1988 share record
persistent URL:
Leonard M. Adleman , Kireeti Kompella : Using Smoothness to Achieve Parallelism (Abstract). STOC 1988 : 528-538 share record
persistent URL:
Alok Aggarwal , Ashok K. Chandra : Virtual Memory Algorithms (Preliminary Version). STOC 1988 : 173-185 share record
persistent URL:
Alok Aggarwal , Ashok K. Chandra , Prabhakar Raghavan : Energy Consumption in VLSI Circuits (Preliminary Version). STOC 1988 : 205-216 share record
persistent URL:
Mihir Bellare , Silvio Micali : How to Sign Given Any Trapdoor Function (Extended Abstract). STOC 1988 : 32-42 share record
persistent URL:
Michael Ben-Or , Richard Cleve : Computing Algebraic Formulas Using a Constant Number of Registers. STOC 1988 : 254-257 share record
persistent URL:
Michael Ben-Or , Shafi Goldwasser , Joe Kilian , Avi Wigderson : Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. STOC 1988 : 113-131 share record
persistent URL:
Michael Ben-Or , Shafi Goldwasser , Avi Wigderson : Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). STOC 1988 : 1-10 share record
persistent URL:
Michael Ben-Or , Prasoon Tiwari : A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract). STOC 1988 : 301-309 share record
persistent URL:
Piotr Berman , Janos Simon : Investigations of Fault-Tolerant Networks of Computers (Preliminary Version). STOC 1988 : 66-77 share record
persistent URL:
Sandeep N. Bhatt , Fan R. K. Chung , Jia-Wei Hong , Frank Thomson Leighton , Arnold L. Rosenberg : Optimal Simulations by Butterfly Networks (Preliminary Version). STOC 1988 : 192-204 share record
persistent URL:
Manuel Blum , Paul Feldman , Silvio Micali : Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract). STOC 1988 : 103-112 share record
persistent URL:
Andrei Z. Broder : Errata to "How hard is to marry at random? (On the approximation of the permanent)". STOC 1988 : 551 share record
persistent URL:
John F. Canny : Some Algebraic and Geometric Computations in PSPACE. STOC 1988 : 460-467 share record
persistent URL:
David Chaum , Claude Crépeau , Ivan Damgård : Multiparty Unconditionally Secure Protocols (Extended Abstract). STOC 1988 : 11-19 export record
dblp key:
conf/stoc/CosmadakisGKV88 share record
persistent URL:
Stavros S. Cosmadakis , Haim Gaifman , Paris C. Kanellakis , Moshe Y. Vardi : Decidable Optimization Problems for Database Logic Programs (Preliminary Report). STOC 1988 : 477-490 share record
persistent URL:
Danny Dolev , Eli Gafni , Nir Shavit : Toward a Non-Atomic Era: \ell-Exclusion as a Test Case. STOC 1988 : 78-92 share record
persistent URL:
Tomás Feder , Daniel H. Greene : Optimal Algorithms for Approximate Clustering. STOC 1988 : 434-444 share record
persistent URL:
Paul Feldman , Silvio Micali : Optimal Algorithms for Byzantine Agreement. STOC 1988 : 148-161 share record
persistent URL:
Amos Fiat , Moni Naor , Jeanette P. Schmidt , Alan Siegel : Non-Oblivious Hashing (Extended Abstract). STOC 1988 : 367-376 share record
persistent URL:
Amos Fiat , Moni Naor , Alejandro A. Schäffer , Jeanette P. Schmidt , Alan Siegel : Storing and Searching a Multikey Table (Extended Abstract). STOC 1988 : 344-353 share record
persistent URL:
Steven Fortune , Gordon T. Wilfong : Planning Constrained Motion. STOC 1988 : 445-459 share record
persistent URL:
Hubert de Fraysseix , János Pach , Richard Pollack : Small Sets Supporting Fáry Embeddings of Planar Graphs. STOC 1988 : 426-433 share record
persistent URL:
Harold N. Gabow , Robert Endre Tarjan : Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems. STOC 1988 : 514-527 share record
persistent URL:
Harold N. Gabow , Herbert H. Westermann : Forests, Frames and Games: Algorithms for Matroid Sums and Applications. STOC 1988 : 407-421 share record
persistent URL:
Andrew V. Goldberg , Robert Endre Tarjan : Finding Minimum-Cost Circulations by Canceling Negative Cycles. STOC 1988 : 388-397 share record
persistent URL:
Yuri Gurevich , Saharon Shelah : Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space. STOC 1988 : 281-289 share record
persistent URL:
András Hajnal , Wolfgang Maass , György Turán : On the Communication Complexity of Graph Properties. STOC 1988 : 186-191 share record
persistent URL:
Joseph Y. Halpern , Yoram Moses , Mark R. Tuttle : A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report). STOC 1988 : 132-147 share record
persistent URL:
Joseph Y. Halpern , Moshe Y. Vardi : Reasoning about Knowledge and Time in Asynchronous Systems. STOC 1988 : 53-65 share record
persistent URL:
Bernd Halstenberg , Rüdiger Reischuk : On Different Modes of Communication (Extended Abstract). STOC 1988 : 162-172