Reducing the number of solutions of NP functions
Journal of Computer and System Sciences
Generalized Regular Counting Classes
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Reducing the Number of Solutions of NP Functions
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Finite Automata with Generalized Acceptance Criteria
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Inherent Dimension of Bounded Counting Classes
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Acceptance by Transformation Monoids (with an Application to Local Self Reductions)
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Optimal proof systems imply complete sets for promise classes
Information and Computation
Lower bounds and the hardness of counting properties
Theoretical Computer Science
Functions computable in polynomial space
Information and Computation
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
Reductions between disjoint NP-pairs
Information and Computation
A reducibility for the dot-depth hierarchy
Theoretical Computer Science - Mathematical foundations of computer science 2004
Languages polylog-time reducible to dot-depth 1/2
Journal of Computer and System Sciences
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Functions computable in polynomial space
Information and Computation
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
Reductions between disjoint NP-Pairs
Information and Computation
Acceptor-definable counting classes
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Leaf languages and string compression
Information and Computation
Characterizing definability of second-order generalized quantifiers
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Machines that can output empty words
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polylog-time reductions decrease dot-depth
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
The dot-depth and the polynomial hierarchy correspond on the delta levels
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Perfect correspondences between dot-depth and polynomial-time hierarchy
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Some reducibilities on regular sets
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The Chain Method to Separate Counting Classes
Theory of Computing Systems
| Hi-index | 5.23 |