| Publication | Date of Publication | Type |
|---|
| Separations in communication complexity using cheat sheets and information complexity | 2025-08-06 | Paper |
| Classical and quantum algorithms for variants of subset-sum via dynamic programming | 2025-06-19 | Paper |
| Quantum algorithm for stochastic optimal stopping problems with applications in finance | 2024-06-27 | Paper |
scientific article; zbMATH DE number 7789149 (Why is no real title available?)
Theory of Computing | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788397 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7716603 (Why is no real title available?)
(available as arXiv preprint) | 2023-07-25 | Paper |
On the cut dimension of a graph
(available as arXiv preprint) | 2023-07-12 | Paper |
Total functions in QMA
Quantum Information Processing | 2023-02-16 | Paper |
Characterising the intersection of QMA and coQMA
Quantum Information Processing | 2022-11-24 | Paper |
Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
Computational Complexity | 2022-10-21 | Paper |
scientific article; zbMATH DE number 7561557 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559094 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Quantum algorithm for stochastic optimal stopping problems with applications in finance | 2021-11-30 | Paper |
scientific article; zbMATH DE number 7378736 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
(available as arXiv preprint) | 2021-08-04 | Paper |
A composition theorem for randomized query complexity
(available as arXiv preprint) | 2020-11-25 | Paper |
| A new public-key cryptosystem via Mersenne numbers | 2020-06-30 | Paper |
On the polynomial parity argument complexity of the combinatorial Nullstellensatz
(available as arXiv preprint) | 2020-05-26 | Paper |
Quadratically tight relations for randomized query complexity
Theory of Computing Systems | 2020-02-27 | Paper |
Improved quantum query algorithms for triangle finding and associativity testing
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| On the hitting times of quantum versus random walks | 2019-05-06 | Paper |
Quadratically tight relations for randomized query complexity
Lecture Notes in Computer Science | 2018-11-28 | Paper |
Linear-Time Algorithm for Quantum 2SAT
Theory of Computing | 2018-06-15 | Paper |
Separations in query complexity based on pointer functions
Journal of the ACM | 2018-05-17 | Paper |
Polynomial interpolation and identity testing from high powers over finite fields
Algorithmica | 2018-04-06 | Paper |
On the complexity of probabilistic trials for hidden satisfiability problems
(available as arXiv preprint) | 2018-03-21 | Paper |
Linear time algorithm for quantum 2SAT
(available as arXiv preprint) | 2017-12-19 | Paper |
A decision procedure for well-formed linear quantum cellular automata
STACS 96 | 2017-11-16 | Paper |
On the complexity of trial and error for constraint satisfaction problems
Journal of Computer and System Sciences | 2017-11-14 | Paper |
On the complexity of trial and error for constraint satisfaction problems
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Separations in query complexity based on pointer functions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Separating decision tree complexity from subcube partition complexity
(available as arXiv preprint) | 2017-08-31 | Paper |
| Generalized Wong sequences and their applications to Edmonds' problems | 2017-03-03 | Paper |
Improved quantum query algorithms for triangle detection and associativity testing
Algorithmica | 2017-03-03 | Paper |
Solving systems of diagonal polynomial equations over finite fields
Theoretical Computer Science | 2017-02-06 | Paper |
New bounds on the classical and quantum communication complexity of some graph properties
(available as arXiv preprint) | 2017-01-26 | Paper |
Approximate testing with relative error
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Improved bounds for the randomized decision tree complexity of recursive majority
Random Structures & Algorithms | 2016-06-10 | Paper |
On solving systems of diagonal polynomial equations over finite fields
Frontiers in Algorithmics | 2015-11-12 | Paper |
On solving systems of diagonal polynomial equations over finite fields
Frontiers in Algorithmics | 2015-11-12 | Paper |
Generalized Wong sequences and their applications to Edmonds' problems
Journal of Computer and System Sciences | 2015-07-13 | Paper |
An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
| Quantum algorithms for the triangle problem | 2014-10-13 | Paper |
Self-testing of universal and fault-tolerant sets of quantum gates
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On the complexity of trial and error for constraint satisfaction problems
Automata, Languages, and Programming | 2014-07-01 | Paper |
Hidden translation and translating coset in quantum computing
SIAM Journal on Computing | 2014-06-04 | Paper |
Hidden translation and translating coset in quantum computing
SIAM Journal on Computing | 2014-06-04 | Paper |
Learning graph based quantum query algorithms for finding constant-size subgraphs
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Hidden symmetry subgroup problems
SIAM Journal on Computing | 2014-02-04 | Paper |
Hidden symmetry subgroup problems
SIAM Journal on Computing | 2014-02-04 | Paper |
Query complexity of matroids
Lecture Notes in Computer Science | 2013-06-07 | Paper |
On the power of a unique quantum witness
Theory of Computing | 2012-09-27 | Paper |
On the hitting times of quantum versus random walks
Algorithmica | 2012-04-26 | Paper |
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
Algorithmica | 2012-04-26 | Paper |
Optimal direct sum results for deterministic and randomized decision tree complexity
Information Processing Letters | 2012-03-27 | Paper |
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
Automata, Languages and Programming | 2011-07-06 | Paper |
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
Automata, Languages and Programming | 2011-07-06 | Paper |
Search via Quantum Walk
SIAM Journal on Computing | 2011-05-17 | Paper |
Search via Quantum Walk
SIAM Journal on Computing | 2011-05-17 | Paper |
Efficient testing of groups
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Hidden translation and orbit coset in quantum computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Quantum and classical query complexities of local search are polynomially related
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
On the black-box complexity of Sperner's Lemma
Theory of Computing Systems | 2009-09-02 | Paper |
Quantum and classical query complexities of local search are polynomially related
Algorithmica | 2009-08-31 | Paper |
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae | 2009-06-23 | Paper |
| scientific article; zbMATH DE number 5485493 (Why is no real title available?) | 2009-01-05 | Paper |
Quantum Walk Based Search Algorithms
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Approximate Nash Equilibria for Multi-player Games
Algorithmic Game Theory | 2008-05-02 | Paper |
Quantum Algorithms for the Triangle Problem
SIAM Journal on Computing | 2008-04-22 | Paper |
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
SIAM Journal on Computing | 2008-04-22 | Paper |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
STACS 2007 | 2007-09-03 | Paper |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
STACS 2007 | 2007-09-03 | Paper |
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Consecutive-2 systems on trees
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Quantum Algorithms for Element Distinctness
SIAM Journal on Computing | 2005-09-16 | Paper |
| scientific article; zbMATH DE number 2086425 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2077106 (Why is no real title available?) | 2004-07-01 | Paper |
Semantical counting circuits
Theory of Computing Systems | 2003-08-26 | Paper |
Approximate testing with error relative to input size.
Journal of Computer and System Sciences | 2003-08-13 | Paper |
Efficient approximation algorithms for the subset-sums equality problem.
Journal of Computer and System Sciences | 2002-08-04 | Paper |
A decision procedure for unitary linear quantum cellular automata
SIAM Journal on Computing | 2002-04-23 | Paper |
scientific article; zbMATH DE number 1652000 (Why is no real title available?)
SCOPOS | 2001-09-27 | Paper |
| scientific article; zbMATH DE number 1507219 (Why is no real title available?) | 2001-06-10 | Paper |
| scientific article; zbMATH DE number 1555922 (Why is no real title available?) | 2001-01-24 | Paper |
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
Journal of Algorithms | 1999-08-31 | Paper |
Average-case analysis of the merging algorithm of Hwang and Lin
Algorithmica | 1999-06-21 | Paper |
Verifying the determinant in parallel
Computational Complexity | 1999-05-18 | Paper |
| scientific article; zbMATH DE number 1223719 (Why is no real title available?) | 1998-11-15 | Paper |
| A decision procedure for well-formed linear quantum cellular automata | 1998-06-01 | Paper |
Oblivious transfers and intersecting codes
IEEE Transactions on Information Theory | 1997-04-27 | Paper |
| scientific article; zbMATH DE number 826067 (Why is no real title available?) | 1995-12-13 | Paper |
Parallel searching of multidimensional cubes
Discrete Mathematics | 1993-10-24 | Paper |
On the Reversibility of Oblivious Transfer
Advances in Cryptology — EUROCRYPT ’91 | 1993-05-18 | Paper |
Two Probabilistic Results on Merging
SIAM Journal on Computing | 1993-05-17 | Paper |
Deciding bisimilarity is P-complete
Formal Aspects of Computing | 1993-02-04 | Paper |
Relativized Arthur-Merlin versus Merlin-Arthur games
Information and Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4050983 (Why is no real title available?) | 1987-01-01 | Paper |
On using deterministic functions to reduce randomness in probabilistic algorithms
Information and Computation | 1987-01-01 | Paper |
Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3930983 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3871339 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3777464 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3777464 (Why is no real title available?) | 1982-01-01 | Paper |
