Gerard Tel
According to our database^{1},
Gerard Tel
authored at least 33 papers
between 1987 and 2010.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on cs.ruu.nl
On csauthors.net:
Bibliography
2010
CoRR, 2010
2009
Theory Comput. Syst., 2009
2008
Int. J. Approx. Reason., 2008
2007
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2007
2006
Proceedings of the SemWiki2006, First Workshop on Semantic Wikis, 2006
2004
J. Graph Algorithms Appl., 2004
2000
Termination detection and universal graph reconstruction.
Proceedings of the SIROCCO 7, 2000
1998
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes.
Proceedings of the SIROCCO'98, 1998
1997
RAIRO Theor. Informatics Appl., 1997
1996
Distributed Comput., 1996
1995
Parallel Process. Lett., 1995
Proceedings of the SOFSEM '95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23, 1995
A Monte Carlo Algorithm for Election.
Proceedings of the Structure, Information and Communication Complexity, 1995
1994
IEEE/ACM Trans. Netw., 1994
TradeOffs in NonReversing Diameter.
Nord. J. Comput., 1994
Inf. Process. Lett., 1994
Inf. Process. Lett., 1994
Int. J. Found. Comput. Sci., 1994
1993
The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes.
ACM Trans. Program. Lang. Syst., 1993
1990
Comments on "On the Proof of a Distributed Algorithm": AlwaysTru is not Invariant.
Inf. Process. Lett., 1990
Inf. Process. Lett., 1990
1989
J. Parallel Distributed Comput., 1989
Comments on "Ring Based Termination Detection Algorithm for Distributed Computations".
Inf. Process. Lett., 1989
1988
The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols.
Sci. Comput. Program., 1988
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988
1987
A nondeterministic algorithm and its analysis.
Bull. EATCS, 1987
Efficent leader finding in arbitary networks.
Bull. EATCS, 1987
Proceedings of the Distributed Algorithms, 1987
The Derivation of onthefly Garbage Collection Algorithms from Distributed Termination Detection Protocols.
Proceedings of the STACS 87, 1987
Proceedings of the Fundamentals of Computation Theory, 1987