- Philip N. Klein, Serge A. Plotkin, Satish Rao:
Excluded minors, network decomposition, and multicommodity flow. STOC 1993: 682-690 - Daphne Koller, Nimrod Megiddo:
Constructing small sample spaces satisfying given constraints. STOC 1993: 268-277 - Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman:
Lower bounds for randomized mutual exclusion. STOC 1993: 154-163 - Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman:
Efficient construction of a small hitting set for combinatorial rectangles in high dimension. STOC 1993: 258-267 - Michael Luby, Noam Nisan
:
A parallel approximation algorithm for positive linear programming. STOC 1993: 448-457 - Carsten Lund, Mihalis Yannakakis:
On the hardness of approximating minimization problems. STOC 1993: 286-293 - Wolfgang Maass:
Bounds for the computational power and learning complexity of analog neural nets. STOC 1993: 335-344 - Angus Macintyre, Eduardo D. Sontag:
Finiteness results for sigmoidal "neural" networks. STOC 1993: 325-334 - Jirí Matousek, Otfried Schwarzkopf:
A deterministic algorithm for the three-dimensional diameter problem. STOC 1993: 478-484 - Moni Naor, Larry J. Stockmeyer:
What can be computed locally? STOC 1993: 184-193 - Noam Nisan, David Zuckerman:
More deterministic simulation in logspace. STOC 1993: 235-244 - Christos H. Papadimitriou, Mihalis Yannakakis:
Linear programming without the matrix. STOC 1993: 121-129 - James K. Park, Cynthia A. Phillips:
Finding minimum-quotient cuts in planar graphs. STOC 1993: 766-775 - Cynthia A. Phillips:
The network inhibition problem. STOC 1993: 776-785 - Steven J. Phillips, Jeffery R. Westbrook:
Online load balancing and network flow. STOC 1993: 402-411 - Nicholas Pippenger:
Self-routing superconcentrators. STOC 1993: 355-361 - Serge A. Plotkin, Éva Tardos:
Improved bounds on the max-flow min-cut ratio for multicommodity flows. STOC 1993: 691-697 - Pavel Pudlák, Vojtech Rödl:
Modified ranks of tensors and the size of circuits. STOC 1993: 523-531 - Charles Rackoff, Daniel R. Simon:
Cryptographic defense against traffic analysis. STOC 1993: 672-681 - R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
Many birds with one stone: multi-objective approximation algorithms. STOC 1993: 438-447 - Michael E. Saks, Fotios Zaharoglou:
Wait-free k-set agreement is impossible: the topology of public knowledge. STOC 1993: 101-110 - Leonard J. Schulman:
Deterministic coding for interactive communication. STOC 1993: 747-756 - Adi Shamir:
On the generation of multivariate polynomials which are hard to factor. STOC 1993: 796-804 - Mario Szegedy, Sundar Vishwanathan:
Locality based graph coloring. STOC 1993: 201-207 - Avi Wigderson, David Zuckerman:
Expanders that beat the eigenvalue bound: explicit construction and applications. STOC 1993: 245-251 - David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani:
A primal-dual approximation algorithm for generalized Steiner network problems. STOC 1993: 708-717 - S. Rao Kosaraju, David S. Johnson, Alok Aggarwal:
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA. ACM 1993, ISBN 0-89791-591-7 [contents]
