Author of the publication

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

Towards the Parallel Repetition Conjecture.. Theor. Comput. Sci., 157 (2): 277-282 (1996)How complex are random graphs in first order logic?, , , and . Random Struct. Algorithms, 26 (1-2): 119-145 (2005)On the Computational Complexity of the Forcing Chromatic Number., , and . SIAM J. Comput., 37 (1): 1-19 (2007)On the obfuscation complexity of planar graphs.. Theor. Comput. Sci., 396 (1-3): 294-300 (2008)Arthur-Merlin Games in Boolean Decision Trees., , , and . Computational Complexity Conference, page 58-67. IEEE Computer Society, (1998)First-Order Definability of Trees and Sparse Random Graphs., , , , , , and . Comb. Probab. Comput., 16 (3): 375-400 (2007)Arthur-Merlin Games in Boolean Decision Trees, , , and . Electron. Colloquium Comput. Complex., (1997)Descriptive complexity of finite structures: Saving the quantifier rank., and . J. Symb. Log., 70 (2): 419-450 (2005)On collinear sets in straight line drawings, and . CoRR, (2008)On Collinear Sets in Straight-Line Drawings., and . WG, volume 6986 of Lecture Notes in Computer Science, page 295-306. Springer, (2011)