Yves F. Verhoeven

Université Paris-Sud — France

Computer Science · Physical Sciences

3h-index42citations8works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(5), Quantum Computing Algorithms and Architecture(3), Computability, Logic, AI Algorithms(2), Optimization and Search Problems(2), Health, Medicine and Society(2)

Publications8 total

On the Black-Box Complexity of Sperner’s Lemma
Theory of Computing Systems·2008· 2 cited
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
Theoretical Computer Science·2006· 2 cited
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
Lecture notes in computer science·2006· 7 cited
Locally 2-dimensional Sperner problems complete for the Polynomial Parity Argument classes
2006
Enhanced algorithms for Local Search
Information Processing Letters·2005· 10 cited
Enhanced algorithms for Local Search
arXiv (Cornell University)·2005Open Access
On the black-box complexity of Sperner's Lemma
2005Open Access
On the Black-Box Complexity of Sperner’s Lemma
Lecture notes in computer science·2005· 21 cited

Frequent Co-authors

Gábor Ivanyos(5), Miklós Sántha(5), Katalin Friedl(3), Karl E. Friedl(2)