default search action
Journal of Algorithms, Volume 8
Volume 8, Number 1, March 1987
- Hiroshi Imai, Takao Asano:
Dynamic Orthogonal Segment Intersection Search. 1-18 - Richard Cole, Chee-Keng Yap:
Shape from Probing. 19-38 - Howard J. Karloff, David B. Shmoys
:
Efficient Parallel Algorithms for Edge Coloring Problems. 39-52 - 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 - John L. Mohammed, Carlos S. Subi:
An Improved Block-Interchange Algorithm. 113-121 - George K. Georgakopoulos, Christos H. Papadimitriou:
The 1-Steiner Tree Problem. 122-130 - 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 - J. C. Lagarias, Andrew M. Odlyzko:
Computing pi(x): An Analytic Method. 173-191 - 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 G. Pittel:
Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records. 236-249 - Vojtech Rödl, Craig A. Tovey
Multiple Optima in Local Search. 250-259 - 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 - Noga Alon, Zvi Galil, V. D. Milman:
Better Expanders and Superconcentrators. 337-347 - David P. Dobkin, Herbert Edelsbrunner:
Space Searching for Intersecting Objects. 348-361 - Donald W. Loveland:
Finding Critical Sets. 362-371 - Ten-Hwang Lai, Alan P. Sprague:
On the Routability of a Convex Grid. 372-384 - Stephen A. Cook, Pierre McKenzie:
Problems Complete for Deterministic Logarithmic Space. 385-394 - Michael F. Bridgland:
Universal Traversal Sequences for Paths and Cycles. 395-404 - David A. Plaisted, Jiarong Hong:
A Heuristic Triangulation Algorithm. 405-437 - 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 Boyar, Howard J. Karloff:
Coloring Planar Graphs in Parallel. 470-479 - Mikhail J. Atallah, Susanne E. Hambrusch:
On Bipartite Matchings of Minimum Density. 480-502 - Joan M. Lucas:
The Rotation Graph of Binary Trees is Hamiltonian. 503-535 - Ouri Wolfson
The Virtues of Locking by Symbolic Names. 536-556 - Jeffrey S. Salowe, William L. Steiger:
Simplified Stable Merging Tasks. 557-571 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-18 18:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: