| Publication | Date of Publication | Type |
|---|
Classical and Quantum Computations with Restricted Memory
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Identification of quantum hashes: numerical experiment
Lobachevskii Journal of Mathematics | 2023-05-25 | Paper |
Quantum algorithms for string processing
| 2022-11-01 | Paper |
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
Computer Science – Theory and Applications | 2022-10-19 | Paper |
On the concept of quantum hashing
Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] | 2021-09-20 | Paper |
Algorithms for quantum branching programs based on fingerprinting
| 2021-01-26 | Paper |
Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Lower bounds for one-way probabilistic communication complexity
Automata, Languages and Programming | 2019-03-29 | Paper |
Quantum-assisted blockchain
Lobachevskii Journal of Mathematics | 2018-11-02 | Paper |
Randomization and nondeterminism are comparable for ordered read-once branching programs
Automata, Languages and Programming | 2018-07-04 | Paper |
Computing Boolean functions via quantum hashing
Computing with New Resources | 2015-09-08 | Paper |
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Quantum hashing via \(\varepsilon \)-universal hashing constructions and Freivalds' fingerprinting schemas
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Extension of the hierarchy for \(k\)-OBDDs of small width
Russian Mathematics | 2013-07-16 | Paper |
On quantum realisation of Boolean functions by the fingerprinting technique
Discrete Mathematics and Applications | 2012-03-23 | Paper |
On complexity of classical simulation of quantum branching programs
| 2011-07-18 | Paper |
A communication approach to the superposition problem
| 2011-06-10 | Paper |
Classical simulation complexity of quantum machines.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Superposition problem of continuous functions. A communication approach
| 2010-01-13 | Paper |
scientific article; zbMATH DE number 5510978 (Why is no real title available?)
| 2009-02-24 | Paper |
Stochastic Algorithms: Foundations and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
On the computational power of probabilistic and quantum branching program
Information and Computation | 2006-01-10 | Paper |
scientific article; zbMATH DE number 2102760 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2086634 (Why is no real title available?)
| 2004-08-11 | Paper |
A lower bound for integer multiplication on randomized ordered read-once branching programs.
Information and Computation | 2004-03-14 | Paper |
scientific article; zbMATH DE number 1848274 (Why is no real title available?)
| 2003-01-01 | Paper |
scientific article; zbMATH DE number 1839432 (Why is no real title available?)
| 2002-12-02 | Paper |
scientific article; zbMATH DE number 1759400 (Why is no real title available?)
| 2002-11-04 | Paper |
On BPP versus \(NP\cup coNP\) for ordered read-once branching programs
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1499078 (Why is no real title available?)
| 2000-09-03 | Paper |
scientific article; zbMATH DE number 1283990 (Why is no real title available?)
| 1999-05-03 | Paper |
Lower bounds for one-way probabilistic communication complexity and their application to space complexity
Theoretical Computer Science | 1997-02-27 | Paper |
Comparative complexity of the representation of languages by probabilistic automata
Cybernetics | 1992-09-27 | Paper |
scientific article; zbMATH DE number 20623 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 17834 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 4064485 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4117873 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4117874 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4039300 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4030991 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 4001489 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3956464 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3965449 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3870629 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3843140 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3837380 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3698421 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3744574 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3789839 (Why is no real title available?)
| 1980-01-01 | Paper |
