We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
We analyze the capacity scaling laws of wireless networks where the spatial distribution of nodes over the network area exhibits a high degree of clustering. In particular we cons...
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...
Several lower bounds have been proposed for the smallest singular value of a square matrix, such as Johnson's bound, Brauer-type bound, Li's bound and Ostrowskitype boun...
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction princip...