2084 search results - page 218 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
102
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
CIC
2004
14 years 11 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
JCSS
2007
14 years 10 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...