![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/conf/stoc/stoc88.bht:"
@inproceedings{DBLP:conf/stoc/AdlemanK88, author = {Leonard M. Adleman and Kireeti Kompella}, editor = {Janos Simon}, title = {Using Smoothness to Achieve Parallelism (Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {528--538}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62264}, doi = {10.1145/62212.62264}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AdlemanK88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AggarwalC88, author = {Alok Aggarwal and Ashok K. Chandra}, editor = {Janos Simon}, title = {Virtual Memory Algorithms (Preliminary Version)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {173--185}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62227}, doi = {10.1145/62212.62227}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AggarwalC88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AggarwalCR88, author = {Alok Aggarwal and Ashok K. Chandra and Prabhakar Raghavan}, editor = {Janos Simon}, title = {Energy Consumption in {VLSI} Circuits (Preliminary Version)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {205--216}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62230}, doi = {10.1145/62212.62230}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AggarwalCR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BellareM88, author = {Mihir Bellare and Silvio Micali}, editor = {Janos Simon}, title = {How to Sign Given Any Trapdoor Function (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {32--42}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62216}, doi = {10.1145/62212.62216}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BellareM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-OrC88, author = {Michael Ben{-}Or and Richard Cleve}, editor = {Janos Simon}, title = {Computing Algebraic Formulas Using a Constant Number of Registers}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {254--257}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62236}, doi = {10.1145/62212.62236}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ben-OrC88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-OrGKW88, author = {Michael Ben{-}Or and Shafi Goldwasser and Joe Kilian and Avi Wigderson}, editor = {Janos Simon}, title = {Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {113--131}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62223}, doi = {10.1145/62212.62223}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ben-OrGKW88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-OrGW88, author = {Michael Ben{-}Or and Shafi Goldwasser and Avi Wigderson}, editor = {Janos Simon}, title = {Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {1--10}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62213}, doi = {10.1145/62212.62213}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ben-OrGW88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-OrT88, author = {Michael Ben{-}Or and Prasoon Tiwari}, editor = {Janos Simon}, title = {A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {301--309}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62241}, doi = {10.1145/62212.62241}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ben-OrT88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BermanS88, author = {Piotr Berman and Janos Simon}, editor = {Janos Simon}, title = {Investigations of Fault-Tolerant Networks of Computers (Preliminary Version)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {66--77}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62219}, doi = {10.1145/62212.62219}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BermanS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BhattCHLR88, author = {Sandeep N. Bhatt and Fan R. K. Chung and Jia{-}Wei Hong and Frank Thomson Leighton and Arnold L. Rosenberg}, editor = {Janos Simon}, title = {Optimal Simulations by Butterfly Networks (Preliminary Version)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {192--204}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62229}, doi = {10.1145/62212.62229}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BhattCHLR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BlumFM88, author = {Manuel Blum and Paul Feldman and Silvio Micali}, editor = {Janos Simon}, title = {Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {103--112}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62222}, doi = {10.1145/62212.62222}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BlumFM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Broder88, author = {Andrei Z. Broder}, editor = {Janos Simon}, title = {Errata to "How hard is to marry at random? (On the approximation of the permanent)"}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {551}, publisher = {{ACM}}, year = {1988}, timestamp = {Mon, 17 Oct 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Broder88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Canny88, author = {John F. Canny}, editor = {Janos Simon}, title = {Some Algebraic and Geometric Computations in {PSPACE}}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {460--467}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62257}, doi = {10.1145/62212.62257}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Canny88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChaumCD88, author = {David Chaum and Claude Cr{\'{e}}peau and Ivan Damg{\aa}rd}, editor = {Janos Simon}, title = {Multiparty Unconditionally Secure Protocols (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {11--19}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62214}, doi = {10.1145/62212.62214}, timestamp = {Wed, 16 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChaumCD88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CosmadakisGKV88, author = {Stavros S. Cosmadakis and Haim Gaifman and Paris C. Kanellakis and Moshe Y. Vardi}, editor = {Janos Simon}, title = {Decidable Optimization Problems for Database Logic Programs (Preliminary Report)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {477--490}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62259}, doi = {10.1145/62212.62259}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/CosmadakisGKV88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DolevGS88, author = {Danny Dolev and Eli Gafni and Nir Shavit}, editor = {Janos Simon}, title = {Toward a Non-Atomic Era: {\textbackslash}ell-Exclusion as a Test Case}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {78--92}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62220}, doi = {10.1145/62212.62220}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DolevGS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FederG88, author = {Tom{\'{a}}s Feder and Daniel H. Greene}, editor = {Janos Simon}, title = {Optimal Algorithms for Approximate Clustering}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {434--444}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62255}, doi = {10.1145/62212.62255}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FederG88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FeldmanM88, author = {Paul Feldman and Silvio Micali}, editor = {Janos Simon}, title = {Optimal Algorithms for Byzantine Agreement}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {148--161}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62225}, doi = {10.1145/62212.62225}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FeldmanM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FiatNSS88, author = {Amos Fiat and Moni Naor and Jeanette P. Schmidt and Alan Siegel}, editor = {Janos Simon}, title = {Non-Oblivious Hashing (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {367--376}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62248}, doi = {10.1145/62212.62248}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FiatNSS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FiatNSSS88, author = {Amos Fiat and Moni Naor and Alejandro A. Sch{\"{a}}ffer and Jeanette P. Schmidt and Alan Siegel}, editor = {Janos Simon}, title = {Storing and Searching a Multikey Table (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {344--353}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62245}, doi = {10.1145/62212.62245}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FiatNSSS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FortuneW88, author = {Steven Fortune and Gordon T. Wilfong}, editor = {Janos Simon}, title = {Planning Constrained Motion}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {445--459}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62256}, doi = {10.1145/62212.62256}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FortuneW88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FraysseixPP88, author = {Hubert de Fraysseix and J{\'{a}}nos Pach and Richard Pollack}, editor = {Janos Simon}, title = {Small Sets Supporting F{\'{a}}ry Embeddings of Planar Graphs}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {426--433}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62254}, doi = {10.1145/62212.62254}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FraysseixPP88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GabowT88, author = {Harold N. Gabow and Robert Endre Tarjan}, editor = {Janos Simon}, title = {Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {514--527}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62263}, doi = {10.1145/62212.62263}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GabowT88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GabowW88, author = {Harold N. Gabow and Herbert H. Westermann}, editor = {Janos Simon}, title = {Forests, Frames and Games: Algorithms for Matroid Sums and Applications}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {407--421}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62252}, doi = {10.1145/62212.62252}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GabowW88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GoldbergT88, author = {Andrew V. Goldberg and Robert Endre Tarjan}, editor = {Janos Simon}, title = {Finding Minimum-Cost Circulations by Canceling Negative Cycles}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {388--397}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62250}, doi = {10.1145/62212.62250}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GoldbergT88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GurevichS88, author = {Yuri Gurevich and Saharon Shelah}, editor = {Janos Simon}, title = {Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {281--289}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62239}, doi = {10.1145/62212.62239}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GurevichS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HajnalMT88, author = {Andr{\'{a}}s Hajnal and Wolfgang Maass and Gy{\"{o}}rgy Tur{\'{a}}n}, editor = {Janos Simon}, title = {On the Communication Complexity of Graph Properties}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {186--191}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62228}, doi = {10.1145/62212.62228}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HajnalMT88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HalpernMT88, author = {Joseph Y. Halpern and Yoram Moses and Mark R. Tuttle}, editor = {Janos Simon}, title = {A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {132--147}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62224}, doi = {10.1145/62212.62224}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HalpernMT88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HalpernV88, author = {Joseph Y. Halpern and Moshe Y. Vardi}, editor = {Janos Simon}, title = {Reasoning about Knowledge and Time in Asynchronous Systems}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {53--65}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62218}, doi = {10.1145/62212.62218}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HalpernV88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HalstenbergR88, author = {Bernd Halstenberg and R{\"{u}}diger Reischuk}, editor = {Janos Simon}, title = {On Different Modes of Communication (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {162--172}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62226}, doi = {10.1145/62212.62226}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HalstenbergR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Istrail88, author = {Sorin Istrail}, editor = {Janos Simon}, title = {Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {491--503}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62260}, doi = {10.1145/62212.62260}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Istrail88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/JerrumS88, author = {Mark Jerrum and Alistair Sinclair}, editor = {Janos Simon}, title = {Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {235--244}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62234}, doi = {10.1145/62212.62234}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/JerrumS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KalyanasundaramS88, author = {Bala Kalyanasundaram and Georg Schnitger}, editor = {Janos Simon}, title = {On the Power of White Pebbles (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {258--266}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62237}, doi = {10.1145/62212.62237}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KalyanasundaramS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KannanNR88, author = {Sampath Kannan and Moni Naor and Steven Rudich}, editor = {Janos Simon}, title = {Implicit Representation of Graphs}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {334--343}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62244}, doi = {10.1145/62212.62244}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KannanNR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KarchmerW88, author = {Mauricio Karchmer and Avi Wigderson}, editor = {Janos Simon}, title = {Monotone Circuits for Connectivity Require Super-logarithmic Depth}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {539--550}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62265}, doi = {10.1145/62212.62265}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KarchmerW88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KarloffR88, author = {Howard J. Karloff and Prabhakar Raghavan}, editor = {Janos Simon}, title = {Randomized Algorithms and Pseudorandom Numbers}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {310--321}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62242}, doi = {10.1145/62212.62242}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KarloffR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KarpZ88, author = {Richard M. Karp and Yanjun Zhang}, editor = {Janos Simon}, title = {A Randomized Parallel Branch-and-Bound Procedure}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {290--300}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62240}, doi = {10.1145/62212.62240}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KarpZ88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KearnsL88, author = {Michael J. Kearns and Ming Li}, editor = {Janos Simon}, title = {Learning in the Presence of Malicious Errors (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {267--280}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62238}, doi = {10.1145/62212.62238}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KearnsL88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Kilian88, author = {Joe Kilian}, editor = {Janos Simon}, title = {Founding Cryptography on Oblivious Transfer}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {20--31}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62215}, doi = {10.1145/62212.62215}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Kilian88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/King88, author = {Valerie King}, editor = {Janos Simon}, title = {Lower Bounds on the Complexity of Graph Properties}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {468--476}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62258}, doi = {10.1145/62212.62258}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/King88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ko88, author = {Ker{-}I Ko}, editor = {Janos Simon}, title = {Relativized Polynominal Time Hierarchies Having Exactly {K} Levels}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {245--253}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62235}, doi = {10.1145/62212.62235}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ko88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KosarajuS88, author = {S. Rao Kosaraju and Gregory F. Sullivan}, editor = {Janos Simon}, title = {Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {398--406}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62251}, doi = {10.1145/62212.62251}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KosarajuS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KrizancPU88, author = {Danny Krizanc and David Peleg and Eli Upfal}, editor = {Janos Simon}, title = {A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {93--102}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62221}, doi = {10.1145/62212.62221}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KrizancPU88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LoeblN88, author = {Martin Loebl and Jaroslav Nesetril}, editor = {Janos Simon}, title = {Linearity and Unprovability of Set Union Problem Strategies}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {360--366}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62247}, doi = {10.1145/62212.62247}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LoeblN88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LuekerM88, author = {George S. Lueker and Mariko Molodowitch}, editor = {Janos Simon}, title = {More Analysis of Double Hashing}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {354--359}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62246}, doi = {10.1145/62212.62246}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LuekerM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ManasseMS88, author = {Mark S. Manasse and Lyle A. McGeoch and Daniel Dominic Sleator}, editor = {Janos Simon}, title = {Competitive Algorithms for On-line Problems}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {322--333}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62243}, doi = {10.1145/62212.62243}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ManasseMS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Orlin88, author = {James B. Orlin}, editor = {Janos Simon}, title = {A Faster Strongly Polynominal Minimum Cost Flow Algorithm}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {377--387}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62249}, doi = {10.1145/62212.62249}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Orlin88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/PapadimitriouY88a, author = {Christos H. Papadimitriou and Mihalis Yannakakis}, editor = {Janos Simon}, title = {Optimization, Approximation, and Complexity Classes (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {229--234}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62233}, doi = {10.1145/62212.62233}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouY88a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/PapadimitriouY88b, author = {Christos H. Papadimitriou and Mihalis Yannakakis}, editor = {Janos Simon}, title = {Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {510--513}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62262}, doi = {10.1145/62212.62262}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouY88b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/PelegU88, author = {David Peleg and Eli Upfal}, editor = {Janos Simon}, title = {A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {43--52}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62217}, doi = {10.1145/62212.62217}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/PelegU88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/PintzSS88, author = {Janos Pintz and William L. Steiger and Endre Szemer{\'{e}}di}, editor = {Janos Simon}, title = {Two Infinite Sets of Primes with Fast Primality Tests}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {504--509}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62261}, doi = {10.1145/62212.62261}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/PintzSS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Vaidya88, author = {Pravin M. Vaidya}, editor = {Janos Simon}, title = {Geometry Helps in Matching (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {422--425}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62253}, doi = {10.1145/62212.62253}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Vaidya88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/VenkatesanL88, author = {Ramarathnam Venkatesan and Leonid A. Levin}, editor = {Janos Simon}, title = {Random Instances of a Graph Coloring Problem Are Hard}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {217--222}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62231}, doi = {10.1145/62212.62231}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/VenkatesanL88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Yannakakis88, author = {Mihalis Yannakakis}, editor = {Janos Simon}, title = {Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract)}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {223--228}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62232}, doi = {10.1145/62212.62232}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Yannakakis88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stoc/STOC20, editor = {Janos Simon}, title = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, publisher = {{ACM}}, year = {1988}, isbn = {0-89791-264-0}, timestamp = {Mon, 17 Oct 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/STOC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.