dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Julia Kempe (Selection)

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

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


39Electronic 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. SIAM J. Comput. 40(3): 848-877 (2011)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Kempe, Oded Regev, Ben Toner: Unique Games with Entangled Provers Are Easy. SIAM J. Comput. 39(7): 3207-3229 (2010)
28Electronic 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
27Electronic 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
23Electronic 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

Selection of 5 from 43 records - Julia Kempe has 27 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page