Showing papers by "Andrei Z. Broder published in 1993"

Some applications of Rabin’s fingerprinting method

Abstract: Rabin’s fingerprinting scheme is based on arithmetic modulo an irreducible polynomial with coefficients in Z2. This paper presents an implementation and several applications of this scheme that take considerable advantage of its algebraic properties.

On the satisfiability and maximum satisfiability of random 3-CNF formulas

Abstract: We analyze the pure literal rule heuristic for computing a satisfying assignment to a random 3-CNF formula with n variables. We show that the pure literal rule by itself finds satisfying assignments for almost all 3-CNF formulas with up to 1.63n clauses, but it fails for more than 1.7n clauses. As an aside we show that the value of maximum satisfiability for random 3-CNF formulas is tightly concentrated around its mean.

On-line choice of on-line algorithms

Abstract: Let {Al,Az,... ,Am} be a set of on-line algorithms for a problem P with input set I. We assume that P can be represented as a metrical task system. Each A; has a competitive ratio si with respect to the optimum offline algorithm, but only for a subset of the possible inputs such that the union of these subsets covers I. Given this setup, we construct a generic deterministic on-line algorithm and a generic randomized on-line algorithm for P that are competitive over all possible inputs. We show that their competitive ratios are optimal up to constant factors. Our analysis proceeds via an amusing card game.