- Franco P. Preparata, Roberto Tamassia:
Fully Dynamic Point Location in a Monotone Subdivision. SIAM J. Comput. 18(4): 811-830 (1989) - Sanguthevar Rajasekaran, John H. Reif:
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. SIAM J. Comput. 18(3): 594-607 (1989) - David Rappaport:
Computing Simple Circuits from a Set of Line Segments is NP-Complete. SIAM J. Comput. 18(6): 1128-1139 (1989) - Bala Ravikumar, Oscar H. Ibarra:
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation. SIAM J. Comput. 18(6): 1263-1282 (1989) - James Renegar:
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials. SIAM J. Comput. 18(2): 350-370 (1989) - Wansoo T. Rhee, Michel Talagrand:
Optimal Bin Packing with Items of Random Sizes II. SIAM J. Comput. 18(1): 139-151 (1989) - Wansoo T. Rhee, Michel Talagrand:
Optimal Bin Packing with Items of Random Sizes III. SIAM J. Comput. 18(3): 473-486 (1989) - Wansoo T. Rhee, Michel Talagrand:
Optimal Bin Covering with Items of Random Size. SIAM J. Comput. 18(3): 487-498 (1989) - Wansoo T. Rhee, Michel Talagrand:
The Complete Convergence of Best Fit Decreasing. SIAM J. Comput. 18(5): 909-918 (1989) - Wansoo T. Rhee, Michel Talagrand:
The Complete Convergence of First Fit Decreasing. SIAM J. Comput. 18(5): 919-938 (1989) - Manfred Schimmler, Christoph Starke:
A Correction Network for N-Sorters. SIAM J. Comput. 18(6): 1179-1187 (1989) - Barbara B. Simons, Manfred K. Warmuth:
A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs. SIAM J. Comput. 18(4): 690-710 (1989) - J. Michael Steele, Timothy Law Snyder:
Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization. SIAM J. Comput. 18(2): 278-287 (1989) - Shouwen Tang, Osamu Watanabe:
On Tally Relativizations of BP-Complexity Classes. SIAM J. Comput. 18(3): 449-462 (1989) - Pravin M. Vaidya:
Space-Time Trade-Offs for Orthogonal Range Queries. SIAM J. Comput. 18(4): 748-758 (1989) - Pravin M. Vaidya:
Geometry Helps in Matching. SIAM J. Comput. 18(6): 1201-1225 (1989) - Umesh V. Vazirani, Vijay V. Vazirani:
The Two-Processor Scheduling Problem is in Random NC. SIAM J. Comput. 18(6): 1140-1148 (1989) - H. Venkateswaran, Martin Tompa:
A New Pebble Game That Characterizes Parallel Complexity Classes. SIAM J. Comput. 18(3): 533-549 (1989) - Rakesh M. Verma
, Steven W. Reyner:
An Analysis of a Good Algorithm for the Subtree Problem, Corrected. SIAM J. Comput. 18(5): 906-908 (1989) - Jeffery R. Westbrook, Robert Endre Tarjan:
Amortized Analysis of Algorithms for Set Union with Backtracking. SIAM J. Comput. 18(1): 1-11 (1989) - Robert E. Wilber:
Lower Bounds for Accessing Binary Search Trees with Rotations. SIAM J. Comput. 18(1): 56-67 (1989) - Andrew Chi-Chih Yao:
On the Complexity of Partial Order Productions. SIAM J. Comput. 18(4): 679-689 (1989) - F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson:
Partitioning Space for Range Queries. SIAM J. Comput. 18(2): 371-384 (1989) - Kaizhong Zhang, Dennis E. Shasha:
Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems. SIAM J. Comput. 18(6): 1245-1262 (1989)