Chernoff-Hoeffding bounds are fundamental tools used in bounding the tail probabilities of the sums of bounded and independent random variables. We present a simple technique which gives slightlyâ€¦ (More)

Jeanette Schmidt~ R. N. Uma$ Joel Wein~ We consider the problem of scheduling a parallel loop with independent iterations on a network of heterogeneous workstations, and demonstrate the effectivenessâ€¦ (More)

The problem of comparing two sequences A and B to determine their longest common subsequence (LCS) or the edit distance between them has been much studied. In this paper we consider the followingâ€¦ (More)

Fischetti. V.A., G.M. Landau, P.H. Sellers and J.P. Schmidt, Identifying periodic occurrences of a template with applications to protein structure, Information Processing Letters 45 (1993) 11-18.â€¦ (More)

A perfect single tandem repeat is deÂŽned as a nonempty string that can be divided into two identical substrings, e.g., abcabc. An approximate single tandem repeat is one in which the substrings areâ€¦ (More)

A perfect single tandem repeat is defined as a nonempty string that can be divided into two identical substrings, e.g., abcabc. An approximate single tandem repeat is one in which the substrings areâ€¦ (More)

This paper gives the first optimal bounds for classical closed hashing schemes in the case of limited randomness. We thereby establish the first proof of optimality for hashing arbitrarily selectedâ€¦ (More)