We consider a graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations.Expand

For any listL ofn numbers in (0, 1) letL* denote the minimum number of unit capacity bins needed to pack the elements ofL. We prove that, for every positive ε, there exists anO(n)-time algorithmS… Expand

A database is said to allow range restrictions if one may request that only records with some specified field in a specified range be considered when answering a given query.Expand

We present a data structure and algorithm which enable one to insert and delete points and to perform orthogonal range queries in a d-dimensional space.Expand

We consider the average-case behavior of the Zero?One Knapsack problem, as well as an on-line version studied by Marchetti-Spaccamela and Vercellis.Expand

A matrix of zeroes and ones is said to have the consecutive ones property if there is a permutation of its rows such that the ones in each column appear consecutively.Expand

We show that the average length of the longest common subsequence of two random strings of length <i>n</i> over an alphabet is asymptotic to γ<sub><i>k</i></sub> for some constant γ <sub>2</sub> depending on <i>.Expand