Yves F. Verhoeven

Publication Activity (10 Years)

Years Active: 2005-2009
Publications (10 Years): 0

Publications

Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
On the Black-Box Complexity of Sperner's Lemma. Theory Comput. Syst. 45 (3) (2009)
Yves F. Verhoeven
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem. Theor. Comput. Sci. 359 (1-3) (2006)
Yves F. Verhoeven
Enhanced algorithms for Local Search. Inf. Process. Lett. 97 (5) (2006)
Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. CIAC (2006)
Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
On the Black-Box Complexity of Sperner's Lemma. FCT (2005)