STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Hard problems for CSP Algorithms
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A new proof of the weak pigeonhole principle
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Regular resolution lower bounds for the weak pigeonhole principle
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution lower bounds for the weak pigeonhole principle
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution Proofs of Matching Principles
Annals of Mathematics and Artificial Intelligence
Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Proof Complexity of Pigeonhole Principles
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Monotone Proofs of the Pigeon Hole Principle
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Improved bounds on the weak Pigeonhole principle and infinitely many primes from weaker axioms
Theoretical Computer Science - Mathematical foundations of computer science
Lower bounds for the weak Pigeonhole principle and random formulas beyond resolution
Information and Computation
A new proof of the weak Pigeonhole principle
Journal of Computer and System Sciences - Special issue on STOC 2000
Resolution lower bounds for the weak functional pigeonhole principle
Theoretical Computer Science - Logic and complexity in computer science
Resolution lower bounds for the weak pigeonhole principle
Journal of the ACM (JACM)
Non-automatizability of bounded-depth frege proofs
Computational Complexity
Formalizing dangerous SAT encodings
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Width versus size in resolution proofs
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 5.23 |