| Publication | Date of Publication | Type |
|---|
Sets computable in polynomial time on average
Lecture Notes in Computer Science | 2023-12-12 | Paper |
| Structure in average case complexity | 2023-03-21 | Paper |
The complexity of generating test instances
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Measurement of the number of molecules of a single mRNA species in a complex mRNA preparation
Journal of Theoretical Biology | 2020-05-06 | Paper |
Switch-like behavior enables Wnt11 concentration specific response during dorso-ventral axis formation in \textit{Xenopus laevis}
Journal of Theoretical Biology | 2018-03-09 | Paper |
Average polynomial time is hard for exponential time under sn-reductions
Lecture Notes in Computer Science | 2017-01-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
| scientific article; zbMATH DE number 5568413 (Why is no real title available?) | 2009-06-23 | Paper |
Randomized algorithms for 3-SAT
Theory of Computing Systems | 2007-03-12 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2086385 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087031 (Why is no real title available?) | 2004-08-11 | Paper |
Average-case intractability vs. worst-case intractability
Information and Computation | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1953213 (Why is no real title available?) | 2003-07-25 | Paper |
The difference between polynomial-time many-one and truth-table reducibilities on distributional problems
Theory of Computing Systems | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1788736 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1688354 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1555928 (Why is no real title available?) | 2001-01-24 | Paper |
Resource-bounded measure and learnability
Theory of Computing Systems | 2000-05-07 | Paper |
| scientific article; zbMATH DE number 1335899 (Why is no real title available?) | 1999-09-13 | Paper |
| scientific article; zbMATH DE number 1332677 (Why is no real title available?) | 1999-09-08 | Paper |
| scientific article; zbMATH DE number 1304330 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1222584 (Why is no real title available?) | 1998-11-11 | Paper |
If NP has polynomial-size circuits, then MA=AM
Theoretical Computer Science | 1997-02-28 | Paper |
Some properties of sets tractable under every polynomial-time computable distribution
Information Processing Letters | 1997-02-27 | Paper |
Structural average case complexity
Journal of Computer and System Sciences | 1997-01-27 | Paper |
ON HELPING AND INTERACTIVE PROOF SYSTEMS
International Journal of Foundations of Computer Science | 1995-10-29 | Paper |
Random languages for nonuniform complexity classes
Journal of Complexity | 1992-06-26 | Paper |
