74 search results - page 14 / 15 » The Complexity of Black-Box Ring Problems |
NGC
2000
Springer
13 years 8 months ago
2000
Springer
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
JC
2000
13 years 5 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
DAC
2007
ACM
14 years 6 months ago
2007
ACM
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
JSA
2000
13 years 5 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...