- 1993
- William Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao:
Approximate load balancing on dynamic and asynchronous networks. STOC 1993: 632-641 - Eric Allender, Jia Jiao:
Depth reduction for noncommutative arithmetic circuits. STOC 1993: 515-522 - Noga Alon, Fan R. K. Chung, Ronald L. Graham:
Routing permutations on graphs via matchings. STOC 1993: 583-591 - Rajeev Alur, Thomas A. Henzinger, Moshe Y. Vardi:
Parametric real-time reasoning. STOC 1993: 592-601 - Sigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell:
Checking approximate computations over the reals. STOC 1993: 786-795 - James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts:
On-line load balancing with applications to machine scheduling and virtual circuit routing. STOC 1993: 623-631 - Baruch Awerbuch, Yair Bartal, Amos Fiat:
Competitive distributed file allocation. STOC 1993: 164-173 - Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese:
Time optimal self-stabilizing synchronization. STOC 1993: 652-661 - Brenda S. Baker:
A theory of parameterized pattern matching: algorithms and applications. STOC 1993: 71-80 - Greg Barnes, Uriel Feige:
Short random walks on graphs. STOC 1993: 728-737 - Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel:
Proportionate progress: a notion of fairness in resource allocation. STOC 1993: 345-354 - Giuseppe Di Battista, Luca Vismara:
Angles of planar triangular graphs. STOC 1993: 431-437 - Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell
:
Efficient probabilistically checkable proofs and applications to approximations. STOC 1993: 294-304 - Michael Ben-Or, Ran Canetti, Oded Goldreich:
Asynchronous secure computation. STOC 1993: 52-61 - Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Thermodynamics of computation and information distance. STOC 1993: 21-30 - Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Piecewise linear paths among convex obstacles. STOC 1993: 505-514 - Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan:
On-line algorithms for cache sharing. STOC 1993: 422-430 - Ethan Bernstein, Umesh V. Vazirani:
Quantum complexity theory. STOC 1993: 11-20 - Robert D. Blumofe, Charles E. Leiserson:
Space-efficient scheduling of multithreaded computations. STOC 1993: 362-371 - Hans L. Bodlaender:
A linear time algorithm for finding tree-decompositions of small treewidth. STOC 1993: 226-234 - Ravi B. Boppana, Babu O. Narayanan:
The biased coin problem. STOC 1993: 252-257 - Ryan S. Borgstrom, S. Rao Kosaraju:
Comparison-based search in the presence of errors. STOC 1993: 130-136 - Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal:
How much can hardware help routing? STOC 1993: 573-582 - Elizabeth Borowsky, Eli Gafni:
Generalized FLP impossibility result for t-resilient asynchronous computations. STOC 1993: 91-100 - Ran Canetti, Tal Rabin:
Fast asynchronous Byzantine agreement with optimal resilience. STOC 1993: 42-51 - Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, Manfred K. Warmuth:
How to use expert advice. STOC 1993: 382-391 - Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan:
Randomness-optimal unique element isolation, with applications to perfect matching and related problems. STOC 1993: 458-467 - Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Improved bounds on weak epsilon-nets for convex sets. STOC 1993: 495-504 - Arthur W. Chou, Ker-I Ko:
Some complexity issues on the simply connected regions of the two-dimensional plane. STOC 1993: 1-10 - Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber:
Markov chains, computer proofs, and average-case analysis of best fit bin packing. STOC 1993: 412-421
