Travelled to:1 × Denmark
1 × Finland
1 × Greece
1 × The Netherlands
1 × USA
Collaborated with:T.Lee R.Spalek M.Mosca R.d.Wolf J.Neerbek Y.Shi G.Brassard A.Tapp C.Dürr M.Heiligman M.Mhalla
Talks about:quantum (4) complex (2) search (2) adversari (1) stronger (1) distinct (1) problem (1) element (1) weight (1) queri (1)
Person: Peter Høyer
DBLP: H=oslash=yer:Peter
Contributed to:
2007
2004200320011998Wrote 5 papers:
- STOC-2007-HoyerLS
- Negative weights make adversaries stronger (PH, TL, RS), pp. 526–535.
- ICALP-2004-DurrHHM #complexity #graph #problem #quantum #query
- Quantum Query Complexity of Some Graph Problems (CD, MH, PH, MM), pp. 481–493.
- ICALP-2003-HoyerMW #bound #quantum
- Quantum Search on Bounded-Error Inputs (PH, MM, RdW), pp. 291–299.
- ICALP-2001-HoyerNS #order #quantum #sorting
- Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness (PH, JN, YS), pp. 346–357.
- ICALP-1998-BrassardHT #quantum
- Quantum Counting (GB, PH, AT), pp. 820–831.