120 search results - page 10 / 24 » siamcomp 2008 |
SIAMCOMP
2002
14 years 9 months ago
2002
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
101
click to vote
SIAMCOMP
2002
14 years 9 months ago
2002
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
SIAMCOMP
2002
14 years 9 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
SIAMCOMP
2008
14 years 9 months ago
2008
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
SIAMCOMP
2008
14 years 9 months ago
2008
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...