| Publication | Date of Publication | Type |
|---|
Lifting query complexity to time-space complexity for two-way finite automata
Journal of Computer and System Sciences | 2024-01-22 | Paper |
Synthesis of quantum images using phase rotation
Quantum Information Processing | 2022-12-23 | Paper |
Time-Space Complexity Advantages for Quantum Computing
Theory and Practice of Natural Computing | 2022-12-09 | Paper |
State complexity of SBTA languages
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
Testing Boolean functions properties
Fundamenta Informaticae | 2022-02-01 | Paper |
Improving the success probability for Shor's factorization algorithm
Reversibility and Universality | 2020-05-28 | Paper |
Entangling and disentangling in Grover's search algorithm
Theoretical Computer Science | 2019-05-21 | Paper |
Generalizations of the distributed Deutsch-Jozsa promise problem
Mathematical Structures in Computer Science | 2017-04-03 | Paper |
Promise problems solved by quantum and classical finite automata
Theoretical Computer Science | 2017-02-14 | Paper |
Potential of quantum finite automata with exact acceptance
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
Information and Computation | 2015-05-04 | Paper |
On the state complexity of semi-quantum finite automata
RAIRO - Theoretical Informatics and Applications | 2014-06-27 | Paper |
Quantum finite automata
| 2014-06-03 | Paper |
On the state complexity of semi-quantum finite automata
Language and Automata Theory and Applications | 2014-03-31 | Paper |
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science | 2014-01-10 | Paper |
One-way finite automata with quantum and classical states
Lecture Notes in Computer Science | 2012-11-01 | Paper |
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
Acta Informatica | 2012-03-23 | Paper |
From classical cryptography to quantum physics through quantum cryptography
| 2011-11-24 | Paper |
Universal Sets of Quantum Information Processing Primitives and Their Optimal Use
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Algebraic Methods in Quantum Informatics
Algebraic Informatics | 2008-09-04 | Paper |
A broader view on the limitations of information processing and communication by nature
Natural Computing | 2007-06-14 | Paper |
THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
International Journal of Foundations of Computer Science | 2007-06-05 | Paper |
Universal Sets of Quantum Information Processing Primitives and their optimal use
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Different time solutions for the firing squad synchronization problem on basic grid networks
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
QUANTUM COMPLEXITY THEORY GOALS AND CHALLENGES
International Journal of Quantum Information | 2005-03-30 | Paper |
Quantum entanglement as a new information processing resource
New Generation Computing | 2004-09-22 | Paper |
scientific article; zbMATH DE number 1687022 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1759497 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1759499 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1489998 (Why is no real title available?)
| 2002-05-20 | Paper |
scientific article; zbMATH DE number 1738653 (Why is no real title available?)
| 2002-05-07 | Paper |
Systolic tree and tree-like automata
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
Quantum models and modes of computation and communication
RIMS Kokyuroku | 2001-09-23 | Paper |
scientific article; zbMATH DE number 1502104 (Why is no real title available?)
| 2000-09-04 | Paper |
Succinctness of descriptions of SBTA-languages
Theoretical Computer Science | 1998-07-22 | Paper |
scientific article; zbMATH DE number 1089087 (Why is no real title available?)
| 1998-03-16 | Paper |
scientific article; zbMATH DE number 1047929 (Why is no real title available?)
| 1997-11-09 | Paper |
scientific article; zbMATH DE number 846967 (Why is no real title available?)
| 1996-06-27 | Paper |
Power of interconnections and of nondeterminism in regularY-tree systolic automata
Mathematical Systems Theory | 1995-12-13 | Paper |
Synthesis, structure and power of systolic computations
Theoretical Computer Science | 1990-01-01 | Paper |
SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4060727 (Why is no real title available?)
| 1988-01-01 | Paper |
Systolic trellis automata: Stability, decidability and complexity
Information and Control | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3940734 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 4047120 (Why is no real title available?)
| 1986-01-01 | Paper |
Systolic trellis automatata †
International Journal of Computer Mathematics | 1984-01-01 | Paper |
Systolic trellis automatat†
International Journal of Computer Mathematics | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3898246 (Why is no real title available?)
| 1984-01-01 | Paper |
Systolic automata for VLSI on balanced trees
Acta Informatica | 1983-01-01 | Paper |
On a family of L languages resulting from systolic tree automata
Theoretical Computer Science | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3529421 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3478420 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3548460 (Why is no real title available?)
| 1973-01-01 | Paper |
scientific article; zbMATH DE number 3443188 (Why is no real title available?)
| 1973-01-01 | Paper |
scientific article; zbMATH DE number 3430145 (Why is no real title available?)
| 1973-01-01 | Paper |
scientific article; zbMATH DE number 3413826 (Why is no real title available?)
| 1973-01-01 | Paper |
scientific article; zbMATH DE number 3426895 (Why is no real title available?)
| 1973-01-01 | Paper |
scientific article; zbMATH DE number 3381865 (Why is no real title available?)
| 1972-01-01 | Paper |
A characterization of context-free languages
Journal of Computer and System Sciences | 1971-01-01 | Paper |
Complexity and unambiguity of context-free grammars and languages
Information and Control | 1971-01-01 | Paper |
A few remarks on the index of context-free grammars and languages
Information and Control | 1971-01-01 | Paper |
Some classifications of context-free languages
Information and Control | 1969-01-01 | Paper |
scientific article; zbMATH DE number 3307586 (Why is no real title available?)
| 1969-01-01 | Paper |
scientific article; zbMATH DE number 3254902 (Why is no real title available?)
| 1967-01-01 | Paper |
scientific article; zbMATH DE number 3254901 (Why is no real title available?)
| 1966-01-01 | Paper |
Isolable and weakly isolable sets
| 1966-01-01 | Paper |
scientific article; zbMATH DE number 3231088 (Why is no real title available?)
| 1966-01-01 | Paper |
scientific article; zbMATH DE number 3219611 (Why is no real title available?)
| 1965-01-01 | Paper |
scientific article; zbMATH DE number 3216193 (Why is no real title available?)
| 1965-01-01 | Paper |
scientific article; zbMATH DE number 3225359 (Why is no real title available?)
| 1965-01-01 | Paper |
