| 2007 |
|---|
| 28 | EE | Peter Høyer,
Troy Lee,
Robert Spalek:
Negative weights make adversaries stronger.
STOC 2007: 526-535 |
| 2006 |
|---|
| 27 | EE | Peter Høyer,
Mehdi Mhalla,
Simon Perdrix:
Resources Required for Preparing Graph States.
ISAAC 2006: 638-649 |
| 26 | EE | Christoph Dürr,
Mark Heiligman,
Peter Høyer,
Mehdi Mhalla:
Quantum Query Complexity of Some Graph Problems.
SIAM J. Comput. 35(6): 1310-1328 (2006) |
| 2005 |
|---|
| 25 | EE | Peter Høyer:
The Phase Matrix.
ISAAC 2005: 308-317 |
| 24 | | Peter Høyer,
Robert Spalek:
Lower Bounds on Quantum Query Complexity.
Bulletin of the EATCS 87: 78-103 (2005) |
| 23 | EE | Harry Buhrman,
Christoph Dürr,
Mark Heiligman,
Peter Høyer,
Frédéric Magniez,
Miklos Santha,
Ronald de Wolf:
Quantum Algorithms for Element Distinctness.
SIAM J. Comput. 34(6): 1324-1330 (2005) |
| 22 | EE | Peter Høyer,
Robert Spalek:
Quantum Fan-out is Powerful.
Theory of Computing 1(1): 81-103 (2005) |
| 2004 |
|---|
| 21 | EE | Christoph Dürr,
Mark Heiligman,
Peter Høyer,
Mehdi Mhalla:
Quantum Query Complexity of Some Graph Problems.
ICALP 2004: 481-493 |
| 20 | EE | Richard Cleve,
Peter Høyer,
Benjamin Toner,
John Watrous:
Consequences and Limits of Nonlocal Strategies.
IEEE Conference on Computational Complexity 2004: 236-249 |
| 19 | EE | Mark Ettinger,
Peter Høyer,
Emanuel Knill:
The quantum query complexity of the hidden subgroup problem is polynomial.
Inf. Process. Lett. 91(1): 43-48 (2004) |
| 2003 |
|---|
| 18 | EE | Peter Høyer,
Michele Mosca,
Ronald de Wolf:
Quantum Search on Bounded-Error Inputs.
ICALP 2003: 291-299 |
| 17 | EE | Peter Høyer,
Robert Spalek:
Quantum Circuits with Unbounded Fan-out.
STACS 2003: 234-246 |
| 16 | EE | Peter Høyer,
Michele Mosca,
Ronald de Wolf:
Quantum Search on Bounded-Error Inputs
CoRR quant-ph/0304052: (2003) |
| 2002 |
|---|
| 15 | EE | Peter Høyer,
Ronald de Wolf:
Improved Quantum Communication Complexity Bounds for Disjointness and Equality.
STACS 2002: 299-310 |
| 14 | EE | Peter Høyer,
Jan Neerbek,
Yaoyun Shi:
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.
Algorithmica 34(4): 429-448 (2002) |
| 13 | EE | Peter Høyer,
Robert Spalek:
Quantum Circuits with Unbounded Fan-out
CoRR quant-ph/0208043: (2002) |
| 2001 |
|---|
| 12 | EE | Peter Høyer,
Jan Neerbek,
Yaoyun Shi:
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.
ICALP 2001: 346-357 |
| 11 | EE | Harry Buhrman,
Christoph Dürr,
Mark Heiligman,
Peter Høyer,
Frédéric Magniez,
Miklos Santha,
Ronald de Wolf:
Quantum Algorithms for Element Distinctness.
IEEE Conference on Computational Complexity 2001: 131-137 |
| 10 | EE | Peter Høyer:
Introduction to Recent Quantum Algorithms.
MFCS 2001: 62-73 |
| 9 | EE | Peter Høyer,
Ronald de Wolf:
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
CoRR quant-ph/0109068: (2001) |
| 2000 |
|---|
| 8 | EE | Peter Høyer:
Simplified proof of the Fourier Sampling Theorem.
Inf. Process. Lett. 75(4): 139-143 (2000) |
| 1999 |
|---|
| 7 | EE | Mark Ettinger,
Peter Høyer:
On Quantum Algorithms for Noncommutative Hidden Subgroups.
STACS 1999: 478-487 |
| 1998 |
|---|
| 6 | EE | Gilles Brassard,
Peter Høyer,
Alain Tapp:
Quantum Counting.
ICALP 1998: 820-831 |
| 5 | EE | Gilles Brassard,
Peter Høyer,
Alain Tapp:
Quantum Cryptanalysis of Hash and Claw-Free Functions.
LATIN 1998: 163-169 |
| 4 | | Peter Høyer,
Kim S. Larsen:
Parametric Permutation Routing via Matchings.
Nord. J. Comput. 5(2): 105-114 (1998) |
| 1997 |
|---|
| 3 | EE | Gilles Brassard,
Peter Høyer:
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem.
ISTCS 1997: 12-23 |
| 1996 |
|---|
| 2 | EE | Christoph Dürr,
Peter Høyer:
A Quantum Algorithm for Finding the Minimum
CoRR quant-ph/9607014: (1996) |
| 1995 |
|---|
| 1 | | Peter Høyer:
A General Technique for Implementation of Efficient Priority Queues.
ISTCS 1995: 57-66 |
