- 1989
- Karl R. Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, David G. Kirkpatrick:
The Bit Complexity of Randomized Leader Election on a Ring. SIAM J. Comput. 18(1): 12-29 (1989) - Ravindra K. Ahuja, James B. Orlin, Robert Endre Tarjan:
Improved Time Bounds for the Maximum Flow Problem. SIAM J. Comput. 18(5): 939-954 (1989) - Noga Alon, Yossi Azar:
Finding an Approximate Maximum. SIAM J. Comput. 18(2): 258-267 (1989) - Shoshana Anily, Refael Hassin:
Ranking the Best Binary Trees. SIAM J. Comput. 18(5): 882-892 (1989) - Mikhail J. Atallah, Richard Cole, Michael T. Goodrich:
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. SIAM J. Comput. 18(3): 499-532 (1989) - Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman:
Bounds on Universal Sequences. SIAM J. Comput. 18(2): 268-277 (1989) - Francisco Barahona, Éva Tardos:
Note on Weintraub's Minimum-Cost Circulation Algorithm. SIAM J. Comput. 18(3): 579-583 (1989) - Charles H. Bennett:
Time/Space Trade-Offs for Reversible Computation. SIAM J. Comput. 18(4): 766-776 (1989) - David Bernstein, Jeffrey M. Jaffe, Michael Rodeh:
Scheduling Arithmetic and Load Operations in Parallel with No Spilling. SIAM J. Comput. 18(6): 1098-1127 (1989) - Gianfranco Bilardi, Alexandru Nicolau:
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines. SIAM J. Comput. 18(2): 216-228 (1989) - Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo
, Martin Tompa:
Two Applications of Inductive Counting for Complementation Problems. SIAM J. Comput. 18(3): 559-578 (1989) - Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa:
Erratum: Two Applications of Inductive Counting for Complementation Problems. SIAM J. Comput. 18(6): 1283 (1989) - Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
A New Base Change Algorithm for Permutation Groups. SIAM J. Comput. 18(5): 1037-1047 (1989) - Nader H. Bshouty:
A Lower Bound for Matrix Multiplication. SIAM J. Comput. 18(4): 759-765 (1989) - Khaled M. Bugrara, Youfang Pan, Paul Walton Purdom Jr.:
Exponential Average Time for the Pure Literal Rule. SIAM J. Comput. 18(2): 409-418 (1989) - Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung:
The Boolean Hierarchy II: Applications. SIAM J. Comput. 18(1): 95-111 (1989) - Edward P. F. Chan:
A Design Theory for Solving the Anomalies Problem. SIAM J. Comput. 18(3): 429-448 (1989) - Ming-Syan Chen, Kang G. Shin:
On Relaxed Squashed Embedding of Graphs into a Hypercube. SIAM J. Comput. 18(6): 1226-1244 (1989) - Joseph Cheriyan, S. N. Maheshwari:
Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput. 18(6): 1057-1086 (1989) - Guy W. Cherry:
An Analysis of the Rational Exponential Integral. SIAM J. Comput. 18(5): 893-905 (1989) - Michael Clausen:
Fast Fourier Transforms for Metabelian Groups. SIAM J. Comput. 18(3): 584-593 (1989) - Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer:
The Distributed Firing Squad Problem. SIAM J. Comput. 18(5): 990-1012 (1989) - Edward G. Coffman Jr., J. C. Lagarias:
Algorithms for Packing Squares: A Probabilistic Analysis. SIAM J. Comput. 18(1): 166-185 (1989) - Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi:
An Optimal-Time Algorithm for Slope Selection. SIAM J. Comput. 18(4): 792-810 (1989) - Karel Culík II, Jan K. Pachl, Sheng Yu:
On the Limit Sets of Cellular Automata. SIAM J. Comput. 18(4): 831-842 (1989) - Ernst-Erich Doberkat:
Topological Completeness in an Ideal Model for Polymorphic Types. SIAM J. Comput. 18(5): 977-989 (1989) - Wayne Eberly:
Very Fast Parallel Polynomial Arithmetic. SIAM J. Comput. 18(5): 955-976 (1989) - Greg N. Frederickson, Ravi Janardan:
Efficient Message Routing in Planar Networks. SIAM J. Comput. 18(4): 843-857 (1989) - Greg N. Frederickson, Mandayam A. Srinivas:
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems. SIAM J. Comput. 18(1): 112-138 (1989) - Merrick L. Furst, Ravi Kannan:
Succinct Certificates for Almost All Subset Sum Problems. SIAM J. Comput. 18(3): 550-558 (1989)
