Elements of information theory
Elements of information theory
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Quantum automata and quantum grammars
Theoretical Computer Science
The Complexity of Probabilistic versus Deterministic Finite Automata
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Relationships Between Quantum and Classical Space-Bounded Complexity Classes
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
Quantum communication and complexity
Theoretical Computer Science - Natural computing
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Characterizations of quantum automata
Theoretical Computer Science
Automata theory based on quantum logic: Reversibilities and pushdown automata
Theoretical Computer Science
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Short seed extractors against quantum storage
Proceedings of the forty-first annual ACM symposium on Theory of computing
Relaxed uncertainty relations and information processing
Quantum Information & Computation
Improved lower bounds for locally decodable codes and private information retrieval
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Unbounded-error one-way classical and quantum communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |