Yves F. Verhoeven

On the Black-Box Complexity of Sperner's Lemma

Miklos Santha, Gábor Ivanyos, Katalin Friedl, 2005, FCT.

Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes

Miklos Santha, Gábor Ivanyos, Katalin Friedl, 2006, CIAC.

On the Black-Box Complexity of Sperner’s Lemma

Miklos Santha, Gábor Ivanyos, Katalin Friedl, 2008, Theory of Computing Systems.

Enhanced algorithms for Local Search

Yves F. Verhoeven, 2006, Inf. Process. Lett..

A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem

Yves F. Verhoeven, 2006, Theor. Comput. Sci..

On the complexity of Sperner’s Lemma

Miklos Santha, Gábor Ivanyos, Yves F. Verhoeven, 2005 .

Enhanced algorithms for Local Search

Yves F. Verhoeven, 2005, Inf. Process. Lett..

On the Black-Box Complexity of Sperner’s Lemma

Yves F. Verhoeven, M. Santha, K. Friedl, 2005, Theory of Computing Systems.