default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal 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 - Selim G. Akl, Henk Meijer:
On the Average-Case Complexity of "Bucketing" Algorithms. 9-13 - Danny Dolev
:
The Byzantine Generals Strike Again. 14-30 - R. Tolimieri:
A Nonquadratic Minimal Algorithm for a System of Quadratic Forms. 41-40 - Paul Klingsberg:
A Gray Code for Compositions. 41-44 - Oscar H. Ibarra, Shlomo Moran, Roger Hui:
A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications. 45-56 - Yossi Shiloach, Uzi Vishkin:
An O(log n) Parallel Connectivity Algorithm. 57-67 - Michael L. Fredman, Dennis J. Volper:
The Complexity of Partial Match Retrieval in a Dynamic Setting. 68-78 - Martin Aigner:
Parallel Complexity of Sorting Problems. 79-88 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 89-99
Volume 3, Number 2, June 1982
- Claus-Peter Schnorr:
Refined Analysis and Improvements on Some Factoring Algorithms. 101-127 - Yossi Shiloach, Uzi Vishkin:
An O(n² log n) Parallel MAX-FLOW Algorithm. 128-146 - Robert N. Goldberg:
Minimal String Difference Encodings. 147-156 - Costas S. Iliopoulos:
Analysis of an Algorithm for Composition of Binary Quadratic Forms. 157-159 - Vijay K. Vaishnavi, Derick Wood:
Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization. 160-176 - Leonidas J. Guibas:
Problems. 177-181 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 182-195
Volume 3, Number 3, September 1982
- Maurice Mignotte:
Identification of Algebraic Numbers. 197-204 - Barry K. Rosen:
Robust Linear Algorithms for Cutsets. 205-217 - D. T. Lee, Franco P. Preparata:
An Improved Algorithm for the Rectangle Enclosure Problem. 218-224 - Karl J. Lieberherr:
Algorithmic Extremal Problems in Combinatorial Optimization. 225-244 - Danny Dolev, Maria M. Klawe, Michael Rodeh:
An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle. 245-260 - Jeffrey Scott Vitter:
Deletion Algorithms for Hashing That Preserve Randomness. 261-275 - Gary D. Knott:
Fixed-Bucket Binary Storage Trees. 276-287 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 288-300 - Witold Lipski Jr., Franco P. Preparata:
Corrigendum: Finding the Contour of a Union of Iso-Oriented Rectangles. 301-302
Volume 3, Number 4, December 1982
- Brenda S. Baker, Edward G. Coffman Jr.:
A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation. 303-316 - Deborah S. Franzblau, Doron Zeilberger:
A Bijective Proof of the Hook-Length Formula. 317-343 - Kazuo Nakajima, S. Louis Hakimi:
Complexity Results for Scheduling Tasks with Discrete Starting Times. 344-361 - Leonidas J. Guibas:
Problems. 362-380 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 381-395
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 2026-08-14 21:53 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
