default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 2
Volume 2, Number 1, March 1981
- Gideon Ehrlich:
Searching and Sorting Real Numbers. 1-12 - Jorge Olivos:
On Vectorial Addition Chains. 13-21 - Shlomo Moran, Yehoshua Perl:
The Complexity of Identifying Redundant and Essential Elements. 22-30 - David A. Klarner:
An Algorithm to Determine When Certain Sets Have 0-Density. 31-43 - Irvin Roy Hentzel, Leslie Hogben:
Exhaustive Checking of Sparse Algebras. 44-49 - Anthony Ralston:
A New Memoryless Algorithm for De Bruijn Sequences. 50-62 - Witold Lipski Jr., Franco P. Preparata:
Segments, Rectangles, Contours. 63-76 - Michael L. Fredman:
The Spanning Bound as a Measure of Range Query Complexity. 77-87 - Yossi Shiloach, Uzi Vishkin:
Finding the Maximum, Merging, and Sorting in a Parallel Computation Model. 88-102 - Leonidas J. Guibas:
Problems. 103-104 - Witold Lipski Jr., Franco P. Preparata:
Erratum: Finding the Contour of a Union of Iso-Oriented Rectangles. 105
Volume 2, Number 2, June 1981
- Yossi Shiloach:
Fast Canonization of Circular Strings. 107-121 - T. C. Hu, M. T. Shing:
An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon. 122-138 - Robert Melville:
A Time/Space Tradeoff for In-Place Array Permutation. 139-143 - Victor Y. Pan:
The Bit-Complexity of Arithmetic Algorithms. 144-163 - Judea Pearl:
A Space-Efficient On-Line Method of Computing Quantile Estimates. 164-177 - William H. Burge:
Stacks in a Two-Level Store. 178-185 - Hossam A. ElGindy, David Avis:
A Linear Algorithm for Computing the Visibility Polygon from a Point. 186-197 - Reuven Bar-Yehuda, Shimon Even:
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. 198-203 - Herbert S. Wilf:
The Uniform Selection of Free Trees. 204-207 - Leonidas J. Guibas:
Problems. 208-210
Volume 2, Number 3, September 1981
- Witold Lipski Jr., Christos H. Papadimitriou:
A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. 211-226 - Lloyd Allison
:
Generating Coset Representatives for Permutation Groups. 227-244 - Mark H. Overmars:
Dynamization of Order Decomposable Set Problems. 245-260 - Ephraim Feig:
On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear. 261-281 - Jan van Leeuwen, Derick Wood:
The Measure Problem for Rectangular Ranges in d-Space. 282-300 - Victor Y. Pan:
A Unified Approach to the Analysis of Bilinear Algorithms. 301-310 - Shimon Even, Oded Goldreich:
The Minimum-Length Generator Sequence Problem is NP-Hard. 311-313 - Leonidas J. Guibas:
Problems. 314-315
Volume 2, Number 4, December 1981
- Norishige Chiba, Takao Nishizeki, Nobuji Saito:
A Linear 5-Coloring Algorithm of Planar Graphs. 317-327 - András Frank:
A Weighted Matroid Intersection Algorithm. 328-336 - D. T. Lee, C. K. Wong:
Finding Intersection of Rectangles by Range Search. 337-347 - Brenda S. Baker, Donna J. Brown, Howard P. Katseff:
A 5/4 Algorithm for Two-Dimensional Packing. 348-368 - Peter Eades, John Staples:
On Optimal Trees. 369-384 - David G. Cantor:
Irreducible Polynomials with Integral Coefficients Have Succinct Certificates. 385-392 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 393-405
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-29 01:29 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:
