Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/stoc/stoc2013.bht:"
download as .bib file
@inproceedings{DBLP:conf/stoc/AgrawalSS13,
author = {Manindra Agrawal and
Chandan Saha and
Nitin Saxena},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Quasi-polynomial hitting-set for set-depth-{\(\Delta\)} formulas},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {321--330},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488649},
doi = {10.1145/2488608.2488649},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AgrawalSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ajtai13,
author = {Mikl{\'{o}}s Ajtai},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Lower bounds for RAMs and quantifier elimination},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {803--812},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488710},
doi = {10.1145/2488608.2488710},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ajtai13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonLSV13,
author = {Noga Alon and
Troy Lee and
Adi Shraibman and
Santosh S. Vempala},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {The approximate rank of a matrix and its algorithmic applications:
approximate rank},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {675--684},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488694},
doi = {10.1145/2488608.2488694},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlonLSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ambainis13,
author = {Andris Ambainis},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Superlinear advantage for exact quantum algorithms},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {891--900},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488721},
doi = {10.1145/2488608.2488721},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ambainis13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AndoniGMP13,
author = {Alexandr Andoni and
Assaf Goldberger and
Andrew McGregor and
Ely Porat},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Homomorphic fingerprints under misalignments: sketching edit and shift
distances},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {931--940},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488726},
doi = {10.1145/2488608.2488726},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AndoniGMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AzarCG13,
author = {Yossi Azar and
Ilan Reuven Cohen and
Iftah Gamzu},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {The loss of serving in the dark},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {951--960},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488729},
doi = {10.1145/2488608.2488729},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AzarCG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AzarCKS13,
author = {Yossi Azar and
Ilan Reuven Cohen and
Seny Kamara and
F. Bruce Shepherd},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Tight bounds for online vector bin packing},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {961--970},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488730},
doi = {10.1145/2488608.2488730},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AzarCKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BabaiW13,
author = {L{\'{a}}szl{\'{o}} Babai and
John Wilmes},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Quasipolynomial-time canonical form for steiner designs},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {261--270},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488642},
doi = {10.1145/2488608.2488642},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BabaiW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeckI13,
author = {Christopher Beck and
Russell Impagliazzo},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Strong {ETH} holds for regular resolution},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {487--494},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488669},
doi = {10.1145/2488608.2488669},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeckI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeckNT13,
author = {Chris Beck and
Jakob Nordstr{\"{o}}m and
Bangsheng Tang},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Some trade-off results for polynomial calculus: extended abstract},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {813--822},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488711},
doi = {10.1145/2488608.2488711},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeckNT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeiCZ13,
author = {Xiaohui Bei and
Ning Chen and
Shengyu Zhang},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {On the complexity of trial and error},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {31--40},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488613},
doi = {10.1145/2488608.2488613},
timestamp = {Thu, 01 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeiCZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-SassonCGT13,
author = {Eli Ben{-}Sasson and
Alessandro Chiesa and
Daniel Genkin and
Eran Tromer},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {On the concrete efficiency of probabilistically-checkable proofs},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {585--594},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488681},
doi = {10.1145/2488608.2488681},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonCGT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-SassonGKKS13,
author = {Eli Ben{-}Sasson and
Ariel Gabizon and
Yohay Kaplan and
Swastik Kopparty and
Shubhangi Saraf},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {A new family of locally correctable codes based on degree-lifted algebraic
geometry codes},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {833--842},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488714},
doi = {10.1145/2488608.2488714},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonGKKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bernstein13,
author = {Aaron Bernstein},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Maintaining shortest paths under deletions in weighted directed graphs:
[extended abstract]},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {725--734},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488701},
doi = {10.1145/2488608.2488701},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bernstein13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhattacharyyaFHHL13,
author = {Arnab Bhattacharyya and
Eldar Fischer and
Hamed Hatami and
Pooya Hatami and
Shachar Lovett},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Every locally characterized affine-invariant property is testable},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {429--436},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488662},
doi = {10.1145/2488608.2488662},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhattacharyyaFHHL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhawalkarGM13,
author = {Kshipra Bhawalkar and
Sreenivas Gollapudi and
Kamesh Munagala},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Coevolutionary opinion formation games},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {41--50},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488615},
doi = {10.1145/2488608.2488615},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhawalkarGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhowmickDL13,
author = {Abhishek Bhowmick and
Zeev Dvir and
Shachar Lovett},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {New bounds for matching vector families},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {823--832},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488713},
doi = {10.1145/2488608.2488713},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhowmickDL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BitanskyCCT13,
author = {Nir Bitansky and
Ran Canetti and
Alessandro Chiesa and
Eran Tromer},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Recursive composition and bootstrapping for {SNARKS} and proof-carrying
data},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {111--120},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488623},
doi = {10.1145/2488608.2488623},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BitanskyCCT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BitanskyP13,
author = {Nir Bitansky and
Omer Paneth},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {On the impossibility of approximate obfuscation and applications to
resettable cryptography},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {241--250},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488639},
doi = {10.1145/2488608.2488639},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BitanskyP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BohmGJ13,
author = {Stanislav B{\"{o}}hm and
Stefan G{\"{o}}ller and
Petr Jancar},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Equivalence of deterministic one-counter automata is NL-complete},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {131--140},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488626},
doi = {10.1145/2488608.2488626},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BohmGJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakerskiLPRS13,
author = {Zvika Brakerski and
Adeline Langlois and
Chris Peikert and
Oded Regev and
Damien Stehl{\'{e}}},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Classical hardness of learning with errors},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {575--584},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488680},
doi = {10.1145/2488608.2488680},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakerskiLPRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrandaoH13,
author = {Fernando G. S. L. Brand{\~{a}}o and
Aram W. Harrow},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Quantum de finetti theorems under local measurements with applications},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {861--870},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488718},
doi = {10.1145/2488608.2488718},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrandaoH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrandaoH13a,
author = {Fernando G. S. L. Brand{\~{a}}o and
Aram W. Harrow},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Product-state approximations to quantum ground states},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {871--880},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488719},
doi = {10.1145/2488608.2488719},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrandaoH13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanGPW13,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {From information to exact communication},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {151--160},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488628},
doi = {10.1145/2488608.2488628},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BravermanGPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanM13,
author = {Mark Braverman and
Ankur Moitra},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {An information complexity approach to extended formulations},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {161--170},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488629},
doi = {10.1145/2488608.2488629},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BravermanM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannL13,
author = {Karl Bringmann and
Kasper Green Larsen},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Succinct sampling from discrete distributions},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {775--782},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488707},
doi = {10.1145/2488608.2488707},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BringmannL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuchbinderNS13,
author = {Niv Buchbinder and
Joseph Naor and
Roy Schwartz},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Simplex partitioning via exponential clocks and the multiway cut problem},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {535--544},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488675},
doi = {10.1145/2488608.2488675},
timestamp = {Wed, 23 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BuchbinderNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BurgisserI13,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Explicit lower bounds via geometric complexity theory},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {141--150},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488627},
doi = {10.1145/2488608.2488627},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BurgisserI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CadekKMVW13,
author = {Martin Cadek and
Marek Krc{\'{a}}l and
Jir{\'{\i}} Matousek and
Luk{\'{a}}s Vokr{\'{\i}}nek and
Uli Wagner},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Extending continuous maps: polynomiality and undecidability},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {595--604},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488683},
doi = {10.1145/2488608.2488683},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CadekKMVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CaiGW13,
author = {Jin{-}Yi Cai and
Heng Guo and
Tyson Williams},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {A complete dichotomy rises from the capture of vanishing signatures:
extended abstract},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {635--644},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488687},
doi = {10.1145/2488608.2488687},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CaiGW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CaputoMSS13,
author = {Pietro Caputo and
Fabio Martinelli and
Alistair Sinclair and
Alexandre Stauffer},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Random lattice triangulations: structure and algorithms},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {615--624},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488685},
doi = {10.1145/2488608.2488685},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CaputoMSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabartyS13,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {A o(n) monotonicity tester for boolean functions over the hypercube},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {411--418},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488660},
doi = {10.1145/2488608.2488660},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChakrabartyS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabartyS13a,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Optimal bounds for monotonicity and lipschitz testing over hypercubes
and hypergrids},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {419--428},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488661},
doi = {10.1145/2488608.2488661},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChakrabartyS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chan13,
author = {Siu On Chan},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Approximation resistance from pairwise independent subgroups},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {447--456},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488665},
doi = {10.1145/2488608.2488665},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Chan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChawlaHMS13,
author = {Shuchi Chawla and
Jason D. Hartline and
David L. Malec and
Balasubramanian Sivan},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Prior-independent mechanisms for scheduling},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {51--60},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488616},
doi = {10.1145/2488608.2488616},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChawlaHMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriC13,
author = {Chandra Chekuri and
Julia Chuzhoy},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Large-treewidth graph decompositions and applications},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {291--300},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488645},
doi = {10.1145/2488608.2488645},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenPY13,
author = {Xi Chen and
Dimitris Paparas and
Mihalis Yannakakis},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {The complexity of non-monotone markets},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {181--190},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488632},
doi = {10.1145/2488608.2488632},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenPY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenST13,
author = {Xi Chen and
Xiaorui Sun and
Shang{-}Hua Teng},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Multi-stage design for quasipolynomial-time isomorphism testing of
steiner 2-systems},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {271--280},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488643},
doi = {10.1145/2488608.2488643},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CheungCD13,
author = {Yun Kuen Cheung and
Richard Cole and
Nikhil R. Devanur},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Tatonnement beyond gross substitutes?: gradient descent to the rescue},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {191--200},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488633},
doi = {10.1145/2488608.2488633},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CheungCD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChonevOW13,
author = {Ventsislav Chonev and
Jo{\"{e}}l Ouaknine and
James Worrell},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {The orbit problem in higher dimensions},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {941--950},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488728},
doi = {10.1145/2488608.2488728},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChonevOW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChungPS13,
author = {Kai{-}Min Chung and
Rafael Pass and
Karn Seth},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Non-black-box simulation from one-way functions and applications to
resettable security},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {231--240},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488638},
doi = {10.1145/2488608.2488638},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChungPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ClarksonW13,
author = {Kenneth L. Clarkson and
David P. Woodruff},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Low rank approximation and regression in input sparsity time},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {81--90},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488620},
doi = {10.1145/2488608.2488620},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ClarksonW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Coja-OghlanP13,
author = {Amin Coja{-}Oghlan and
Konstantinos Panagiotou},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Going after the k-SAT threshold},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {705--714},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488698},
doi = {10.1145/2488608.2488698},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Coja-OghlanP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CyganKN13,
author = {Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Fast hamiltonicity checking via bases of perfect matchings},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {301--310},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488646},
doi = {10.1145/2488608.2488646},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CyganKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DeMN13,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Majority is stablest: discrete and SoS},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {477--486},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488668},
doi = {10.1145/2488608.2488668},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DeMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EisenstatK13,
author = {David Eisenstat and
Philip N. Klein},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Linear-time algorithms for max flow and multiple-source shortest paths
in unit-weight planar graphs},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {735--744},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488702},
doi = {10.1145/2488608.2488702},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EisenstatK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ElkinS13,
author = {Michael Elkin and
Shay Solomon},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Optimal euclidean spanners: really short, thin and lanky},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {645--654},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488691},
doi = {10.1145/2488608.2488691},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ElkinS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmanFGL13,
author = {Michal Feldman and
Hu Fu and
Nick Gravin and
Brendan Lucier},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Simultaneous auctions are (almost) efficient},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {201--210},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488634},
doi = {10.1145/2488608.2488634},
timestamp = {Mon, 30 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FeldmanFGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmanGL13,
author = {Michal Feldman and
Nick Gravin and
Brendan Lucier},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Combinatorial walrasian equilibrium},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {61--70},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488617},
doi = {10.1145/2488608.2488617},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeldmanGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmanGRVX13,
author = {Vitaly Feldman and
Elena Grigorescu and
Lev Reyzin and
Santosh S. Vempala and
Ying Xiao},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Statistical algorithms and a lower bound for detecting planted cliques},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {655--664},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488692},
doi = {10.1145/2488608.2488692},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeldmanGRVX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GargGSW13,
author = {Sanjam Garg and
Craig Gentry and
Amit Sahai and
Brent Waters},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Witness encryption and its applications},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {467--476},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488667},
doi = {10.1145/2488608.2488667},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GargGSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldwasserKPVZ13,
author = {Shafi Goldwasser and
Yael Tauman Kalai and
Raluca A. Popa and
Vinod Vaikuntanathan and
Nickolai Zeldovich},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Reusable garbled circuits and succinct functional encryption},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {555--564},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488678},
doi = {10.1145/2488608.2488678},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoldwasserKPVZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GorbunovVW13,
author = {Sergey Gorbunov and
Vinod Vaikuntanathan and
Hoeteck Wee},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Attribute-based encryption for circuits},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {545--554},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488677},
doi = {10.1145/2488608.2488677},
timestamp = {Mon, 29 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GorbunovVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Goyal13,
author = {Vipul Goyal},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Non-black-box simulation in the fully concurrent setting},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {221--230},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488637},
doi = {10.1145/2488608.2488637},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Goyal13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuGK13,
author = {Albert Gu and
Anupam Gupta and
Amit Kumar},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {The power of deferral: maintaining a constant-competitive steiner
tree online},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {525--534},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488674},
doi = {10.1145/2488608.2488674},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaTW13,
author = {Anupam Gupta and
Kunal Talwar and
David Witmer},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Sparsest cut on bounded treewidth graphs: algorithms and hardness
results},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {281--290},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488644},
doi = {10.1145/2488608.2488644},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuptaTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiX13,
author = {Venkatesan Guruswami and
Chaoping Xing},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes
up to the singleton bound},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {843--852},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488715},
doi = {10.1145/2488608.2488715},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Har-PeledR13,
author = {Sariel Har{-}Peled and
Benjamin Adam Raichel},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Net and prune: a linear time algorithm for euclidean distance problems},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {605--614},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488684},
doi = {10.1145/2488608.2488684},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Har-PeledR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HardtR13,
author = {Moritz Hardt and
Aaron Roth},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Beyond worst-case analysis in private singular vector computation},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {331--340},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488650},
doi = {10.1145/2488608.2488650},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HardtR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HardtW13,
author = {Moritz Hardt and
David P. Woodruff},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {How robust are linear sketches to adaptive inputs?},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {121--130},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488624},
doi = {10.1145/2488608.2488624},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HardtW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HarrisS13,
author = {David G. Harris and
Aravind Srinivasan},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Constraint satisfaction, packet routing, and the lovasz local lemma},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {685--694},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488696},
doi = {10.1145/2488608.2488696},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HarrisS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HsuRU13,
author = {Justin Hsu and
Aaron Roth and
Jonathan R. Ullman},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Differential privacy for the analyst via private equilibrium computation},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {341--350},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488651},
doi = {10.1145/2488608.2488651},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HsuRU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Huang13,
author = {Sangxia Huang},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Approximation resistance on satisfiable instances for predicates with
few accepting inputs},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {457--466},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488666},
doi = {10.1145/2488608.2488666},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Huang13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JainNS13,
author = {Prateek Jain and
Praneeth Netrapalli and
Sujay Sanghavi},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Low-rank matrix completion using alternating minimization},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {665--674},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488693},
doi = {10.1145/2488608.2488693},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JainNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KalaiRR13,
author = {Yael Tauman Kalai and
Ran Raz and
Ron D. Rothblum},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Delegation for bounded space},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {565--574},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488679},
doi = {10.1145/2488608.2488679},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KalaiRR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KaneM13,
author = {Daniel M. Kane and
Raghu Meka},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {A {PRG} for lipschitz functions of polynomials with applications to
sparsest cut},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {1--10},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488610},
doi = {10.1145/2488608.2488610},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KaneM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KawarabayashiY13,
author = {Ken{-}ichi Kawarabayashi and
Yuichi Yoshida},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Testing subdivision-freeness: property testing meets structural graph
theory},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {437--446},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488663},
doi = {10.1145/2488608.2488663},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KawarabayashiY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KeevashKM13,
author = {Peter Keevash and
Fiachra Knox and
Richard Mycroft},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Polynomial-time perfect matchings in dense hypergraphs},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {311--320},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488647},
doi = {10.1145/2488608.2488647},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KeevashKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KelnerOSZ13,
author = {Jonathan A. Kelner and
Lorenzo Orecchia and
Aaron Sidford and
Zeyuan Allen Zhu},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {A simple, combinatorial algorithm for solving {SDD} systems in nearly-linear
time},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {911--920},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488724},
doi = {10.1145/2488608.2488724},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KelnerOSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KingS13,
author = {Valerie King and
Jared Saia},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Byzantine agreement in polynomial expected time: [extended abstract]},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {401--410},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488658},
doi = {10.1145/2488608.2488658},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KingS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KleinMS13,
author = {Philip N. Klein and
Shay Mozes and
Christian Sommer},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Structured recursive separator decompositions for planar graphs in
linear time},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {505--514},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488672},
doi = {10.1145/2488608.2488672},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KleinMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KolR13,
author = {Gillat Kol and
Ran Raz},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Interactive channel capacity},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {715--724},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488699},
doi = {10.1145/2488608.2488699},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KolR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KomargodskiR13,
author = {Ilan Komargodski and
Ran Raz},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Average-case lower bounds for formula size},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {171--180},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488630},
doi = {10.1145/2488608.2488630},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KomargodskiR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KwokLLGT13,
author = {Tsz Chiu Kwok and
Lap Chi Lau and
Yin Tat Lee and
Shayan Oveis Gharan and
Luca Trevisan},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Improved Cheeger's inequality: analysis of spectral partitioning algorithms
through higher order spectral gap},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {11--20},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488611},
doi = {10.1145/2488608.2488611},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KwokLLGT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeMM13,
author = {James R. Lee and
Manor Mendel and
Mohammad Moharrami},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {A node-capacitated okamura-seymour theorem},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {495--504},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488671},
doi = {10.1145/2488608.2488671},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LeeMM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeRS13,
author = {Yin Tat Lee and
Satish Rao and
Nikhil Srivastava},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {A new approach to computing maximum flows using electrical flows},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {755--764},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488704},
doi = {10.1145/2488608.2488704},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LeeRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LenzenP13,
author = {Christoph Lenzen and
Boaz Patt{-}Shamir},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Fast routing table construction using small messages: extended abstract},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {381--390},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488656},
doi = {10.1145/2488608.2488656},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LenzenP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Li13,
author = {Xin Li},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {New independent source extractors with exponential improvement},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {783--792},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488708},
doi = {10.1145/2488608.2488708},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Li13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiS13,
author = {Shi Li and
Ola Svensson},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Approximating k-median via pseudo-approximation},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {901--910},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488723},
doi = {10.1145/2488608.2488723},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiY13,
author = {Jian Li and
Wen Yuan},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Stochastic combinatorial optimization via poisson approximation},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {971--980},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488731},
doi = {10.1145/2488608.2488731},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MendesH13,
author = {Hammurabi Mendes and
Maurice Herlihy},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Multidimensional approximate agreement in Byzantine asynchronous systems},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {391--400},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488657},
doi = {10.1145/2488608.2488657},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MendesH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MengM13,
author = {Xiangrui Meng and
Michael W. Mahoney},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Low-distortion subspace embeddings in input-sparsity time and applications
to robust linear regression},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {91--100},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488621},
doi = {10.1145/2488608.2488621},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MengM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MilesV13,
author = {Eric Miles and
Emanuele Viola},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Shielding circuits with groups},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {251--260},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488640},
doi = {10.1145/2488608.2488640},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MilesV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Miller13,
author = {Gary L. Miller},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Solving large optimization problems using spectral graph theory},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {981},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488689},
doi = {10.1145/2488608.2488689},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Miller13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NaorRV13,
author = {Assaf Naor and
Oded Regev and
Thomas Vidick},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Efficient rounding for the noncommutative grothendieck inequality},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {71--80},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488618},
doi = {10.1145/2488608.2488618},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NaorRV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NeimanS13,
author = {Ofer Neiman and
Shay Solomon},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Simple deterministic algorithms for fully dynamic maximal matching},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {745--754},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488703},
doi = {10.1145/2488608.2488703},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NeimanS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NelsonN13,
author = {Jelani Nelson and
Huy L. Nguyen},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Sparsity lower bounds for dimensionality reducing maps},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {101--110},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488622},
doi = {10.1145/2488608.2488622},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NelsonN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NikolovTZ13,
author = {Aleksandar Nikolov and
Kunal Talwar and
Li Zhang},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {The geometry of differential privacy: the sparse and approximate cases},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {351--360},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488652},
doi = {10.1145/2488608.2488652},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NikolovTZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Orlin13,
author = {James B. Orlin},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Max flows in O(nm) time, or better},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {765--774},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488705},
doi = {10.1145/2488608.2488705},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Orlin13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RodittyW13,
author = {Liam Roditty and
Virginia Vassilevska Williams},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Fast approximation algorithms for the diameter and radius of sparse
graphs},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {515--524},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488673},
doi = {10.1145/2488608.2488673},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RodittyW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RothblumVW13,
author = {Guy N. Rothblum and
Salil P. Vadhan and
Avi Wigderson},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Interactive proofs of proximity: delegating computation in sublinear
time},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {793--802},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488709},
doi = {10.1145/2488608.2488709},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RothblumVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Sherstov13,
author = {Alexander A. Sherstov},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Communication lower bounds using directional derivatives},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {921--930},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488725},
doi = {10.1145/2488608.2488725},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Sherstov13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SinclairS13,
author = {Alistair Sinclair and
Piyush Srivastava},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Lee-Yang theorems and the complexity of computing averages},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {625--634},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488686},
doi = {10.1145/2488608.2488686},
timestamp = {Thu, 21 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SinclairS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SyrgkanisT13,
author = {Vasilis Syrgkanis and
{\'{E}}va Tardos},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Composable and efficient mechanisms},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {211--220},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488635},
doi = {10.1145/2488608.2488635},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SyrgkanisT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-Shma13,
author = {Amnon Ta{-}Shma},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Inverting well conditioned matrices in quantum logspace},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {881--890},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488720},
doi = {10.1145/2488608.2488720},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-Shma13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ThapperZ13,
author = {Johan Thapper and
Stanislav Zivn{\'{y}}},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {The complexity of finite-valued CSPs},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {695--704},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488697},
doi = {10.1145/2488608.2488697},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ThapperZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Thorup13,
author = {Mikkel Thorup},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Bottom-k and priority sampling, set similarity and subset sums with
minimal independence},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {371--380},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488655},
doi = {10.1145/2488608.2488655},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Thorup13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ullman13,
author = {Jonathan R. Ullman},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Answering n\({}_{\mbox{\{2+o(1)\}}}\) counting queries with differential
privacy is hard},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {361--370},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488653},
doi = {10.1145/2488608.2488653},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ullman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Williams13,
author = {Ryan Williams},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Natural proofs versus derandomization},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {21--30},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488612},
doi = {10.1145/2488608.2488612},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Williams13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Wootters13,
author = {Mary Wootters},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {On the list decodability of random linear codes with large error rates},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {853--860},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488716},
doi = {10.1145/2488608.2488716},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Wootters13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2013,
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
publisher = {{ACM}},
year = {2013},
url = {http://dl.acm.org/citation.cfm?id=2488608},
isbn = {978-1-4503-2029-0},
timestamp = {Sun, 26 May 2013 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-04-25 09:59 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
