| Publication | Date of Publication | Type |
|---|
The robustness of LWPP and WPP, with an application to graph reconstruction
(available as arXiv preprint) | 2021-08-04 | Paper |
The robustness of LWPP and WPP, with an application to graph reconstruction
Computational Complexity | 2021-05-25 | Paper |
On limited nondeterminism and ACC circuit lower bounds
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Avoiding simplicity is complex
Theory of Computing Systems | 2012-12-07 | Paper |
Frequency of correctness versus average polynomial time
Information Processing Letters | 2010-08-20 | Paper |
An improved exact algorithm for the domatic number problem
Information Processing Letters | 2010-01-29 | Paper |
Hierarchical Unambiguity
SIAM Journal on Computing | 2009-11-06 | Paper |
Generalized juntas and NP-hard sets
Theoretical Computer Science | 2009-09-10 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
Fundamentals of Computation Theory | 2008-02-26 | Paper |
On the power of unambiguity in alternating machines
Theory of Computing Systems | 2007-09-06 | Paper |
Hierarchical Unambiguity
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences | 2006-06-30 | Paper |
The complexity of Kemeny elections
Theoretical Computer Science | 2006-03-20 | Paper |
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
RAIRO - Theoretical Informatics and Applications | 2006-02-22 | Paper |
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
RAIRO - Theoretical Informatics and Applications | 2006-02-22 | Paper |
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
RAIRO - Theoretical Informatics and Applications | 2006-02-22 | Paper |
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation | 2005-08-05 | Paper |
| scientific article; zbMATH DE number 2163013 (Why is no real title available?) | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2080215 (Why is no real title available?) | 2004-08-04 | Paper |
Exact complexity of the winner problem for Young elections
Theory of Computing Systems | 2003-08-26 | Paper |
| scientific article; zbMATH DE number 1953099 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1390091 (Why is no real title available?) | 2001-03-12 | Paper |
