Gerard Tel

According to our database1, Gerard Tel authored at least 33 papers between 1987 and 2010.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2010
Termination Detection of Local Computations
CoRR, 2010

2009
Wooden Geometric Puzzles: Design and Hardness Proofs.
Theory Comput. Syst., 2009

2008
Complexity results for enhanced qualitative probabilistic networks.
Int. J. Approx. Reason., 2008

2007
About the Termination Detection in the Asynchronous Message Passing Model.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Local Monotonicity in Probabilistic Networks.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2007

2006
The ABCDE Format Enabling Semantic Conference Proceedings.
Proceedings of the SemWiki2006, First Workshop on Semantic Wikis, 2006

2004
A Note on Rectilinearity and Angular Resolution.
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
Calculs approchés de la borne inférieure de valeurs réparties.
RAIRO Theor. Informatics Appl., 1997

1996
Synchronous, Asynchronous, and Causally Ordered Communication.
Distributed Comput., 1996

1995
Linear Election in Hypercubes.
Parallel Process. Lett., 1995

Sense of Direction in Processor Networks.
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
Synchronizing ABD networks.
IEEE/ACM Trans. Netw., 1994

Trade-Offs in Non-Reversing Diameter.
Nord. J. Comput., 1994

An Assertional Proof of Rana's Algorithm.
Inf. Process. Lett., 1994

Maximal Matching Stabilizes in Quadratic Time.
Inf. Process. Lett., 1994

Network Orientation.
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": Always-Tru is not Invariant.
Inf. Process. Lett., 1990

Bit-Optimal Election in Synchronous Rings.
Inf. Process. Lett., 1990

1989
Hierarchical Parallel Memory Systems and Multiperiodic Skewing Schemes.
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

Assertional Verification of a Timer Based Protocol.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Total Algorithms.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

Optimal Synchronization of ABD Networks.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

1987
A non-deterministic algorithm and its analysis.
Bull. EATCS, 1987

Efficent leader finding in arbitary networks.
Bull. EATCS, 1987

Directed Network Protocols.
Proceedings of the Distributed Algorithms, 1987

The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols.
Proceedings of the STACS 87, 1987

Distributed Infimum Approximation.
Proceedings of the Fundamentals of Computation Theory, 1987


  Loading...