Journal of Algorithms, Volume 3

Volume 3, Number 1, March 1982

J. Michael Steele, Andrew Chi-Chih Yao: Lower Bounds for Algebraic Decision Trees. 1-8 BibTeX
Selim G. Akl, Henk Meijer: On the Average-Case Complexity of "Bucketing" Algorithms. 9-13 BibTeX
Danny Dolev: The Byzantine Generals Strike Again. 14-30 BibTeX
R. Tolimieri: A Nonquadratic Minimal Algorithm for a System of Quadratic Forms. 41-40 BibTeX
Paul Klingsberg: A Gray Code for Compositions. 41-44 BibTeX
Oscar H. Ibarra, Shlomo Moran, Roger Hui: A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications. 45-56 BibTeX
Yossi Shiloach, Uzi Vishkin: An O(log n) Parallel Connectivity Algorithm. 57-67 BibTeX
Michael L. Fredman, Dennis J. Volper: The Complexity of Partial Match Retrieval in a Dynamic Setting. 68-78 BibTeX
Martin Aigner: Parallel Complexity of Sorting Problems. 79-88 BibTeX
David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 89-99 BibTeX

Claus-Peter Schnorr: Refined Analysis and Improvements on Some Factoring Algorithms. 101-127 BibTeX
Yossi Shiloach, Uzi Vishkin: An O(n² log n) Parallel MAX-FLOW Algorithm. 128-146 BibTeX
Robert N. Goldberg: Minimal String Difference Encodings. 147-156 BibTeX
Costas S. Iliopoulos: Analysis of an Algorithm for Composition of Binary Quadratic Forms. 157-159 BibTeX
Vijay K. Vaishnavi, Derick Wood: Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization. 160-176 BibTeX
Leonidas J. Guibas: Problems. 177-181 BibTeX
David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 182-195 BibTeX

Maurice Mignotte: Identification of Algebraic Numbers. 197-204 BibTeX
Barry K. Rosen: Robust Linear Algorithms for Cutsets. 205-217 BibTeX
D. T. Lee, Franco P. Preparata: An Improved Algorithm for the Rectangle Enclosure Problem. 218-224 BibTeX
Karl J. Lieberherr: Algorithmic Extremal Problems in Combinatorial Optimization. 225-244 BibTeX
Danny Dolev, Maria M. Klawe, Michael Rodeh: An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle. 245-260 BibTeX
Jeffrey Scott Vitter: Deletion Algorithms for Hashing That Preserve Randomness. 261-275 BibTeX
Gary D. Knott: Fixed-Bucket Binary Storage Trees. 276-287 BibTeX
David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 288-300 BibTeX
Witold Lipski Jr., Franco P. Preparata: Corrigendum: Finding the Contour of a Union of Iso-Oriented Rectangles. 301-302 BibTeX , ->J. Algorithms 1(3): 235-246(1980) BibTeX

Brenda S. Baker, Edward G. Coffman Jr.: A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation. 303-316 BibTeX
Deborah S. Franzblau, Doron Zeilberger: A Bijective Proof of the Hook-Length Formula. 317-343 BibTeX
Kazuo Nakajima, S. Louis Hakimi: Complexity Results for Scheduling Tasks with Discrete Starting Times. 344-361 BibTeX
Leonidas J. Guibas: Problems. 362-380 BibTeX
David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 381-395 BibTeX