Sciweavers

1132 search results - page 215 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
12 years 12 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
MOBICOM
2003
ACM
15 years 2 months ago
Topology control for wireless sensor networks
We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively fl...
Jianping Pan, Yiwei Thomas Hou, Lin Cai, Yi Shi, S...
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
15 years 4 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
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...
Heidi Gebauer
FSTTCS
2009
Springer
15 years 4 months ago
Fractional Pebbling and Thrifty Branching Programs
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...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
MST
2000
57views more  MST 2000»
14 years 9 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast