Julia Kempe Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick: Using Entanglement in Quantum Multi-Prover Interactive Proofs. Computational Complexity 18(2): 273-307 (2009)
2008
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick: Entangled Games are Hard to Approximate. FOCS 2008: 447-456
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Oded Regev, Ben Toner: Unique Games with Entangled Provers are Easy. FOCS 2008: 457-466
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Oded Regev, Falk Unger, Ronald de Wolf: Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) 2008: 845-856
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick: Using Entanglement in Quantum Multi-prover Interactive Proofs. IEEE Conference on Computational Complexity 2008: 211-222
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf: Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM J. Comput. 38(5): 1695-1708 (2008)
2007
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Oded Regev, Ben Toner: The Unique Games Conjecture with Entangled Provers is False. Algebraic Methods in Computational Complexity 2007
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe: The Power of Quantum Systems on a Line. FOCS 2007: 373-383
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf: Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC 2007: 516-525
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev: Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. SIAM J. Comput. 37(1): 166-194 (2007)
2006
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting. IEEE Conference on Computational Complexity 2006: 288-298
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf: Bounded-error quantum state identification and exponential separations in communication complexity. STOC 2006: 594-603
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDmitry Gavinsky, Julia Kempe, Ronald de Wolf: Strengths and Weaknesses of Quantum Fingerprinting CoRR abs/quant-ph/0603173: (2006)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDmitry Gavinsky, Julia Kempe, Ronald de Wolf: Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function CoRR abs/quant-ph/0607174: (2006)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDmitry Gavinsky, Julia Kempe, Ronald de Wolf: Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. Electronic Colloquium on Computational Complexity (ECCC) 13(086): (2006)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Alexei Kitaev, Oded Regev: The Complexity of the Local Hamiltonian Problem. SIAM J. Comput. 35(5): 1070-1097 (2006)
2005
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndris Ambainis, Julia Kempe, Alexander Rivosh: Coins make quantum walks faster. SODA 2005: 1099-1108
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Aner Shalev: The hidden subgroup problem and permutation group theory. SODA 2005: 1118-1125
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf: Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity CoRR abs/quant-ph/0511013: (2005)
2004
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev: Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. FOCS 2004: 42-51
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Alexei Kitaev, Oded Regev: The Complexity of the Local Hamiltonian Problem. FSTTCS 2004: 372-383
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Aner Shalev: The hidden subgroup problem and permutation group theory CoRR quant-ph/0406046: (2004)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Alexei Kitaev, Oded Regev: The Complexity of the Local Hamiltonian Problem CoRR quant-ph/0406180: (2004)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDmitry Gavinsky, Julia Kempe, Ronald de Wolf: Quantum Communication Cannot Simulate a Public Coin CoRR quant-ph/0411051: (2004)
2003
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe: Discrete Quantum Walks Hit Exponentially Faster. RANDOM-APPROX 2003: 354-369
2002
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe: Quantum Random Walks Hit Exponentially Faster CoRR quant-ph/0205083: (2002)
2001
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani: Quantum walks on graphs. STOC 2001: 50-59

Coauthor Index

1Dorit Aharonov [1] [8] [18] [20]
2Andris Ambainis [1] [11]
3Wim van Dam [8] [18]
4Dmitry Gavinsky [4] [9] [13] [14] [15] [16] [17] [19] [22]
5Daniel Gottesman [20]
6Sandy Irani [20]
7Iordanis Kerenidis [19] [22]
8Alexei Kitaev [5] [7] [12]
9Hirotada Kobayashi [23] [26] [27]
10Zeph Landau [8] [18]
11Seth Lloyd [8] [18]
12Keiji Matsumoto [23] [26] [27]
13Ran Raz [19] [22]
14Oded Regev [5] [7] [8] [9] [12] [16] [18] [21] [24] [25]
15Alexander Rivosh [11]
16Aner Shalev [6] [10]
17Ben Toner [21] [25] [26]
18Falk Unger [24]
19Umesh V. Vazirani [1]
20Thomas Vidick [23] [26] [27]
21Ronald de Wolf [4] [9] [13] [14] [15] [16] [17] [19] [22] [24]

Colors in the list of coauthors

Copyright © Sat Nov 7 19:26:18 2009 by Michael Ley (ley@uni-trier.de)