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/stoc2000.bht:"
download as .bib file
@inproceedings{DBLP:conf/stoc/Achlioptas00,
author = {Dimitris Achlioptas},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Setting 2 variables at a time yields a new lower bound for random
3-SAT (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {28--37},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335309},
doi = {10.1145/335305.335309},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Achlioptas00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AdlerL00,
author = {Micah Adler and
Frank Thomson Leighton},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Compression using efficient multicasting},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {153--162},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335324},
doi = {10.1145/335305.335324},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AdlerL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AharonovTVY00,
author = {Dorit Aharonov and
Amnon Ta{-}Shma and
Umesh V. Vazirani and
Andrew Chi{-}Chih Yao},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Quantum bit escrow},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {705--714},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335404},
doi = {10.1145/335305.335404},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AharonovTVY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AielloCL00,
author = {William Aiello and
Fan R. K. Chung and
Linyuan Lu},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A random graph model for massive graphs},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {171--180},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335326},
doi = {10.1145/335305.335326},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AielloCL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlekhnovichBRW00,
author = {Michael Alekhnovich and
Eli Ben{-}Sasson and
Alexander A. Razborov and
Avi Wigderson},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Space complexity in propositional calculus},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {358--367},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335347},
doi = {10.1145/335305.335347},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlekhnovichBRW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AleksandrovMS00,
author = {Lyudmil Aleksandrov and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Approximation algorithms for geometric shortest path problems},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {286--295},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335339},
doi = {10.1145/335305.335339},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AleksandrovMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ambainis00,
author = {Andris Ambainis},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Quantum lower bounds by quantum arguments},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {636--643},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335394},
doi = {10.1145/335305.335394},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ambainis00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmbainisSV00,
author = {Andris Ambainis and
Leonard J. Schulman and
Umesh V. Vazirani},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Computing with highly mixed states (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {697--704},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335403},
doi = {10.1145/335305.335403},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AmbainisSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnderssonT00,
author = {Arne Andersson and
Mikkel Thorup},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Tight(er) worst-case bounds on dynamic searching and priority queues},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {335--342},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335344},
doi = {10.1145/335305.335344},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AnderssonT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bar-NoyBFNS00,
author = {Amotz Bar{-}Noy and
Reuven Bar{-}Yehuda and
Ari Freund and
Joseph Naor and
Baruch Schieber},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A unified approach to approximating resource allocation and scheduling},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {735--744},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335410},
doi = {10.1145/335305.335410},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bar-NoyBFNS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarkolR00,
author = {Omer Barkol and
Yuval Rabani},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Tighter bounds for nearest neighbor search and related problems in
the cell probe model},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {388--396},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335350},
doi = {10.1145/335305.335350},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BarkolR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BerenbrinkCSV00,
author = {Petra Berenbrink and
Artur Czumaj and
Angelika Steger and
Berthold V{\"{o}}cking},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Balanced allocations: the heavily loaded case},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {745--754},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335411},
doi = {10.1145/335305.335411},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BerenbrinkCSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BermanD00,
author = {Piotr Berman and
Bhaskar DasGupta},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Improvements in throughout maximization for real-time scheduling},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {680--687},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335401},
doi = {10.1145/335305.335401},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BermanD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BihamBBMR00,
author = {Eli Biham and
Michel Boyer and
P. Oscar Boykin and
Tal Mor and
Vwani P. Roychowdhury},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A proof of the security of quantum key distribution (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {715--724},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335406},
doi = {10.1145/335305.335406},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BihamBBMR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlumKW00,
author = {Avrim Blum and
Adam Kalai and
Hal Wasserman},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Noise-tolerant learning, the parity problem, and the statistical query
model},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {435--440},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335355},
doi = {10.1145/335305.335355},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BlumKW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Boneh00,
author = {Dan Boneh},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Finding smooth integers in short intervals using {CRT} decoding},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {265--272},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335337},
doi = {10.1145/335305.335337},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Boneh00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuhrmanMRV00,
author = {Harry Buhrman and
Peter Bro Miltersen and
Jaikumar Radhakrishnan and
Srinivasan Venkatesh},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Are bitvectors optimal?},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {449--458},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335357},
doi = {10.1145/335305.335357},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BuhrmanMRV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuschHW00,
author = {Costas Busch and
Maurice Herlihy and
Roger Wattenhofer},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Hard-Potato routing},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {278--285},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.338762},
doi = {10.1145/335305.338762},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BuschHW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CanettiGGM00,
author = {Ran Canetti and
Oded Goldreich and
Shafi Goldwasser and
Silvio Micali},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Resettable zero-knowledge (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {235--244},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335334},
doi = {10.1145/335305.335334},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CanettiGGM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CarrV00,
author = {Robert D. Carr and
Santosh S. Vempala},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Randomized metarounding (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {58--62},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335312},
doi = {10.1145/335305.335312},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CarrV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarFGKRS00,
author = {Moses Charikar and
Ronald Fagin and
Venkatesan Guruswami and
Jon M. Kleinberg and
Prabhakar Raghavan and
Amit Sahai},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Query strategies for priced information (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {582--591},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335382},
doi = {10.1145/335305.335382},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarFGKRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenX00,
author = {Danny Z. Chen and
Jinhui Xu},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Shortest path queries in planar graphs},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {469--478},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335359},
doi = {10.1145/335305.335359},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChenX00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColeH00,
author = {Richard Cole and
Ramesh Hariharan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Faster suffix tree construction with missing suffix links},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {407--415},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335352},
doi = {10.1145/335305.335352},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ColeH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CramerDD00,
author = {Ronald Cramer and
Ivan Damg{\aa}rd and
Stefan Dziembowski},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On the complexity of verifiable secret sharing and multiparty computation},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {325--334},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335343},
doi = {10.1145/335305.335343},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CramerDD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CrescenzoSY00,
author = {Giovanni Di Crescenzo and
Kouichi Sakurai and
Moti Yung},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On zero-knowledge proofs (extended abstract): "from membership to
decision"},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {255--264},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335336},
doi = {10.1145/335305.335336},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CrescenzoSY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CsirikJKOSW00,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon and
James B. Orlin and
Peter W. Shor and
Richard R. Weber},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On the sum-of-squares algorithm for bin packing},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {208--217},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335331},
doi = {10.1145/335305.335331},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CsirikJKOSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CzumajS00,
author = {Artur Czumaj and
Christian Scheideler},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A new algorithm approach to the general Lov{\'{a}}sz local lemma
with applications to scheduling and satisfiability problems (extended
abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {38--47},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335310},
doi = {10.1145/335305.335310},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CzumajS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DamMMS00,
author = {Wim van Dam and
Fr{\'{e}}d{\'{e}}ric Magniez and
Michele Mosca and
Miklos Santha},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Self-testing of universal and fault-tolerant sets of quantum gates},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {688--696},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335402},
doi = {10.1145/335305.335402},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DamMMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EdelsbrunnerLMSTTUW00,
author = {Herbert Edelsbrunner and
Xiang{-}Yang Li and
Gary L. Miller and
Andreas Stathopoulos and
Dafna Talmor and
Shang{-}Hua Teng and
Alper {\"{U}}ng{\"{o}}r and
Noel Walkington},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Smoothing and cleaning up slivers},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {273--277},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335338},
doi = {10.1145/335305.335338},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EdelsbrunnerLMSTTUW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EvenGS00,
author = {Guy Even and
Sudipto Guha and
Baruch Schieber},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Improved approximations of crossings in graph drawings},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {296--305},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335340},
doi = {10.1145/335305.335340},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EvenGS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FaginKKRRRST00,
author = {Ronald Fagin and
Anna R. Karlin and
Jon M. Kleinberg and
Prabhakar Raghavan and
Sridhar Rajagopalan and
Ronitt Rubinfeld and
Madhu Sudan and
Andrew Tomkins},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Random walks with "back buttons" (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {484--493},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335362},
doi = {10.1145/335305.335362},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FaginKKRRRST00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FederMPOW00,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Rina Panigrahy and
Chris Olston and
Jennifer Widom},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Computing the median with uncertainty},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {602--607},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335386},
doi = {10.1145/335305.335386},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FederMPOW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FederMS00,
author = {Tom{\'{a}}s Feder and
Rajeev Motwani and
Carlos S. Subi},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Finding long paths and cycles in sparse Hamiltonian graphs},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {524--529},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335368},
doi = {10.1145/335305.335368},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FederMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeHK00,
author = {Uriel Feige and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Approximating the domatic number},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {134--143},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335321},
doi = {10.1145/335305.335321},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FeigeHK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeKN00,
author = {Uriel Feige and
Robert Krauthgamer and
Kobbi Nissim},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Approximating the minimum bisection size (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {530--536},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335370},
doi = {10.1145/335305.335370},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeigeKN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigenbaumPS00,
author = {Joan Feigenbaum and
Christos H. Papadimitriou and
Scott Shenker},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Sharing the cost of muliticast transmissions (preliminary version)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {218--227},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335332},
doi = {10.1145/335305.335332},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeigenbaumPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FiatM00,
author = {Amos Fiat and
Manor Mendel},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Better algorithms for unfair metrical task systems and applications},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {725--734},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335408},
doi = {10.1145/335305.335408},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FiatM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FitziM00,
author = {Matthias Fitzi and
Ueli M. Maurer},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {From partial consistency to global broadcast},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {494--503},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335363},
doi = {10.1145/335305.335363},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FitziM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FleischerI00,
author = {Lisa Fleischer and
Satoru Iwata},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Improved algorithms for submodular function minimization and submodular
flow},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {107--116},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335318},
doi = {10.1145/335305.335318},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FleischerI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Fortune00,
author = {Steven Fortune},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Exact computations of the inertia symmetric integer matrices},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {556--564},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335374},
doi = {10.1145/335305.335374},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Fortune00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Furer00,
author = {Martin F{\"{u}}rer},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Approximating permanents of complex matrices},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {667--669},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335399},
doi = {10.1145/335305.335399},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Furer00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoelMP00,
author = {Ashish Goel and
Adam Meyerson and
Serge A. Plotkin},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Combining fairness with throughput: online routing with multiple objectives},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {670--679},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335400},
doi = {10.1145/335305.335400},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoelMP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldsmithS00,
author = {Judy Goldsmith and
Robert H. Sloan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {More theory revision with queries (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {441--448},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335356},
doi = {10.1145/335305.335356},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoldsmithS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Grohe00,
author = {Martin Grohe},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Isomorphism testing for embeddable graphs through definability},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {63--72},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335313},
doi = {10.1145/335305.335313},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Grohe00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GrossiV00,
author = {Roberto Grossi and
Jeffrey Scott Vitter},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Compressed suffix arrays and suffix trees with applications to text
indexing and string matching (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {397--406},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335351},
doi = {10.1145/335305.335351},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GrossiV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Grover00,
author = {Lov K. Grover},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Rapid sampling though quantum computing},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {618--626},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335389},
doi = {10.1145/335305.335389},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Grover00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaT00,
author = {Anupam Gupta and
{\'{E}}va Tardos},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A constant factor approximation algorithm for a class of classification
problems},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {652--658},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335397},
doi = {10.1145/335305.335397},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuptaT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiS00,
author = {Venkatesan Guruswami and
Madhu Sudan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {List decoding algorithms for certain concatenated codes},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {181--190},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335327},
doi = {10.1145/335305.335327},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GurvitsS00,
author = {Leonid Gurvits and
Alex Samorodnitsky},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A deterministic polynomial-time algorithm for approximating mixed
discriminant and mixed volume},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {48--57},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335311},
doi = {10.1145/335305.335311},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GurvitsS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gutierrez00,
author = {Claudio Gutierrez},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Satisfiability of equations in free groups is in {PSPACE}},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {21--27},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335308},
doi = {10.1145/335305.335308},
timestamp = {Thu, 10 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Gutierrez00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HallgrenRT00,
author = {Sean Hallgren and
Alexander Russell and
Amnon Ta{-}Shma},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Normal subgroup reconstruction and quantum computation using group
representations},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {627--635},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335392},
doi = {10.1145/335305.335392},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HallgrenRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HarnikR00,
author = {Danny Harnik and
Ran Raz},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Higher lower bounds on monotone size},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {378--387},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335349},
doi = {10.1145/335305.335349},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HarnikR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoSW00,
author = {Russell Impagliazzo and
Ronen Shaltiel and
Avi Wigderson},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Extractors and pseudo-random generators with optimal seed length},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {1--10},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335306},
doi = {10.1145/335305.335306},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Istrail00,
author = {Sorin Istrail},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Statistical mechanics, three-dimensionality and NP-completeness: I.
Universality of intracatability for the partition function of the
Ising model across non-planar surfaces (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {87--96},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335316},
doi = {10.1145/335305.335316},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Istrail00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/IwataFF00,
author = {Satoru Iwata and
Lisa Fleischer and
Satoru Fujishige},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A combinatorial, strongly polynomial-time algorithm for minimizing
submodular functions},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {97--106},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335317},
doi = {10.1145/335305.335317},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/IwataFF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KabanetsC00,
author = {Valentine Kabanets and
Jin{-}yi Cai},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Circuit minimization problem},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {73--79},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335314},
doi = {10.1145/335305.335314},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KabanetsC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KaoNT00,
author = {Ming{-}Yang Kao and
Andreas Nolte and
Stephen R. Tate},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {The risk profile problem for stock portfolio optimization (extended
abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {228--234},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335333},
doi = {10.1145/335305.335333},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KaoNT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KatzT00,
author = {Jonathan Katz and
Luca Trevisan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On the efficiency of local decoding procedures for error-correcting
codes},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {80--86},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335315},
doi = {10.1145/335305.335315},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KatzT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KatzY00,
author = {Jonathan Katz and
Moti Yung},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Complete characterization of security notions for probabilistic private-key
encryption},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {245--254},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335335},
doi = {10.1145/335305.335335},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KatzY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KempeKK00,
author = {David Kempe and
Jon M. Kleinberg and
Amit Kumar},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Connectivity and inference problems for temporal networks},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {504--513},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335364},
doi = {10.1145/335305.335364},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KempeKK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KenyonSY00,
author = {Claire Kenyon and
Nicolas Schabanel and
Neal E. Young},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Polynomial-time approximation scheme for data broadcast},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {659--666},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335398},
doi = {10.1145/335305.335398},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KenyonSY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kilian00,
author = {Joe Kilian},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {More general completeness theorems for secure two-party computation},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {316--324},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335342},
doi = {10.1145/335305.335342},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kilian00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KitaevW00,
author = {Alexei Y. Kitaev and
John Watrous},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Parallelization, amplification, and exponential time simulation of
quantum interactive proof systems},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {608--617},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335387},
doi = {10.1145/335305.335387},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KitaevW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Klauck00,
author = {Hartmut Klauck},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On quantum and probabilistic communication: Las Vegas and one-way
protocols},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {644--651},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335396},
doi = {10.1145/335305.335396},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Klauck00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kleinberg00,
author = {Jon M. Kleinberg},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {The small-world phenomenon: an algorithmic perspective},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {163--170},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335325},
doi = {10.1145/335305.335325},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kleinberg00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KonemannR00,
author = {Jochen K{\"{o}}nemann and
R. Ravi},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A matter of degree: improved approximation algorithms for degree-bounded
minimum spanning trees},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {537--546},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335371},
doi = {10.1145/335305.335371},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KonemannR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiMW00,
author = {Ming Li and
Bin Ma and
Lusheng Wang},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Near optimal multiple alignment within a band in polynomial time},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {425--434},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335354},
doi = {10.1145/335305.335354},
timestamp = {Mon, 13 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LiMW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MacielPW00,
author = {Alexis Maciel and
Toniann Pitassi and
Alan R. Woods},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A new proof of the weak pigeonhole principle},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {368--377},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335348},
doi = {10.1145/335305.335348},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MacielPW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MahajanV00,
author = {Meena Mahajan and
Kasturi R. Varadarajan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A new NC-algorithm for finding a perfect matching in bipartite planar
and small genus graphs (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {351--357},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335346},
doi = {10.1145/335305.335346},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MahajanV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MotwaniPSV00,
author = {Rajeev Motwani and
Rina Panigrahy and
Vijay A. Saraswat and
Suresh Venkatasubramanian},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On the decidability of accessibility problems (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {306--315},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335341},
doi = {10.1145/335305.335341},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MotwaniPSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MuthukrishnanS00,
author = {S. Muthukrishnan and
S{\"{u}}leyman Cenk Sahinalp},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Approximate nearest neighbors and sequence comparison with block operations},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {416--424},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335353},
doi = {10.1145/335305.335353},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MuthukrishnanS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NaorRR00,
author = {Moni Naor and
Omer Reingold and
Alon Rosen},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Pseudo-random functions and factoring (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {11--20},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335307},
doi = {10.1145/335305.335307},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NaorRR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/OlshevskyS00,
author = {Vadim Olshevsky and
Mohammad Amin Shokrollahi},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Matrix-vector product for confluent Cauchy-like matrices with application
to confluent rational interpolation},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {573--581},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335380},
doi = {10.1145/335305.335380},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/OlshevskyS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/OrlinSS00,
author = {James B. Orlin and
Andreas S. Schulz and
Sudipta Sengupta},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {epsilon-optimization schemes and L-bit precision: alternative perspectives
in combinatorial optimization (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {565--572},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335377},
doi = {10.1145/335305.335377},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/OrlinSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PapadimitriouV00,
author = {Christos H. Papadimitriou and
Santosh S. Vempala},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On the approximability of the traveling salesman problem (extended
abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {126--133},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335320},
doi = {10.1145/335305.335320},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RasalaW00,
author = {April Rasala and
Gordon T. Wilfong},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Strictly non-blocking {WDM} cross-connects for heterogeneous networks},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {514--523},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335366},
doi = {10.1145/335305.335366},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RasalaW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Reed00,
author = {Bruce A. Reed},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {How tall is a tree?},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {479--483},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335360},
doi = {10.1145/335305.335360},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Reed00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RothemundW00,
author = {Paul W. K. Rothemund and
Erik Winfree},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {The program-size complexity of self-assembled squares (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {459--468},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335358},
doi = {10.1145/335305.335358},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RothemundW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SamorodnitskyT00,
author = {Alex Samorodnitsky and
Luca Trevisan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A {PCP} characterization of {NP} with optimal amortized query complexity},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {191--199},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335329},
doi = {10.1145/335305.335329},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SamorodnitskyT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Schulman00,
author = {Leonard J. Schulman},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Clustering for edge-cost minimization (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {547--555},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335373},
doi = {10.1145/335305.335373},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Schulman00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Seiden00,
author = {Steven S. Seiden},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A guessing game and randomized online algorithms},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {592--601},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335385},
doi = {10.1145/335305.335385},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Seiden00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Srinivasan00,
author = {Aravind Srinivasan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {The value of strong inapproximability results for clique},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {144--152},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335322},
doi = {10.1145/335305.335322},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Srinivasan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Thorup00,
author = {Mikkel Thorup},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Near-optimal fully-dynamic graph connectivity},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {343--350},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335345},
doi = {10.1145/335305.335345},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Thorup00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Vadhan00,
author = {Salil P. Vadhan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On transformation of interactive proofs that preserve the prover's
complexity},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {200--207},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335330},
doi = {10.1145/335305.335330},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Vadhan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Vygen00,
author = {Jens Vygen},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On dual minimum cost flow algorithms (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {117--125},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335319},
doi = {10.1145/335305.335319},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Vygen00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2000,
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
publisher = {{ACM}},
year = {2000},
isbn = {1-58113-184-4},
timestamp = {Mon, 17 Oct 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2000.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 14:18 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:
