Termination Detection of Local Computations | 3 | 0.44 | 2010 |
About the Termination Detection in the Asynchronous Message Passing Model | 9 | 0.52 | 2007 |
Wooden Geometric Puzzles: Design and Hardness Proofs | 2 | 0.41 | 2007 |
Local Monotonicity in Probabilistic Networks | 0 | 0.34 | 2007 |
SOFSEM 2006: Theory and Practice of Computer Science: 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, ... (Lecture Notes in Computer Science) | 49 | 3.36 | 2006 |
The ABCDE Format Enabling Semantic Conference Proceedings | 17 | 1.73 | 2006 |
Complexity results for enhanced qualitative probabilistic networks | 2 | 0.37 | 2006 |
A Note on Rectilinearity and Angular Resolution | 5 | 0.45 | 2004 |
Termination detection and universal graph reconstruction | 15 | 0.97 | 2000 |
SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27 - December 4, 1999, Proceedings | 34 | 4.65 | 1999 |
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes | 2 | 0.40 | 1998 |
Calculs approchés de la borne inférieure de valeurs réparties | 0 | 0.34 | 1997 |
Synchronous, asynchronous, and causally ordered communication | 43 | 2.06 | 1996 |
Linear Election in Hypercubes | 8 | 0.67 | 1995 |
Sense of Direction in Processor Networks | 14 | 0.93 | 1995 |
A Monte Carlo Algorithm for Election | 1 | 0.42 | 1995 |
Synchronizing ABD networks | 9 | 0.58 | 1994 |
Network orientation | 8 | 0.79 | 1994 |
Maximal matching stabilizes in quadratic time | 20 | 1.79 | 1994 |
Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings | 26 | 4.96 | 1994 |
An assertional proof of Rana's algorithm | 1 | 0.36 | 1994 |
Trade-offs in non-reversing diameter | 20 | 1.02 | 1994 |
The derivation of distributed termination detection algorithms from garbage collection schemes | 43 | 1.92 | 1991 |
Comments on “on the proof of a distributed algorithm”: always-true is not invariant | 7 | 0.82 | 1990 |
Optimal synchronization of ABD networks | 4 | 0.64 | 1988 |
Assertional Verification of a Timer Based Protocol | 6 | 1.16 | 1988 |
Total algorithms | 7 | 2.14 | 1988 |
A non-deterministic algorithm and its analysis | 0 | 0.34 | 1987 |
Distributed Infimum Approximation | 8 | 1.52 | 1987 |
Directed Network Protocols | 4 | 0.92 | 1987 |
Efficent leader finding in arbitary networks | 0 | 0.34 | 1987 |