#### Filter Results:

#### Publication Year

1987

2010

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

It is shown that the termination detection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the termination detection problem are obtained by applying transformations to garbage collection algorithms. The transformation can be applied to collectors of the… (More)

- Gerard Tel
- SOFSEM
- 1995

Consider a tree T with a number of extra edges (the bridges) added. We consider the notion of diameter, that is obtained by admitting only paths p with the property that for every bridge b in path p, no edge that is on the unique path (in T) between the endpoints of b is also in p or on the unique path between the two endpoints of any other bridge in p.… (More)

Core Matter – We believe that the best way to present a narrative to a computer is to let the author explicitly create a rich semantic structure for the article during writing. – We propose an open-standard, widely (re)useable format, the ABCDE format for proceedings and workshop contributions that can be easily mined, integrated and consumed by semantic… (More)

The paper presents a complete characterisation of the families of networks in which distributed computations can be performed in a process terminating manner, that is, with explicit termination in the asyn-chronous message passing model. The characterisation encompasses all criteria that have been formulated in the past that were known to influence explicit… (More)

We deene the notion of total algorithms for networks of processes. A total algorithm enforces that a \decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of distributed algorithms. For some important network control… (More)

partment of the Ecole Polytechnique. Her research interests include program veriication and semantics, distributed programming, and distributed algorithms. Friedemann Mattern received the Diploma in computer science from Bonn University and the Ph.D. degree from the University of Kaiserslautern in 1983 and 1989, respectively. From 1991 to 1994 he was a… (More)