1395 search results - page 274 / 279 » (k, )-Distance-Hereditary Graphs |
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
CRYPTO
2001
Springer
14 years 28 days ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
SIGUCCS
2000
ACM
14 years 23 days ago
2000
ACM
The University of Pittsburgh's Computing Services and Systems Development organization is focused on the needs of the faculty and student population, totaling nearly 40,000 u...
IPPS
1999
IEEE
14 years 21 days ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
DAC
1998
ACM
14 years 20 days ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...