Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/stoc/stoc2002.bht:"
download as .bib file
@inproceedings{DBLP:conf/stoc/Aaronson02,
author = {Scott Aaronson},
editor = {John H. Reif},
title = {Quantum lower bound for the collision problem},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {635--642},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509999},
doi = {10.1145/509907.509999},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Aaronson02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AchlioptasM02,
author = {Dimitris Achlioptas and
Cristopher Moore},
editor = {John H. Reif},
title = {Almost all graphs with average degree 4 are 3-colorable},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {199--208},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509940},
doi = {10.1145/509907.509940},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AchlioptasM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AdlemanCGHKER02,
author = {Leonard M. Adleman and
Qi Cheng and
Ashish Goel and
Ming{-}Deh A. Huang and
David Kempe and
Pablo Moisset de Espan{\'{e}}s and
Paul W. K. Rothemund},
editor = {John H. Reif},
title = {Combinatorial optimization problems in self-assembly},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {23--32},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509913},
doi = {10.1145/509907.509913},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AdlemanCGHKER02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Adler02,
author = {Micah Adler},
editor = {John H. Reif},
title = {Tradeoffs in probabilistic packet marking for {IP} traceback},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {407--418},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509969},
doi = {10.1145/509907.509969},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Adler02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgolHT02,
author = {Ian Agol and
Joel Hass and
William P. Thurston},
editor = {John H. Reif},
title = {3-manifold knot genus is NP-complet},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {761--766},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510016},
doi = {10.1145/509907.510016},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AgolHT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ajtai02,
author = {Mikl{\'{o}}s Ajtai},
editor = {John H. Reif},
title = {The invasiveness of off-line memory checking},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {504--513},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509981},
doi = {10.1145/509907.509981},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ajtai02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AjtaiJKS02,
author = {Mikl{\'{o}}s Ajtai and
T. S. Jayram and
Ravi Kumar and
D. Sivakumar},
editor = {John H. Reif},
title = {Approximate counting of inversions in a data stream},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {370--379},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509964},
doi = {10.1145/509907.509964},
timestamp = {Mon, 08 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AjtaiJKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Albers02,
author = {Susanne Albers},
editor = {John H. Reif},
title = {On randomized online scheduling},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {134--143},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509930},
doi = {10.1145/509907.509930},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Albers02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlbersFG02,
author = {Susanne Albers and
Lene M. Favrholdt and
Oliver Giel},
editor = {John H. Reif},
title = {On paging with locality of reference},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {258--267},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509949},
doi = {10.1145/509907.509949},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlbersFG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlekhnovichJPU02,
author = {Michael Alekhnovich and
Jan Johannsen and
Toniann Pitassi and
Alasdair Urquhart},
editor = {John H. Reif},
title = {An exponential separation between regular and general resolution},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {448--456},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509974},
doi = {10.1145/509907.509974},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlekhnovichJPU02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonVKK02,
author = {Noga Alon and
Wenceslas Fernandez de la Vega and
Ravi Kannan and
Marek Karpinski},
editor = {John H. Reif},
title = {Random sampling and approximation of {MAX-CSP} problems},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {232--239},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509945},
doi = {10.1145/509907.509945},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlonVKK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnshelevichKK02,
author = {Elliot Anshelevich and
David Kempe and
Jon M. Kleinberg},
editor = {John H. Reif},
title = {Stability of load balancing algorithms in dynamic adversarial systems},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {399--406},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509968},
doi = {10.1145/509907.509968},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AnshelevichKK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArgeBDHM02,
author = {Lars Arge and
Michael A. Bender and
Erik D. Demaine and
Bryan Holland{-}Minkley and
J. Ian Munro},
editor = {John H. Reif},
title = {Cache-oblivious priority queue and graph algorithm applications},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {268--276},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509950},
doi = {10.1145/509907.509950},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ArgeBDHM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraK02,
author = {Sanjeev Arora and
Subhash Khot},
editor = {John H. Reif},
title = {Fitting algebraic curves to noisy data},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {162--169},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509934},
doi = {10.1145/509907.509934},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AroraK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AryaMM02,
author = {Sunil Arya and
Theocharis Malamatos and
David M. Mount},
editor = {John H. Reif},
title = {Space-efficient approximate Voronoi diagrams},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {721--730},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510011},
doi = {10.1145/509907.510011},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AryaMM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AspnesSS02,
author = {James Aspnes and
Gauri Shah and
Jatin Shah},
editor = {John H. Reif},
title = {Wait-free consensus with infinite arrivals},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {524--533},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509983},
doi = {10.1145/509907.509983},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AspnesSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bachmat02,
author = {Eitan Bachmat},
editor = {John H. Reif},
title = {Average case analysis for batched disk scheduling and increasing subsequences},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {277--286},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509951},
doi = {10.1145/509907.509951},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bachmat02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BadoiuHI02,
author = {Mihai Badoiu and
Sariel Har{-}Peled and
Piotr Indyk},
editor = {John H. Reif},
title = {Approximate clustering via core-sets},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {250--257},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509947},
doi = {10.1145/509907.509947},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BadoiuHI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarakL02,
author = {Boaz Barak and
Yehuda Lindell},
editor = {John H. Reif},
title = {Strict polynomial-time in simulation and extraction},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {484--493},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509979},
doi = {10.1145/509907.509979},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BarakL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bas02,
author = {Saugata Basu},
editor = {John H. Reif},
title = {Computing the betti numbers of arrangements},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {712--720},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510010},
doi = {10.1145/509907.510010},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bas02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BaswanaHS02,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
editor = {John H. Reif},
title = {Improved decremental algorithms for maintaining transitive closure
and all-pairs shortest paths},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {117--123},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509928},
doi = {10.1145/509907.509928},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BaswanaHS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BatuDKR02,
author = {Tugkan Batu and
Sanjoy Dasgupta and
Ravi Kumar and
Ronitt Rubinfeld},
editor = {John H. Reif},
title = {The complexity of approximating entropy},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {678--687},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510005},
doi = {10.1145/509907.510005},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BatuDKR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameV02,
author = {Paul Beame and
Erik Vee},
editor = {John H. Reif},
title = {Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor
problems},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {688--697},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510006},
doi = {10.1145/509907.510006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeameV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-Sasson02,
author = {Eli Ben{-}Sasson},
editor = {John H. Reif},
title = {Size space tradeoffs for resolution},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {457--464},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509975},
doi = {10.1145/509907.509975},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ben-Sasson02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-Sasson02a,
author = {Eli Ben{-}Sasson},
editor = {John H. Reif},
title = {Hard examples for bounded depth frege},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {563--572},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509988},
doi = {10.1145/509907.509988},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ben-Sasson02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BertsimasV02,
author = {Dimitris Bertsimas and
Santosh S. Vempala},
editor = {John H. Reif},
title = {Solving convex programs by random walks},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {109--115},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509926},
doi = {10.1145/509907.509926},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BertsimasV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrodalLMTT02,
author = {Gerth St{\o}lting Brodal and
George Lagogiannis and
Christos Makris and
Athanasios K. Tsakalidis and
Kostas Tsichlas},
editor = {John H. Reif},
title = {Optimal finger search trees in the pointer machine},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {583--591},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509991},
doi = {10.1145/509907.509991},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BrodalLMTT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CanettiLOS02,
author = {Ran Canetti and
Yehuda Lindell and
Rafail Ostrovsky and
Amit Sahai},
editor = {John H. Reif},
title = {Universally composable two-party and multi-party secure computation},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {494--503},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509980},
doi = {10.1145/509907.509980},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CanettiLOS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CapalboRVW02,
author = {Michael R. Capalbo and
Omer Reingold and
Salil P. Vadhan and
Avi Wigderson},
editor = {John H. Reif},
title = {Randomness conductors and constant-degree lossless expanders},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {659--668},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510003},
doi = {10.1145/509907.510003},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CapalboRVW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chan02,
author = {Timothy M. Chan},
editor = {John H. Reif},
title = {Dynamic subgraph connectivity with geometric applications},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {7--13},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509911},
doi = {10.1145/509907.509911},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Chan02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChanLTW02,
author = {Wun{-}Tat Chan and
Tak Wah Lam and
Hing{-}Fung Ting and
Prudence W. H. Wong},
editor = {John H. Reif},
title = {A unified analysis of hot video schedulers},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {179--188},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509937},
doi = {10.1145/509907.509937},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChanLTW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Charikar02,
author = {Moses Charikar},
editor = {John H. Reif},
title = {Similarity estimation techniques from rounding algorithms},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {380--388},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509965},
doi = {10.1145/509907.509965},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Charikar02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarLLPPRSS02,
author = {Moses Charikar and
Eric Lehman and
Ding Liu and
Rina Panigrahy and
Manoj Prabhakaran and
April Rasala and
Amit Sahai and
Abhi Shelat},
editor = {John H. Reif},
title = {Approximating the smallest grammar: Kolmogorov complexity in natural
models},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {792--801},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510021},
doi = {10.1145/509907.510021},
timestamp = {Wed, 17 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarLLPPRSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriK02,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {John H. Reif},
title = {Approximation schemes for preemptive weighted flow time},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {297--305},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509954},
doi = {10.1145/509907.509954},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CheriyanVV02,
author = {Joseph Cheriyan and
Santosh S. Vempala and
Adrian Vetta},
editor = {John H. Reif},
title = {Approximation algorithms for minimum-cost k-vertex connected subgraphs},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {306--312},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509955},
doi = {10.1145/509907.509955},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CheriyanVV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChienRS02,
author = {Steve Chien and
Lars Eilstrup Rasmussen and
Alistair Sinclair},
editor = {John H. Reif},
title = {Clifford algebras and approximating the permanent},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {222--231},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509944},
doi = {10.1145/509907.509944},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChienRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColeH02,
author = {Richard Cole and
Ramesh Hariharan},
editor = {John H. Reif},
title = {Verifying candidate matches in sparse and wildcard matching},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {592--601},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509992},
doi = {10.1145/509907.509992},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ColeH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CooperF02,
author = {Colin Cooper and
Alan M. Frieze},
editor = {John H. Reif},
title = {Crawling on web graphs},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {419--427},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509970},
doi = {10.1145/509907.509970},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CooperF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CrepeauGS02,
author = {Claude Cr{\'{e}}peau and
Daniel Gottesman and
Adam D. Smith},
editor = {John H. Reif},
title = {Secure multi-party quantum computation},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {643--652},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510000},
doi = {10.1145/509907.510000},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CrepeauGS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CryanD02,
author = {Mary Cryan and
Martin E. Dyer},
editor = {John H. Reif},
title = {A polynomial-time algorithm to approximately count contingency tables
when the number of rows is constant},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {240--249},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509946},
doi = {10.1145/509907.509946},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CryanD02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CzumajKV02,
author = {Artur Czumaj and
Piotr Krysta and
Berthold V{\"{o}}cking},
editor = {John H. Reif},
title = {Selfish traffic allocation for server farms},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {287--296},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509952},
doi = {10.1145/509907.509952},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CzumajKV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DengPS02,
author = {Xiaotie Deng and
Christos H. Papadimitriou and
Shmuel Safra},
editor = {John H. Reif},
title = {On the complexity of equilibria},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {67--71},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509920},
doi = {10.1145/509907.509920},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DengPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DinurS02,
author = {Irit Dinur and
Shmuel Safra},
editor = {John H. Reif},
title = {The importance of being biased},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {33--42},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509915},
doi = {10.1145/509907.509915},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DinurS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DrineasKR02,
author = {Petros Drineas and
Iordanis Kerenidis and
Prabhakar Raghavan},
editor = {John H. Reif},
title = {Competitive recommendation systems},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {82--90},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509922},
doi = {10.1145/509907.509922},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DrineasKR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DworkS02,
author = {Cynthia Dwork and
Larry J. Stockmeyer},
editor = {John H. Reif},
title = {2-round zero knowledge and proof auditors},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {322--331},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509958},
doi = {10.1145/509907.509958},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DworkS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DziembowskiM02,
author = {Stefan Dziembowski and
Ueli M. Maurer},
editor = {John H. Reif},
title = {Tight security proofs for the bounded-storage model},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {341--350},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509960},
doi = {10.1145/509907.509960},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DziembowskiM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EiterGM02,
author = {Thomas Eiter and
Georg Gottlob and
Kazuhisa Makino},
editor = {John H. Reif},
title = {New results on monotone dualization and generating hypergraph transversals},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {14--22},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509912},
doi = {10.1145/509907.509912},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EiterGM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ElkinK02,
author = {Michael Elkin and
Guy Kortsarz},
editor = {John H. Reif},
title = {Combinatorial logarithmic approximation algorithm for directed telephone
broadcast problem},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {438--447},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509972},
doi = {10.1145/509907.509972},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ElkinK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feige02,
author = {Uriel Feige},
editor = {John H. Reif},
title = {Relations between average case complexity and approximation complexity},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {534--543},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509985},
doi = {10.1145/509907.509985},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Feige02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FiatGHK02,
author = {Amos Fiat and
Andrew V. Goldberg and
Jason D. Hartline and
Anna R. Karlin},
editor = {John H. Reif},
title = {Competitive generalized auctions},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {72--81},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509921},
doi = {10.1145/509907.509921},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FiatGHK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FischerLNRRS02,
author = {Eldar Fischer and
Eric Lehman and
Ilan Newman and
Sofya Raskhodnikova and
Ronitt Rubinfeld and
Alex Samorodnitsky},
editor = {John H. Reif},
title = {Monotonicity testing over general poset domains},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {474--483},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509977},
doi = {10.1145/509907.509977},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FischerLNRRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gacs02,
author = {P{\'{e}}ter G{\'{a}}cs},
editor = {John H. Reif},
title = {Clairvoyant scheduling of random walks},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {99--108},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509925},
doi = {10.1145/509907.509925},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Gacs02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GilbertGIKMS02,
author = {Anna C. Gilbert and
Sudipto Guha and
Piotr Indyk and
Yannis Kotidis and
S. Muthukrishnan and
Martin Strauss},
editor = {John H. Reif},
title = {Fast, small-space algorithms for approximate histogram maintenance},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {389--398},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509966},
doi = {10.1145/509907.509966},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GilbertGIKMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GilbertGIMS02,
author = {Anna C. Gilbert and
Sudipto Guha and
Piotr Indyk and
S. Muthukrishnan and
Martin Strauss},
editor = {John H. Reif},
title = {Near-optimal sparse fourier representations via sampling},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {152--161},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509933},
doi = {10.1145/509907.509933},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GilbertGIMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldbergKP02,
author = {Leslie Ann Goldberg and
Steven Kelk and
Mike Paterson},
editor = {John H. Reif},
title = {The complexity of choosing an H-colouring (nearly) uniformly at random},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {53--62},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509917},
doi = {10.1145/509907.509917},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoldbergKP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Goldreich02,
author = {Oded Goldreich},
editor = {John H. Reif},
title = {Concurrent zero-knowledge with timing, revisited},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {332--340},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509959},
doi = {10.1145/509907.509959},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Goldreich02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GolinKY02,
author = {Mordecai J. Golin and
Claire Kenyon and
Neal E. Young},
editor = {John H. Reif},
title = {Huffman coding with unequal letter costs},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {785--791},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510020},
doi = {10.1145/509907.510020},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GolinKY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Guruswami02,
author = {Venkatesan Guruswami},
editor = {John H. Reif},
title = {Limits to list decodability of linear codes},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {802--811},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510022},
doi = {10.1145/509907.510022},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Guruswami02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiI02,
author = {Venkatesan Guruswami and
Piotr Indyk},
editor = {John H. Reif},
title = {Near-optimal linear-time codes for unique decoding and new list-decodable
codes over smaller alphabets},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {812--821},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510023},
doi = {10.1145/509907.510023},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hallgren02,
author = {Sean Hallgren},
editor = {John H. Reif},
title = {Polynomial-time quantum algorithms for Pell's equation and the principal
ideal problem},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {653--658},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510001},
doi = {10.1145/509907.510001},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Hallgren02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Han02,
author = {Yijie Han},
editor = {John H. Reif},
title = {Deterministic sorting in O(nlog log n) time and linear space},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {602--608},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509993},
doi = {10.1145/509907.509993},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Han02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HastadV02,
author = {Johan H{\aa}stad and
Srinivasan Venkatesh},
editor = {John H. Reif},
title = {On the advantage over a random assignment},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {43--52},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509916},
doi = {10.1145/509907.509916},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HastadV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HellersteinR02,
author = {Lisa Hellerstein and
Vijay Raghavan},
editor = {John H. Reif},
title = {Exact learning of {DNF} formulas using {DNF} hypotheses},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {465--473},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509976},
doi = {10.1145/509907.509976},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HellersteinR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Holmerin02,
author = {Jonas Holmerin},
editor = {John H. Reif},
title = {Vertex cover on 4-regular hyper-graphs is hard to approximate within
2-epsilon},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {544--552},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509986},
doi = {10.1145/509907.509986},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Holmerin02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JacksonKS02,
author = {Jeffrey C. Jackson and
Adam R. Klivans and
Rocco A. Servedio},
editor = {John H. Reif},
title = {Learnability beyond {AC0}},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {776--784},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510018},
doi = {10.1145/509907.510018},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JacksonKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JainMS02,
author = {Kamal Jain and
Mohammad Mahdian and
Amin Saberi},
editor = {John H. Reif},
title = {A new greedy approach for facility location problems},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {731--740},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510012},
doi = {10.1145/509907.510012},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JainMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JainV02,
author = {Kamal Jain and
Vijay V. Vazirani},
editor = {John H. Reif},
title = {Equitable cost allocations via primal-dual-type algorithms},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {313--321},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509956},
doi = {10.1145/509907.509956},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JainV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KaplanST02,
author = {Haim Kaplan and
Nira Shafrir and
Robert Endre Tarjan},
editor = {John H. Reif},
title = {Meldable heaps and boolean union-find},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {573--582},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509990},
doi = {10.1145/509907.509990},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KaplanST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KargerL02,
author = {David R. Karger and
Matthew S. Levine},
editor = {John H. Reif},
title = {Random sampling in residual graphs},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {63--66},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509918},
doi = {10.1145/509907.509918},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KargerL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KargerR02,
author = {David R. Karger and
Matthias Ruhl},
editor = {John H. Reif},
title = {Finding nearest neighbors in growth-restricted metrics},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {741--750},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510013},
doi = {10.1145/509907.510013},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KargerR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Khot02,
author = {Subhash Khot},
editor = {John H. Reif},
title = {Hardness results for approximate hypergraph coloring},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {351--359},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509962},
doi = {10.1145/509907.509962},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Khot02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Khot02a,
author = {Subhash Khot},
editor = {John H. Reif},
title = {On the power of unique 2-prover 1-round games},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {767--775},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510017},
doi = {10.1145/509907.510017},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Khot02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kontogiannis02,
author = {Spyros C. Kontogiannis},
editor = {John H. Reif},
title = {Lower bounds {\&} competitive algorithms for online scheduling
of unit-size tasks to related machines},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {124--133},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509929},
doi = {10.1145/509907.509929},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kontogiannis02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LindellLR02,
author = {Yehuda Lindell and
Anna Lysyanskaya and
Tal Rabin},
editor = {John H. Reif},
title = {On the composition of authenticated byzantine agreement},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {514--523},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509982},
doi = {10.1145/509907.509982},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LindellLR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LinialMN02,
author = {Nathan Linial and
Avner Magen and
Assaf Naor},
editor = {John H. Reif},
title = {Girth and euclidean distortion},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {705--711},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510009},
doi = {10.1145/509907.510009},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LinialMN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MeshulamW02,
author = {Roy Meshulam and
Avi Wigderson},
editor = {John H. Reif},
title = {Expanders from symmetric codes},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {669--677},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510004},
doi = {10.1145/509907.510004},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MeshulamW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Micciancio02,
author = {Daniele Micciancio},
editor = {John H. Reif},
title = {Improved cryptographic hash functions with worst-case/average-case
connection},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {609--618},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509995},
doi = {10.1145/509907.509995},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Micciancio02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Molloy02,
author = {Michael Molloy},
editor = {John H. Reif},
title = {The Glauber dynamics on colourings of a graph with high girth and
maximum degree},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {91--98},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509924},
doi = {10.1145/509907.509924},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Molloy02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Molloy02a,
author = {Michael Molloy},
editor = {John H. Reif},
title = {Models and thresholds for random constraint satisfaction problems},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {209--217},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509941},
doi = {10.1145/509907.509941},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Molloy02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NayakS02,
author = {Ashwin Nayak and
Julia Salzman},
editor = {John H. Reif},
title = {On communication over an entanglement-assisted quantum channel},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {698--704},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510007},
doi = {10.1145/509907.510007},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NayakS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ODonnell02,
author = {Ryan O'Donnell},
editor = {John H. Reif},
title = {Hardness amplification within {NP}},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {751--760},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510015},
doi = {10.1145/509907.510015},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ODonnell02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Papadimitriou02,
author = {Christos H. Papadimitriou},
editor = {John H. Reif},
title = {The Joy of Theory},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {116},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509908},
doi = {10.1145/509907.509908},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Papadimitriou02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Raz02,
author = {Ran Raz},
editor = {John H. Reif},
title = {On the complexity of matrix product},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {144--151},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509932},
doi = {10.1145/509907.509932},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Raz02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Raz02a,
author = {Ran Raz},
editor = {John H. Reif},
title = {Resolution lower bounds for the weak pigeonhole principle},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {553--562},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509987},
doi = {10.1145/509907.509987},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Raz02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Roughgarden02,
author = {Tim Roughgarden},
editor = {John H. Reif},
title = {The price of anarchy is independent of the network topology},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {428--437},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509971},
doi = {10.1145/509907.509971},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Roughgarden02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SaksS02,
author = {Michael E. Saks and
Xiaodong Sun},
editor = {John H. Reif},
title = {Space lower bounds for distance approximation in the data stream model},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {360--369},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509963},
doi = {10.1145/509907.509963},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SaksS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SchaeferSS02,
author = {Marcus Schaefer and
Eric Sedgwick and
Daniel Stefankovic},
editor = {John H. Reif},
title = {Recognizing string graphs in {NP}},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {1--6},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509910},
doi = {10.1145/509907.509910},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SchaeferSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ScharbrodtSS02,
author = {Mark Scharbrodt and
Thomas Schickinger and
Angelika Steger},
editor = {John H. Reif},
title = {A new average case analysis for completion time scheduling},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {170--178},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509936},
doi = {10.1145/509907.509936},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ScharbrodtSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Sivakumar02,
author = {D. Sivakumar},
editor = {John H. Reif},
title = {Algorithmic derandomization via complexity theory},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {619--626},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509996},
doi = {10.1145/509907.509996},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Sivakumar02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Smyth02,
author = {Clifford D. Smyth},
editor = {John H. Reif},
title = {Reimer's inequality and tardos' conjecture},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {218--221},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509942},
doi = {10.1145/509907.509942},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Smyth02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SrinivasanA02,
author = {Anand Srinivasan and
James H. Anderson},
editor = {John H. Reif},
title = {Optimal rate-based scheduling on multiprocessors},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {189--198},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509938},
doi = {10.1145/509907.509938},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SrinivasanA02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Umans02,
author = {Christopher Umans},
editor = {John H. Reif},
title = {Pseudo-random generators for all hardnesses},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {627--634},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509997},
doi = {10.1145/509907.509997},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Umans02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2002,
editor = {John H. Reif},
title = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
publisher = {{ACM}},
year = {2002},
isbn = {1-58113-495-9},
timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-25 17:09 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:
