The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Peter Høyer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.309secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002