Author of the publication

On the Black-Box Complexity of Sperner's Lemma.

, , , and . FCT, volume 3623 of Lecture Notes in Computer Science, page 245-257. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Enhanced algorithms for Local Search.. Inf. Process. Lett., 97 (5): 171-176 (2006)On the Black-Box Complexity of Sperner's Lemma., , , and . FCT, volume 3623 of Lecture Notes in Computer Science, page 245-257. Springer, (2005)On the Black-Box Complexity of Sperner's Lemma., , , and . Theory Comput. Syst., 45 (3): 629-646 (2009)Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes., , , and . CIAC, volume 3998 of Lecture Notes in Computer Science, page 380-391. Springer, (2006)A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem.. Theor. Comput. Sci., 359 (1-3): 58-68 (2006)