| Publication | Date of Publication | Type |
|---|
| Application of kolmogorov complexity to inductive inference with limited memory | 2023-12-08 | Paper |
| Quantum complexity for vector domination problem | 2023-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161147 | 2023-06-26 | Paper |
| Quantum bounds for 2D-grid and Dyck language | 2023-06-01 | Paper |
| Strong dispersion property for the quantum walk on the hypercube | 2023-02-23 | Paper |
| Quantum algorithms for computational geometry problems | 2023-02-07 | Paper |
| Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language | 2022-07-18 | Paper |
| All Classical Adversary Methods Are Equivalent for Total Functions | 2022-03-14 | Paper |
| Automata and quantum computing | 2021-11-12 | Paper |
| Quadratic speedup for finding marked vertices by Quantum walks | 2021-01-19 | Paper |
| Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test | 2020-10-21 | Paper |
| UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY | 2020-09-22 | Paper |
| All Classical Adversary Methods are Equivalent for Total Functions | 2020-08-05 | Paper |
| Quantum security proofs using semi-classical oracles | 2020-03-09 | Paper |
| Quantum Speedups for Exponential-Time Dynamic Programming Algorithms | 2019-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967202 | 2019-07-03 | Paper |
| Quadratic speedup for finding marked vertices by quantum walks | 2019-03-18 | Paper |
| Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities | 2019-03-15 | Paper |
| On block sensitivity and fractional block sensitivity | 2018-11-02 | Paper |
| Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing | 2018-07-16 | Paper |
| Forrelation: A Problem That Optimally Separates Quantum from Classical Computing | 2018-07-04 | Paper |
| Upper bound on the communication complexity of private information retrieval | 2018-07-04 | Paper |
| Separations in Query Complexity Based on Pointer Functions | 2018-05-17 | Paper |
| General inductive inference types based on linearly-ordered sets | 2017-11-16 | Paper |
| Upper bounds on multiparty communication complexity of shifts | 2017-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368738 | 2017-10-10 | Paper |
| Polynomials, quantum query complexity, and Grothendieck's inequality | 2017-10-10 | Paper |
| Separations in Query Complexity Based on Pointer Functions | 2017-09-29 | Paper |
| Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games | 2017-08-17 | Paper |
| Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ | 2017-04-04 | Paper |
| Provable Advantage for Quantum Strategies in Random Symmetric XOR Games | 2017-02-01 | Paper |
| Exact Quantum Query Complexity of EXACT and THRESHOLD | 2017-02-01 | Paper |
| Optimal quantum query bounds for almost all Boolean functions. | 2017-01-30 | Paper |
| Quantum query complexity of almost all functions with fixed on-set size | 2016-11-30 | Paper |
| Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems | 2016-10-24 | Paper |
| Dense quantum coding and a lower bound for 1-way quantum automata | 2016-09-29 | Paper |
| Sensitivity Versus Certificate Complexity of Boolean Functions | 2016-07-25 | Paper |
| How rich is the structure of the intrinsic complexity of learning | 2016-06-16 | Paper |
| Superlinear Advantage for Exact Quantum Algorithms | 2016-05-12 | Paper |
| Dense quantum coding and quantum finite automata | 2015-12-07 | Paper |
| Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification | 2015-12-03 | Paper |
| Size of Sets with Small Sensitivity: A Generalization of Simon’s Lemma | 2015-09-30 | Paper |
| Forrelation | 2015-08-21 | Paper |
| Fast Matrix Multiplication | 2015-08-21 | Paper |
| Grover’s Algorithm with Errors | 2015-08-05 | Paper |
| One-dimensional quantum walks | 2015-02-27 | Paper |
| Quantum walks on graphs | 2015-02-27 | Paper |
| A new protocol and lower bounds for quantum coin flipping | 2015-02-27 | Paper |
| How low can approximate degree and quantum query complexity be for total Boolean functions? | 2015-01-23 | Paper |
| A new quantum lower bound method, | 2014-11-25 | Paper |
| Worst Case Analysis of Non-local Games | 2014-11-04 | Paper |
| A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity | 2014-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921782 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191607 | 2014-10-06 | Paper |
| Quantum lower bounds by quantum arguments | 2014-09-26 | Paper |
| Computing with highly mixed states (extended abstract) | 2014-09-26 | Paper |
| A quantum lovász local lemma | 2014-08-13 | Paper |
| Superlinear advantage for exact quantum algorithms | 2014-08-07 | Paper |
| Recent Developments in Quantum Algorithms and Complexity | 2014-08-07 | Paper |
| Weak Parity | 2014-07-01 | Paper |
| Tighter Relations between Sensitivity and Other Complexity Measures | 2014-07-01 | Paper |
| A quantum Lovász local lemma | 2014-02-17 | Paper |
| On symmetric nonlocal games | 2014-01-10 | Paper |
| Quantum Strategies Are Better Than Classical in Almost Any XOR Game | 2013-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910707 | 2013-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904800 | 2012-08-23 | Paper |
| Superiority of exact quantum automata for promise problems | 2012-05-04 | Paper |
| Random tensor theory: Extending random matrix theory to mixtures of random product states | 2012-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3171618 | 2011-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172424 | 2011-10-05 | Paper |
| Quantum Property Testing for Bounded-Degree Graphs | 2011-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002756 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002757 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002814 | 2011-05-24 | Paper |
| Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer | 2011-01-17 | Paper |
| Quantum search with variable times | 2010-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3589465 | 2010-09-20 | Paper |
| New Developments in Quantum Algorithms | 2010-09-03 | Paper |
| Quantum algorithms a decade after shor | 2010-08-15 | Paper |
| Nonlocal Quantum XOR Games for Large Number of Players | 2010-06-17 | Paper |
| Transformations that preserve learnability | 2010-04-27 | Paper |
| Nonmalleable encryption of quantum information | 2009-12-14 | Paper |
| A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs | 2009-08-31 | Paper |
| Improved constructions of quantum automata | 2009-05-19 | Paper |
| Public Key Cryptography – PKC 2004 | 2009-05-14 | Paper |
| Quantum Query Complexity of Boolean Functions with Small On-Sets | 2009-01-29 | Paper |
| Improved Constructions of Quantum Automata | 2009-01-13 | Paper |
| Computing with highly mixed states | 2008-12-21 | Paper |
| The minimum distance problem for two-way entanglement purification | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522383 | 2008-09-03 | Paper |
| Probabilistic and team PFIN-type learning: General properties | 2008-06-10 | Paper |
| Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems | 2008-04-24 | Paper |
| Quantum Walk Algorithm for Element Distinctness | 2008-03-28 | Paper |
| Quantum Algorithms for Matching and Network Flows | 2008-03-19 | Paper |
| Quantum Random Walks – New Method for Designing Quantum Algorithms | 2008-03-07 | Paper |
| Quantum Walks with Multiple or Moving Marked Locations | 2008-03-07 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Improved Algorithms for Quantum Identification of Boolean Oracles | 2007-09-07 | Paper |
| Improved algorithms for quantum identification of Boolean oracles | 2007-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3437580 | 2007-05-09 | Paper |
| Algebraic results on quantum automata | 2006-10-25 | Paper |
| Polynomial degree vs. quantum query complexity | 2006-04-28 | Paper |
| Parsimony hierarchies for inductive inference | 2005-08-29 | Paper |
| A new protocol and lower bounds for quantum coin flipping | 2004-11-22 | Paper |
| QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470530 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4459079 | 2004-03-25 | Paper |
| The Quantum Communication Complexity of Sampling | 2004-01-08 | Paper |
| Exact results for accepting probabilities of quantum automata. | 2003-08-17 | Paper |
| Two-way finite automata with quantum and classical states. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779141 | 2002-11-25 | Paper |
| Quantum lower bounds by quantum arguments | 2002-09-12 | Paper |
| A note on quantum black-box complexity of almost all Boolean functions | 2002-07-25 | Paper |
| On learning formulas in the limit and with assurance. | 2002-07-25 | Paper |
| Delayed binary search, or playing twenty questions with a procrastinator | 2002-05-21 | Paper |
| The communication complexity of enumeration, elimination, and selection | 2002-04-11 | Paper |
| Average-case quantum query complexity | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762497 | 2002-01-09 | Paper |
| Hierarchies of probabilistic and team FIN-learning | 2001-08-20 | Paper |
| Probabilistic inductive inference: A survey | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508377 | 2001-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938665 | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504216 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501528 | 2000-09-04 | Paper |
| Ordinal mind change complexity of language identification | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496246 | 2000-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943318 | 2000-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938621 | 2000-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4240334 | 1999-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218115 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252369 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370213 | 1998-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370228 | 1998-02-02 | Paper |
| Communication complexity in a 3-computer model | 1996-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415450 | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415451 | 1996-01-01 | Paper |
