350 search results - page 53 / 70 » Lower and upper bounds on obtaining history independence |
102
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
105
click to vote
DAC
2004
ACM
16 years 22 days ago
2004
ACM
Current technology trends have led to the growing impact of both inter-die and intra-die process variations on circuit performance. While it is imperative to model parameter varia...
TCC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
111
click to vote
DAM
2007
14 years 11 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...