4565 search results - page 274 / 913 » Time Optimal Self-Stabilizing Algorithms |
155
Voted
CPM
2009
Springer
14 years 10 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
114
click to vote
SODA
2000
ACM
15 years 2 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
82
Voted
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...
97
Voted
SWAT
2010
Springer
15 years 5 months ago
2010
Springer
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
96
Voted
RANDOM
1999
Springer
15 years 5 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...