2924 search results - page 370 / 585 » Lower Bounds in Distributed Computing |
163
Voted
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
163
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means...
143
click to vote
ANCS
2005
ACM
15 years 10 months ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
143
click to vote
AAAI
2010
15 years 6 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
147
click to vote
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...