4565 search results - page 141 / 913 » Time Optimal Self-Stabilizing Algorithms |
111
Voted
JACM
2010
15 years 25 days ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
93
Voted
ESA
2004
Springer
15 years 7 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
136
click to vote
RTCSA
2003
IEEE
15 years 7 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
124
click to vote
ICCAD
2004
IEEE
15 years 11 months ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
110
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...