WDAG
2000
Springer
14 years 1 months ago
2000
Springer
WDAG
2000
Springer
14 years 1 months ago
2000
Springer
WDAG
2000
Springer
14 years 1 months ago
2000
Springer
WDAG
2000
Springer
14 years 1 months ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
WDAG
2000
Springer
14 years 1 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
WDAG
2000
Springer
14 years 1 months ago
2000
Springer
WDAG
2000
Springer
14 years 1 months ago
2000
Springer
Weconsider the problemof generic broadcast in asynchronous systems with crashes, a problem that was rst studied in 12]. Roughly speaking, given a \con ict" relation on the set...
WDAG
2000
Springer
14 years 1 months ago
2000
Springer
We show that Naming
DAC
1995
ACM
14 years 1 months ago
1995
ACM
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
DAC
1995
ACM
14 years 1 months ago
1995
ACM
––This paper describes algorithms for automatic layout synthesisofleafcellsin1–dandinanew1–1/2–dlayoutstyle,useful for non–dual circuit styles. The graph theory based a...