default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 12, 1994
Volume 12, Number 1, July 1994
- Lee R. Nackman, Vijay Srinivasan:
Point Placement Algorithms for Delaunay Triangulation of Polygonal Domains. 1-17 - Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink:
An Optimal Algorithm for the On-Line Closest-Pair Problem. 18-29 - Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. 30-53 - Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. 54-68
Volume 12, Number 2/3, August/September 1994
- Jeffrey Scott Vitter
:
Guest Editor's Introduction: Special Issue on Large-Scale Memories. 69-71 - Bowen Alpern, Larry Carter, Ephraim Feig, Ted Selker:
The Uniform Memory Hierarchy Model of Computation. 72-109 - Jeffrey Scott Vitter, Elizabeth A. M. Shriver:
Algorithms for Parallel Memory I: Two-Level Memories. 110-147 - Jeffrey Scott Vitter, Elizabeth A. M. Shriver:
Algorithms for Parallel Memory II: Hierarchical Multilevel Memories. 148-169 - A. Chin:
Locality-Preserving Hash Functions for General Purpose Parallel Computation. 170-181 - Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson:
Coding Techniques for Handling Failures in Large Disk Arrays. 182-208 - Lee Aaron Newberg, David S. Wolfe:
String Layouts for a Redundant Array of Inexpensive Disks. 209-224 - Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. 225-244
Volume 12, Number 4/5, October/November 1994
- Alberto Apostolico:
Guest Editor's Foreword: Special Issue on String Algorithmics and Its Applications. 245-246 - Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Speeding Up Two String-Matching Algorithms. 247-267 - Ricardo A. Baeza-Yates, Christian Choffrut, Gaston H. Gonnet:
On Boyer-Moore Automata. 268-292 - Francis Y. L. Chin, Chung Keung Poon:
Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences. 293-311 - Dan Gusfield, K. Balasubramanian, Dalit Naor:
Parametric Optimization of Sequence Alignment. 312-326 - William I. Chang, Eugene L. Lawler:
Sublinear Approximate String Matching and Biological Applications. 327-344 - Eugene W. Myers:
A Sublinear Algorithm for Approximate Keyword Searching. 345-374 - Gad M. Landau, Uzi Vishkin:
Pattern Matching in a Digitized Image. 375-408 - Aviezri S. Fraenkel, Shmuel T. Klein:
Complexity Aspects of Guessing Prefix Codes. 409-419
Volume 12, Number 6, December 1994
- Young C. Wee, Seth Chaiken, S. S. Ravi:
Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors. 421-435 - Ilan Adler, Peter A. Beling:
Polynomial Algorithms for Linear Programming over the Algebraic Numbers. 436-457 - Pang-Chieh Chen:
Heuristic Sampling on DAGs. 458-475 - Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino:
Upward Drawings of Triconnected Digraphs. 476-497 - Gabriele Blankenagel, Ralf Hartmut Güting:
External Segment Trees. 498-532 - Lenwood S. Heath, Sriram V. Pemmaraju:
New Results for the Minimum Weight Triangulation Problem. 533-552
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-11-04 00:26 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:
