Volume 9,
Number 1,
1993
Volume 9,
Number 2,
1993
- T. Berger, A. Hekstra, Alon Orlitsky:
Asymptotic Component Densities in Programmable Gate Arrays Realizing All Circuits of a Given Size.
101-127
- Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap:
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel.
128-141
- Barry Joe, Cao An Wang:
Duality of Constrained Voronoi Diagrams and Delaunay Triangulations.
142-155
- Mikhail J. Atallah:
A Faster Parallel Algorithm for a Matrix Searching Problem.
156-167
- Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine:
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls.
168-183
- Robert A. Bosch, Kurt M. Anstreicher:
On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise.
184-197
Volume 9,
Number 3,
1993
Volume 9,
Number 4,
1993
Volume 9,
Number 5,
1993
Volume 9,
Number 6,
1993
- David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri:
Computing the Intersection-Depth of Polyhedra.
518-533
- Leonidas J. Guibas, David Salesin, Jorge Stolfi:
Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives.
534-560
- János Pach, Richard Pollack, Emo Welzl:
Weaving Patterns of Lines and Line Segments in Space.
561-571
- Tetsuo Asano, Takeshi Tokuyama:
Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing.
572-590
- Feng Gao, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe:
Finding Extrema with Unary Predicates.
591-600
- Kuo-Hui Tsai, Wen-Lian Hsu:
Fast Algorithms for the Dominating Set Problem on Permutation Graphs.
601-614
- Tak Wah Lam, Kwong-fai Chan:
Finding Least-Weight Subsequences with Fewer Processors.
615-628
- Svante Carlsson, Christos Levcopoulos, Ola Petersson:
Sublinear Merging and Natural Mergesort.
629-648
- Kazumiti Numata, Takeshi Tokuyama:
Splitting a Configuration in a Simplex.
649-668
Copyright © Sat Nov 28 22:25:38 2009
by Michael Ley (ley@uni-trier.de)
