Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Ronald de Wolf

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 Harry Buhrman

> Home > Persons > Ronald de Wolf

Publications

2013
[j28]
- view
  - electronic edition @ uchicago.edu (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/cjtcs/BuhrmanGMW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cjtcs/BuhrmanGMW13
Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf:
The non-adaptive query complexity of testing k-parities. Chic. J. Theor. Comput. Sci. 2013 (2013)
2012
[j26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/toc/BuhrmanRSW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/BuhrmanRSW12
Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf:
Near-Optimal and Explicit Bell Inequality Violations. Theory Comput. 8(1): 623-645 (2012)
[i35]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1209-3849
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1209-3849
Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf:
The non-adaptive query complexity of testing k-parities. CoRR abs/1209.3849 (2012)
2011
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/BuhrmanRSW11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BuhrmanRSW11
Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf:
Near-Optimal and Explicit Bell Inequality Violations. CCC 2011: 157-166
2007
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/BuhrmanNRW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BuhrmanNRW07
Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf:
Robust Polynomials and Quantum Algorithms. Theory Comput. Syst. 40(4): 379-395 (2007)
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/BuhrmanVW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BuhrmanVW07
Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf:
On Computation and Communication with Small Bias. CCC 2007: 24-32
2005
[j13]
- 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)
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/BuhrmanNRW05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/BuhrmanNRW05
Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf:
Robust Polynomials and Quantum Algorithms. STACS 2005: 593-604
2003
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/BuhrmanW03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BuhrmanW03
Harry Buhrman, Ronald de Wolf:
Quantum zero-error algorithms cannot be composed. Inf. Process. Lett. 87(2): 79-84 (2003)
[i13]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/quant-ph-0309220
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/quant-ph-0309220
Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf:
Robust Quantum Algorithms and Polynomials. CoRR quant-ph/0309220 (2003)
2002
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BuhrmanW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BuhrmanW02
Harry Buhrman, Ronald de Wolf:
Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1): 21-43 (2002)
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/quant-ph-0211029
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/quant-ph-0211029
Harry Buhrman, Ronald de Wolf:
Quantum Zero-Error Algorithms Cannot be Composed. CoRR quant-ph/0211029 (2002)
2001
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/BealsBCMW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/BealsBCMW01
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum lower bounds by polynomials. J. ACM 48(4): 778-797 (2001)
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/BuhrmanW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BuhrmanW01
Harry Buhrman, Ronald de Wolf:
Communication Complexity Lower Bounds by Polynomials. CCC 2001: 120-130
[c10]
- 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
1999
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/BuhrmanW99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BuhrmanW99
Harry Buhrman, Ronald de Wolf:
A Lower Bound for Quantum Search of an Ordered List. Inf. Process. Lett. 70(5): 205-209 (1999)
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/BuhrmanCWZ99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BuhrmanCWZ99
Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka:
Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS 1999: 358-368
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/cs-CC-9904019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-CC-9904019
Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka:
Bounds for Small-Error and Zero-Error Quantum Algorithms. CoRR cs.CC/9904019 (1999)
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/cs-CC-9910010
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-CC-9910010
Harry Buhrman, Ronald de Wolf:
Communication Complexity Lower Bounds by Polynomials. CoRR cs.CC/9910010 (1999)
1998
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/BealsBCMW98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/BealsBCMW98
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. FOCS 1998: 352-361
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/quant-ph-9802049
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/quant-ph-9802049
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. CoRR quant-ph/9802049 (1998)
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/quant-ph-9811046
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/quant-ph-9811046
Harry Buhrman, Ronald de Wolf:
Lower Bounds for Quantum Search and Derandomization. CoRR quant-ph/9811046 (1998)

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.