| Introduction to distributed algorithms G Tel Cambridge university press, 2000 | 1431 | 2000 |
| Introduction to distributed algorithms G Tel Cambridge university press, 2000 | 1431 | 2000 |
| Introduction to distributed algorithms G Tel Cambridge university press, 2000 | 1431 | 2000 |
| Synchronous, asynchronous, and causally ordered communication B Charron-Bost, F Mattern, G Tel Distributed Computing 9 (4), 173-191, 1996 | 135 | 1996 |
| Topics in distributed algorithms G Tel CUP Archive, 1991 | 131 | 1991 |
| Topics in distributed algorithms G Tel CUP Archive, 1991 | 131 | 1991 |
| Topics in distributed algorithms G Tel CUP Archive, 1991 | 131 | 1991 |
| The derivation of distributed termination detection algorithms from garbage collection schemes G Tel, F Mattern ACM Transactions on Programming Languages and Systems (TOPLAS) 15 (1), 1-35, 1993 | 100 | 1993 |
| Distributed algorithms: an intuitive approach W Fokkink MIT Press, 2018 | 80 | 2018 |
| Maximal matching stabilizes in quadratic time G Tel Information Processing Letters 49 (6), 271-272, 1994 | 47 | 1994 |
| Trade-offs in non-reversing diameter HL Bodlaender, G Tel, N Santoro | 42 | 1994 |
| Network orientation G Tel International Journal of Foundations of Computer Science 5 (01), 23-57, 1994 | 37 | 1994 |
| Global virtual time approximation with distributed termination detection algorithms F Mattern, AA Schoone, G Tel Unknown Publisher, 1991 | 32 | 1991 |
| Synchronous and asynchronous communication in distributed computations B Charron-Bost, F Mattern, G Tel Distributed Computing, to appear, 1991 | 30 | 1991 |
| Sense of direction in processor networks G Tel International Conference on Current Trends in Theory and Practice of …, 1995 | 28 | 1995 |
| Linear election in hypercubes G Tel Parallel Processing Letters 5 (03), 357-366, 1995 | 27 | 1995 |
| Termination detection and universal graph reconstruction. Y Métivier, G Tel SIROCCO, 237-251, 2000 | 25 | 2000 |
| Distributed infimum approximation G Tel International Conference on Fundamentals of Computation Theory, 440-447, 1987 | 25 | 1987 |
| Distributed infimum approximation G Tel International Conference on Fundamentals of Computation Theory, 440-447, 1987 | 25 | 1987 |
| Total algorithms G Tel International Conference on Concurrency, 277-291, 1988 | 24* | 1988 |
