default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 9, 1993
Volume 9, Number 1, 1993
- R. Z. Hwang, Richard C. T. Lee, R. C. Chang:
The Slab Dividing Approach To Solve the Euclidean P-Center Problem. 1-22 - Philip N. Klein, Clifford Stein:
A Parallel Algorithm for Approximating the Minimum Cycle Cover. 23-31 - Manfred Kunde:
Packet Routing on Grids of Processors. 32-46 - Michael Kaufmann, F. Miller Maley:
Parity Conditions in Homotopic Knock-Knee Routing. 47-63 - Michael J. Todd, Yufei Wang:
On Combined Phase 1-Phase 2 Projective Methods for Linear Programming. 64-83 - Majid Sarrafzadeh, Ruey-Der Lou:
Maximum k-Covering of Weighted Transitive Graphs with Applications. 84-100
Volume 9, Number 2, 1993
- Toby 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
- P. B. Ramprasad, C. Pandu Rangan:
A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs. 199-216 - Lin Chen:
Efficient Parallel Recognition of Some Circular Arc Graphs, I. 217-238 - Richard J. Lipton, Jeffrey F. Naughton:
Clocked Adversaries for Hashing. 239-252 - Edward G. Coffman Jr., Peter W. Shor:
Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms. 253-277 - Walter Meyer:
Seven Fingers Allow Force-Torque Closure Grasps on Any Convex Polyhedron. 278-292 - Richard Anderson, Simon Kahan, Martine D. F. Schlag:
Single-Layer Cylindrical Compaction. 293-312
Volume 9, Number 4, 1993
- Eric Bach, Jonathan P. Sorenson
:
Sieve Algorithms for Perfect Power Testing. 313-328 - Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud:
A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis. 329-356 - Shaunak Pawagi, Owen Kaser:
Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees. 357-381 - Richard W. Kenyon:
Tiling a Polygon with Parallelograms. 382-397 - R. Z. Hwang, R. C. Chang, Richard C. T. Lee:
The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time. 398-423
Volume 9, Number 5, 1993
- Mee Yee Chan, Francis Y. L. Chin:
Schedulers for Larger Classes of Pinwheel Instances. 425-462 - Alexander Zelikovsky:
An 11/6-Approximation Algorithm for the Network Steiner Problem. 463-470 - Marco Pellegrini:
Ray Shooting on Triangles in 3-Space. 471-494 - Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri:
Selecting Distances in the Plane. 495-514 - Michael T. Goodrich, Steven B. Shauck, Sumanta Guha:
An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. 515-516
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
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-02-03 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:
