Sciweavers

3208 search results - page 200 / 642
» A Lower Bound for Primality
Sort
View
COMPGEOM
2005
ACM
15 years 8 months ago
Incidences of not-too-degenerate hyperplanes
We present a multi-dimensional generalization of the Szemer´edi-Trotter Theorem, and give a sharp bound on the number of incidences of points and not-too-degenerate hyperplanes i...
György Elekes, Csaba D. Tóth
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 8 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
15 years 6 months ago
Drawing a Graph in a Hypercube
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
David R. Wood
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
15 years 6 months ago
Clusters in a Multigraph with Elevated Density
In this paper, we prove that in a multigraph whose density Γ exceeds the maximum vertex degree ∆, the collection of minimal clusters (maximally dense sets of vertices) is cycle...
Mark K. Goldberg
ACTA
2005
110views more  ACTA 2005»
15 years 6 months ago
Online square and cube packing
In online square packing, squares of different sizes arrive online and need to be packed into unit squares which are called bins. The goal is to minimize the number of bins used. ...
Leah Epstein, Rob van Stee