| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6138069 | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147309 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6176155 | 2023-07-25 | Paper |
| On the cut dimension of a graph | 2023-07-12 | Paper |
| Total functions in QMA | 2023-02-16 | Paper |
| Characterising the intersection of QMA and coQMA | 2022-11-24 | Paper |
| Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) | 2022-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091221 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090429 | 2022-07-18 | Paper |
| Quantum algorithm for stochastic optimal stopping problems with applications in finance | 2021-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005160 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009633 | 2021-08-04 | Paper |
| A Composition Theorem for Randomized Query Complexity | 2020-11-25 | Paper |
| A new public-key cryptosystem via Mersenne numbers | 2020-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111161 | 2020-05-26 | Paper |
| Quadratically tight relations for randomized query complexity | 2020-02-27 | Paper |
| Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633814 | 2019-05-06 | Paper |
| Quadratically tight relations for randomized query complexity | 2018-11-28 | Paper |
| Linear-Time Algorithm for Quantum 2SAT | 2018-06-15 | Paper |
| Separations in Query Complexity Based on Pointer Functions | 2018-05-17 | Paper |
| Polynomial interpolation and identity testing from high powers over finite fields | 2018-04-06 | Paper |
| On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems | 2018-03-21 | Paper |
| Linear Time Algorithm for Quantum 2SAT | 2017-12-19 | Paper |
| A decision procedure for well-formed linear quantum cellular automata | 2017-11-16 | Paper |
| On the complexity of trial and error for constraint satisfaction problems | 2017-11-14 | Paper |
| Separations in Query Complexity Based on Pointer Functions | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351943 | 2017-08-31 | Paper |
| Improved quantum query algorithms for triangle detection and associativity testing | 2017-03-03 | Paper |
| Generalized Wong sequences and their applications to Edmonds' problems | 2017-03-03 | Paper |
| Solving systems of diagonal polynomial equations over finite fields | 2017-02-06 | Paper |
| New bounds on the classical and quantum communication complexity of some graph properties | 2017-01-26 | Paper |
| Approximate testing with relative error | 2016-09-29 | Paper |
| Improved bounds for the randomized decision tree Complexity of recursive majority | 2016-06-10 | Paper |
| On Solving Systems of Diagonal Polynomial Equations Over Finite Fields | 2015-11-12 | Paper |
| Generalized Wong sequences and their applications to Edmonds' problems | 2015-07-13 | Paper |
| An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group | 2014-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921783 | 2014-10-13 | Paper |
| Self-testing of universal and fault-tolerant sets of quantum gates | 2014-09-26 | Paper |
| On the Complexity of Trial and Error for Constraint Satisfaction Problems | 2014-07-01 | Paper |
| Hidden Translation and Translating Coset in Quantum Computing | 2014-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414605 | 2014-05-06 | Paper |
| Hidden Symmetry Subgroup Problems | 2014-02-04 | Paper |
| Query Complexity of Matroids | 2013-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2913817 | 2012-09-27 | Paper |
| An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups | 2012-04-26 | Paper |
| On the hitting times of quantum versus random walks | 2012-04-26 | Paper |
| Optimal direct sum results for deterministic and randomized decision tree complexity | 2012-03-27 | Paper |
| Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority | 2011-07-06 | Paper |
| Search via Quantum Walk | 2011-05-17 | Paper |
| Hidden translation and orbit coset in quantum computing | 2010-08-16 | Paper |
| Efficient testing of groups | 2010-08-16 | Paper |
| Quantum and classical query complexities of local search are polynomially related | 2010-08-15 | Paper |
| On the black-box complexity of Sperner's Lemma | 2009-09-02 | Paper |
| Quantum and classical query complexities of local search are polynomially related | 2009-08-31 | Paper |
| Quantum Testers for Hidden Group Properties | 2009-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549657 | 2009-01-05 | Paper |
| Quantum Walk Based Search Algorithms | 2008-05-27 | Paper |
| Approximate Nash Equilibria for Multi-player Games | 2008-05-02 | Paper |
| Quantum Algorithms for the Triangle Problem | 2008-04-22 | Paper |
| Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates | 2008-04-22 | Paper |
| An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups | 2008-04-15 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups | 2007-09-03 | Paper |
| Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes | 2007-05-02 | Paper |
| Consecutive-2 systems on trees | 2007-01-19 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM | 2005-10-19 | Paper |
| Quantum Algorithms for Element Distinctness | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736880 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470488 | 2004-07-01 | Paper |
| Semantical counting circuits | 2003-08-26 | Paper |
| Approximate testing with error relative to input size. | 2003-08-13 | Paper |
| Efficient approximation algorithms for the subset-sums equality problem. | 2002-08-04 | Paper |
| A Decision Procedure for Unitary Linear Quantum Cellular Automata | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743234 | 2001-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503939 | 2001-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525685 | 2001-01-24 | Paper |
| On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs | 1999-08-31 | Paper |
| Average-case analysis of the merging algorithm of Hwang and Lin | 1999-06-21 | Paper |
| Verifying the determinant in parallel | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219034 | 1998-11-15 | Paper |
| A decision procedure for well-formed linear quantum cellular automata | 1998-06-01 | Paper |
| Oblivious transfers and intersecting codes | 1997-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858453 | 1995-12-13 | Paper |
| Parallel searching of multidimensional cubes | 1993-10-24 | Paper |
| On the Reversibility of Oblivious Transfer | 1993-05-18 | Paper |
| Two Probabilistic Results on Merging | 1993-05-17 | Paper |
| Deciding bisimilarity is P-complete | 1993-02-04 | Paper |
| Relativized Arthur-Merlin versus Merlin-Arthur games | 1989-01-01 | Paper |
| On using deterministic functions to reduce randomness in probabilistic algorithms | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787473 | 1987-01-01 | Paper |
| Generating quasi-random sequences from semi-random sources | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3705434 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338230 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956919 | 1982-01-01 | Paper |
