Yves F. Verhoeven - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 5 from 5

2009

On the Black-Box Complexity of Sperner s LemmaKatalin Friedl, GÃ¡bor Ivanyos, Miklos Santha, Yves F. Verhoeven. mst, 45(3):629-646, 2009. [doi]

2006

Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument ClassesKatalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven. ciac 2006: 380-391 [doi]

A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problemYves F. Verhoeven. TCS, 359(1-3):58-68, 2006. [doi]

Enhanced algorithms for Local SearchYves F. Verhoeven. ipl, 97(5):171-176, 2006. [doi]

2005

On the Black-Box Complexity of Sperner s LemmaKatalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven. fct 2005: 245-257 [doi]

Sign in or sign up to see more results.

runs on WebDSL