Author： Beauquier D. Nivat M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.303, Iss.2, 2003-07, pp. : 417-430
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Undecidable properties of monoids with word problem solvable in linear time
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
The 3-server problem in the plane
By Bein W.W. Chrobak M. Larmore L.L.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Polyomino tilings, cellular automata and codicity
Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. :
A Probabilistic Minimax Location Problem on the Plane
By Berman O.
Annals of Operations Research, Vol. 122, Iss. 1-4, 2003-09 ,pp. :