Sciweavers

ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 11 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 11 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
ALGORITHMICA
1999
58views more  ALGORITHMICA 1999»
13 years 11 months ago
Reductions Do Not Preserve Fast Convergence Rates in Average Time
Jay Belanger, Aduri Pavan, Jie Wang
ALGORITHMICA
1999
62views more  ALGORITHMICA 1999»
13 years 11 months ago
Output-Sensitive Reporting of Disjoint Paths
Giuseppe Di Battista, Roberto Tamassia, Luca Visma...
ALGORITHMICA
1999
87views more  ALGORITHMICA 1999»
13 years 11 months ago
The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine ...
Kevin Atteson
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
13 years 11 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson