default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 5
Volume 5, Number 1, March 1984
- Dan Gusfield:
Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines. 1-6 - Gary D. Knott:
Direct-Chaining with Coalescing Lists. 7-21 - Joseph Y.-T. Leung:
Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs. 22-35 - Per-Åke Larson:
Analysis of Hashing with Chaining in the Prime Area. 36-47 - Danny Dolev
, Manfred K. Warmuth:
Scheduling Precedence Graphs of Bounded Height. 48-59 - Alan C. Tucker, Donna Wilson:
An O(N²) Algorithm for Coloring Perfect Planar Graphs. 60-68 - Shou-Hsuan Stephen Huang, C. K. Wong:
Optimal Binary Split Trees. 69-79 - Harold N. Gabow, Robert Endre Tarjan:
Efficient Algorithms for a Family of Matroid Intersection Problems. 80-131 - Prakash V. Ramanan, Jitender S. Deogun, C. L. Liu:
A Personnel Assignment Problem. 132-144 - Leonidas J. Guibas:
Problems. 145-146 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 147-160
Volume 5, Number 2, June 1984
- David A. Plaisted:
Heuristic Matching for Graphs Satisfying the Triangle Inequality. 163-179 - Peter J. Weinberger:
Finding the Number of Factors of a Polynomial. 180-186 - M. Boshernitzan, Aviezri S. Fraenkel:
A Linear Algorithm for Nonhomogeneous Spectra of Numbers. 187-198 - Eljas Soisalon-Soininen, Derick Wood:
Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. 199-214 - Richard P. Anstee, Martin Farber:
Characterizations of Totally Balanced Matrices. 215-230 - Christos H. Papadimitriou, Umesh V. Vazirani:
On Two Geometric Problems Related to the Traveling Salesman Problem. 231-246 - Nicholas C. Wormald:
Generating Random Regular Graphs. 247-280 - Ichiro Semba:
An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order. 281-283 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 284-299
Volume 5, Number 3, September 1984
- Ralf Hartmut Güting:
An Optimal Contour Algorithm for Iso-Oriented Rectangles. 303-326 - Gadiel Seroussi, Abraham Lempel:
On Symmetric Algorithms for Bilinear Forms over Finite Fields. 327-344 - Derek G. Corneil, Mark K. Goldberg:
A Non-Factorial Algorithm for Canonical Numbering of a Graph. 345-362 - Leslie G. Valiant:
Short Monotone Formulae for the Majority Function. 363-366 - Yehoshua Perl:
Optimum Split Trees. 367-374 - Pierre Rosenstiehl, Robert Endre Tarjan:
Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations. 375-390 - John R. Gilbert, Joan P. Hutchinson, Robert Endre Tarjan:
A Separator Theorem for Graphs of Bounded Genus. 391-407 - Thomas Lengauer:
On the Solution of Inequality Systems Relevant to IC-Layout. 408-421 - Michael G. Main, Richard J. Lorentz:
An O(n log n) Algorithm for Finding All Repetitions in a String. 422-432 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 433-447
Volume 5, Number 4, December 1984
- Gaston H. Gonnet, J. Ian Munro:
The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform. 451-470 - Jeffrey B. Remmel, Roger Whitney:
Multiplying Schur functions. 471-487 - Eli Shamir, Eli Upfal:
Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. 488-501 - Susan F. Assmann, David S. Johnson, Daniel J. Kleitman, Joseph Y.-T. Leung:
On a Dual Version of the One-Dimensional Bin Packing Problem. 502-525 - S. Louis Hakimi, Edward F. Schmeichel:
An Adaptive Algorithm for System Level Diagnosis. 526-530 - Eitan M. Gurari, Ivan Hal Sudborough:
Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. 531-546 - Micha Hofri:
A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm. 547-556 - Prakash V. Ramanan, Laurent Hyafil:
New Algorithms for Selection. 557-578 - Leonidas J. Guibas:
Problems. 579-594 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 595-609
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 2025-12-01 23:10 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:
