default search action

combined dblp search
author search
venue search
publication search

ask others

Mark Adcock

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2016
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/qip/AdcockHS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/qip/AdcockHS16
Mark Adcock, Peter Høyer, Barry C. Sanders:
Quantum computation with coherent spin states and the close Hadamard problem. Quantum Inf. Process. 15(4): 1361-1386 (2016)
2013
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/qip/AdcockHS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/qip/AdcockHS13
Mark Adcock, Peter Høyer, Barry C. Sanders:
Gaussian quantum computation with oracle-decision problems. Quantum Inf. Process. 12(4): 1759-1779 (2013)

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2006
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/AdcockCIPY06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/AdcockCIPY06
Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita:
Quantum lower bounds for the Goldreich-Levin problem. Inf. Process. Lett. 97(5): 208-211 (2006)
2002
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/AdcockC02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/AdcockC02
Mark Adcock, Richard Cleve:
A Quantum Goldreich-Levin Theorem with Cryptographic Applications. STACS 2002: 323-334

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.