- Harold N. Gabow, Robert Endre Tarjan:
Faster Scaling Algorithms for Network Problems. SIAM J. Comput. 18(5): 1013-1036 (1989) - Zvi Galil, Stuart Haber, Moti Yung:
Minimum-Knowledge Interactive Proofs for Decision Problems. SIAM J. Comput. 18(4): 711-739 (1989) - Giorgio Gallo, Michael D. Grigoriadis, Robert Endre Tarjan:
A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. Comput. 18(1): 30-55 (1989) - Mark K. Goldberg, Thomas H. Spencer:
A New Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 18(2): 419-427 (1989) - Shafi Goldwasser, Silvio Micali, Charles Rackoff:
The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18(1): 186-208 (1989) - Torben Hagerup, Marek Chrobak, Krzysztof Diks:
Optimal Parallel 5-Colouring of Planar Graphs. SIAM J. Comput. 18(2): 288-300 (1989) - Johan Håstad
, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr:
Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. SIAM J. Comput. 18(5): 859-881 (1989) - Keith E. Humenik:
Ratio Estimators are Maximum-Likelihood Estimators for Non-Context-Free Grammars. SIAM J. Comput. 18(5): 1048-1055 (1989) - Jing-Jang Hwang, Yuan-Chieh Chow, Frank D. Anger, Chung-Yee Lee:
Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM J. Comput. 18(2): 244-257 (1989) - Costas S. Iliopoulos:
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix. SIAM J. Comput. 18(4): 658-669 (1989) - Costas S. Iliopoulos:
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations. SIAM J. Comput. 18(4): 670-678 (1989) - Neil Immerman:
Expressibility and Parallel Complexity. SIAM J. Comput. 18(3): 625-638 (1989) - Kazuo Iwama:
CNF Satisfiability Test by Counting and Polynomial Average Time. SIAM J. Comput. 18(2): 385-391 (1989) - Philippe Jacquet, Wojciech Szpankowski:
Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation. SIAM J. Comput. 18(4): 777-791 (1989) - Mark Jerrum, Alistair Sinclair:
Approximating the Permanent. SIAM J. Comput. 18(6): 1149-1178 (1989) - Ker-I Ko:
Relativized Polynomial Time Hierarchies Having Exactly K Levels. SIAM J. Comput. 18(2): 392-408 (1989) - Norbert Korte, Rolf H. Möhring:
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs. SIAM J. Comput. 18(1): 68-81 (1989) - George Labahn, Stanley Cabay:
Matrix Padé Fractions and Their Computation. SIAM J. Comput. 18(4): 639-657 (1989) - Richard E. Ladner
:
Polynomial Space Counting Problems. SIAM J. Comput. 18(6): 1087-1097 (1989) - Lawrence L. Larmore:
Minimum Delay Codes. SIAM J. Comput. 18(1): 82-94 (1989) - Joseph Y.-T. Leung, Gilbert H. Young:
Minimizing Schedule Length Subject to Minimum Flow Time. SIAM J. Comput. 18(2): 314-326 (1989) - Shuo-Yen Robert Li:
Dynamic Programming by Exchangeability. SIAM J. Comput. 18(3): 463-472 (1989) - Zhiyuan Li, Edward M. Reingold:
Solution of a Divide-and-Conquer Maximin Recurrence. SIAM J. Comput. 18(6): 1188-1200 (1989) - Thomas Lickteig:
A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras. SIAM J. Comput. 18(2): 209-215 (1989) - Riccardo Melen, Jonathan S. Turner:
Nonblocking Multirate Networks. SIAM J. Comput. 18(2): 301-313 (1989) - Joseph Naor, Moni Naor, Alejandro A. Schäffer:
Fast Parallel Algorithms for Chordal Graphs. SIAM J. Comput. 18(2): 327-349 (1989) - Graham H. Norton:
Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for GF(q)[x]. SIAM J. Comput. 18(3): 608-624 (1989) - Edward T. Ordman:
Minimal Threshold Separators and Memory Requirements for Synchronization. SIAM J. Comput. 18(1): 152-165 (1989) - David Peleg, Eli Upfal
:
The Token Distribution Problem. SIAM J. Comput. 18(2): 229-243 (1989) - David Peleg, Jeffrey D. Ullman:
An Optimal Synchronizer for the Hypercube. SIAM J. Comput. 18(4): 740-747 (1989)