- Robert F. Cohen, Giuseppe Di Battista, Arkady Kanevsky, Roberto Tamassia:
Reinventing the wheel: an optimal data structure for connectivity queries. STOC 1993: 194-200 - Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
:
Multi-scale self-simulation: a technique for reconfiguring arrays with faults. STOC 1993: 561-572 - Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC 1993: 305-314 - Jason Cooper, Nathan Linial:
Fast perfection-information leader-election protocol with linear immunity. STOC 1993: 662-671 - Cynthia Dwork, Maurice Herlihy, Orli Waarts:
Contention in shared memory algorithms. STOC 1993: 174-183 - Jeff Edmonds:
Time-space trade-offs for undirected st-connectivity on a JAG. STOC 1993: 718-727 - David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer:
Separator based sparsification for dynamic planar graph algorithms. STOC 1993: 208-217 - Martin Farach, Sampath Kannan, Tandy J. Warnow:
A robust model for finding optimal evolutionary trees. STOC 1993: 137-145 - Tomás Feder, Moshe Y. Vardi:
Monotone monadic SNP and constraint satisfaction. STOC 1993: 612-622 - Anja Feldmann, Ming-Yang Kao, Jirí Sgall, Shang-Hua Teng:
Optimal online scheduling of parallel jobs with dependencies. STOC 1993: 642-651 - Stefan Felsner, Lorenz Wernisch:
Maximum k-chains in planar point sets: combinatorial structure and algorithms. STOC 1993: 146-153 - Rudolf Fleischer:
Decision trees: old and new results. STOC 1993: 468-477 - Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie:
Efficient learning of typical finite automata from random walks. STOC 1993: 315-324 - Juan A. Garay, Yoram Moses:
Fully polynomial Byzantine agreement in t+1 rounds. STOC 1993: 31-41 - Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis:
Approximate max-flow min-(multi)cut theorems and their applications. STOC 1993: 698-707 - Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski:
Counting curves and their projections. STOC 1993: 805-812 - Leslie Ann Goldberg:
Polynomial space polynomial delay algorithms for listing families of graphs. STOC 1993: 218-225 - Mikael Goldmann, Marek Karpinski:
Simulating threshold circuits by majority circuits. STOC 1993: 551-560 - Maurice Herlihy, Nir Shavit:
The asynchronous computability theorem for t-resilient tasks. STOC 1993: 111-120 - John Hershberger, Subhash Suri:
Matrix searching with the shortest path metric. STOC 1993: 485-494 - Ramana M. Idury, Alejandro A. Schäffer:
Multiple matching of rectangular patterns. STOC 1993: 81-90 - Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks:
Size-depth trade-offs for threshold circuits. STOC 1993: 541-550 - Tao Jiang, Ming Li:
k one-way heads cannot do string-matching. STOC 1993: 62-70 - Neil D. Jones:
Constant time factors do matter. STOC 1993: 602-611 - Mauricio Karchmer, Avi Wigderson:
Characterizing non-deterministic circuit size. STOC 1993: 532-540 - David R. Karger, Clifford Stein:
An O~(n2) algorithm for minimum cuts. STOC 1993: 757-765 - Richard M. Karp:
Mapping the genome: some combinatorial problems arising in molecular biology. STOC 1993: 278-285 - Michael J. Kearns:
Efficient noise-tolerant learning from statistical queries. STOC 1993: 392-401 - Claire Kenyon, Dana Randall, Alistair Sinclair:
Matchings in lattice graphs. STOC 1993: 738-746 - Michael Kharitonov:
Cryptographic hardness of distribution-specific learning. STOC 1993: 372-381
