According to our database1, Peter Høyer authored at least 34 papers between 1995 and 2020.
Legend:Book In proceedings Article PhD thesis Other
Contextuality in multipartite pseudo-telepathy graph games.
J. Comput. Syst. Sci., 2020
Key Establishment à la Merkle in a Quantum World.
J. Cryptology, 2019
Provably Secure Key Establishment Against Quantum Adversaries.
Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017
Efficient Quantum Walk on the Grid with Multiple Marked Elements.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017
Controlled Quantum Amplification.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Quantum Algorithm for the Collision Problem.
Encyclopedia of Algorithms, 2016
Quantum computation with coherent spin states and the close Hadamard problem.
Quantum Information Processing, 2016
Contextuality in multipartie pseudo-telepathy graph games.
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems.
Quantum Information & Computation, 2014
Gaussian quantum computation with oracle-decision problems.
Quantum Information Processing, 2013
Merkle Puzzles in a Quantum World.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011
Exact quantum lower bound for grover's problem.
Quantum Information & Computation, 2009
Negative weights make adversaries stronger.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Quantum Query Complexity of Some Graph Problems.
SIAM J. Comput., 2006
Resources Required for Preparing Graph States.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
Quantum Fan-out is Powerful.
Theory of Computing, 2005
Quantum Algorithms for Element Distinctness.
SIAM J. Comput., 2005
Lower Bounds on Quantum Query Complexity.
Bulletin of the EATCS, 2005
The Phase Matrix.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
The quantum query complexity of the hidden subgroup problem is polynomial.
Inf. Process. Lett., 2004
Consequences and Limits of Nonlocal Strategies.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004
Quantum Circuits with Unbounded Fan-out.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Quantum Search on Bounded-Error Inputs.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.
Improved Quantum Communication Complexity Bounds for Disjointness and Equality.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
Introduction to Recent Quantum Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001
Simplified proof of the Fourier Sampling Theorem.
Inf. Process. Lett., 2000
On Quantum Algorithms for Noncommutative Hidden Subgroups.
Adv. Appl. Math., 2000
Parametric Permutation Routing via Matchings.
Nord. J. Comput., 1998
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
Quantum cryptanalysis of hash and claw-free functions.
SIGACT News, 1997
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997
A Quantum Algorithm for Finding the Minimum
A General Technique for Implementation of Efficient Priority Queues.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995