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/focs/focs2011.bht:"
download as .bib file
@inproceedings{DBLP:conf/focs/AharonovALV11,
author = {Dorit Aharonov and
Itai Arad and
Zeph Landau and
Umesh V. Vazirani},
editor = {Rafail Ostrovsky},
title = {The 1D Area Law and the Complexity of Quantum States: {A} Combinatorial
Approach},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {324--333},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.91},
doi = {10.1109/FOCS.2011.91},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AharonovALV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AharonovE11,
author = {Dorit Aharonov and
Lior Eldar},
editor = {Rafail Ostrovsky},
title = {On the Complexity of Commuting Local Hamiltonians, and Tight Conditions
for Topological Order in Such Systems},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {334--343},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.58},
doi = {10.1109/FOCS.2011.58},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AharonovE11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Alaei11,
author = {Saeed Alaei},
editor = {Rafail Ostrovsky},
title = {Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms
to Many Buyers},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {512--521},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.90},
doi = {10.1109/FOCS.2011.90},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Alaei11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlistarhAGG11,
author = {Dan Alistarh and
James Aspnes and
Seth Gilbert and
Rachid Guerraoui},
editor = {Rafail Ostrovsky},
title = {The Complexity of Renaming},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {718--727},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.66},
doi = {10.1109/FOCS.2011.66},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlistarhAGG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniCNN11,
author = {Alexandr Andoni and
Moses Charikar and
Ofer Neiman and
Huy L. Nguyen},
editor = {Rafail Ostrovsky},
title = {Near Linear Lower Bound for Dimension Reduction in {L1}},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {315--323},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.87},
doi = {10.1109/FOCS.2011.87},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AndoniCNN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniKO11,
author = {Alexandr Andoni and
Robert Krauthgamer and
Krzysztof Onak},
editor = {Rafail Ostrovsky},
title = {Streaming Algorithms via Precision Sampling},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {363--372},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.82},
doi = {10.1109/FOCS.2011.82},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AndoniKO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApplebaumIK11,
author = {Benny Applebaum and
Yuval Ishai and
Eyal Kushilevitz},
editor = {Rafail Ostrovsky},
title = {How to Garble Arithmetic Circuits},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {120--129},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.40},
doi = {10.1109/FOCS.2011.40},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ApplebaumIK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalBMN11,
author = {Nikhil Bansal and
Niv Buchbinder and
Aleksander Madry and
Joseph Naor},
editor = {Rafail Ostrovsky},
title = {A Polylogarithmic-Competitive Algorithm for the k-Server Problem},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {267--276},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.63},
doi = {10.1109/FOCS.2011.63},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BansalBMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalFKMNNS11,
author = {Nikhil Bansal and
Uriel Feige and
Robert Krauthgamer and
Konstantin Makarychev and
Viswanath Nagarajan and
Joseph Naor and
Roy Schwartz},
editor = {Rafail Ostrovsky},
title = {Min-max Graph Partitioning and Small Set Expansion},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {17--26},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.79},
doi = {10.1109/FOCS.2011.79},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BansalFKMNNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarakRS11,
author = {Boaz Barak and
Prasad Raghavendra and
David Steurer},
editor = {Rafail Ostrovsky},
title = {Rounding Semidefinite Programming Hierarchies via Global Correlation},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {472--481},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.95},
doi = {10.1109/FOCS.2011.95},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BarakRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BaswanaGS11,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
editor = {Rafail Ostrovsky},
title = {Fully Dynamic Maximal Matching in {O} (log n) Update Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {383--392},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.89},
doi = {10.1109/FOCS.2011.89},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BaswanaGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenderG11,
author = {Michael A. Bender and
Seth Gilbert},
editor = {Rafail Ostrovsky},
title = {Mutual Exclusion with O(log2 Log n) Amortized Work},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {728--737},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.84},
doi = {10.1109/FOCS.2011.84},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BenderG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhattacharyyaDSS11,
author = {Arnab Bhattacharyya and
Zeev Dvir and
Amir Shpilka and
Shubhangi Saraf},
editor = {Rafail Ostrovsky},
title = {Tight Lower Bounds for 2-query LCCs over Finite Fields},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {638--647},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.28},
doi = {10.1109/FOCS.2011.28},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BhattacharyyaDSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BindelKO11,
author = {David Bindel and
Jon M. Kleinberg and
Sigal Oren},
editor = {Rafail Ostrovsky},
title = {How Bad is Forming Your Own Opinion?},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {57--66},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.43},
doi = {10.1109/FOCS.2011.43},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BindelKO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlasiakKL11,
author = {Anna Blasiak and
Robert Kleinberg and
Eyal Lubetzky},
editor = {Rafail Ostrovsky},
title = {Lexicographic Products and the Power of Non-linear Network Coding},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {609--618},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.39},
doi = {10.1109/FOCS.2011.39},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlasiakKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlumGMS11,
author = {Avrim Blum and
Anupam Gupta and
Yishay Mansour and
Ankit Sharma},
editor = {Rafail Ostrovsky},
title = {Welfare and Profit Maximization with Production Costs},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {77--86},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.68},
doi = {10.1109/FOCS.2011.68},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlumGMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlumeEKKT11,
author = {Lawrence E. Blume and
David A. Easley and
Jon M. Kleinberg and
Robert Kleinberg and
{\'{E}}va Tardos},
editor = {Rafail Ostrovsky},
title = {Which Networks are Least Susceptible to Cascading Failures?},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {393--402},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.38},
doi = {10.1109/FOCS.2011.38},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlumeEKKT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BogdanovPW11,
author = {Andrej Bogdanov and
Periklis A. Papakonstantinou and
Andrew Wan},
editor = {Rafail Ostrovsky},
title = {Pseudorandomness for Read-Once Formulas},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {240--246},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.57},
doi = {10.1109/FOCS.2011.57},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BogdanovPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BonsmaSW11,
author = {Paul S. Bonsma and
Jens Schulz and
Andreas Wiese},
editor = {Rafail Ostrovsky},
title = {A Constant Factor Approximation Algorithm for Unsplittable Flow on
Paths},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {47--56},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.10},
doi = {10.1109/FOCS.2011.10},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BonsmaSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BorradaileKMNW11,
author = {Glencora Borradaile and
Philip N. Klein and
Shay Mozes and
Yahav Nussbaum and
Christian Wulff{-}Nilsen},
editor = {Rafail Ostrovsky},
title = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
in Near-Linear Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {170--179},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.73},
doi = {10.1109/FOCS.2011.73},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BorradaileKMNW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BoutsidisDM11,
author = {Christos Boutsidis and
Petros Drineas and
Malik Magdon{-}Ismail},
editor = {Rafail Ostrovsky},
title = {Near Optimal Column-Based Matrix Reconstruction},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {305--314},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.21},
doi = {10.1109/FOCS.2011.21},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BoutsidisDM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrakerskiV11,
author = {Zvika Brakerski and
Vinod Vaikuntanathan},
editor = {Rafail Ostrovsky},
title = {Efficient Fully Homomorphic Encryption from (Standard) {LWE}},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {97--106},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.12},
doi = {10.1109/FOCS.2011.12},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrakerskiV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanMMN11,
author = {Mark Braverman and
Konstantin Makarychev and
Yury Makarychev and
Assaf Naor},
editor = {Rafail Ostrovsky},
title = {The Grothendieck Constant is Strictly Smaller than Krivine's Bound},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {453--462},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.77},
doi = {10.1109/FOCS.2011.77},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanMMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanR11,
author = {Mark Braverman and
Anup Rao},
editor = {Rafail Ostrovsky},
title = {Information Equals Amortized Communication},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {748--757},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.86},
doi = {10.1109/FOCS.2011.86},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CaiD11,
author = {Yang Cai and
Constantinos Daskalakis},
editor = {Rafail Ostrovsky},
title = {Extreme-Value Theorems for Optimal Multidimensional Pricing},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {522--531},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.76},
doi = {10.1109/FOCS.2011.76},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CaiD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CaputoMT11,
author = {Pietro Caputo and
Fabio Martinelli and
Fabio Lucio Toninelli},
editor = {Rafail Ostrovsky},
title = {Sharp Mixing Time Bounds for Sampling Random Surfaces},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {130--139},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.47},
doi = {10.1109/FOCS.2011.47},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CaputoMT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CaragiannisFGS11,
author = {Ioannis Caragiannis and
Angelo Fanelli and
Nick Gravin and
Alexander Skopalik},
editor = {Rafail Ostrovsky},
title = {Efficient Computation of Approximate Pure Nash Equilibria in Congestion
Games},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {532--541},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.50},
doi = {10.1109/FOCS.2011.50},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CaragiannisFGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CelisRSW11,
author = {L. Elisa Celis and
Omer Reingold and
Gil Segev and
Udi Wieder},
editor = {Rafail Ostrovsky},
title = {Balls and Bins: Smaller Hash Families and Faster Evaluation},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {599--608},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.49},
doi = {10.1109/FOCS.2011.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CelisRSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChaillouxK11,
author = {Andr{\'{e}} Chailloux and
Iordanis Kerenidis},
editor = {Rafail Ostrovsky},
title = {Optimal Bounds for Quantum Bit Commitment},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {354--362},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.42},
doi = {10.1109/FOCS.2011.42},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChaillouxK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriE11,
author = {Chandra Chekuri and
Alina Ene},
editor = {Rafail Ostrovsky},
title = {Approximation Algorithms for Submodular Multiway Partition},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {807--816},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.34},
doi = {10.1109/FOCS.2011.34},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriE11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenM11,
author = {Jing Chen and
Silvio Micali},
editor = {Rafail Ostrovsky},
title = {Mechanism Design with Set-Theoretic Beliefs},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {87--96},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.11},
doi = {10.1109/FOCS.2011.11},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CheungLL11,
author = {Ho Yee Cheung and
Lap Chi Lau and
Kai Man Leung},
editor = {Rafail Ostrovsky},
title = {Graph Connectivities, Network Coding, and Expander Graphs},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {190--199},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.55},
doi = {10.1109/FOCS.2011.55},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CheungLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChierichettiKR11,
author = {Flavio Chierichetti and
Ravi Kumar and
Prabhakar Raghavan},
editor = {Rafail Ostrovsky},
title = {Markov Layout},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {492--501},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.71},
doi = {10.1109/FOCS.2011.71},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChierichettiKR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChungP11,
author = {Kai{-}Min Chung and
Rafael Pass},
editor = {Rafail Ostrovsky},
title = {The Randomness Complexity of Parallel Repetition},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {658--667},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.93},
doi = {10.1109/FOCS.2011.93},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChungP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CyganNPPRW11,
author = {Marek Cygan and
Jesper Nederlof and
Marcin Pilipczuk and
Michal Pilipczuk and
Johan M. M. van Rooij and
Jakub Onufry Wojtaszczyk},
editor = {Rafail Ostrovsky},
title = {Solving Connectivity Problems Parameterized by Treewidth in Single
Exponential Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {150--159},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.23},
doi = {10.1109/FOCS.2011.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CyganNPPRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CzumajMOS11,
author = {Artur Czumaj and
Morteza Monemizadeh and
Krzysztof Onak and
Christian Sohler},
editor = {Rafail Ostrovsky},
title = {Planar Graphs: Random Walks and Bipartiteness Testing},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {423--432},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.69},
doi = {10.1109/FOCS.2011.69},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CzumajMOS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DadushPV11,
author = {Daniel Dadush and
Chris Peikert and
Santosh S. Vempala},
editor = {Rafail Ostrovsky},
title = {Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {580--589},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.31},
doi = {10.1109/FOCS.2011.31},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DadushPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DodisLWW11,
author = {Yevgeniy Dodis and
Allison B. Lewko and
Brent Waters and
Daniel Wichs},
editor = {Rafail Ostrovsky},
title = {Storing Secrets on Continually Leaky Devices},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {688--697},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.35},
doi = {10.1109/FOCS.2011.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DodisLWW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DodisLWZ11,
author = {Yevgeniy Dodis and
Xin Li and
Trevor D. Wooley and
David Zuckerman},
editor = {Rafail Ostrovsky},
title = {Privacy Amplification and Non-malleable Extractors via Character Sums},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {668--677},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.67},
doi = {10.1109/FOCS.2011.67},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DodisLWZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DughmiV11,
author = {Shaddin Dughmi and
Jan Vondr{\'{a}}k},
editor = {Rafail Ostrovsky},
title = {Limitations of Randomized Mechanisms for Combinatorial Auctions},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {502--511},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.64},
doi = {10.1109/FOCS.2011.64},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DughmiV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Dwork11,
author = {Cynthia Dwork},
editor = {Rafail Ostrovsky},
title = {The Promise of Differential Privacy: {A} Tutorial on Algorithmic Techniques},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {1--2},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.88},
doi = {10.1109/FOCS.2011.88},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Dwork11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ElkinS11,
author = {Michael Elkin and
Shay Solomon},
editor = {Rafail Ostrovsky},
title = {Steiner Shallow-Light Trees are Exponentially Lighter than Spanning
Ones},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {373--382},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.18},
doi = {10.1109/FOCS.2011.18},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ElkinS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FalikF11,
author = {Dvir Falik and
Ehud Friedgut},
editor = {Rafail Ostrovsky},
title = {An Algebraic Proof of a Robust Social Choice Impossibility Theorem},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {413--422},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.72},
doi = {10.1109/FOCS.2011.72},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FalikF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanNS11,
author = {Moran Feldman and
Joseph Naor and
Roy Schwartz},
editor = {Rafail Ostrovsky},
title = {A Unified Continuous Greedy Algorithm for Submodular Maximization},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {570--579},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.46},
doi = {10.1109/FOCS.2011.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FraigniaudKP11,
author = {Pierre Fraigniaud and
Amos Korman and
David Peleg},
editor = {Rafail Ostrovsky},
title = {Local Distributed Decision},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {708--717},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.17},
doi = {10.1109/FOCS.2011.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FraigniaudKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GellesMS11,
author = {Ran Gelles and
Ankur Moitra and
Amit Sahai},
editor = {Rafail Ostrovsky},
title = {Efficient and Explicit Coding for Interactive Communication},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {768--777},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.51},
doi = {10.1109/FOCS.2011.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GellesMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GentryH11,
author = {Craig Gentry and
Shai Halevi},
editor = {Rafail Ostrovsky},
title = {Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic
Circuits},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {107--109},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.94},
doi = {10.1109/FOCS.2011.94},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GentryH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GharanSS11,
author = {Shayan Oveis Gharan and
Amin Saberi and
Mohit Singh},
editor = {Rafail Ostrovsky},
title = {A Randomized Rounding Approach to the Traveling Salesman Problem},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {550--559},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.80},
doi = {10.1109/FOCS.2011.80},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GharanSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldbergPS11,
author = {Paul W. Goldberg and
Christos H. Papadimitriou and
Rahul Savani},
editor = {Rafail Ostrovsky},
title = {The Complexity of the Homotopy Method, Equilibrium Selection, and
Lemke-Howson Solutions},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {67--76},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.26},
doi = {10.1109/FOCS.2011.26},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GoldbergPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GopalanKMSVV11,
author = {Parikshit Gopalan and
Adam R. Klivans and
Raghu Meka and
Daniel Stefankovic and
Santosh S. Vempala and
Eric Vigoda},
editor = {Rafail Ostrovsky},
title = {An {FPTAS} for {\#}Knapsack and Related Counting Problems},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {817--826},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.32},
doi = {10.1109/FOCS.2011.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GopalanKMSVV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoyalM11,
author = {Vipul Goyal and
Hemanta K. Maji},
editor = {Rafail Ostrovsky},
title = {Stateless Cryptographic Protocols},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {678--687},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.74},
doi = {10.1109/FOCS.2011.74},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoyalM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuptaKL11,
author = {Ankit Gupta and
Neeraj Kayal and
Satyanarayana V. Lokam},
editor = {Rafail Ostrovsky},
title = {Efficient Reconstruction of Random Multilinear Formulas},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {778--787},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.70},
doi = {10.1109/FOCS.2011.70},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuptaKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuptaKMR11,
author = {Anupam Gupta and
Ravishankar Krishnaswamy and
Marco Molinaro and
R. Ravi},
editor = {Rafail Ostrovsky},
title = {Approximation Algorithms for Correlated Knapsacks and Non-martingale
Bandits},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {827--836},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.48},
doi = {10.1109/FOCS.2011.48},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuptaKMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiS11,
author = {Venkatesan Guruswami and
Ali Kemal Sinop},
editor = {Rafail Ostrovsky},
title = {Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes
for Graph Partitioning and Quadratic Integer Programming with {PSD}
Objectives},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {482--491},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.36},
doi = {10.1109/FOCS.2011.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaitnerO11,
author = {Iftach Haitner and
Eran Omri},
editor = {Rafail Ostrovsky},
title = {Coin Flipping with Constant Bias Implies One-Way Functions},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {110--119},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.29},
doi = {10.1109/FOCS.2011.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HaitnerO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaramatySS11,
author = {Elad Haramaty and
Amir Shpilka and
Madhu Sudan},
editor = {Rafail Ostrovsky},
title = {Optimal Testing of Multivariate Polynomials over Small Prime Fields},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {629--637},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.61},
doi = {10.1109/FOCS.2011.61},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HaramatySS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hertli11,
author = {Timon Hertli},
editor = {Rafail Ostrovsky},
title = {3-SAT Faster and Simpler - Unique-SAT Bounds for {PPSZ} Hold in General},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {277--284},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.22},
doi = {10.1109/FOCS.2011.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hertli11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HuangKK11,
author = {Zhiyi Huang and
Sampath Kannan and
Sanjeev Khanna},
editor = {Rafail Ostrovsky},
title = {Algorithms for the Generalized Sorting Problem},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {738--747},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.54},
doi = {10.1109/FOCS.2011.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HuangKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IndykPW11,
author = {Piotr Indyk and
Eric Price and
David P. Woodruff},
editor = {Rafail Ostrovsky},
title = {On the Power of Adaptivity in Sparse Recovery},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {285--294},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.83},
doi = {10.1109/FOCS.2011.83},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/IndykPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JainY11,
author = {Rahul Jain and
Penghui Yao},
editor = {Rafail Ostrovsky},
title = {A Parallel Approximation Algorithm for Positive Semidefinite Programming},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {463--471},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.25},
doi = {10.1109/FOCS.2011.25},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JainY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JhaR11,
author = {Madhav Jha and
Sofya Raskhodnikova},
editor = {Rafail Ostrovsky},
title = {Testing and Reconstruction of Lipschitz Functions with Applications
to Data Privacy},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {433--442},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.13},
doi = {10.1109/FOCS.2011.13},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JhaR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kanade11,
author = {Varun Kanade},
editor = {Rafail Ostrovsky},
title = {Evolution with Recombination},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {837--846},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.24},
doi = {10.1109/FOCS.2011.24},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kanade11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kane11,
author = {Daniel M. Kane},
editor = {Rafail Ostrovsky},
title = {A Small {PRG} for Polynomial Threshold Functions of Gaussians},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {257--266},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.16},
doi = {10.1109/FOCS.2011.16},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kane11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KaufmanL11,
author = {Tali Kaufman and
Shachar Lovett},
editor = {Rafail Ostrovsky},
title = {New Extension of the Weil Bound for Character Sums with Applications
to Coding},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {788--796},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.41},
doi = {10.1109/FOCS.2011.41},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KaufmanL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KawarabayashiRW11,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed and
Paul Wollan},
editor = {Rafail Ostrovsky},
title = {The Graph Minor Algorithm with Parity Conditions},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {27--36},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.52},
doi = {10.1109/FOCS.2011.52},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KawarabayashiRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KawarabayashiT11,
author = {Ken{-}ichi Kawarabayashi and
Mikkel Thorup},
editor = {Rafail Ostrovsky},
title = {The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {160--169},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.53},
doi = {10.1109/FOCS.2011.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KawarabayashiT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhannaS11,
author = {Sanjeev Khanna and
Madhu Sudan},
editor = {Rafail Ostrovsky},
title = {Delays and the Capacity of Continuous-Time Channels},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {758--767},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.60},
doi = {10.1109/FOCS.2011.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KhannaS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhotS11,
author = {Subhash Khot and
Muli Safra},
editor = {Rafail Ostrovsky},
title = {A Two Prover One Round Game with Strong Soundness},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {648--657},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.62},
doi = {10.1109/FOCS.2011.62},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KhotS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KollaMM11,
author = {Alexandra Kolla and
Konstantin Makarychev and
Yury Makarychev},
editor = {Rafail Ostrovsky},
title = {How to Play Unique Games Against a Semi-random Adversary: Study of
Semi-random Models of Unique Games},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {443--452},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.78},
doi = {10.1109/FOCS.2011.78},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KollaMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KoutisMP11,
author = {Ioannis Koutis and
Gary L. Miller and
Richard Peng},
editor = {Rafail Ostrovsky},
title = {A Nearly-m log n Time Solver for {SDD} Linear Systems},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {590--598},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.85},
doi = {10.1109/FOCS.2011.85},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KoutisMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Larsen11,
author = {Kasper Green Larsen},
editor = {Rafail Ostrovsky},
title = {On Range Searching in the Group Model and Combinatorial Discrepancy},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {542--549},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.14},
doi = {10.1109/FOCS.2011.14},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Larsen11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeMRSS11,
author = {Troy Lee and
Rajat Mittal and
Ben W. Reichardt and
Robert Spalek and
Mario Szegedy},
editor = {Rafail Ostrovsky},
title = {Quantum Query Complexity of State Conversion},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {344--353},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.75},
doi = {10.1109/FOCS.2011.75},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeeMRSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiD11,
author = {Jian Li and
Amol Deshpande},
editor = {Rafail Ostrovsky},
title = {Maximizing Expected Utility for Stochastic Combinatorial Optimization
Problems},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {797--806},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.33},
doi = {10.1109/FOCS.2011.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MomkeS11,
author = {Tobias M{\"{o}}mke and
Ola Svensson},
editor = {Rafail Ostrovsky},
title = {Approximating Graphic {TSP} by Matchings},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {560--569},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.56},
doi = {10.1109/FOCS.2011.56},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MomkeS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NaorPS11,
author = {Joseph Naor and
Debmalya Panigrahi and
Mohit Singh},
editor = {Rafail Ostrovsky},
title = {Online Node-Weighted Steiner Tree and Related Problems},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {210--219},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.65},
doi = {10.1109/FOCS.2011.65},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NaorPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PriceW11,
author = {Eric Price and
David P. Woodruff},
editor = {Rafail Ostrovsky},
title = {{(1} + eps)-Approximate Sparse Recovery},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {295--304},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.92},
doi = {10.1109/FOCS.2011.92},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PriceW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Pruhs11,
author = {Kirk Pruhs},
editor = {Rafail Ostrovsky},
title = {Green Computing Algorithmics},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {3--4},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.44},
doi = {10.1109/FOCS.2011.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Pruhs11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RestrepoSTVY11,
author = {Ricardo Restrepo and
Jinwoo Shin and
Prasad Tetali and
Eric Vigoda and
Linji Yang},
editor = {Rafail Ostrovsky},
title = {Improved Mixing Condition on the Grid for Counting and Sampling Independent
Sets},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {140--149},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.45},
doi = {10.1109/FOCS.2011.45},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RestrepoSTVY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RodittyW11,
author = {Liam Roditty and
Virginia Vassilevska Williams},
editor = {Rafail Ostrovsky},
title = {Minimum Weight Cycles and Triangles: Equivalences and Algorithms},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {180--189},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.27},
doi = {10.1109/FOCS.2011.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RodittyW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Seguin-CharbonneauS11,
author = {Lo{\"{\i}}c Seguin{-}Charbonneau and
F. Bruce Shepherd},
editor = {Rafail Ostrovsky},
title = {Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {200--209},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.30},
doi = {10.1109/FOCS.2011.30},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Seguin-CharbonneauS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ShahST11,
author = {Devavrat Shah and
Jinwoo Shin and
Prasad Tetali},
editor = {Rafail Ostrovsky},
title = {Medium Access Using Queues},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {698--707},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.99},
doi = {10.1109/FOCS.2011.99},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ShahST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Shaltiel11,
author = {Ronen Shaltiel},
editor = {Rafail Ostrovsky},
title = {Dispersers for Affine Sources with Sub-polynomial Entropy},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {247--256},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.37},
doi = {10.1109/FOCS.2011.37},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Shaltiel11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/TulsianiW11,
author = {Madhur Tulsiani and
Julia Wolf},
editor = {Rafail Ostrovsky},
title = {Quadratic Goldreich-Levin Theorems},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {619--628},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.59},
doi = {10.1109/FOCS.2011.59},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/TulsianiW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Vaikuntanathan11,
author = {Vinod Vaikuntanathan},
editor = {Rafail Ostrovsky},
title = {Computing Blindfolded: New Developments in Fully Homomorphic Encryption},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {5--16},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.98},
doi = {10.1109/FOCS.2011.98},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Vaikuntanathan11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ValiantV11,
author = {Gregory Valiant and
Paul Valiant},
editor = {Rafail Ostrovsky},
title = {The Power of Linear Estimators},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {403--412},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.81},
doi = {10.1109/FOCS.2011.81},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ValiantV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Viola11,
author = {Emanuele Viola},
editor = {Rafail Ostrovsky},
title = {Extractors for Circuit Sources},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {220--229},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.20},
doi = {10.1109/FOCS.2011.20},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Viola11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Viola11a,
author = {Emanuele Viola},
editor = {Rafail Ostrovsky},
title = {Randomness Buys Depth for Approximate Counting},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {230--239},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.19},
doi = {10.1109/FOCS.2011.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Viola11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Wulff-Nilsen11,
author = {Christian Wulff{-}Nilsen},
editor = {Rafail Ostrovsky},
title = {Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with
Applications},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {37--46},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.15},
doi = {10.1109/FOCS.2011.15},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Wulff-Nilsen11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2011,
editor = {Rafail Ostrovsky},
title = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://ieeexplore.ieee.org/xpl/conhome/6108120/proceeding},
isbn = {978-1-4577-1843-4},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/2011.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-05-14 14:16 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:
