default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 9
Volume 9, Number 1, March 1988
- William M. Kantor, Donald E. Taylor
:
Polynomial-Time Versions of Sylow's Theorem. 1-17 - John Hershberger, Leonidas J. Guibas:
An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. 18-46 - Claus-Peter Schnorr:
A More Efficient Algorithm for Lattice Basis Reduction. 47-62 - Jonathan S. Turner:
Almost All k-Colorable Graphs are Easy to Color. 63-82 - Mauricio Karchmer, Joseph Naor:
A Fast Parallel Algorithm to Color a Graph with Delta Colors. 83-91 - Xin He, Yaacov Yesha:
Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs. 92-113 - Charles E. Leiserson, James B. Saxe:
A Mixed-Integer Linear Programming Problem which is Efficiently Solvable. 114-128 - Jeffrey H. Kingston:
A New Proof of the Garsia-Wachs Algorithm. 129-136 - Michael Kaminski:
An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants. 137-147
Volume 9, Number 2, June 1988
- Franz Aurenhammer:
Improved Algorithms for Discs and Balls Using Power Diagrams. 151-161 - Frank Ruskey:
Adjacent Interchange Generation of Combinations. 162-180 - Alan M. Frieze:
An Algorithm for Finding Hamilton Cycles in Random Directed Graphs. 181-204 - Danny Soroker:
Fast Parallel Strong Orientation of Mixed Graphs and Related Augmentation Problems. 205-223 - Wojciech Szpankowski:
Some Results on V-ary Asymmetric Tries. 224-244 - James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore:
Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. 245-253 - Mark H. Overmars:
Efficient Data Structures for Range Searching on a Grid. 254-275 - Danny Soroker:
Fast Parallel Algorithms for Finding Hamiltonian Paths and Cycles in a Tournament. 276-286 - Manfred Kunde, Michael A. Langston, Jin-Ming Liu:
On a Special Case of Uniform Processor Scheduling. 287-296
Volume 9, Number 3, September 1988
- Vijaya Ramachandran:
Finding a Minimum Feedback Arc Set in Reducible Flow Graphs. 299-313 - Martin Charles Golumbic, Peter L. Hammer:
Stability in Circular Arc Graphs. 314-320 - Alejandro A. Schäffer:
A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm. 321-342 - Harold Greenberg:
Solution to a Linear Diophantine Equation for Nonnegative Integers. 343-353 - Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty:
Addition Requirements for Matrix and Transposed Matrix Products. 354-364 - Arnold Schönhage:
Probabilistic Computation of Integer Polynomial GCDs. 365-371 - Mark H. Overmars, Derick Wood:
On Rectangular Visibility. 372-390 - Lajos Rónyai:
Factoring Polynomials Over Finite Fields. 391-400 - Ying Cheng, Frank K. Hwang:
Diameters of Weighted Double Loop Networks. 401-410 - Harold N. Gabow, Robert Endre Tarjan:
Algorithms for Two Bottleneck Optimization Problems. 411-417 - Robert E. Wilber:
The Concave Least-Weight Subsequence Problem Revisited. 418-425 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 426-444
Volume 9, Number 4, December 1988
- Binay K. Bhattacharya, J. Zorbas:
Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot. 449-469 - Hanoch Levy, David W. Low:
A Contraction Algorithm for Finding Small Cycle Cutsets. 470-493 - Lajos Rónyai:
Zero Divisors in Quaternion Algebras. 494-506 - Joseph Cheriyan, S. N. Maheshwari:
Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. 507-537 - Ingo Althöfer:
On the Complexity of Searching Game Trees and Other Recursion Trees. 538-567 - Reuven Bar-Yehuda, Shay Kutten:
Fault Tolerant Distributed Majority Commitment. 568-582 - Oded Maimon:
An Algorithm for the Lorenz Measure in Locational Decisions on Trees. 583-596 - Stephan Olariu, S. Toida, M. Zubair:
On a Conjecture by Plaisted and Hong. 597-598
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 20:04 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:
