2924 search results - page 319 / 585 » Lower Bounds in Distributed Computing |
128
click to vote
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
133
click to vote
ICTCS
2005
Springer
15 years 10 months ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
114
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
141
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
131
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...