Journal of Algorithms, Volume 9

Volume 9, Number 1, March 1988

William M. Kantor, D. E. Taylor: Polynomial-Time Versions of Sylow's Theorem. 1-17 BibTeX
John Hershberger, Leonidas J. Guibas: An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. 18-46 BibTeX
Claus-Peter Schnorr: A More Efficient Algorithm for Lattice Basis Reduction. 47-62 BibTeX
Jonathan S. Turner: Almost All k-Colorable Graphs are Easy to Color. 63-82 BibTeX
Mauricio Karchmer, Joseph Naor: A Fast Parallel Algorithm to Color a Graph with Delta Colors. 83-91 BibTeX
Xin He, Yaacov Yesha: Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs. 92-113 BibTeX
Charles E. Leiserson, James B. Saxe: A Mixed-Integer Linear Programming Problem which is Efficiently Solvable. 114-128 BibTeX
Jeffrey H. Kingston: A New Proof of the Garsia-Wachs Algorithm. 129-136 BibTeX
Michael Kaminski: An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants. 137-147 BibTeX

Franz Aurenhammer: Improved Algorithms for Discs and Balls Using Power Diagrams. 151-161 BibTeX
Frank Ruskey: Adjacent Interchange Generation of Combinations. 162-180 BibTeX
Alan M. Frieze: An Algorithm for Finding Hamilton Cycles in Random Directed Graphs. 181-204 BibTeX
Danny Soroker: Fast Parallel Strong Orientation of Mixed Graphs and Related Augmentation Problems. 205-223 BibTeX
Wojciech Szpankowski: Some Results on V-ary Asymmetric Tries. 224-244 BibTeX
James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore: Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. 245-253 BibTeX
Mark H. Overmars: Efficient Data Structures for Range Searching on a Grid. 254-275 BibTeX
Danny Soroker: Fast Parallel Algorithms for Finding Hamiltonian Paths and Cycles in a Tournament. 276-286 BibTeX
Manfred Kunde, Michael A. Langston, Jin-Ming Liu: On a Special Case of Uniform Processor Scheduling. 287-296 BibTeX

Vijaya Ramachandran: Finding a Minimum Feedback Arc Set in Reducible Flow Graphs. 299-313 BibTeX
Martin Charles Golumbic, Peter L. Hammer: Stability in Circular Arc Graphs. 314-320 BibTeX
Alejandro A. Schäffer: A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm. 321-342 BibTeX
Harold Greenberg: Solution to a Linear Diophantine Equation for Nonnegative Integers. 343-353 BibTeX
Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty: Addition Requirements for Matrix and Transposed Matrix Products. 354-364 BibTeX
Arnold Schönhage: Probabilistic Computation of Integer Polynomial GCDs. 365-371 BibTeX
Mark H. Overmars, Derick Wood: On Rectangular Visibility. 372-390 BibTeX
Lajos Rónyai: Factoring Polynomials Over Finite Fields. 391-400 BibTeX
Ying Cheng, Frank K. Hwang: Diameters of Weighted Double Loop Networks. 401-410 BibTeX
Harold N. Gabow, Robert Endre Tarjan: Algorithms for Two Bottleneck Optimization Problems. 411-417 BibTeX
Robert E. Wilber: The Concave Least-Weight Subsequence Problem Revisited. 418-425 BibTeX
David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 426-444 BibTeX

Binay K. Bhattacharya, J. Zorbas: Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot. 449-469 BibTeX
Hanoch Levy, David W. Low: A Contraction Algorithm for Finding Small Cycle Cutsets. 470-493 BibTeX
Lajos Rónyai: Zero Divisors in Quaternion Algebras. 494-506 BibTeX
Joseph Cheriyan, S. N. Maheshwari: Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. 507-537 BibTeX
Ingo Althöfer: On the Complexity of Searching Game Trees and Other Recursion Trees. 538-567 BibTeX
Reuven Bar-Yehuda, Shay Kutten: Fault Tolerant Distributed Majority Commitment. 568-582 BibTeX
Oded Maimon: An Algorithm for the Lorenz Measure in Locational Decisions on Trees. 583-596 BibTeX
Stephan Olariu, S. Toida, M. Zubair: On a Conjecture by Plaisted and Hong. 597-598 BibTeX