4860 search results - page 248 / 972 » SNPs Problems, Complexity, and Algorithms |
97
Voted
SODA
1997
ACM
15 years 1 months ago
1997
ACM
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
ISSAC
2005
Springer
15 years 6 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
ESA
2004
Springer
15 years 6 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
101
click to vote
ITNG
2006
IEEE
15 years 6 months ago
2006
IEEE
—In this paper, we address the scheduling problem for Clos-network switches with no buffers at the central stage. Existing scheduling (dispatching) algorithms for this type of sw...
82
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...