| Analysis of multi-hop emergency message propagation in vehicular ad hoc networks | 61 | 3.45 | 2007 |
| Bounding the firing synchronization problem on a ring | 14 | 0.82 | 2004 |
| Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks | 20 | 1.16 | 2004 |
| New Bounds for the Firing Squad Problem on a Ring | 2 | 0.48 | 2002 |
| Smaller solutions for the firing squad | 17 | 0.94 | 2002 |
| Decidable Properties of Graphs of All-Optical Networks | 4 | 0.48 | 2001 |
| On the bottleneck counting argument | 4 | 0.39 | 2000 |
| Improved bounds for the firing synchronization problem | 2 | 0.45 | 1998 |
| A Note on the Bottleneck Counting Argument | 3 | 0.43 | 1997 |
| On the Amount of Randomness Needed in Distributed Computations | 1 | 0.35 | 1997 |
| Active transport in biological computing. | 12 | 0.76 | 1996 |
| Symmetry Breaking in Anonymous Networks: Characterizations | 59 | 2.38 | 1996 |
| Average Circuit Depth and Average Communication Complexity | 2 | 0.52 | 1995 |
| Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings | 24 | 1.53 | 1995 |
| On the complexity of RAM with various operation sets | 4 | 1.49 | 1992 |
| Milking the Aanderaa argument | 3 | 0.39 | 1990 |
| A New Lower Bound Theorem for Read Only Once Branching Programs and Its Applications | 26 | 1.44 | 1990 |
| Universal traversal sequences of length nO(log n) for cliques | 17 | 2.79 | 1988 |
| Probabilistic communication complexity | 46 | 13.83 | 1986 |
| Hierarchical VLSI design systems based on attribute grammars | 28 | 2.28 | 1986 |
| Probabilistic Communication Complexity (Preliminary Version) | 0 | 0.34 | 1984 |
| Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version) | 1 | 0.38 | 1983 |
| Space efficient algorithms for some graph theoretical problems | 3 | 0.45 | 1982 |
| On the Difference Between One and Many (Preliminary Version) | 15 | 12.89 | 1977 |
