Christoph Dürr

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mark Heiligman

> Home > Persons > Christoph Dürr

Publications

2006
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/DurrHHM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/DurrHHM06
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)
2005
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/BuhrmanD05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/BuhrmanD05
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)
2004
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/DurrHHM04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/DurrHHM04
Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla:
Quantum Query Complexity of Some Graph Problems. ICALP 2004: 481-493
2001
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/BuhrmanDHHMSW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BuhrmanDHHMSW01
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

a service of

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.