default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Høyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c22]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer
, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-To-Communication Simulation. STACS 2022: 20:1-20:23- 2020
- [j17]Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in multipartite pseudo-telepathy graph games. J. Comput. Syst. Sci. 107: 156-165 (2020) - [j16]Peter Høyer, Zhan Yu:
Analysis of lackadaisical quantum walks. Quantum Inf. Comput. 20(13&14): 1137-1152 (2020) - [i7]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-to-Communication Simulation. CoRR abs/2012.05233 (2020)
2010 – 2019
- 2019
- [j15]Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail:
Key Establishment à la Merkle in a Quantum World. J. Cryptol. 32(3): 601-634 (2019) - 2017
- [c21]Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in Multipartite Pseudo-Telepathy Graph Games. FCT 2017: 41-55 - [c20]Catalin Dohotaru, Peter Høyer:
Controlled Quantum Amplification. ICALP 2017: 18:1-18:13 - [c19]Peter Høyer, Mojtaba Komeili:
Efficient Quantum Walk on the Grid with Multiple Marked Elements. STACS 2017: 42:1-42:14 - [c18]Aleksandrs Belovs, Gilles Brassard, Peter Høyer, Marc Kaplan, Sophie Laplante, Louis Salvail:
Provably Secure Key Establishment Against Quantum Adversaries. TQC 2017: 3:1-3:17 - 2016
- [j14]Mark Adcock, Peter Høyer, Barry C. Sanders:
Quantum computation with coherent spin states and the close Hadamard problem. Quantum Inf. Process. 15(4): 1361-1386 (2016) - [r1]Gilles Brassard, Peter Høyer, Alain Tapp:
Quantum Algorithm for the Collision Problem. Encyclopedia of Algorithms 2016: 1662-1664 - [i6]Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Contextuality in multipartie pseudo-telepathy graph games. CoRR abs/1609.09689 (2016) - [i5]Peter Høyer, Mojtaba Komeili:
Efficient quantum walk on the grid with multiple marked elements. CoRR abs/1612.08958 (2016) - 2014
- [j13]Thomas Decker, Peter Høyer, Gábor Ivanyos, Miklos Santha:
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems. Quantum Inf. Comput. 14(9-10): 790-806 (2014) - 2013
- [j12]Mark Adcock, Peter Høyer, Barry C. Sanders:
Gaussian quantum computation with oracle-decision problems. Quantum Inf. Process. 12(4): 1759-1779 (2013) - 2011
- [c17]Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail:
Merkle Puzzles in a Quantum World. CRYPTO 2011: 391-410
2000 – 2009
- 2009
- [j11]Catalin Dohotaru, Peter Høyer:
Exact quantum lower bound for grover's problem. Quantum Inf. Comput. 9(5&6): 533-540 (2009) - 2007
- [c16]Peter Høyer, Troy Lee, Robert Spalek:
Negative weights make adversaries stronger. STOC 2007: 526-535 - 2006
- [j10]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) - [c15]Peter Høyer, Mehdi Mhalla, Simon Perdrix:
Resources Required for Preparing Graph States. ISAAC 2006: 638-649 - 2005
- [j9]Peter Høyer, Robert Spalek:
Lower Bounds on Quantum Query Complexity. Bull. EATCS 87: 78-103 (2005) - [j8]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) - [j7]Peter Høyer, Robert Spalek:
Quantum Fan-out is Powerful. Theory Comput. 1(1): 81-103 (2005) - [c14]Peter Høyer:
The Phase Matrix. ISAAC 2005: 308-317 - 2004
- [j6]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) - [c13]Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous:
Consequences and Limits of Nonlocal Strategies. CCC 2004: 236-249 - [c12]Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla:
Quantum Query Complexity of Some Graph Problems. ICALP 2004: 481-493 - 2003
- [c11]Peter Høyer, Michele Mosca, Ronald de Wolf:
Quantum Search on Bounded-Error Inputs. ICALP 2003: 291-299 - [c10]Peter Høyer, Robert Spalek:
Quantum Circuits with Unbounded Fan-out. STACS 2003: 234-246 - [i4]Peter Høyer, Michele Mosca, Ronald de Wolf:
Quantum Search on Bounded-Error Inputs. CoRR quant-ph/0304052 (2003) - 2002
- [j5]Peter Høyer, Jan Neerbek, Yaoyun Shi:
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Algorithmica 34(4): 429-448 (2002) - [c9]Peter Høyer, Ronald de Wolf:
Improved Quantum Communication Complexity Bounds for Disjointness and Equality. STACS 2002: 299-310 - [i3]Peter Høyer, Robert Spalek:
Quantum Circuits with Unbounded Fan-out. CoRR quant-ph/0208043 (2002) - 2001
- [c8]Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf:
Quantum Algorithms for Element Distinctness. CCC 2001: 131-137 - [c7]Peter Høyer, Jan Neerbek, Yaoyun Shi:
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. ICALP 2001: 346-357 - [c6]Peter Høyer:
Introduction to Recent Quantum Algorithms. MFCS 2001: 62-73 - [i2]Peter Høyer, Ronald de Wolf:
Improved Quantum Communication Complexity Bounds for Disjointness and Equality. CoRR quant-ph/0109068 (2001) - 2000
- [j4]Mark Ettinger, Peter Høyer:
On Quantum Algorithms for Noncommutative Hidden Subgroups. Adv. Appl. Math. 25(3): 239-251 (2000) - [j3]Peter Høyer:
Simplified proof of the Fourier Sampling Theorem. Inf. Process. Lett. 75(4): 139-143 (2000)
1990 – 1999
- 1999
- [c5]Mark Ettinger, Peter Høyer:
On Quantum Algorithms for Noncommutative Hidden Subgroups. STACS 1999: 478-487 - 1998
- [j2]Peter Høyer, Kim S. Larsen:
Parametric Permutation Routing via Matchings. Nord. J. Comput. 5(2): 105-114 (1998) - [c4]Gilles Brassard, Peter Høyer, Alain Tapp:
Quantum Counting. ICALP 1998: 820-831 - [c3]Gilles Brassard, Peter Høyer, Alain Tapp:
Quantum Cryptanalysis of Hash and Claw-Free Functions. LATIN 1998: 163-169 - 1997
- [j1]Gilles Brassard, Peter Høyer, Alain Tapp:
Quantum cryptanalysis of hash and claw-free functions. SIGACT News 28(2): 14-19 (1997) - [c2]Gilles Brassard, Peter Høyer:
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. ISTCS 1997: 12-23 - 1996
- [i1]Christoph Dürr, Peter Høyer:
A Quantum Algorithm for Finding the Minimum. CoRR quant-ph/9607014 (1996) - 1995
- [c1]Peter Høyer:
A General Technique for Implementation of Efficient Priority Queues. ISTCS 1995: 57-66
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
