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/stoc81.bht:"
download as .bib file
@inproceedings{DBLP:conf/stoc/AdachiIK81,
author = {Akeo Adachi and
Shigeki Iwata and
Takumi Kasai},
title = {Low Level Complexity for Combinatorial Games},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {228--237},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802476},
doi = {10.1145/800076.802476},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AdachiIK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArjomandiFL81,
author = {Eshrat Arjomandi and
Michael J. Fischer and
Nancy A. Lynch},
title = {A Difference in Efficiency between Synchronous and Asynchronous Systems},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {128--132},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802466},
doi = {10.1145/800076.802466},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ArjomandiFL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeeriFMMUY81,
author = {Catriel Beeri and
Ronald Fagin and
David Maier and
Alberto O. Mendelzon and
Jeffrey D. Ullman and
Mihalis Yannakakis},
title = {Properties of Acyclic Database Schemes},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {355--362},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802489},
doi = {10.1145/800076.802489},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeeriFMMUY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BertoniMS81,
author = {Alberto Bertoni and
Giancarlo Mauri and
Nicoletta Sabadini},
title = {A Characterization of the Class of Functions Computable in Polynomial
Time on Random Access Machines},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {168--176},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802470},
doi = {10.1145/800076.802470},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BertoniMS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chan81,
author = {Tat{-}hung Chan},
title = {Reversal Complexity of Counter Machines},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {146--157},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802468},
doi = {10.1145/800076.802468},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Chan81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChandraHMP81,
author = {Ashok K. Chandra and
Joseph Y. Halpern and
Albert R. Meyer and
Rohit Parikh},
title = {Equations between Regular Terms and an Application to Process Logic},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {384--390},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802493},
doi = {10.1145/800076.802493},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChandraHMP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChandraLM81,
author = {Ashok K. Chandra and
Harry R. Lewis and
Johann A. Makowsky},
title = {Embedded Implicational Dependencies and their Inference Problem},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {342--354},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802488},
doi = {10.1145/800076.802488},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChandraLM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chazelle81,
author = {Bernard Chazelle},
title = {Convex Decompositions of Polyhedra},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {70--79},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802459},
doi = {10.1145/800076.802459},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Chazelle81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChazelleM81,
author = {Bernard Chazelle and
Louis Monier},
title = {A Model of Computation for {VLSI} with Related Complexity Results},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {318--325},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802485},
doi = {10.1145/800076.802485},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChazelleM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chew81,
author = {Paul Chew},
title = {Unique Normal Forms in Term Rewriting Systems with Repeated Variables},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {7--18},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802452},
doi = {10.1145/800076.802452},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Chew81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CulikH81,
author = {Karel Cul{\'{\i}}k II and
Tero Harju},
title = {The omega-Sequence Equivalence Problem for {DOL} Systems Is Decidable},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {1--6},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802451},
doi = {10.1145/800076.802451},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CulikH81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DolevKSSU81,
author = {Danny Dolev and
Kevin Karplus and
Alan Siegel and
Alex Strong and
Jeffrey D. Ullman},
title = {Optimal Wiring between Rectangles},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {312--317},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802484},
doi = {10.1145/800076.802484},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DolevKSSU81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisG81,
author = {Pavol Duris and
Zvi Galil},
title = {Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One
Counter for Two Way Machines (Preliminary Version)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {177--188},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802471},
doi = {10.1145/800076.802471},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Fich81,
author = {Faith E. Fich},
title = {Lower Bounds for the Cycle Detection Problem},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {96--105},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802462},
doi = {10.1145/800076.802462},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Fich81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilP81,
author = {Zvi Galil and
Wolfgang J. Paul},
title = {An Efficient General Purpose Parallel Computer},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {247--262},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802478},
doi = {10.1145/800076.802478},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilS81,
author = {Zvi Galil and
Joel I. Seiferas},
title = {Time-Space-Optimal String Matching},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {106--113},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802463},
doi = {10.1145/800076.802463},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GonnetM81,
author = {Gaston H. Gonnet and
J. Ian Munro},
title = {A Linear Probing Sort and its Analysis (Preliminary Draft)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {90--95},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802461},
doi = {10.1145/800076.802461},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GonnetM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HawrusikVY81,
author = {Frank M. Hawrusik and
K. N. Venkataraman and
Ann Yasuhara},
title = {Classes of Functions for Computing on Binary Trees (Extended Abstract)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {19--27},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802453},
doi = {10.1145/800076.802453},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HawrusikVY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HongK81,
author = {Jia{-}Wei Hong and
H. T. Kung},
title = {{I/O} Complexity: The Red-Blue Pebble Game},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {326--333},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802486},
doi = {10.1145/800076.802486},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HongK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HongR81,
author = {Jia{-}Wei Hong and
Arnold L. Rosenberg},
title = {Graphs that Are Almost Binary Trees (Preliminary Version)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {334--341},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802487},
doi = {10.1145/800076.802487},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HongR81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JosephY81,
author = {Deborah Joseph and
Paul Young},
title = {Fast Programs for Initial Segments and Polynomial Time Computation
in Weak Models of Arithmetic (Preliminary Abstract)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {55--61},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802457},
doi = {10.1145/800076.802457},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JosephY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KimR81,
author = {Chul E. Kim and
Azriel Rosenfeld},
title = {Digital Straightness and Convexity (Extended Abstract)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {80--89},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802460},
doi = {10.1145/800076.802460},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KimR81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/King81,
author = {K. N. King},
title = {Measures of Parallelism in Alternating Computation Trees (Extended
Abstract)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {189--201},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802472},
doi = {10.1145/800076.802472},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/King81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KleitmanLLM81,
author = {Daniel J. Kleitman and
Frank Thomson Leighton and
Margaret Lepley and
Gary L. Miller},
title = {New Layouts for the Shuffle-Exchange Graph (Extended Abstract)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {278--292},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802480},
doi = {10.1145/800076.802480},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KleitmanLLM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kosaraju81,
author = {S. Rao Kosaraju},
title = {Localized Search in Sorted Lists},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {62--69},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802458},
doi = {10.1145/800076.802458},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kosaraju81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KrishnamurthyM81,
author = {Balakrishnan Krishnamurthy and
Robert N. Moll},
title = {Examples of Hard Tautologies in the Propositional Calculus},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {28--37},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802454},
doi = {10.1145/800076.802454},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KrishnamurthyM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Leivant81,
author = {Daniel Leivant},
title = {The Complexity of Parameter Passing in Polymorphic Procedures (or:
Programming Language Theorems Independent of Very Strong Theories)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {38--45},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802455},
doi = {10.1145/800076.802455},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Leivant81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiptonS81,
author = {Richard J. Lipton and
Robert Sedgewick},
title = {Lower Bounds for {VLSI}},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {300--307},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802482},
doi = {10.1145/800076.802482},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LiptonS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Mayr81,
author = {Ernst W. Mayr},
title = {An Algorithm for the General Petri Net Reachability Problem},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {238--246},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802477},
doi = {10.1145/800076.802477},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Mayr81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MonienS81,
author = {Burkhard Monien and
Ivan Hal Sudborough},
title = {Bandwidth Constrained NP-Complete Problems},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {207--217},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802474},
doi = {10.1145/800076.802474},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MonienS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MullerS81,
author = {David E. Muller and
Paul E. Schupp},
title = {Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability
Problems},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {46--54},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802456},
doi = {10.1145/800076.802456},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MullerS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Orlin81,
author = {James B. Orlin},
title = {The Complexity of Dynamic Languages and Dynamic Optimization Problems},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {218--227},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802475},
doi = {10.1145/800076.802475},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Orlin81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Parisi-Presicce81,
author = {Francesco Parisi{-}Presicce},
title = {On the Faithful Regular Extensions of Iterative Algebras},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {368--374},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802491},
doi = {10.1145/800076.802491},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Parisi-Presicce81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatersonRS81,
author = {Mike Paterson and
Walter L. Ruzzo and
Lawrence Snyder},
title = {Bounds on Minimax Edge Length for Complete Binary Trees (Extended
Abstract)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {293--299},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802481},
doi = {10.1145/800076.802481},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PatersonRS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ReifS81,
author = {John H. Reif and
Paul G. Spirakis},
title = {Distributed Algorithms for Synchronizing Interprocess Communication
within Real Time},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {133--145},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802467},
doi = {10.1145/800076.802467},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ReifS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Simon81,
author = {Janos Simon},
title = {Space-Bounded Probabilistic Turing Machine Complexity Classes Are
Closed under Complement (Preliminary Version)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {158--167},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802469},
doi = {10.1145/800076.802469},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Simon81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SleatorT81,
author = {Daniel Dominic Sleator and
Robert Endre Tarjan},
title = {A Data Structure for Dynamic Trees},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {114--122},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802464},
doi = {10.1145/800076.802464},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SleatorT81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Streett81,
author = {Robert S. Streett},
title = {Propositional Dynamic Logic of Looping and Converse},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {375--383},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802492},
doi = {10.1145/800076.802492},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Streett81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/UkkonenS81,
author = {Esko Ukkonen and
Eljas Soisalon{-}Soininen},
title = {LALR(k) Testing is PSPACE-Complete},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {202--206},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802473},
doi = {10.1145/800076.802473},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/UkkonenS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ValiantB81,
author = {Leslie G. Valiant and
Gordon J. Brebner},
title = {Universal Schemes for Parallel Communication},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {263--277},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802479},
doi = {10.1145/800076.802479},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ValiantB81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yannakakis81,
author = {Mihalis Yannakakis},
title = {Issues of Correctness in Database Concurrency Control by Locking},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {363--367},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802490},
doi = {10.1145/800076.802490},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yannakakis81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yao81,
author = {Andrew Chi{-}Chih Yao},
title = {On the Parallel Computation for the Knapsack Problem},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {123--127},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802465},
doi = {10.1145/800076.802465},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yao81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yao81a,
author = {Andrew Chi{-}Chih Yao},
title = {The Entropic Limitations on {VLSI} Computations (Extended Abstract)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {308--311},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802483},
doi = {10.1145/800076.802483},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Yao81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC13,
title = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
publisher = {{ACM}},
year = {1981},
timestamp = {Mon, 17 Oct 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/STOC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-24 12:41 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:
