Peter Høyer - RankMe

47 papers A* 7A 7B 5Journal 24Unranked 3

Year	Rank	Type	Title / Venue / Authors
2022	A	`conf`	Symmetry and Quantum Query-To-Communication Simulation. STACS Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
2020	J	`jnl`	Analysis of lackadaisical quantum walks. Quantum Inf. Comput. Peter Høyer, Zhan Yu
2020	J	`jnl`	Contextuality in multipartite pseudo-telepathy graph games. J. Comput. Syst. Sci. Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix
2020	J	`jnl`	Symmetry and Quantum Query-to-Communication Simulation. CoRR Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
2019	J	`jnl`	Key Establishment à la Merkle in a Quantum World. J. Cryptol. Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail
2017	B	`conf`	Contextuality in Multipartite Pseudo-Telepathy Graph Games. FCT Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix
2017	A*	`conf`	Controlled Quantum Amplification. ICALP Catalin Dohotaru, Peter Høyer
2017	A	`conf`	Efficient Quantum Walk on the Grid with Multiple Marked Elements. STACS Peter Høyer, Mojtaba Komeili
2017	—	`conf`	Provably Secure Key Establishment Against Quantum Adversaries. TQC Aleksandrs Belovs, Gilles Brassard, Peter Høyer, Marc Kaplan, Sophie Laplante, Louis Salvail
2016	J	`jnl`	Contextuality in multipartie pseudo-telepathy graph games. CoRR Peter Høyer, Mehdi Mhalla, Simon Perdrix
2016	J	`jnl`	Efficient quantum walk on the grid with multiple marked elements. CoRR Peter Høyer, Mojtaba Komeili
2016	—	`ch.`	Quantum Algorithm for the Collision Problem. Encyclopedia of Algorithms Gilles Brassard, Peter Høyer, Alain Tapp
2016	J	`jnl`	Quantum computation with coherent spin states and the close Hadamard problem. Quantum Inf. Process. Mark Adcock, Peter Høyer, Barry C. Sanders
2014	J	`jnl`	Polynomial time quantum algorithms for certain bivariate hidden polynomial problems. Quantum Inf. Comput. Thomas Decker, Peter Høyer, Gábor Ivanyos, Miklos Santha
2013	J	`jnl`	Gaussian quantum computation with oracle-decision problems. Quantum Inf. Process. Mark Adcock, Peter Høyer, Barry C. Sanders
2011	A*	`conf`	Merkle Puzzles in a Quantum World. CRYPTO Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail
2009	J	`jnl`	Exact quantum lower bound for grover's problem. Quantum Inf. Comput. Catalin Dohotaru, Peter Høyer
2007	A*	`conf`	Negative weights make adversaries stronger. STOC Peter Høyer, Troy Lee, Robert Spalek
2006	J	`jnl`	Quantum Query Complexity of Some Graph Problems. SIAM J. Comput. Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla
2006	B	`conf`	Resources Required for Preparing Graph States. ISAAC Peter Høyer, Mehdi Mhalla, Simon Perdrix
2005	J	`jnl`	Lower Bounds on Quantum Query Complexity. Bull. EATCS Peter Høyer, Robert Spalek
2005	J	`jnl`	Quantum Algorithms for Element Distinctness. SIAM J. Comput. Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
2005	J	`jnl`	Quantum Fan-out is Powerful. Theory Comput. Peter Høyer, Robert Spalek
2005	B	`conf`	The Phase Matrix. ISAAC Peter Høyer
2004	A	`conf`	Consequences and Limits of Nonlocal Strategies. CCC Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous
2004	A*	`conf`	Quantum Query Complexity of Some Graph Problems. ICALP Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla
2004	J	`jnl`	The quantum query complexity of the hidden subgroup problem is polynomial. Inf. Process. Lett. Mark Ettinger, Peter Høyer, Emanuel Knill
2003	A	`conf`	Quantum Circuits with Unbounded Fan-out. STACS Peter Høyer, Robert Spalek
2003	J	`jnl`	Quantum Search on Bounded-Error Inputs CoRR Peter Høyer, Michele Mosca, Ronald de Wolf
2003	A*	`conf`	Quantum Search on Bounded-Error Inputs. ICALP Peter Høyer, Michele Mosca, Ronald de Wolf
2002	A	`conf`	Improved Quantum Communication Complexity Bounds for Disjointness and Equality. STACS Peter Høyer, Ronald de Wolf
2002	J	`jnl`	Quantum Circuits with Unbounded Fan-out CoRR Peter Høyer, Robert Spalek
2002	J	`jnl`	Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Algorithmica Peter Høyer, Jan Neerbek, Yaoyun Shi
2001	J	`jnl`	Improved Quantum Communication Complexity Bounds for Disjointness and Equality CoRR Peter Høyer, Ronald de Wolf
2001	B	`conf`	Introduction to Recent Quantum Algorithms. MFCS Peter Høyer
2001	A	`conf`	Quantum Algorithms for Element Distinctness. CCC Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
2001	A*	`conf`	Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. ICALP Peter Høyer, Jan Neerbek, Yaoyun Shi
2000	J	`jnl`	On Quantum Algorithms for Noncommutative Hidden Subgroups. Adv. Appl. Math. Mark Ettinger, Peter Høyer
2000	J	`jnl`	Simplified proof of the Fourier Sampling Theorem. Inf. Process. Lett. Peter Høyer
1999	A	`conf`	On Quantum Algorithms for Noncommutative Hidden Subgroups. STACS Mark Ettinger, Peter Høyer
1998	J	`jnl`	Parametric Permutation Routing via Matchings. Nord. J. Comput. Peter Høyer, Kim S. Larsen
1998	A*	`conf`	Quantum Counting. ICALP Gilles Brassard, Peter Høyer, Alain Tapp
1998	B	`conf`	Quantum Cryptanalysis of Hash and Claw-Free Functions. LATIN Gilles Brassard, Peter Høyer, Alain Tapp
1997	—	`conf`	An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. ISTCS Gilles Brassard, Peter Høyer
1997	J	`jnl`	Quantum cryptanalysis of hash and claw-free functions. SIGACT News Gilles Brassard, Peter Høyer, Alain Tapp
1996	J	`jnl`	A Quantum Algorithm for Finding the Minimum CoRR Christoph Dürr, Peter Høyer
1995	—	`conf`	A General Technique for Implementation of Efficient Priority Queues. ISTCS Peter Høyer