Journal of Algorithms, Volume 8
Volume 8, Number 1, March 1987
- Jan K. Pachl: A Lower Bound for Probabilistic Distributed Algorithms. 53-65
- Alejandro A. Schäffer, Christopher J. Van Wyk: Convex Hulls of Piecewise-Smooth Jordan Curves. 66-94
- George Steiner: Searching in 2-Dimensional Partial Orders. 95-105
- Moon-Jung Chung: O(n^(2.55)) Time Algorithms for the Subgraph Homeomorphism Problem on Trees. 106-112
- Helaman R. P. Ferguson: A Noninductive GL(n, Z) Algorithm That Constructs Integral Linear Relations for n Z-Linearly Dependent Real Numbers. 131-145
- Shou-Hsuan Stephen Huang: Optimal Multiway Split Trees. 146-156
Volume 8, Number 2, June 1987
- M. D. Atkinson: An Optimal Algorithm for Geometrical Congruence. 159-172
- Daniel Leven, Micha Sharir: An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers. 192-215
- Marshall W. Bern, Eugene L. Lawler, A. L. Wong: Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs. 216-235
- Boris Pittel: Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records. 236-249
- Thomas Lengauer: Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs. 260-284
- David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 285-303
Volume 8, Number 3, September 1987
- Dorit S. Hochbaum, Wolfgang Maass: Fast Approximation Algorithms for a Nonconvex Covering Problem. 305-323
- Shih Ping Tung: Computational Complexities of Diophantine Equations with Parameters. 324-336
- Donald W. Loveland: Finding Critical Sets. 362-371
- Michael F. Bridgland: Universal Traversal Sequences for Paths and Cycles. 395-404
- David S. Johnson: The NP-Completeness Column: An Ongoing Guide. 438-448
Volume 8, Number 4, December 1987
- Janet A. Blumer: How Much is that DAWG in the Window? A Moving Window Algorithm for the Directed Acyclic Word Graph. 451-469
- Joan M. Lucas: The Rotation Graph of Binary Trees is Hamiltonian. 503-535
- Ouri Wolfson: The Virtues of Locking by Symbolic Names. 536-556
- Shankar M. Venkatesan: Improved Constants for Some Separator Theorems. 572-578
- Lawrence L. Larmore: A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees. 579-591
- Fanica Gavril: Generating the Maximum Spanning Trees of a Weighted Graph. 592-597
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team