Journal of Algorithms, Volume 4
Volume 4, Number 1, March 1983
Victor Y. Pan: The Additive and Logical Complexities of Linear and Bilinear Arithmetic Algorithms. 1-34- Uzi Vishkin: Implementation of Simultaneous Memory Address Access in Models That Forbid It. 45-50
- Greg N. Frederickson, Donald B. Johnson: Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures. 61-80
- Ephraim Feig: Minimal Algorithms for Bilinear Forms May Have Divisions. 81-84
- Leonidas J. Guibas: Problems. 85-86
- David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 87-100
Volume 4, Number 2, June 1983
- Ronald I. Becker, Yehoshua Perl: Shifting Algorithms for Tree Partitioning with General Weighting Functions. 101-120
- Binay K. Bhattacharya, Godfried T. Toussaint: Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. 121-136
- Ephraim Feig: Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic. 137-149
- Gregory Butler: Computing Normalizers in Permutation Groups. 163-175
- Leonidas J. Guibas: Problems. 176-188
- David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 189-203
Volume 4, Number 3, September 1983
- A. Guénoche: Random Spanning Tree. 214-220
- W. M. Beynon: A Formal Account of Some Elementary Continued Fraction Algorithms. 221-240
- Errol L. Lloyd: An O(n log m) Algorithm for the Josephus Problem. 262-270
- Eliezer L. Lozinskii: An Algorithm for Parallel Evaluation of Functions. 271-281
- C. Pandu Rangan: On the Minimum Number of Additions Required to Compute a Quadratic Form. 282-285
- David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 286-300
- Mark H. Overmars: Corrigendum: Dynamization of Order Decomposable Set Problems. 301
Volume 4, Number 4, December 1983
- Hiroshi Imai, Takao Asano: Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. 310-323
- Paul Pritchard: Fast Compact Prime Number Sieves (among Others). 332-344
- Ten-Hwang Lai, Sartaj Sahni: Nearly On-Line Scheduling of Multiprocessor Systems with Memories. 353-362
- Jean-Pierre Duval: Factorizing Words over an Ordered Alphabet. 363-381
- Leonidas J. Guibas: Problems. 382-396
- David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 397-411
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team