| Publication | Date of Publication | Type |
|---|
A threshold for unsatisfiability
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
| Matched instances of quantum satisfiability (QSat) -- product state solutions of restrictions | 2019-10-22 | Paper |
On random betweenness constraints
Combinatorics, Probability and Computing | 2013-03-13 | Paper |
Satisfiability thresholds beyond \(k\)-XORSAT
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)
Automata, Languages and Programming | 2010-09-07 | Paper |
Certifying unsatisfiability of random \(2k\)-SAT formulas using approximation techniques.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On Random Betweenness Constraints
Fundamentals of Computation Theory | 2009-10-20 | Paper |
On Random Ordering Constraints
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Recognizing more random unsatisfiable 3-SAT instances efficiently
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Strong Refutation Heuristics for Random k-SAT
Combinatorics, Probability and Computing | 2007-03-20 | Paper |
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
SIAM Journal on Computing | 2006-06-01 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
Theoretical Computer Science | 2005-02-09 | Paper |
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
Combinatorics, Probability and Computing | 2004-06-18 | Paper |
Analysis of edge deletion processes on faulty random regular graphs.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1929945 (Why is no real title available?) | 2003-06-18 | 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 1754601 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1689045 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1670827 (Why is no real title available?) | 2001-11-11 | Paper |
The giant component threshold for random regular graphs with edge faults H. Prodinger
Theoretical Computer Science | 2001-08-20 | Paper |
Random regular graphs with edge faults: Expansion through cores
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1512674 (Why is no real title available?) | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1555180 (Why is no real title available?) | 2001-01-22 | Paper |
A remark on random 2-SAT
Discrete Applied Mathematics | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1361486 (Why is no real title available?) | 1999-11-10 | Paper |
| scientific article; zbMATH DE number 1354172 (Why is no real title available?) | 1999-10-28 | Paper |
Davis-Putnam resolution versus unrestricted resolution
Annals of Mathematics and Artificial Intelligence | 1997-05-13 | Paper |
A threshold for unsatisfiability
Journal of Computer and System Sciences | 1997-03-18 | Paper |
| scientific article; zbMATH DE number 512977 (Why is no real title available?) | 1994-04-07 | Paper |
Regular Resolution Versus Unrestricted Resolution
SIAM Journal on Computing | 1993-10-10 | Paper |
| scientific article; zbMATH DE number 408793 (Why is no real title available?) | 1993-09-06 | Paper |
Characterizing complexity classes by general recursive definitions in higher types
Information and Computation | 1993-05-16 | Paper |
Characterizing complexity classes by higher type primitive recursive definitions
Theoretical Computer Science | 1992-09-27 | Paper |
Unrestricted resolution versus N-resolution
Theoretical Computer Science | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 19768 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4210103 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4170889 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4179364 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4072354 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060685 (Why is no real title available?) | 1988-01-01 | Paper |
An automata-theoretical characterization of the OI-hierarchy
Information and Control | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3980461 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3767074 (Why is no real title available?) | 1982-01-01 | Paper |
