Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simulating Boolean circuits on a DNA computer
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
SIGACT news complexity theory column 35
ACM SIGACT News
Theoretical Computer Science
From Bidirectionality to Alternation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
The complexity of tensor calculus
Computational Complexity
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Complexity theory for splicing systems
Theoretical Computer Science
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
ACM Computing Surveys (CSUR)
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Circuits and context-free languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Complexity theory for splicing systems
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Evaluating monotone circuits on cylinders, planes and tori
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Characterizing valiant's algebraic complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Arithmetic circuits: The chasm at depth four gets wider
Theoretical Computer Science
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Tradeoff lower lounds for stack machines
Computational Complexity
Hi-index | 0.00 |