358 search results - page 1 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
SODA
1998
ACM
13 years 6 months ago
1998
ACM
SIGMETRICS
2006
ACM
13 years 10 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
CCR
2006
13 years 4 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
WDAG
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
TCOM
2008
13 years 4 months ago
2008
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...