| Publication | Date of Publication | Type |
|---|
| Classical and Quantum Computations with Restricted Memory | 2023-06-30 | Paper |
| Identification of quantum hashes: numerical experiment | 2023-05-25 | Paper |
| Quantum algorithms for string processing | 2022-11-01 | Paper |
| Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations | 2022-10-19 | Paper |
| О понятии квантового хеширования | 2021-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146647 | 2021-01-26 | Paper |
| Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test | 2020-10-21 | Paper |
| Lower bounds for one-way probabilistic communication complexity | 2019-03-29 | Paper |
| Quantum-assisted blockchain | 2018-11-02 | Paper |
| Randomization and nondeterminism are comparable for ordered read-once branching programs | 2018-07-04 | Paper |
| Computing Boolean Functions via Quantum Hashing | 2015-09-08 | Paper |
| Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs | 2014-08-07 | Paper |
| Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas | 2014-08-07 | Paper |
| Extension of the hierarchy for \(k\)-OBDDs of small width | 2013-07-16 | Paper |
| On quantum realisation of Boolean functions by the fingerprinting technique | 2012-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3013162 | 2011-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3005900 | 2011-06-10 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3655986 | 2010-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3604268 | 2009-02-24 | Paper |
| Stochastic Algorithms: Foundations and Applications | 2006-10-20 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| On the computational power of probabilistic and quantum branching program | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818848 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737169 | 2004-08-11 | Paper |
| A lower bound for integer multiplication on randomized ordered read-once branching programs. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785452 | 2003-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782697 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536348 | 2002-11-04 | Paper |
| On BPP versus \(NP\cup coNP\) for ordered read-once branching programs | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501130 | 2000-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4240332 | 1999-05-03 | Paper |
| Lower bounds for one-way probabilistic communication complexity and their application to space complexity | 1997-02-27 | Paper |
| Comparative complexity of the representation of languages by probabilistic automata | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3979858 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975178 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798238 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732124 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732125 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777457 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3771624 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727435 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725566 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732969 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3336724 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313262 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3042410 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3891794 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929071 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3967055 | 1980-01-01 | Paper |
