Journal of the ACM (JACM)
Unary Pushdown Automata and Auxiliary Space Lower Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The intractability of computing the Hamming distance
Theoretical Computer Science
Non-recursive trade-offs for deterministic restarting automata
Journal of Automata, Languages and Combinatorics
Church-Rosser groups and growing context-sensitive groups
Journal of Automata, Languages and Combinatorics
On the complexity of regular-grammars with integer attributes
Journal of Computer and System Sciences
Tradeoff lower lounds for stack machines
Computational Complexity
Hi-index | 0.00 |