|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
39th Annual Symposium on Foundations of Computer Science
Algorithms to Tile the Infinite Grid with Finite Clusters
Palo Alto, California
November 08-November 11
ISBN: 0-8186-9172-7
| ASCII Text | x | ||
| M. Szegedy, "Algorithms to Tile the Infinite Grid with Finite Clusters," Foundations of Computer Science, IEEE Annual Symposium on, pp. 137, 39th Annual Symposium on Foundations of Computer Science, 1998. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1998.743437, author = {M. Szegedy}, title = {Algorithms to Tile the Infinite Grid with Finite Clusters}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1998}, issn = {0272-5428}, pages = {137}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743437}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Algorithms to Tile the Infinite Grid with Finite Clusters SN - 0272-5428 SP EP A1 - M. Szegedy, PY - 1998 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
Citation:
M. Szegedy, "Algorithms to Tile the Infinite Grid with Finite Clusters," focs, pp.137, 39th Annual Symposium on Foundations of Computer Science, 1998
Usage of this product signifies your acceptance of the Terms of Use.
