#### Filter Results:

- Full text PDF available (22)

#### Publication Year

1987

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hans L. Bodlaender, Gerard Tel, Nicola Santoro
- Nord. J. Comput.
- 1994

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)

- Gerard Tel
- 2015

This booklet contains (partial) solutions to most of the exercises in the book Introduction to Distributed Algorithms [Tel00]. Needless to say, the book as well as this document contain numerous errors; please find them and mail them to me! I have not included answers or hints for the following exercises and projects: 2.3, 2.9, 2.10, 3.2, 3.7, 6.16, 10.2,… (More)

- Gerard Tel, Friedemann Mattern
- ACM Trans. Program. Lang. Syst.
- 1991

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

A b s t r a c t . We discuss recent research evaluating the benefits of certain link labellings in processor networks. Such a labelling, called Sense of Direction or SoD, allows processors to communicate more efficiently with each other, and to exploit topological properties of the network algorithmically. We shall define sense of direction for several… (More)

- Bernadette Charron-Bost, Friedemann Mattern, Gerard Tel
- Distributed Computing
- 1996

This article studies characteristic properties of synchronous and asynchronous message communications in distributed systems. Based on the causality relation between events in computations with asynchronous communications, we characterize computations which are realizable with synchronous communications, which respect causal order, or where messages between… (More)

- Gerard Tel
- Inf. Process. Lett.
- 1994

- Anita de Waard, Gerard Tel
- SemWiki
- 2006

– 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 browsers and… (More)

- Gerard Tel
- Concurrency
- 1988

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)

- Gerard Tel
- Int. J. Found. Comput. Sci.
- 1994

This paper analyses how the symmetry of a processor network innuences the existence of a solution for the network orientation problem. The orientation of cliques, hypercubes and tori is the problem of assigning labels to each link of each processor, in such a way that a sense of direction is given to the network. In this paper the problem of network… (More)

- Gerard Tel
- Parallel Processing Letters
- 1995