| Publication | Date of Publication | Type |
|---|
Graph isomorphism is low for PP
STACS 92 | 2022-08-18 | Paper |
Promise problems on probability distributions
Complexity and Approximation | 2020-07-20 | Paper |
Reductions to sets of low information content (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
Search heuristics and the influence of non-perfect randomness: examining genetic algorithms and simulated annealing
Computational Statistics | 2015-01-28 | Paper |
Improving implementation of SLS solvers for SAT and new heuristics for \(k\)-SAT with long clauses
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Choosing probability distributions for stochastic local search and the role of make versus break
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Logic for computer scientists
Modern Birkhäuser Classics | 2011-02-10 | Paper |
| scientific article; zbMATH DE number 5823847 (Why is no real title available?) | 2010-12-08 | Paper |
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Computer Science – Theory and Applications | 2010-06-22 | Paper |
Smaller superconcentrators of density 28
Information Processing Letters | 2010-01-18 | Paper |
| scientific article; zbMATH DE number 5568413 (Why is no real title available?) | 2009-06-23 | Paper |
Principles of Stochastic Local Search
Lecture Notes in Computer Science | 2009-02-17 | Paper |
| Theoretical computer science -- in brief | 2008-01-03 | 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 |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
| scientific article; zbMATH DE number 2086385 (Why is no real title available?) | 2004-08-11 | Paper |
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1834642 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1788736 (Why is no real title available?) | 2002-08-26 | Paper |
A probabilistic algorithm for \(k\)-SAT based on limited local search and restart
Algorithmica | 2002-05-21 | Paper |
| scientific article; zbMATH DE number 1361471 (Why is no real title available?) | 2002-01-06 | Paper |
| Algorithmics | 2001-11-19 | Paper |
| scientific article; zbMATH DE number 1670827 (Why is no real title available?) | 2001-11-11 | Paper |
| Construction of expanders and superconcentrators using Kolmogorov complexity | 2001-01-29 | Paper |
| scientific article; zbMATH DE number 1220163 (Why is no real title available?) | 1998-11-08 | Paper |
Complexity of Presburger arithmetic with fixed quantifier dimension
Theory of Computing Systems | 1997-10-19 | Paper |
| scientific article; zbMATH DE number 1024635 (Why is no real title available?) | 1997-06-22 | Paper |
| scientific article; zbMATH DE number 1024633 (Why is no real title available?) | 1997-06-22 | Paper |
| scientific article; zbMATH DE number 1008510 (Why is no real title available?) | 1997-05-12 | Paper |
If NP has polynomial-size circuits, then MA=AM
Theoretical Computer Science | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 953287 (Why is no real title available?) | 1996-12-01 | Paper |
| scientific article; zbMATH DE number 826291 (Why is no real title available?) | 1995-12-14 | Paper |
| scientific article; zbMATH DE number 824081 (Why is no real title available?) | 1995-12-07 | Paper |
| scientific article; zbMATH DE number 824078 (Why is no real title available?) | 1995-12-07 | Paper |
Instance complexity
Journal of the ACM | 1995-03-01 | Paper |
| scientific article; zbMATH DE number 619533 (Why is no real title available?) | 1994-09-13 | Paper |
| scientific article; zbMATH DE number 512798 (Why is no real title available?) | 1994-03-10 | Paper |
On random reductions from sparse sets to tally sets
Information Processing Letters | 1994-01-31 | Paper |
| scientific article; zbMATH DE number 477971 (Why is no real title available?) | 1993-12-08 | Paper |
Graph isomorphism is low for PP
Computational Complexity | 1993-09-16 | Paper |
| scientific article; zbMATH DE number 403953 (Why is no real title available?) | 1993-09-06 | Paper |
| scientific article; zbMATH DE number 54171 (Why is no real title available?) | 1993-01-23 | Paper |
| scientific article; zbMATH DE number 54163 (Why is no real title available?) | 1993-01-23 | Paper |
Logarithmic advice classes
Theoretical Computer Science | 1992-09-27 | Paper |
Turing machines with few accepting computations and low sets for PP
Journal of Computer and System Sciences | 1992-09-27 | Paper |
Logic for computer scientists
Progress in Computer Science and Applied Logic | 1992-09-18 | Paper |
| scientific article; zbMATH DE number 43826 (Why is no real title available?) | 1992-09-17 | Paper |
Probabilistic complexity classes and lowness
Journal of Computer and System Sciences | 1989-01-01 | Paper |
On counting and approximation
Acta Informatica | 1989-01-01 | Paper |
Graph isomorphism is in the low hierarchy
Journal of Computer and System Sciences | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4058873 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4066859 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4095440 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4064489 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4080913 (Why is no real title available?) | 1988-01-01 | Paper |
The difference and truth-table hierarchies for NP
RAIRO - Theoretical Informatics and Applications | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4007728 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4037804 (Why is no real title available?) | 1987-01-01 | Paper |
The polynomial-time hierarchy and sparse oracles
Journal of the ACM | 1986-01-01 | Paper |
Complexity and structure
Lecture Notes in Computer Science | 1986-01-01 | Paper |
Complete sets and closeness to complexity classes
Mathematical Systems Theory | 1986-01-01 | Paper |
The density and complexity of polynomial cores for intractable sets
Information and Control | 1986-01-01 | Paper |
Sparse Sets, Lowness and Highness
SIAM Journal on Computing | 1986-01-01 | Paper |
Optimal Approximations and Polynomially Levelable Sets
SIAM Journal on Computing | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3985202 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4001485 (Why is no real title available?) | 1986-01-01 | Paper |
Robust algorithms: a different approach to oracles
Theoretical Computer Science | 1985-01-01 | Paper |
Bi-immune sets for complexity classes
Mathematical Systems Theory | 1985-01-01 | Paper |
On Circuit-Size Complexity and the Low Hierarchy in NP
SIAM Journal on Computing | 1985-01-01 | Paper |
On bounded query machines
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3919821 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3913678 (Why is no real title available?) | 1985-01-01 | Paper |
Immunity, Relativizations, and Nondeterminism
SIAM Journal on Computing | 1984-01-01 | Paper |
Minimal pairs for P
Theoretical Computer Science | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3883613 (Why is no real title available?) | 1984-01-01 | Paper |
On small generators
Theoretical Computer Science | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3883614 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3887072 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3963808 (Why is no real title available?) | 1984-01-01 | Paper |
A low and a high hierarchy within NP
Journal of Computer and System Sciences | 1983-01-01 | Paper |
On the structure of \(\Delta_ 2\!^ p\)
Information Processing Letters | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3825169 (Why is no real title available?) | 1983-01-01 | Paper |
A uniform approach to obtain diagonal sets in complexity classes
Theoretical Computer Science | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3902038 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3815631 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3759550 (Why is no real title available?) | 1981-01-01 | Paper |
