350 search results - page 41 / 70 » Lower and upper bounds on obtaining history independence |
COMBINATORICA
2008
14 years 12 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
TWC
2008
14 years 11 months ago
2008
Broadcast (or point to multipoint) communication has attracted a lot of research recently. In this paper, we consider the group broadcast channel where the users' pool is divi...
IPL
2002
14 years 11 months ago
2002
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
STACS
1999
Springer
15 years 4 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...