Robert Špalek

Available identifiers

Publication	Date of Publication	Type
Adversary lower bound for the k-sum problem	2017-05-16	Paper
A new quantum lower bound method,	2014-11-25	Paper
Quantum Query Complexity of State Conversion	2014-07-30	Paper
Span-program-based quantum algorithm for evaluating formulas	2012-09-27	Paper
Quantum Circuits with Unbounded Fan-out	2011-05-24	Paper
https://portal.mardi4nfdi.de/entity/Q3002763	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 verification of matrix products	2010-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q3396568	2009-09-19	Paper
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs	2009-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q3549652	2009-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q3549690	2009-01-05	Paper
Quantum Algorithms for Matching and Network Flows	2008-03-19	Paper
Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs	2007-10-22	Paper
Automata, Languages and Programming	2006-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q4418653	2003-08-11	Paper

This page was built for person: Robert Špalek