2342 search results - page 3 / 469 » Sublinear geometric algorithms |
89
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
81
Voted
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
131
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
94
Voted
SODA
1994
ACM
15 years 2 months ago
1994
ACM