350 search results - page 68 / 70 » Lower and upper bounds on obtaining history independence |
176
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
149
click to vote
ESA
2009
Springer
16 years 19 days ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
179
click to vote
FSTTCS
2009
Springer
16 years 19 days ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
196
click to vote
MOBICOM
2009
ACM
16 years 17 days ago
2009
ACM
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
157
click to vote
SIGECOM
2009
ACM
16 years 17 days ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...