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/stoc86.bht:"
download as .bib file
@inproceedings{DBLP:conf/stoc/AdlemanL86,
author = {Leonard M. Adleman and
Hendrik W. Lenstra Jr.},
editor = {Juris Hartmanis},
title = {Finding Irreducible Polynomials over Finite Fields},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {350--355},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12166},
doi = {10.1145/12130.12166},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AdlemanL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AjtaiBHKPRST86,
author = {Mikl{\'{o}}s Ajtai and
L{\'{a}}szl{\'{o}} Babai and
P{\'{e}}ter Hajnal and
J{\'{a}}nos Koml{\'{o}}s and
Pavel Pudl{\'{a}}k and
Vojtech R{\"{o}}dl and
Endre Szemer{\'{e}}di and
Gy{\"{o}}rgy Tur{\'{a}}n},
editor = {Juris Hartmanis},
title = {Two lower bounds for branching programs},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {30--38},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12134},
doi = {10.1145/12130.12134},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AjtaiBHKPRST86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AjtaiKSS86,
author = {Mikl{\'{o}}s Ajtai and
J{\'{a}}nos Koml{\'{o}}s and
William L. Steiger and
Endre Szemer{\'{e}}di},
editor = {Juris Hartmanis},
title = {Deterministic Selection in O(log log {N)} Parallel Time},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {188--195},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12149},
doi = {10.1145/12130.12149},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AjtaiKSS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BaranyF86,
author = {Imre B{\'{a}}r{\'{a}}ny and
Zolt{\'{a}}n F{\"{u}}redi},
editor = {Juris Hartmanis},
title = {Computing the Volume Is Difficult},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {442--447},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12176},
doi = {10.1145/12130.12176},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BaranyF86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Barrington86,
author = {David A. Mix Barrington},
editor = {Juris Hartmanis},
title = {Bounded-Width Polynomial-Size Branching Programs Recognize Exactly
Those Languages in NC{\({^1}\)}},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {1--5},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12131},
doi = {10.1145/12130.12131},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Barrington86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Beame86,
author = {Paul Beame},
editor = {Juris Hartmanis},
title = {Limits on the Power of Concurrent-Write Parallel Machines},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {169--176},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12147},
doi = {10.1145/12130.12147},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Beame86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-OrFKT86,
author = {Michael Ben{-}Or and
Ephraim Feig and
Dexter Kozen and
Prasoon Tiwari},
editor = {Juris Hartmanis},
title = {A Fast Parallel Algorithm for Determining All Roots of a Polynomial
with Real Roots},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {340--349},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12165},
doi = {10.1145/12130.12165},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ben-OrFKT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bern86,
author = {Marshall W. Bern},
editor = {Juris Hartmanis},
title = {Two Probabilistic Results on Rectilinear Steiner Trees},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {433--441},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12175},
doi = {10.1145/12130.12175},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bern86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlumerEHW86,
author = {Anselm Blumer and
Andrzej Ehrenfeucht and
David Haussler and
Manfred K. Warmuth},
editor = {Juris Hartmanis},
title = {Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis
Dimension (Extended Abstract)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {273--282},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12158},
doi = {10.1145/12130.12158},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BlumerEHW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Broder86,
author = {Andrei Z. Broder},
editor = {Juris Hartmanis},
title = {How hard is to marry at random? (On the approximation of the permanent)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {50--58},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12136},
doi = {10.1145/12130.12136},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Broder86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cai86,
author = {Jin{-}yi Cai},
editor = {Juris Hartmanis},
title = {With Probability One, {A} Random Oracle Separates {PSPACE} from the
Polynomial-Time Hierarchy},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {21--29},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12133},
doi = {10.1145/12130.12133},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Cai86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Clarkson86,
author = {Kenneth L. Clarkson},
editor = {Juris Hartmanis},
title = {Further Applications of Random Sampling to Computational Geometry},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {414--423},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12173},
doi = {10.1145/12130.12173},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Clarkson86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cleve86,
author = {Richard Cleve},
editor = {Juris Hartmanis},
title = {Limits on the Security of Coin Flips when Half the Processors Are
Faulty (Extended Abstract)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {364--369},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12168},
doi = {10.1145/12130.12168},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Cleve86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CoffmanL86,
author = {Edward G. Coffman Jr. and
Frank Thomson Leighton},
editor = {Juris Hartmanis},
title = {A Provably Efficient Algorithm for Dynamic Storage Allocation},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {77--90},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12139},
doi = {10.1145/12130.12139},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CoffmanL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColeV86,
author = {Richard Cole and
Uzi Vishkin},
editor = {Juris Hartmanis},
title = {Deterministic coin tossing and accelerating cascades: micro and macro
techniques for designing parallel algorithms},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {206--219},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12151},
doi = {10.1145/12130.12151},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ColeV86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CourcoubetisVW86,
author = {Costas Courcoubetis and
Moshe Y. Vardi and
Pierre Wolper},
editor = {Juris Hartmanis},
title = {Reasoning about Fair Concurrent Programs},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {283--294},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12159},
doi = {10.1145/12130.12159},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CourcoubetisVW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DobkinEY86,
author = {David P. Dobkin and
Herbert Edelsbrunner and
Chee{-}Keng Yap},
editor = {Juris Hartmanis},
title = {Probing Convex Polytopes},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {424--432},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12174},
doi = {10.1145/12130.12174},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DobkinEY86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DriscollSST86,
author = {James R. Driscoll and
Neil Sarnak and
Daniel Dominic Sleator and
Robert Endre Tarjan},
editor = {Juris Hartmanis},
title = {Making Data Structures Persistent},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {109--121},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12142},
doi = {10.1145/12130.12142},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DriscollSST86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DworkPPU86,
author = {Cynthia Dwork and
David Peleg and
Nicholas Pippenger and
Eli Upfal},
editor = {Juris Hartmanis},
title = {Fault Tolerance in Networks of Bounded Degree (Preliminary Version)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {370--379},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12169},
doi = {10.1145/12130.12169},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DworkPPU86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EdelsbrunnerG86,
author = {Herbert Edelsbrunner and
Leonidas J. Guibas},
editor = {Juris Hartmanis},
title = {Topologically Sweeping an Arrangement},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {389--403},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12171},
doi = {10.1145/12130.12171},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EdelsbrunnerG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmanFP86,
author = {Paul Feldman and
Joel Friedman and
Nicholas Pippenger},
editor = {Juris Hartmanis},
title = {Non-Blocking Networks (Preliminary Version)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {247--254},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12155},
doi = {10.1145/12130.12155},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FeldmanFP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilKS86,
author = {Zvi Galil and
Ravi Kannan and
Endre Szemer{\'{e}}di},
editor = {Juris Hartmanis},
title = {On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic
One-Tape Turing Machines},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {39--49},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12135},
doi = {10.1145/12130.12135},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilKS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldbergT86,
author = {Andrew V. Goldberg and
Robert Endre Tarjan},
editor = {Juris Hartmanis},
title = {A New Approach to the Maximum Flow Problem},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {136--146},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12144},
doi = {10.1145/12130.12144},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoldbergT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldwasserK86,
author = {Shafi Goldwasser and
Joe Kilian},
editor = {Juris Hartmanis},
title = {Almost All Primes Can Be Quickly Certified},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {316--329},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12162},
doi = {10.1145/12130.12162},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoldwasserK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldwasserS86,
author = {Shafi Goldwasser and
Michael Sipser},
editor = {Juris Hartmanis},
title = {Private Coins versus Public Coins in Interactive Proof Systems},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {59--68},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12137},
doi = {10.1145/12130.12137},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoldwasserS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HalpernV86,
author = {Joseph Y. Halpern and
Moshe Y. Vardi},
editor = {Juris Hartmanis},
title = {The Complexity of Reasoning about Knowledge and Time: Extended Abstract},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {304--315},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12161},
doi = {10.1145/12130.12161},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HalpernV86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hastad86,
author = {Johan H{\aa}stad},
editor = {Juris Hartmanis},
title = {Almost Optimal Lower Bounds for Small Depth Circuits},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {6--20},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12132},
doi = {10.1145/12130.12132},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Hastad86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kaltofen86,
author = {Erich L. Kaltofen},
editor = {Juris Hartmanis},
title = {Uniform Closure Properties of P-Computable Functions},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {330--337},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12163},
doi = {10.1145/12130.12163},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Kaltofen86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KapoorV86,
author = {Sanjiv Kapoor and
Pravin M. Vaidya},
editor = {Juris Hartmanis},
title = {Fast Algorithms for Convex Quadratic Programming and Multicommodity
Flows},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {147--159},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12145},
doi = {10.1145/12130.12145},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KapoorV86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarlinU86,
author = {Anna R. Karlin and
Eli Upfal},
editor = {Juris Hartmanis},
title = {Parallel Hashing-An Efficient Implementation of Shared Memory (Preliminary
Version)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {160--168},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12146},
doi = {10.1145/12130.12146},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KarlinU86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KoLD86,
author = {Ker{-}I Ko and
Timothy J. Long and
Ding{-}Zhu Du},
editor = {Juris Hartmanis},
title = {A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended
Abstract)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {295--303},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12160},
doi = {10.1145/12130.12160},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KoLD86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kosaraju86,
author = {S. Rao Kosaraju},
editor = {Juris Hartmanis},
title = {Parallel Evaluation of Division-Free Arithmetic Expressions},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {231--239},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12153},
doi = {10.1145/12130.12153},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kosaraju86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KosarajuA86,
author = {S. Rao Kosaraju and
Mikhail J. Atallah},
editor = {Juris Hartmanis},
title = {Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary
Version)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {264--272},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12157},
doi = {10.1145/12130.12157},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KosarajuA86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Krentel86,
author = {Mark W. Krentel},
editor = {Juris Hartmanis},
title = {The Complexity of Optimization Problems},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {69--76},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12138},
doi = {10.1145/12130.12138},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Krentel86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LandauV86,
author = {Gad M. Landau and
Uzi Vishkin},
editor = {Juris Hartmanis},
title = {Introducing Efficient Parallelism into Approximate String Matching
and a New Serial Algorithm},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {220--230},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12152},
doi = {10.1145/12130.12152},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LandauV86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeightonS86,
author = {Frank Thomson Leighton and
Peter W. Shor},
editor = {Juris Hartmanis},
title = {Tight Bounds for Minimax Grid Matching, With Applications to the Average
Case Analysis of Algorithms},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {91--103},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12140},
doi = {10.1145/12130.12140},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LeightonS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiY86,
author = {Ming Li and
Yaacov Yesha},
editor = {Juris Hartmanis},
title = {New Lower Bounds for Parallel Computation},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {177--187},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12148},
doi = {10.1145/12130.12148},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LiY86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LubotzkyPS86,
author = {Alexander Lubotzky and
Ralph Phillips and
Peter Sarnak},
editor = {Juris Hartmanis},
title = {Explicit Expanders and the Ramanujan Conjectures},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {240--246},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12154},
doi = {10.1145/12130.12154},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LubotzkyPS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LubyR86,
author = {Michael Luby and
Charles Rackoff},
editor = {Juris Hartmanis},
title = {Pseudo-random Permutation Generators and Cryptographic Composition},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {356--363},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12167},
doi = {10.1145/12130.12167},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LubyR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LuekerMR86,
author = {George S. Lueker and
Nimrod Megiddo and
Vijaya Ramachandran},
editor = {Juris Hartmanis},
title = {Linear Programming with Two Variables per Inequality in Poly-Log Time
(Preliminary Version)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {196--205},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12150},
doi = {10.1145/12130.12150},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LuekerMR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Mulmuley86,
author = {Ketan Mulmuley},
editor = {Juris Hartmanis},
title = {A Fast Parallel Algorithm to Compute the Rank of a Matrix over an
Arbitrary Field},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {338--339},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12164},
doi = {10.1145/12130.12164},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Mulmuley86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SchnorrS86,
author = {Claus{-}Peter Schnorr and
Adi Shamir},
editor = {Juris Hartmanis},
title = {An Optimal Sorting Algorithm for Mesh Connected Computers},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {255--263},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12156},
doi = {10.1145/12130.12156},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SchnorrS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Seidel86,
author = {Raimund Seidel},
editor = {Juris Hartmanis},
title = {Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per
Face},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {404--413},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12172},
doi = {10.1145/12130.12172},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Seidel86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Siegel86,
author = {Alan Siegel},
editor = {Juris Hartmanis},
title = {Aspects of Information Flow in {VLSI} Circuits (Extended Abstract)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {448--459},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12177},
doi = {10.1145/12130.12177},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Siegel86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SleatorTT86,
author = {Daniel Dominic Sleator and
Robert Endre Tarjan and
William P. Thurston},
editor = {Juris Hartmanis},
title = {Rotation Distance, Triangulations, and Hyperbolic Geometry},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {122--135},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12143},
doi = {10.1145/12130.12143},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SleatorTT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TarjanW86,
author = {Robert Endre Tarjan and
Christopher J. Van Wyk},
editor = {Juris Hartmanis},
title = {A Linear-Time Algorithm for Triangulating Simple Polygons},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {380--388},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12170},
doi = {10.1145/12130.12170},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/TarjanW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yannakakis86,
author = {Mihalis Yannakakis},
editor = {Juris Hartmanis},
title = {Four Pages are Necessary and Sufficient for Planar Graphs (Extended
Abstract)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {104--108},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12141},
doi = {10.1145/12130.12141},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yannakakis86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC18,
editor = {Juris Hartmanis},
title = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
publisher = {{ACM}},
year = {1986},
isbn = {0-89791-193-8},
timestamp = {Mon, 17 Oct 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/STOC18.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-08-26 20:20 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:
