share record
persistent URL:
Sorin Istrail : Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract). STOC 1988 : 491-503 share record
persistent URL:
Mark Jerrum , Alistair Sinclair : Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version). STOC 1988 : 235-244 export record
dblp key:
conf/stoc/KalyanasundaramS88 share record
persistent URL:
Bala Kalyanasundaram , Georg Schnitger : On the Power of White Pebbles (Extended Abstract). STOC 1988 : 258-266 share record
persistent URL:
Sampath Kannan , Moni Naor , Steven Rudich : Implicit Representation of Graphs. STOC 1988 : 334-343 share record
persistent URL:
Mauricio Karchmer , Avi Wigderson : Monotone Circuits for Connectivity Require Super-logarithmic Depth. STOC 1988 : 539-550 share record
persistent URL:
Howard J. Karloff , Prabhakar Raghavan : Randomized Algorithms and Pseudorandom Numbers. STOC 1988 : 310-321 share record
persistent URL:
Richard M. Karp , Yanjun Zhang : A Randomized Parallel Branch-and-Bound Procedure. STOC 1988 : 290-300 share record
persistent URL:
Michael J. Kearns , Ming Li : Learning in the Presence of Malicious Errors (Extended Abstract). STOC 1988 : 267-280 share record
persistent URL:
Joe Kilian : Founding Cryptography on Oblivious Transfer. STOC 1988 : 20-31 share record
persistent URL:
Valerie King : Lower Bounds on the Complexity of Graph Properties. STOC 1988 : 468-476 share record
persistent URL:
Ker-I Ko : Relativized Polynominal Time Hierarchies Having Exactly K Levels. STOC 1988 : 245-253 share record
persistent URL:
S. Rao Kosaraju , Gregory F. Sullivan : Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version). STOC 1988 : 398-406 share record
persistent URL:
Danny Krizanc , David Peleg , Eli Upfal : A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract). STOC 1988 : 93-102 share record
persistent URL:
Martin Loebl , Jaroslav Nesetril : Linearity and Unprovability of Set Union Problem Strategies. STOC 1988 : 360-366 share record
persistent URL:
George S. Lueker , Mariko Molodowitch : More Analysis of Double Hashing. STOC 1988 : 354-359 share record
persistent URL:
Mark S. Manasse , Lyle A. McGeoch , Daniel Dominic Sleator : Competitive Algorithms for On-line Problems. STOC 1988 : 322-333 share record
persistent URL:
James B. Orlin : A Faster Strongly Polynominal Minimum Cost Flow Algorithm. STOC 1988 : 377-387 export record
dblp key:
conf/stoc/PapadimitriouY88a share record
persistent URL:
Christos H. Papadimitriou , Mihalis Yannakakis : Optimization, Approximation, and Complexity Classes (Extended Abstract). STOC 1988 : 229-234 export record
dblp key:
conf/stoc/PapadimitriouY88b share record
persistent URL:
Christos H. Papadimitriou , Mihalis Yannakakis : Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract). STOC 1988 : 510-513 share record
persistent URL:
David Peleg , Eli Upfal : A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract). STOC 1988 : 43-52 share record
persistent URL:
Janos Pintz , William L. Steiger , Endre Szemerédi : Two Infinite Sets of Primes with Fast Primality Tests. STOC 1988 : 504-509 share record
persistent URL:
Pravin M. Vaidya : Geometry Helps in Matching (Extended Abstract). STOC 1988 : 422-425 share record
persistent URL:
Ramarathnam Venkatesan , Leonid A. Levin : Random Instances of a Graph Coloring Problem Are Hard. STOC 1988 : 217-222 share record
persistent URL:
Mihalis Yannakakis : Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract). STOC 1988 : 223-228 share record
persistent URL:
Janos Simon : Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA. ACM 1988 , ISBN 0-89791-264-0 [contents]