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/stoc82.bht:"
download as .bib file
@inproceedings{DBLP:conf/stoc/AsanoH82,
author = {Takao Asano and
Tomio Hirata},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Edge-Deletion and Edge-Contraction Problems},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {245--254},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802198},
doi = {10.1145/800070.802198},
timestamp = {Wed, 14 Nov 2018 10:51:38 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AsanoH82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AtallahK82,
author = {Mikhail J. Atallah and
S. Rao Kosaraju},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Graph Problems on a Mesh-Connected Processor Array (Preliminary Version)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {345--353},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802210},
doi = {10.1145/800070.802210},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AtallahK82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BabaiGM82,
author = {L{\'{a}}szl{\'{o}} Babai and
D. Yu. Grigoryev and
David M. Mount},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Isomorphism of Graphs with Bounded Eigenvalue Multiplicity},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {310--324},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802206},
doi = {10.1145/800070.802206},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BabaiGM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bach82,
author = {Eric Bach},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Fast Algorithms under the Extended Riemann Hypothesis: {A} Concrete
Estimate},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {290--295},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802203},
doi = {10.1145/800070.802203},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bach82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bar-YehudaE82,
author = {Reuven Bar{-}Yehuda and
Shimon Even},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {On Approximating a Vertex Cover for Planar Graphs},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {303--309},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802205},
doi = {10.1145/800070.802205},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bar-YehudaE82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhattL82,
author = {Sandeep N. Bhatt and
Charles E. Leiserson},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {How to Assemble Tree Machines (Extended Abstract)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {77--84},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802179},
doi = {10.1145/800070.802179},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BhattL82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BorodinH82,
author = {Allan Borodin and
John E. Hopcroft},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Routing, Merging and Sorting on Parallel Models of Computation (Extended
Abstract)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {338--344},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802209},
doi = {10.1145/800070.802209},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BorodinH82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BoyceDDG82,
author = {James E. Boyce and
David P. Dobkin and
Robert L. (Scot) Drysdale III and
Leonidas J. Guibas},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Finding Extremal Polygons},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {282--289},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802202},
doi = {10.1145/800070.802202},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BoyceDDG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Carter82,
author = {J. Lawrence Carter},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {The Theory of Signature Testing for {VLSI}},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {66--76},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802178},
doi = {10.1145/800070.802178},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Carter82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CookD82,
author = {Stephen A. Cook and
Cynthia Dwork},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Bounds on the Time for Parallel RAM's to Compute Simple Functions},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {231--233},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802196},
doi = {10.1145/800070.802196},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CookD82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DeBakkerZ82,
author = {J. W. de Bakker and
Jeffery I. Zucker},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Denotational Semantics of Concurrency},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {153--158},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802188},
doi = {10.1145/800070.802188},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DeBakkerZ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DeMilloLM82,
author = {Richard A. DeMillo and
Nancy A. Lynch and
Michael Merritt},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Cryptographic Protocols},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {383--400},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802214},
doi = {10.1145/800070.802214},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DeMilloLM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Dietz82,
author = {Paul F. Dietz},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Maintaining Order in a Linked List},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {122--127},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802184},
doi = {10.1145/800070.802184},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Dietz82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DolevS82,
author = {Danny Dolev and
H. Raymond Strong},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Polynomial Algorithms for Multiple Processor Agreement},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {401--407},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802215},
doi = {10.1145/800070.802215},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DolevS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisG82,
author = {Pavol Duris and
Zvi Galil},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Two Tapes are Better than One for Nondeterministic Machines},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {1--7},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802171},
doi = {10.1145/800070.802171},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EmersonH82,
author = {E. Allen Emerson and
Joseph Y. Halpern},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Decision Procedures and Expressiveness in the Temporal Logic of Branching
Time},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {169--180},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802190},
doi = {10.1145/800070.802190},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EmersonH82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmanH82,
author = {Yishai A. Feldman and
David Harel},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {A Probabilistic Dynamic Logic},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {181--195},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802191},
doi = {10.1145/800070.802191},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FeldmanH82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Furer82,
author = {Martin F{\"{u}}rer},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {The Tight Deterministic Time Hierarchy},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {8--16},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802172},
doi = {10.1145/800070.802172},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Furer82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldwasserM82,
author = {Shafi Goldwasser and
Silvio Micali},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Probabilistic Encryption and How to Play Mental Poker Keeping Secret
All Partial Information},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {365--377},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802212},
doi = {10.1145/800070.802212},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoldwasserM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Greenberg82,
author = {Albert G. Greenberg},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {On the Time Complexity of Broadcast Communication Schemes (Preliminary
Version)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {354--364},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802211},
doi = {10.1145/800070.802211},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Greenberg82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GurevichH82,
author = {Yuri Gurevich and
Leo Harrington},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Trees, Automata, and Games},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {60--65},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802177},
doi = {10.1145/800070.802177},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GurevichH82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HongS82,
author = {Zhu Hong and
Robert Sedgewick},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Notes on Merging Networks (Preliminary Version)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {296--302},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802204},
doi = {10.1145/800070.802204},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HongS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Immerman82,
author = {Neil Immerman},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Relational Queries Computable in Polynomial Time (Extended Abstract)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {147--152},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802187},
doi = {10.1145/800070.802187},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Immerman82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/InoueTT82,
author = {Katsushi Inoue and
Itsuo Takanami and
Hiroshi Taniguchi},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Two-Dimensional Alternating Turing Machines},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {37--46},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802175},
doi = {10.1145/800070.802175},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/InoueTT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kaltofen82,
author = {Erich L. Kaltofen},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial
Factorization},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {261--266},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802200},
doi = {10.1145/800070.802200},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Kaltofen82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kissin82,
author = {Gloria Kissin},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Measuring Energy Consumption in {VLSI} Circuits: a Foundation},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {99--104},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802181},
doi = {10.1145/800070.802181},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kissin82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kosaraju82,
author = {S. Rao Kosaraju},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Decidability of Reachability in Vector Addition Systems (Preliminary
Version)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {267--281},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802201},
doi = {10.1145/800070.802201},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kosaraju82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kurtz82,
author = {Stuart A. Kurtz},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {On the Random Oracle Hypothesis},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {224--230},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802195},
doi = {10.1145/800070.802195},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kurtz82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Leighton82,
author = {Frank Thomson Leighton},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {A Layout Strategy for {VLSI} which Is Provably Good (Extended Abstract)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {85--98},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802180},
doi = {10.1145/800070.802180},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Leighton82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ManberT82,
author = {Udi Manber and
Martin Tompa},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Probabilistic, Nondeterministic, and Alternating Decision Trees},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {234--244},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802197},
doi = {10.1145/800070.802197},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ManberT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MehlhornS82,
author = {Kurt Mehlhorn and
Erik Meineche Schmidt},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Las Vegas Is better than Determinism in {VLSI} and Distributed Computing
(Extended Abstract)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {330--337},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802208},
doi = {10.1145/800070.802208},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MehlhornS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NivatP82,
author = {Maurice Nivat and
Dominique Perrin},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Ensembles Reconnaissables de Mots Biinfinis},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {47--59},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802176},
doi = {10.1145/800070.802176},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NivatP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PachlKR82,
author = {Jan K. Pachl and
Ephraim Korach and
Doron Rotem},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {A Technique for Proving Lower Bounds for Distributed Maximum-Finding
Algorithms},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {378--382},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802213},
doi = {10.1145/800070.802213},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PachlKR82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PapadimitriouS82,
author = {Christos H. Papadimitriou and
Michael Sipser},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Communication Complexity},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {196--200},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802192},
doi = {10.1145/800070.802192},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PapadimitriouY82,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {The Complexity of Facets (and Some Facets of Complexity)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {255--260},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802199},
doi = {10.1145/800070.802199},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouY82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Pippenger82,
author = {Nicholas Pippenger},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Probabilistic Simulations (Preliminary Version)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {17--26},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802173},
doi = {10.1145/800070.802173},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Pippenger82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Reif82,
author = {John H. Reif},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Symmetric Complementation},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {201--214},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802193},
doi = {10.1145/800070.802193},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Reif82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RivestS82,
author = {Ronald L. Rivest and
Adi Shamir},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {How to Reuse a "Write-Once" Memory (Preliminary Version)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {105--113},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802182},
doi = {10.1145/800070.802182},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RivestS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RuzzoST82,
author = {Walter L. Ruzzo and
Janos Simon and
Martin Tompa},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Space-Bounded Hierarchies and Probabilistic Computations},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {215--223},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802194},
doi = {10.1145/800070.802194},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RuzzoST82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SistlaC82,
author = {A. Prasad Sistla and
Edmund M. Clarke},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {The Complexity of Propositional Linear Temporal Logics},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {159--168},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802189},
doi = {10.1145/800070.802189},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SistlaC82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Vardi82,
author = {Moshe Y. Vardi},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {The Complexity of Relational Query Languages (Extended Abstract)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {137--146},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802186},
doi = {10.1145/800070.802186},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Vardi82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Vitanyi82,
author = {Paul M. B. Vit{\'{a}}nyi},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Real-Time Simulation of Multicounters by Oblivious One-Tape Turing
Machines},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {27--36},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802174},
doi = {10.1145/800070.802174},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Vitanyi82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Wigderson82,
author = {Avi Wigderson},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {A New Approximate Graph Coloring Algorithm},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {325--329},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802207},
doi = {10.1145/800070.802207},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Wigderson82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Willard82,
author = {Dan E. Willard},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Maintaining Dense Sequential Files in a Dynamic Environment (Extended
Abstract)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {114--121},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802183},
doi = {10.1145/800070.802183},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Willard82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yao82,
author = {Andrew Chi{-}Chih Yao},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Space-Time Tradeoff for Answering Range Queries (Extended Abstract)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {128--136},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802185},
doi = {10.1145/800070.802185},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yao82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC14,
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070},
doi = {10.1145/800070},
isbn = {0-89791-067-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/STOC14.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 13:12 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:
