default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 1, 1986
Volume 1, Number 1, 1986
- Don Coppersmith, Andrew M. Odlyzko, Richard Schroeppel:
Discrete Logarithms in GF(p). 1-15 - Christopher J. Van Wyk, Jeffrey Scott Vitter
:
The Complexity of Hashing with Lazy Deletion. 17-29 - Robert Sedgewick, Jeffrey Scott Vitter:
Shortest Paths in Euclidean Graphs. 31-48 - Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai:
Visibility of Disjoint Polygons. 49-63 - Gianfranco Bilardi, Franco P. Preparata:
Area-Time Lower-Bound Techniques with Applications to Sorting. 65-91 - Herbert Edelsbrunner:
Edge-Skeletons in Arrangements with Applications. 93-109 - Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan:
The Pairing Heap: A New Form of Self-Adjusting Heap. 111-129
Volume 1, Number 2, 1986
- Bernard Chazelle, Leonidas J. Guibas:
Fractional Cascading: I. A Data Structuring Technique. 133-162 - Bernard Chazelle, Leonidas J. Guibas:
Fractional Cascading: II. Applications. 163-191 - D. T. Lee, Ying-Fung Wu:
Geometric Complexity of Some Loction Problems. 193-211 - Kurt Mehlhorn, Franco P. Preparata, Majid Sarrafzadeh:
Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. 213-221 - Shaodi Gao, Susanne E. Hambrusch:
Two-Layer Channel Routing with Vertical Uni-Length Overlap. 223-232 - Richard A. Games:
Optimal Book Embeddings of the FFT, Benes, and Barrel Shifter Networks. 233-250 - Eugene W. Myers:
An O(ND) Difference Algorithm and Its Variations. 251-266
Volume 1, Number 3, 1986
- Calton Pu:
On-the-Fly, Incremental, Consistent Reading of Entire Databases. 271-287 - Harry K. T. Wong, Jianzhong Li, Frank Olken, Doron Rotem, Linda Wong:
Bit Transposition for Very Large Scientific and Statistical Databases. 289-309 - Hong-Tai Chou, David J. DeWitt:
An Evaluation of Buffer Management Strategies for Relational Database Systems. 311-336 - Claudia Bauzer Medeiros, Frank Wm. Tompa:
Understanding the Implications of View Update Policies. 337-360 - Yannis E. Ioannidis:
A Time Bound on the Materialization of Some Recursively Defined Views. 361-385
Volume 1, Number 4, 1986
- Nimrod Megiddo:
Introduction: New Approaches to Linear Programming. 387-394 - Robert J. Vanderbei, Marc S. Meketon, Barry A. Freedman:
A Modification of Karmarkar's Linear Programming Algorithm. 395-407 - Michael J. Todd, Bruce P. Burrell:
An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables. 409-424 - Guy de Ghellinck, Jean-Philippe Vial:
A Polynomial Newton Method for Linear Programming. 425-453 - Masao Iri, Hiroshi Imai:
A Multiplicative Barrier Function Method for Linear Programming. 455-482 - Kurt M. Anstreicher:
A Monotonic Projective Algorithm for Fractional Linear Programming. 483-498 - Masakazu Kojima:
Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm. 499-515 - Giovanni Rinaldi:
A Projective Method for Linear Programming with Box-Type Constraints. 517-527 - John L. Nazareth:
Homotopy Techniques in Linear Programming. 529-535 - Charles E. Blair:
The Iterative Step in the Linear Programming Algorithm of N. Karmarkar. 537-539
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-04 23:03 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.
