On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Gap-definable counting classes
Journal of Computer and System Sciences
Power balance and apportionment algorithms for the United States Congress
Journal of Experimental Algorithmics (JEA)
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Restrictive Acceptance Suffices for Equivalence Problems
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Theoretical Computer Science
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
A note on the circuit complexity of PP
Theoretical Computer Science
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
Maximally joining probabilistic data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of two problems on arithmetic circuits
Theoretical Computer Science
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Query efficiency in probabilistic XML models
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Incorporating constraints in probabilistic XML
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Computational Complexity
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Modeling and querying probabilistic XML data
ACM SIGMOD Record
Running tree automata on probabilistic XML
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incorporating constraints in probabilistic XML
ACM Transactions on Database Systems (TODS)
Complexity of counting the optimal solutions
Theoretical Computer Science
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity classes of equivalence problems revisited
Information and Computation
Journal of the ACM (JACM)
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Completeness for parity problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Bounds on the power of constant-depth quantum circuits
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The complexity of mining maximal frequent subgraphs
Proceedings of the 32nd symposium on Principles of database systems
Isolating an Odd Number of Elements and Applications in Complexity Theory
Theory of Computing Systems
Hi-index | 0.00 |