Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Universal Sets of Quantum Information Processing Primitives and their optimal use.. Electron. Notes Discret. Math., (2005)Complexity and Unambiguity of Context-Free Grammars and Languages. Inf. Control., 18 (5): 502-519 (June 1971)Security Improvements of Several Basic Quantum Private Query Protocols with O(log N) Communication Complexity., , , , , and . CoRR, (2020)New Challenges for Theoretical Computer Science.. IFIP TCS, volume 1872 of Lecture Notes in Computer Science, page 599-601. Springer, (2000)Time-Space Complexity Advantages for Quantum Computing., , and . TPNC, volume 10687 of Lecture Notes in Computer Science, page 305-317. Springer, (2017)Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata, , and . CoRR, (2013)On star height hierarchies of context-free languages.. Kybernetika, 9 (4): 231-236 (1973)On the State Complexity of Semi-quantum Finite Automata., , and . LATA, volume 8370 of Lecture Notes in Computer Science, page 601-612. Springer, (2014)One-way finite automata with quantum and classical states, , , and . (2011)cite arxiv:1112.2022Comment: Comments are welcome. The paper is for a volume of LNCS Festschifts Series devoted to birthday of Prof. Dr. Juergen Dassov.Book Review: foundations of computing.. XRDS, 6 (5): 5 (2000)