Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Peter Høyer" ( http://dblp.L3S.de/Authors/Peter_Høyer )

  Author page on DBLP  Author page in RDF  Community of Peter Høyer in ASPL-2

Publication years (Num. hits)
1995-2002 (16) 2003-2011 (15)
Publication types (Num. hits)
article(14) inproceedings(17)
Venues (Conferences, Journals, ...)
CoRR(4) ICALP(4) STACS(3) IEEE Conference on Computation...(2) Inf. Process. Lett.(2) ISAAC(2) ISTCS(2) SIAM J. Comput.(2) Algorithmica(1) Bulletin of the EATCS(1) CRYPTO(1) LATIN(1) MFCS(1) Nord. J. Comput.(1) Quantum Information & Computat...(1) SIGACT News(1) More (+10 of total 18)
Authors
Peter Høyer(31) Ronald de Wolf(6) Christoph Dürr(5) Gilles Brassard(5) Robert Spalek(5) Mark Heiligman(4) Alain Tapp(3) Mehdi Mhalla(3) Frédéric Magniez(2) Harry Buhrman(2) Jan Neerbek(2) Mark Ettinger(2) Michele Mosca(2) Miklos Santha(2) Yaoyun Shi(2) Benjamin Toner(1) More (+10 of total 27)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 4 keywords
Results
Found 31 publication records. Showing 31 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail Merkle Puzzles in a Quantum World. Search on Bibsonomy CRYPTO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Catalin Dohotaru, Peter Høyer Exact quantum lower bound for grover's problem. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Troy Lee, Robert Spalek Negative weights make adversaries stronger. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF adversary method, certificate complexity barrier, formula size, quantum query complexity, lower bounds, quantum computing
1Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla Quantum Query Complexity of Some Graph Problems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Mehdi Mhalla, Simon Perdrix Resources Required for Preparing Graph States. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Foundations of computing, Algorithms, Quantum Computing
1Peter Høyer, Robert Spalek Quantum Fan-out is Powerful. Search on Bibsonomy Theory of Computing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Robert Spalek Lower Bounds on Quantum Query Complexity. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2005 DBLP  BibTeX  RDF
1Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf Quantum Algorithms for Element Distinctness. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Høyer The Phase Matrix. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Amplitude Amplification, Algorithms, Randomized Algorithms, Quantum Computing
1Mark Ettinger, Peter Høyer, Emanuel Knill The quantum query complexity of the hidden subgroup problem is polynomial. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla Quantum Query Complexity of Some Graph Problems. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous Consequences and Limits of Nonlocal Strategies. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Michele Mosca, Ronald de Wolf Quantum Search on Bounded-Error Inputs Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Peter Høyer, Michele Mosca, Ronald de Wolf Quantum Search on Bounded-Error Inputs. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Robert Spalek Quantum Circuits with Unbounded Fan-out. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Jan Neerbek, Yaoyun Shi Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Robert Spalek Quantum Circuits with Unbounded Fan-out Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Peter Høyer, Ronald de Wolf Improved Quantum Communication Complexity Bounds for Disjointness and Equality. Search on Bibsonomy STACS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Ronald de Wolf Improved Quantum Communication Complexity Bounds for Disjointness and Equality Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
1Peter Høyer, Jan Neerbek, Yaoyun Shi Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Peter Høyer Introduction to Recent Quantum Algorithms. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf Quantum Algorithms for Element Distinctness. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Peter Høyer Simplified proof of the Fourier Sampling Theorem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Mark Ettinger, Peter Høyer On Quantum Algorithms for Noncommutative Hidden Subgroups. Search on Bibsonomy STACS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Kim S. Larsen Parametric Permutation Routing via Matchings. Search on Bibsonomy Nord. J. Comput. The full citation details ... 1998 DBLP  BibTeX  RDF
1Gilles Brassard, Peter Høyer, Alain Tapp Quantum Counting. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Gilles Brassard, Peter Høyer, Alain Tapp Quantum Cryptanalysis of Hash and Claw-Free Functions. Search on Bibsonomy LATIN The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Gilles Brassard, Peter Høyer, Alain Tapp Quantum cryptanalysis of hash and claw-free functions. Search on Bibsonomy SIGACT News The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Gilles Brassard, Peter Høyer An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. (PDF / PS) Search on Bibsonomy ISTCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Christoph Dürr, Peter Høyer A Quantum Algorithm for Finding the Minimum Search on Bibsonomy CoRR The full citation details ... 1996 DBLP  BibTeX  RDF
1Peter Høyer A General Technique for Implementation of Efficient Priority Queues. Search on Bibsonomy ISTCS The full citation details ... 1995 DBLP  BibTeX  RDF
Displaying result #1 - #31 of 31 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.