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/stoc2001.bht:"
download as .bib file
@inproceedings{DBLP:conf/stoc/AchlioptasBM01,
author = {Dimitris Achlioptas and
Paul Beame and
Michael S. O. Molloy},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {A sharp threshold in proof complexity},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {337--346},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380820},
doi = {10.1145/380752.380820},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AchlioptasBM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AchlioptasM01,
author = {Dimitris Achlioptas and
Frank McSherry},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Fast computation of low rank matrix},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {611--618},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380858},
doi = {10.1145/380752.380858},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AchlioptasM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AdlemanCGH01,
author = {Leonard M. Adleman and
Qi Cheng and
Ashish Goel and
Ming{-}Deh A. Huang},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Running time and program size for self-assembled squares},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {740--748},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380881},
doi = {10.1145/380752.380881},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AdlemanCGH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AjtaiKS01,
author = {Mikl{\'{o}}s Ajtai and
Ravi Kumar and
D. Sivakumar},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {A sieve algorithm for the shortest lattice vector problem},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {601--610},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380857},
doi = {10.1145/380752.380857},
timestamp = {Mon, 08 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AjtaiKS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlfaroM01,
author = {Luca de Alfaro and
Rupak Majumdar},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Quantitative solution of omega-regular games},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {675--683},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380871},
doi = {10.1145/380752.380871},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlfaroM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlstrupBR01,
author = {Stephen Alstrup and
Gerth St{\o}lting Brodal and
Theis Rauhe},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Optimal static range reporting in one dimension},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {476--482},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380842},
doi = {10.1145/380752.380842},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlstrupBR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ambainis01,
author = {Andris Ambainis},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {A new protocol and lower bounds for quantum coin flipping},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {134--142},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380788},
doi = {10.1145/380752.380788},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ambainis01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmbainisBNVW01,
author = {Andris Ambainis and
Eric Bach and
Ashwin Nayak and
Ashvin Vishwanath and
John Watrous},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {One-dimensional quantum walks},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {37--49},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380757},
doi = {10.1145/380752.380757},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AmbainisBNVW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmbainisKV01,
author = {Dorit Aharonov and
Andris Ambainis and
Julia Kempe and
Umesh V. Vazirani},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Quantum walks on graphs},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {50--59},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380758},
doi = {10.1145/380752.380758},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AmbainisKV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AraiPU01,
author = {Noriko H. Arai and
Toniann Pitassi and
Alasdair Urquhart},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {The complexity of analytic tableaux},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {356--363},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380822},
doi = {10.1145/380752.380822},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AraiPU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AryaGKMP01,
author = {Vijay Arya and
Naveen Garg and
Rohit Khandekar and
Adam Meyerson and
Kamesh Munagala and
Vinayaka Pandit},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Local search heuristic for k-median and facility location problems},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {21--29},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380755},
doi = {10.1145/380752.380755},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AryaGKMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AzarFKMS01,
author = {Yossi Azar and
Amos Fiat and
Anna R. Karlin and
Frank McSherry and
Jared Saia},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Spectral analysis of data},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {619--626},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380859},
doi = {10.1145/380752.380859},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AzarFKMS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bar-YossefKS01,
author = {Ziv Bar{-}Yossef and
Ravi Kumar and
D. Sivakumar},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Sampling algorithms: lower bounds and applications},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {266--275},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380810},
doi = {10.1145/380752.380810},
timestamp = {Mon, 08 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bar-YossefKS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BartalCR01,
author = {Yair Bartal and
Moses Charikar and
Danny Raz},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Approximating min-sum \emph{k}-clustering in metric spaces},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {11--20},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380754},
doi = {10.1145/380752.380754},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BartalCR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BecchettiL01,
author = {Luca Becchetti and
Stefano Leonardi},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Non-clairvoyant scheduling to minimize the average flow time on single
and parallel machines},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {94--103},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380782},
doi = {10.1145/380752.380782},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BecchettiL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BolligW01,
author = {Beate Bollig and
Philipp Woelfel},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {A read-once branching program lower bound of Omega(2\({}^{\mbox{n/4}}\))
for integer multiplication using universal},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {419--424},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380835},
doi = {10.1145/380752.380835},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BolligW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BorgsCP01,
author = {Christian Borgs and
Jennifer T. Chayes and
Boris G. Pittel},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Sharp threshold and scaling window for the integer partitioning problem},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {330--336},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380854},
doi = {10.1145/380752.380854},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BorgsCP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BulatovKJ01,
author = {Andrei A. Bulatov and
Andrei A. Krokhin and
Peter Jeavons},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {The complexity of maximal constraint languages},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {667--674},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380868},
doi = {10.1145/380752.380868},
timestamp = {Mon, 17 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BulatovKJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CanettiKPR01,
author = {Ran Canetti and
Joe Kilian and
Erez Petrank and
Alon Rosen},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Black-box concurrent zero-knowledge requires Omega{\textasciitilde}(log
n) rounds},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {570--579},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380852},
doi = {10.1145/380752.380852},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CanettiKPR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarP01,
author = {Moses Charikar and
Rina Panigrahy},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Clustering to minimize the sum of cluster diameters},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {1--10},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380753},
doi = {10.1145/380752.380753},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChazelleL01,
author = {Bernard Chazelle and
Ding Liu},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Lower bounds for intersection searching and fractional cascading in
higher dimension},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {322--329},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380818},
doi = {10.1145/380752.380818},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChazelleL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKZ01,
author = {Chandra Chekuri and
Sanjeev Khanna and
An Zhu},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Algorithms for minimizing weighted flow time},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {84--93},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380778},
doi = {10.1145/380752.380778},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriKZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DunaganV01,
author = {John Dunagan and
Santosh S. Vempala},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Optimal outlier removal in high-dimensional},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {627--636},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380860},
doi = {10.1145/380752.380860},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DunaganV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurandLS01,
author = {Bruno Durand and
Leonid A. Levin and
Alexander Shen},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Complex tilings},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {732--739},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380880},
doi = {10.1145/380752.380880},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DurandLS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Elkies01,
author = {Noam D. Elkies},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Excellent codes from modular curves},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {200--208},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380802},
doi = {10.1145/380752.380802},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Elkies01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ElkinP01,
author = {Michael Elkin and
David Peleg},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {(1+epsilon, beta)-spanner constructions for general graphs},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {173--182},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380797},
doi = {10.1145/380752.380797},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ElkinP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ErgunSSS01,
author = {Funda Erg{\"{u}}n and
S{\"{u}}leyman Cenk Sahinalp and
Jonathan Sharp and
Rakesh K. Sinha},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Biased dictionaries with fast insert/deletes},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {483--491},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380843},
doi = {10.1145/380752.380843},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ErgunSSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeS01,
author = {Uriel Feige and
Gideon Schechtman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {On the integrality ratio of semidefinite relaxations of {MAX} {CUT}},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {433--442},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380837},
doi = {10.1145/380752.380837},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FeigeS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FischerN01,
author = {Eldar Fischer and
Ilan Newman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Testing of matrix properties},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {286--295},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380812},
doi = {10.1145/380752.380812},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FischerN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gacs01,
author = {P{\'{e}}ter G{\'{a}}cs},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Compatible sequences and a slow Winkler percolation},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {694--703},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380874},
doi = {10.1145/380752.380874},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Gacs01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GartnerSTWV01,
author = {Bernd G{\"{a}}rtner and
J{\'{o}}zsef Solymosi and
Falk Tschirschnitz and
Emo Welzl and
Pavel Valtr},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {One line and n points},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {306--315},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380814},
doi = {10.1145/380752.380814},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GartnerSTWV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GennaroIKR01,
author = {Rosario Gennaro and
Yuval Ishai and
Eyal Kushilevitz and
Tal Rabin},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {The round complexity of verifiable secret sharing and secure multicast},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {580--589},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380853},
doi = {10.1145/380752.380853},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GennaroIKR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoemansW01,
author = {Michel X. Goemans and
David P. Williamson},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Approximation algorithms for {MAX-3-CUT} and other problems via complex
semidefinite programming},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {443--452},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380838},
doi = {10.1145/380752.380838},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoemansW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GrigniSVV01,
author = {Michelangelo Grigni and
Leonard J. Schulman and
Monica Vazirani and
Umesh V. Vazirani},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Quantum mechanical algorithms for the nonabelian hidden subgroup problem},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {68--74},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380769},
doi = {10.1145/380752.380769},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GrigniSVV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Grohe01,
author = {Martin Grohe},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Computing crossing numbers in quadratic time},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {231--236},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380805},
doi = {10.1145/380752.380805},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Grohe01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GroheSS01,
author = {Martin Grohe and
Thomas Schwentick and
Luc Segoufin},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {When is the evaluation of conjunctive queries tractable?},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {657--666},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380867},
doi = {10.1145/380752.380867},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GroheSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuhaKS01,
author = {Sudipto Guha and
Nick Koudas and
Kyuseok Shim},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Data-streams and histograms},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {471--475},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380841},
doi = {10.1145/380752.380841},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuhaKS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuhaMM01,
author = {Sudipto Guha and
Adam Meyerson and
Kamesh Munagala},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {A constant factor approximation for the single sink edge installation
problems},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {383--388},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380827},
doi = {10.1145/380752.380827},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuhaMM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaKKRY01,
author = {Anupam Gupta and
Jon M. Kleinberg and
Amit Kumar and
Rajeev Rastogi and
B{\"{u}}lent Yener},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Provisioning a virtual private network: a network design problem for
multicommodity flow},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {389--398},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380830},
doi = {10.1145/380752.380830},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuptaKKRY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaleviKKN01,
author = {Shai Halevi and
Robert Krauthgamer and
Eyal Kushilevitz and
Kobbi Nissim},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Private approximation of NP-hard functions},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {550--559},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380850},
doi = {10.1145/380752.380850},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HaleviKKN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/IckingM01,
author = {Christian Icking and
Lihong Ma},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {A tight bound for the complexity of voroni diagrams under polyhedral
convex distance functions in 3D},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {316--321},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380815},
doi = {10.1145/380752.380815},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/IckingM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JainV01,
author = {Kamal Jain and
Vijay V. Vazirani},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Applications of approximation algorithms to cooperative games},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {364--372},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380825},
doi = {10.1145/380752.380825},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JainV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JayramKKSS01,
author = {T. S. Jayram and
Tracy Kimbrel and
Robert Krauthgamer and
Baruch Schieber and
Maxim Sviridenko},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Online server allocation in a server farm via benefit task systems},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {540--549},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380849},
doi = {10.1145/380752.380849},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JayramKKSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JerrumSV01,
author = {Mark Jerrum and
Alistair Sinclair and
Eric Vigoda},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {A polynomial-time approximation algorithm for the permanent of a matrix
with non-negative entries},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {712--721},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380877},
doi = {10.1145/380752.380877},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JerrumSV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarlinKR01,
author = {Anna R. Karlin and
Claire Kenyon and
Dana Randall},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Dynamic {TCP} acknowledgement and other stories about e/(e-1)},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {502--509},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380845},
doi = {10.1145/380752.380845},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KarlinKR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KempeKD01,
author = {David Kempe and
Jon M. Kleinberg and
Alan J. Demers},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Spatial gossip and resource location protocols},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {163--172},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380796},
doi = {10.1145/380752.380796},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KempeKD01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KesselmanLMPSS01,
author = {Alexander Kesselman and
Zvi Lotker and
Yishay Mansour and
Boaz Patt{-}Shamir and
Baruch Schieber and
Maxim Sviridenko},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Buffer overflow management in QoS switches},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {520--529},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380847},
doi = {10.1145/380752.380847},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KesselmanLMPSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KilianP01,
author = {Joe Kilian and
Erez Petrank},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Concurrent and resettable zero-knowledge in poly-loalgorithm rounds},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {560--569},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380851},
doi = {10.1145/380752.380851},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KilianP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KlauckNTZ01,
author = {Hartmut Klauck and
Ashwin Nayak and
Amnon Ta{-}Shma and
David Zuckerman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Interaction in quantum communication and the complexity of set disjointness},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {124--133},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380786},
doi = {10.1145/380752.380786},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KlauckNTZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KlivansS01,
author = {Adam R. Klivans and
Daniel A. Spielman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Randomness efficient identity testing of multivariate polynomials},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {216--223},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380801},
doi = {10.1145/380752.380801},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KlivansS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KlivansS01a,
author = {Adam R. Klivans and
Rocco A. Servedio},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Learning {DNF} in time 2\({}^{\mbox{{\~{O}}(n\({}^{\mbox{1/3}}\))}}\)},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {258--265},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380809},
doi = {10.1145/380752.380809},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KlivansS01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kosaraju01,
author = {S. Rao Kosaraju},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Euler paths in series parallel graphs},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {237--240},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380806},
doi = {10.1145/380752.380806},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kosaraju01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LachishR01,
author = {Oded Lachish and
Ran Raz},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Explicit lower bound of \emph{4.5n - o(n)} for boolena circuits},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {399--408},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380832},
doi = {10.1145/380752.380832},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LachishR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MavronicolasS01,
author = {Marios Mavronicolas and
Paul G. Spirakis},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {The price of selfish routing},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {510--519},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380846},
doi = {10.1145/380752.380846},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MavronicolasS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Meyerson01,
author = {Adam Meyerson},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Profit-earning facility location},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {30--36},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380756},
doi = {10.1145/380752.380756},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Meyerson01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MolloyR01,
author = {Michael Molloy and
Bruce A. Reed},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Colouring graphs when the number of colours is nearly the maximum
degree},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {462--470},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380840},
doi = {10.1145/380752.380840},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MolloyR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MontenegroS01,
author = {Ravi Montenegro and
Jung{-}Bae Son},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Edge isoperimetry and rapid mixing on matroids and geometric Markov
chains},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {704--711},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380876},
doi = {10.1145/380752.380876},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MontenegroS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MossR01,
author = {Anna Moss and
Yuval Rabani},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Approximation algorithms for constrained for constrained node weighted
steiner tree problems},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {373--382},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380826},
doi = {10.1145/380752.380826},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MossR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MostefaouiRR01,
author = {Achour Most{\'{e}}faoui and
Sergio Rajsbaum and
Michel Raynal},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Conditions on input vectors for consensus solvability in asynchronous
distributed systems},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {153--162},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380792},
doi = {10.1145/380752.380792},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MostefaouiRR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Muller-OlmS01,
author = {Markus M{\"{u}}ller{-}Olm and
Helmut Seidl},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {On optimal slicing of parallel programs},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {647--656},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380864},
doi = {10.1145/380752.380864},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Muller-OlmS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NaorN01,
author = {Moni Naor and
Kobbi Nissim},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Communication preserving protocols for secure function evaluation},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {590--599},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380855},
doi = {10.1145/380752.380855},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NaorN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NaorT01,
author = {Moni Naor and
Vanessa Teague},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Anti-presistence: history independent data structures},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {492--501},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380844},
doi = {10.1145/380752.380844},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NaorT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Pagh01,
author = {Rasmus Pagh},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {On the cell probe complexity of membership and perfect hashing},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {425--432},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380836},
doi = {10.1145/380752.380836},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Pagh01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Papadimitriou01,
author = {Christos H. Papadimitriou},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Algorithms, games, and the internet},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {749--753},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380883},
doi = {10.1145/380752.380883},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Papadimitriou01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ParnasR01,
author = {Michal Parnas and
Dana Ron},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Testing metric properties},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {276--285},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380811},
doi = {10.1145/380752.380811},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ParnasR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiR01,
author = {Toniann Pitassi and
Ran Raz},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Regular resolution lower bounds for the weak pigeonhole principle},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {347--355},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380821},
doi = {10.1145/380752.380821},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PitassiR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RazS01,
author = {Ran Raz and
Amir Shpilka},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Lower bounds for matrix product, in bounded depth circuits with arbitrary
gates},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {409--418},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380833},
doi = {10.1145/380752.380833},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RazS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Roughgarden01,
author = {Tim Roughgarden},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Stackelberg scheduling strategies},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {104--113},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380783},
doi = {10.1145/380752.380783},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Roughgarden01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SanjeevK01,
author = {Sanjeev Arora and
Ravi Kannan},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Learning mixtures of arbitrary gaussians},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {247--257},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380808},
doi = {10.1145/380752.380808},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SanjeevK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SchaeferS01,
author = {Marcus Schaefer and
Daniel Stefankovic},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Decidability of string graphs},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {241--246},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380807},
doi = {10.1145/380752.380807},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SchaeferS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Shparlinski01,
author = {Igor E. Shparlinski},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Sparse polynomial approximation in finite fields},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {209--215},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380803},
doi = {10.1145/380752.380803},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Shparlinski01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SimaO01,
author = {Jiv{r}'{i} v{S}'{i}ma and
Pekka Orponen},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Computing with continuous-time Liapunov systems},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {722--731},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380878},
doi = {10.1145/380752.380878},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SimaO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SpielmanT01,
author = {Daniel A. Spielman and
Shang{-}Hua Teng},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Smoothed analysis of algorithms: why the simplex algorithm usually
takes polynomial time},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {296--305},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380813},
doi = {10.1145/380752.380813},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SpielmanT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-ShmaUZ01,
author = {Amnon Ta{-}Shma and
Christopher Umans and
David Zuckerman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Loss-less condensers, unbalanced expanders, and extractors},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {143--152},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380790},
doi = {10.1145/380752.380790},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-ShmaUZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-ShmaZ01,
author = {Amnon Ta{-}Shma and
David Zuckerman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Extractor codes},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {193--199},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380800},
doi = {10.1145/380752.380800},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-ShmaZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Thorup01,
author = {Mikkel Thorup},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Fully-dynamic min-cut},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {224--230},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380804},
doi = {10.1145/380752.380804},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Thorup01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ThorupZ01,
author = {Mikkel Thorup and
Uri Zwick},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Approximate distance oracles},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {183--192},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380798},
doi = {10.1145/380752.380798},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ThorupZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Tokuyama01,
author = {Takeshi Tokuyama},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Minimax parametric optimization problems and multi-dimensional parametric
searching},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {75--83},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380777},
doi = {10.1145/380752.380777},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Tokuyama01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Trakhtenbrot01,
author = {Boris A. Trakhtenbrot},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Automata, circuits and hybrids: facets of continuous time},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {754--755},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380884},
doi = {10.1145/380752.380884},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Trakhtenbrot01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Trevisan01,
author = {Luca Trevisan},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Non-approximability results for optimization problems on bounded degree
instances},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {453--461},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380839},
doi = {10.1145/380752.380839},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Trevisan01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Valiant01,
author = {Leslie G. Valiant},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Quantum computers that can be simulated classically in polynomial
time},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {114--123},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380785},
doi = {10.1145/380752.380785},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Valiant01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Vatan01,
author = {Farrokh Vatan},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Distribution functions of probabilistic automata},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {684--693},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380872},
doi = {10.1145/380752.380872},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Vatan01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Vocking01,
author = {Berthold V{\"{o}}cking},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Almost optimal permutation routing on hypercubes},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {530--539},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380848},
doi = {10.1145/380752.380848},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Vocking01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/WangW01,
author = {Li{-}San Wang and
Tandy J. Warnow},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Estimating true evolutionary distances between genomes},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {637--646},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380861},
doi = {10.1145/380752.380861},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/WangW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Watrous01,
author = {John Watrous},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Quantum algorithms for solvable groups},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {60--67},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380759},
doi = {10.1145/380752.380759},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Watrous01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yao01,
author = {Andrew Chi{-}Chih Yao},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Some perspective on computational complexity (abstract)},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {600},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380856},
doi = {10.1145/380752.380856},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yao01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2001,
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
publisher = {{ACM}},
year = {2001},
isbn = {1-58113-349-9},
timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-26 12:32 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:
