270 search results - page 3 / 54 » Properties of Almost All Graphs and Generalized Quantifiers |
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
STOC
1996
ACM
13 years 10 months ago
1996
ACM
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
JCT
2010
13 years 4 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
DRM
2007
Springer
13 years 12 months ago
2007
Springer
provides a very brief overview of some of the main points. References are given to my papers, where those points are explained in more detail, and citations are provided to the ext...