36 search results - page 3 / 8 » On the distribution of the number of monotone Boolean functi... |
SODA
2008
ACM
13 years 6 months ago
2008
ACM
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 ...
COMBINATORICA
2011
12 years 5 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
TCS
2008
13 years 5 months ago
2008
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
COCO
2005
Springer
13 years 11 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...