Search dblp for Publications

export results for "toc:db/conf/stoc/stoc2004.bht:"

 download as .bib file

@inproceedings{DBLP:conf/stoc/Aaronson04,
  author       = {Scott Aaronson},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Multilinear formulas and skepticism of quantum computing},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {118--127},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007378},
  doi          = {10.1145/1007352.1007378},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Aaronson04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Aaronson04a,
  author       = {Scott Aaronson},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Lower bounds for local search by quantum arguments},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {465--474},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007358},
  doi          = {10.1145/1007352.1007358},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Aaronson04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AchlioptasN04,
  author       = {Dimitris Achlioptas and
                  Assaf Naor},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {The two possible values of the chromatic number of a random graph},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {587--593},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007442},
  doi          = {10.1145/1007352.1007442},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AchlioptasN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AilonC04,
  author       = {Nir Ailon and
                  Bernard Chazelle},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Lower bounds for linear degeneracy testing},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {554--560},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007436},
  doi          = {10.1145/1007352.1007436},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AilonC04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ajtai04,
  author       = {Mikl{\'{o}}s Ajtai},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {A conjecture about polynomial time computable lattice-lattice functions},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {486--493},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007426},
  doi          = {10.1145/1007352.1007426},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Ajtai04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlbersS04,
  author       = {Susanne Albers and
                  Markus Schmidt},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {On the performance of greedy algorithms in packet buffering},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {35--44},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007366},
  doi          = {10.1145/1007352.1007366},
  timestamp    = {Mon, 11 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AlbersS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonN04,
  author       = {Noga Alon and
                  Assaf Naor},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Approximating the cut-norm via Grothendieck's inequality},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {72--80},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007371},
  doi          = {10.1145/1007352.1007371},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/AlonN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlurM04,
  author       = {Rajeev Alur and
                  P. Madhusudan},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Visibly pushdown languages},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {202--211},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007390},
  doi          = {10.1145/1007352.1007390},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AlurM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ambainis04,
  author       = {Andris Ambainis},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Quantum algorithms a decade after shor},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {111},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007354},
  doi          = {10.1145/1007352.1007354},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Ambainis04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraRV04,
  author       = {Sanjeev Arora and
                  Satish Rao and
                  Umesh V. Vazirani},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Expander flows, geometric embeddings and graph partitioning},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {222--231},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007355},
  doi          = {10.1145/1007352.1007355},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AroraRV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AwerbuchK04,
  author       = {Baruch Awerbuch and
                  Robert D. Kleinberg},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Adaptive routing with end-to-end feedback: distributed learning and
                  geometric approaches},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {45--53},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007367},
  doi          = {10.1145/1007352.1007367},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AwerbuchK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AzarR04,
  author       = {Yossi Azar and
                  Yossi Richter},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {The zero-one principle for switching networks},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {64--71},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007369},
  doi          = {10.1145/1007352.1007369},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AzarR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BansalBCM04,
  author       = {Nikhil Bansal and
                  Avrim Blum and
                  Shuchi Chawla and
                  Adam Meyerson},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Approximation algorithms for deadline-TSP and vehicle routing with
                  time-windows},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {166--174},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007385},
  doi          = {10.1145/1007352.1007385},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BansalBCM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bar-YossefJK04,
  author       = {Ziv Bar{-}Yossef and
                  T. S. Jayram and
                  Iordanis Kerenidis},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Exponential separation of quantum and classical one-way communication
                  complexity},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {128--137},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007379},
  doi          = {10.1145/1007352.1007379},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Bar-YossefJK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BatuKR04,
  author       = {Tugkan Batu and
                  Ravi Kumar and
                  Ronitt Rubinfeld},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Sublinear algorithms for testing monotone and unimodal distributions},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {381--390},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007414},
  doi          = {10.1145/1007352.1007414},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BatuKR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeierV04,
  author       = {Ren{\'{e}} Beier and
                  Berthold V{\"{o}}cking},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Typical properties of winners and losers in discrete optimization},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {343--352},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007409},
  doi          = {10.1145/1007352.1007409},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BeierV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-SassonGHSV04,
  author       = {Eli Ben{-}Sasson and
                  Oded Goldreich and
                  Prahladh Harsha and
                  Madhu Sudan and
                  Salil P. Vadhan},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Robust pcps of proximity, shorter pcps and applications to coding},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {1--10},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007361},
  doi          = {10.1145/1007352.1007361},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/Ben-SassonGHSV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BienstockI04,
  author       = {Daniel Bienstock and
                  Garud Iyengar},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Solving fractional packing problems in \emph{O}\({}^{\mbox{ast}}\)(1/?)
                  iterations},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {146--155},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007382},
  doi          = {10.1145/1007352.1007382},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BienstockI04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BoissonnatCV04,
  author       = {Jean{-}Daniel Boissonnat and
                  David Cohen{-}Steiner and
                  Gert Vegter},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Isotopic implicit surface meshing},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {301--309},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007401},
  doi          = {10.1145/1007352.1007401},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BoissonnatCV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BurgisserC04,
  author       = {Peter B{\"{u}}rgisser and
                  Felipe Cucker},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Counting complexity classes for numeric computations {II:} algebraic
                  and semialgebraic sets},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {475--485},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007425},
  doi          = {10.1145/1007352.1007425},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BurgisserC04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriGKK04,
  author       = {Chandra Chekuri and
                  Ashish Goel and
                  Sanjeev Khanna and
                  Amit Kumar},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Multi-processor scheduling to minimize flow time with epsilon resource
                  augmentation},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {363--372},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007411},
  doi          = {10.1145/1007352.1007411},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ChekuriGKK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKS04,
  author       = {Chandra Chekuri and
                  Sanjeev Khanna and
                  F. Bruce Shepherd},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {The all-or-nothing multicommodity flow problem},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {156--165},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007383},
  doi          = {10.1145/1007352.1007383},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ChekuriKS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenHKX04,
  author       = {Jianer Chen and
                  Xiuzhen Huang and
                  Iyad A. Kanj and
                  Ge Xia},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Linear {FPT} reductions and computational lower bounds},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {212--221},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007391},
  doi          = {10.1145/1007352.1007391},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ChenHKX04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenKLRSV04,
  author       = {Jiangzhuo Chen and
                  Robert D. Kleinberg and
                  L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
                  Rajmohan Rajaraman and
                  Ravi Sundaram and
                  Adrian Vetta},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {(Almost) tight bounds and existence theorems for confluent flows},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {529--538},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007432},
  doi          = {10.1145/1007352.1007432},
  timestamp    = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ChenKLRSV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChlebusKS04,
  author       = {Bogdan S. Chlebus and
                  Dariusz R. Kowalski and
                  Alexander A. Shvartsman},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Collective asynchronous reading with polylogarithmic worst-case overhead},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {321--330},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007406},
  doi          = {10.1145/1007352.1007406},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ChlebusKS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyGHKKN04,
  author       = {Julia Chuzhoy and
                  Sudipto Guha and
                  Eran Halperin and
                  Sanjeev Khanna and
                  Guy Kortsarz and
                  Joseph Naor},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Asymmetric k-center is log\({}^{\mbox{*}}\) \emph{n}-hard to approximate},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {21--27},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007363},
  doi          = {10.1145/1007352.1007363},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ChuzhoyGHKKN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyN04,
  author       = {Julia Chuzhoy and
                  Joseph Naor},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {New hardness results for congestion minimization and machine scheduling},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {28--34},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007364},
  doi          = {10.1145/1007352.1007364},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ChuzhoyN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColeGL04,
  author       = {Richard Cole and
                  Lee{-}Ad Gottlieb and
                  Moshe Lewenstein},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Dictionary matching and indexing with errors and don't cares},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {91--100},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007374},
  doi          = {10.1145/1007352.1007374},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ColeGL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CorreaG04,
  author       = {Jos{\'{e}} R. Correa and
                  Michel X. Goemans},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {An approximate K{\"{o}}nig's theorem for edge-coloring weighted
                  bipartite graphs},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {398--406},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007417},
  doi          = {10.1145/1007352.1007417},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/CorreaG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CzumajS04,
  author       = {Artur Czumaj and
                  Christian Sohler},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Estimating the weight of metric minimum spanning trees in sublinear-time},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {175--183},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007386},
  doi          = {10.1145/1007352.1007386},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/CzumajS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Devanur04,
  author       = {Nikhil R. Devanur},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {The spending constraint model for market equilibrium: algorithmic,
                  existence and uniqueness results},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {519--528},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007431},
  doi          = {10.1145/1007352.1007431},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Devanur04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DunaganV04,
  author       = {John Dunagan and
                  Santosh S. Vempala},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {A simple polynomial-time rescaling algorithm for solving linear programs},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {315--320},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007404},
  doi          = {10.1145/1007352.1007404},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/DunaganV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Elkin04,
  author       = {Michael Elkin},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Unconditional lower bounds on the time-approximation tradeoffs for
                  the distributed minimum spanning tree problem},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {331--340},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007407},
  doi          = {10.1145/1007352.1007407},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Elkin04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FabrikantPT04,
  author       = {Alex Fabrikant and
                  Christos H. Papadimitriou and
                  Kunal Talwar},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {The complexity of pure Nash equilibria},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {604--612},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007445},
  doi          = {10.1145/1007352.1007445},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/FabrikantPT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feige04,
  author       = {Uriel Feige},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {On sums of independent random variables with unbounded variance, and
                  estimating the average degree in a graph},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {594--603},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007443},
  doi          = {10.1145/1007352.1007443},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Feige04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FinocchiI04,
  author       = {Irene Finocchi and
                  Giuseppe F. Italiano},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Sorting and searching in the presence of memory faults (without redundancy)},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {101--110},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007375},
  doi          = {10.1145/1007352.1007375},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/FinocchiI04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Fischer04,
  author       = {Eldar Fischer},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {The difficulty of testing for isomorphism against a graph that is
                  given in advance},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {391--397},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007415},
  doi          = {10.1145/1007352.1007415},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Fischer04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gabow04,
  author       = {Harold N. Gabow},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Finding paths and cycles of superpolylogarithmic length},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {407--416},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007418},
  doi          = {10.1145/1007352.1007418},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Gabow04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GairingLMM04,
  author       = {Martin Gairing and
                  Thomas L{\"{u}}cking and
                  Marios Mavronicolas and
                  Burkhard Monien},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Computing Nash equilibria for scheduling on restricted parallel links},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {613--622},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007446},
  doi          = {10.1145/1007352.1007446},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/GairingLMM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GargK04,
  author       = {Rahul Garg and
                  Sanjiv Kapoor},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Auction algorithms for market equilibrium},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {511--518},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007430},
  doi          = {10.1145/1007352.1007430},
  timestamp    = {Tue, 10 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/GargK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoelRK04,
  author       = {Ashish Goel and
                  Sanatan Rai and
                  Bhaskar Krishnamachari},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Sharp thresholds For monotone properties in random geometric graphs},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {580--586},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007441},
  doi          = {10.1145/1007352.1007441},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/GoelRK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaPRS04,
  author       = {Anupam Gupta and
                  Martin P{\'{a}}l and
                  R. Ravi and
                  Amitabh Sinha},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Boosted sampling: approximation algorithms for stochastic optimization},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {417--426},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007419},
  doi          = {10.1145/1007352.1007419},
  timestamp    = {Wed, 18 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/GuptaPRS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Guruswami04,
  author       = {Venkatesan Guruswami},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Better extractors for better codes?},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {436--444},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007422},
  doi          = {10.1145/1007352.1007422},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Guruswami04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HalpernT04,
  author       = {Joseph Y. Halpern and
                  Vanessa Teague},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Rational secret sharing and multiparty computation: extended abstract},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {623--632},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007447},
  doi          = {10.1145/1007352.1007447},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HalpernT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Har-PeledM04,
  author       = {Sariel Har{-}Peled and
                  Soham Mazumdar},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {On coresets for k-means and k-median clustering},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {291--300},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007400},
  doi          = {10.1145/1007352.1007400},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/Har-PeledM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HarnikNRR04,
  author       = {Danny Harnik and
                  Moni Naor and
                  Omer Reingold and
                  Alon Rosen},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Completeness in two-party secure computation: a computational view},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {252--261},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007395},
  doi          = {10.1145/1007352.1007395},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HarnikNRR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HealyVV04,
  author       = {Alexander Healy and
                  Salil P. Vadhan and
                  Emanuele Viola},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Using nondeterminism to amplify hardness},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {192--201},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007389},
  doi          = {10.1145/1007352.1007389},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HealyVV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HolmerinK04,
  author       = {Jonas Holmerin and
                  Subhash Khot},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {A new {PCP} outer verifier with applications to homogeneous linear
                  equations and max-bisection},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {11--20},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007362},
  doi          = {10.1145/1007352.1007362},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HolmerinK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Indyk04,
  author       = {Piotr Indyk},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Algorithms for dynamic geometric problems over data streams},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {373--380},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007413},
  doi          = {10.1145/1007352.1007413},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Indyk04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/IshaiKOS04,
  author       = {Yuval Ishai and
                  Eyal Kushilevitz and
                  Rafail Ostrovsky and
                  Amit Sahai},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Batch codes and their applications},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {262--271},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007396},
  doi          = {10.1145/1007352.1007396},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/IshaiKOS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kelner04,
  author       = {Jonathan A. Kelner},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Spectral partitioning, eigenvalue bounds, and circle packings for
                  graphs of bounded genus},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {455--464},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007357},
  doi          = {10.1145/1007352.1007357},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Kelner04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KempeM04,
  author       = {David Kempe and
                  Frank McSherry},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {A decentralized algorithm for spectral analysis},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {561--568},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007438},
  doi          = {10.1145/1007352.1007438},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KempeM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KenyonRS04,
  author       = {Claire Kenyon and
                  Yuval Rabani and
                  Alistair Sinclair},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Low distortion maps between point sets},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {272--280},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007398},
  doi          = {10.1145/1007352.1007398},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KenyonRS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KleinbergS04,
  author       = {Jon M. Kleinberg and
                  Mark Sandler},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Using mixture models for collaborative filtering},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {569--578},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007439},
  doi          = {10.1145/1007352.1007439},
  timestamp    = {Tue, 12 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KleinbergS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KortsarzN04,
  author       = {Guy Kortsarz and
                  Zeev Nutov},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Approximation algorithm for k-node connected subgraphs via critical
                  graphs},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {138--145},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007381},
  doi          = {10.1145/1007352.1007381},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KortsarzN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeviRS04,
  author       = {Retsef Levi and
                  Robin Roundy and
                  David B. Shmoys},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Primal-dual algorithms for deterministic inventory problems},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {353--362},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007410},
  doi          = {10.1145/1007352.1007410},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/LeviRS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LovaszV04,
  author       = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
                  Santosh S. Vempala},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Hit-and-run from a corner},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {310--314},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007403},
  doi          = {10.1145/1007352.1007403},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/LovaszV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MankuNW04,
  author       = {Gurmeet Singh Manku and
                  Moni Naor and
                  Udi Wieder},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Know thy neighbor's neighbor: the power of lookahead in randomized
                  {P2P} networks},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {54--63},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007368},
  doi          = {10.1145/1007352.1007368},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/MankuNW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Obata04,
  author       = {Kenji Obata},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Approximate max-integral-flow/min-multicut theorems},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {539--545},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007433},
  doi          = {10.1145/1007352.1007433},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Obata04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Pass04,
  author       = {Rafael Pass},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Bounded-concurrent secure multi-party computation with a dishonest
                  majority},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {232--241},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007393},
  doi          = {10.1145/1007352.1007393},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/Pass04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatrascuD04,
  author       = {Mihai P{u{a}}tra{c{s}}cu and
                  Erik D. Demaine},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Lower bounds for dynamic connectivity},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {546--553},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007435},
  doi          = {10.1145/1007352.1007435},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/PatrascuD04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PrabhakaranS04,
  author       = {Manoj Prabhakaran and
                  Amit Sahai},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {New notions of security: achieving universal composability without
                  trusted setup},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {242--251},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007394},
  doi          = {10.1145/1007352.1007394},
  timestamp    = {Wed, 17 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/PrabhakaranS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Raz04,
  author       = {Ran Raz},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Multi-linear formulas for permanent and determinant are of super-polynomial
                  size},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {633--641},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007353},
  doi          = {10.1145/1007352.1007353},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/Raz04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Reichardt04,
  author       = {Ben Reichardt},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {The quantum adiabatic optimization algorithm and local minima},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {502--510},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007428},
  doi          = {10.1145/1007352.1007428},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Reichardt04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RodittyZ04,
  author       = {Liam Roditty and
                  Uri Zwick},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {A fully dynamic reachability algorithm for directed graphs with an
                  almost linear update time},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {184--191},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007387},
  doi          = {10.1145/1007352.1007387},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/RodittyZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RozenmanSW04,
  author       = {Eyal Rozenman and
                  Aner Shalev and
                  Avi Wigderson},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {A new family of Cayley expanders (?)},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {445--454},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007423},
  doi          = {10.1145/1007352.1007423},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/RozenmanSW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SanthaS04,
  author       = {Miklos Santha and
                  Mario Szegedy},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Quantum and classical query complexities of local search are polynomially
                  related},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {494--501},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007427},
  doi          = {10.1145/1007352.1007427},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/SanthaS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ShpilkaW04,
  author       = {Amir Shpilka and
                  Avi Wigderson},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Derandomizing homomorphism testing in general groups},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {427--435},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007421},
  doi          = {10.1145/1007352.1007421},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ShpilkaW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SpielmanT04,
  author       = {Daniel A. Spielman and
                  Shang{-}Hua Teng},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Nearly-linear time algorithms for graph partitioning, graph sparsification,
                  and solving linear systems},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {81--90},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007372},
  doi          = {10.1145/1007352.1007372},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/SpielmanT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Talwar04,
  author       = {Kunal Talwar},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Bypassing the embedding: algorithms for low dimensional metrics},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {281--290},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007399},
  doi          = {10.1145/1007352.1007399},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Talwar04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Tardos04,
  author       = {{\'{E}}va Tardos},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Network games},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {341--342},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007356},
  doi          = {10.1145/1007352.1007356},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Tardos04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Wigderson04,
  author       = {Avi Wigderson},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Depth through breadth, or why should we attend talks in other areas?},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {579},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007359},
  doi          = {10.1145/1007352.1007359},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Wigderson04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yao04,
  author       = {Andrew Chi{-}Chih Yao},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Graph entropy and quantum sorting problems},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {112--117},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007377},
  doi          = {10.1145/1007352.1007377},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Yao04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2004,
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  publisher    = {{ACM}},
  year         = {2004},
  isbn         = {1-58113-852-0},
  timestamp    = {Fri, 03 Sep 2004 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/2004.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics