| Publication | Date of Publication | Type |
|---|
Cutting planes width and the complexity of graph isomorphism refutations
| 2024-11-26 | Paper |
Cutting planes width and the complexity of graph isomorphism refutations
ACM Transactions on Computational Logic | 2024-11-12 | Paper |
Number of variables for graph differentiation and the resolution of GI formulas
| 2024-04-10 | Paper |
Efficient parallel algorithms for some tree layout problems
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas
ACM Transactions on Computational Logic | 2023-07-18 | Paper |
Pure Nash equilibria in a generalization of congestion games allowing resource failures
Theoretical Computer Science | 2023-06-15 | Paper |
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space
| 2023-02-07 | Paper |
Cops-robber games and the resolution of Tseitin formulas
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Graph isomorphism is low for PP
STACS 92 | 2022-08-18 | Paper |
Pure Nash equilibria in a generalization of congestion games allowing resource failures
| 2022-06-01 | Paper |
Parameterized complexity of small weight automorphisms and isomorphisms
Algorithmica | 2022-01-18 | Paper |
Solution-Graphs of Boolean Formulas and Isomorphism1
Journal on Satisfiability, Boolean Modeling and Computation | 2021-12-09 | Paper |
Reversible pebble games and the relation between tree-like and general resolution space
Computational Complexity | 2021-06-17 | Paper |
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
| 2020-05-27 | Paper |
Lowness results: the next generation
| 2019-07-03 | Paper |
Cops-robber games and the resolution of Tseitin formulas
| 2018-08-10 | Paper |
Parameterized complexity of small weight automorphisms
| 2018-04-19 | Paper |
A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy
| 2017-08-04 | Paper |
CNF and DNF succinct graph encodings
Information and Computation | 2017-03-16 | Paper |
A tutorial on time and space bounds in tree-like resolution
Perspectives in Computational Complexity | 2016-09-22 | Paper |
Solving linear equations parameterized by Hamming weight
Algorithmica | 2016-09-07 | Paper |
Solution-Graphs of Boolean Formulas and Isomorphism
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Sparse sets, approximable sets, and parallel queries to NP
Information Processing Letters | 2016-06-16 | Paper |
Solvable group isomorphism is (almost) in \(\mathsf{NP} \cap \mathsf{coNP}\)
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Graph isomorphism is not \(\mathsf{AC}^{0}\)-reducible to group isomorphism
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Solving linear equations parameterized by Hamming weight
Parameterized and Exact Computation | 2015-09-15 | Paper |
Succinct Encodings of Graph Isomorphism
Language and Automata Theory and Applications | 2014-03-31 | Paper |
On the resolution complexity of graph non-isomorphism
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation | 2012-10-11 | Paper |
Graph isomorphism is not \(\mathrm{AC}^0\) reducible to group isomorphism
| 2012-08-29 | Paper |
Restricted space algorithms for isomorphism on bounded treewidth graphs
| 2012-01-23 | Paper |
Reductions to graph isomorphism
Theory of Computing Systems | 2010-08-13 | Paper |
Paradigms for Fast Parallel Approximability
| 2009-10-21 | Paper |
scientific article; zbMATH DE number 5605063 (Why is no real title available?)
| 2009-09-19 | Paper |
scientific article; zbMATH DE number 5604116 (Why is no real title available?)
| 2009-09-15 | Paper |
scientific article; zbMATH DE number 5568412 (Why is no real title available?)
| 2009-06-23 | Paper |
A combinatorial characterization of treelike resolution space
Information Processing Letters | 2009-04-28 | Paper |
Reductions to Graph Isomorphism
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
Algorithms and Computation | 2008-04-24 | Paper |
Corrigendum to ``Completeness results for graph isomorphism
Journal of Computer and System Sciences | 2006-06-30 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
On the Hardness of Graph Isomorphism
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2086379 (Why is no real title available?)
| 2004-08-11 | Paper |
Minimally unsatisfiable \(CNF\) formulas
Bulletin of the European Association for Theoretical Computer Science EATCS | 2003-09-14 | Paper |
Completeness results for graph isomorphism.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
Optimal proof systems imply complete sets for promise classes
Information and Computation | 2003-07-29 | Paper |
Space bounds for resolution
Information and Computation | 2003-01-14 | Paper |
A nonadaptive NC checker for permutation group intersection
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1500525 (Why is no real title available?)
| 2000-09-04 | Paper |
scientific article; zbMATH DE number 1424047 (Why is no real title available?)
| 2000-08-23 | Paper |
scientific article; zbMATH DE number 1335884 (Why is no real title available?)
| 2000-05-04 | Paper |
scientific article; zbMATH DE number 1304328 (Why is no real title available?)
| 2000-01-09 | Paper |
scientific article; zbMATH DE number 1332674 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-09-08 | Paper |
scientific article; zbMATH DE number 1304340 (Why is no real title available?)
| 1999-06-17 | Paper |
Paradigms for Fast Parallel Approximability
| 1999-02-28 | Paper |
scientific article; zbMATH DE number 1136087 (Why is no real title available?)
| 1998-07-20 | Paper |
scientific article; zbMATH DE number 1072533 (Why is no real title available?)
| 1997-10-08 | Paper |
Parallel approximation schemes for problems on planar graphs
Acta Informatica | 1997-03-25 | Paper |
Computing functions with parallel queries to NP
Theoretical Computer Science | 1997-02-28 | Paper |
The power of the middle bit of a \(\#\)P function
Journal of Computer and System Sciences | 1996-11-04 | Paper |
Complexity classes defined by counting quantifiers
Journal of the ACM | 1994-08-21 | Paper |
scientific article; zbMATH DE number 512806 (Why is no real title available?)
| 1994-04-07 | 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 |
Turing machines with few accepting computations and low sets for PP
Journal of Computer and System Sciences | 1992-09-27 | Paper |
scientific article; zbMATH DE number 17527 (Why is no real title available?)
| 1992-06-26 | Paper |
Self-reducible sets of small density
Mathematical Systems Theory | 1991-01-01 | Paper |
Classes of bounded nondeterminism
Mathematical Systems Theory | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4213446 (Why is no real title available?)
| 1990-01-01 | Paper |
On counting and approximation
Acta Informatica | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4115979 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4066859 (Why is no real title available?)
| 1988-01-01 | Paper |
On the complexity of computable real sequences
RAIRO - Theoretical Informatics and Applications | 1987-01-01 | Paper |
