| A foundation for designing deadlock-free routing algorithms in wormhole networks. | 8 | 0.51 | 2003 |
| Bounded Fairness | 6 | 0.62 | 2003 |
| The Half-Adder Form and Early Branch Condition Resolution | 7 | 0.88 | 1997 |
| On measuring the performance of adaptive wormhole routing. | 2 | 0.41 | 1997 |
| An Evaluation of Architectural Platforms for Parallel Navier-Stokes Computations | 1 | 0.51 | 1997 |
| Fault tolerance in multisensor networks. | 9 | 0.91 | 1996 |
| A necessary and sufficient condition for deadlock-free wormhole routing | 46 | 1.75 | 1996 |
| Parallelizing Navier-Stokes computations on a variety of architecture platforms | 1 | 0.40 | 1995 |
| A universal proof technique for deadlock-free routing in interconnection networks | 19 | 1.75 | 1995 |
| Do Fixed-Processor Communication-Time Tradeoffs Exist? | 0 | 0.34 | 1995 |
| Optimal fully adaptive minimal wormhole routing for meshes | 22 | 1.91 | 1995 |
| Mapping to reduce contention in multiprocessor architectures | 3 | 0.58 | 1993 |
| Compiling for Hierarchical Shared Memory Multiprocessors | 1 | 0.35 | 1993 |
| Optimal fully adaptive wormhole routing for meshes | 24 | 1.32 | 1993 |
| Some Architectural and Compilation Issues in the Design of Hierarchical Shared-Memory Multiprocessors | 3 | 0.40 | 1992 |
| What is an effective schedule? | 1 | 0.47 | 1991 |
| A Tree Structured Hierarchical Memory Multiprocessor | 0 | 0.34 | 1990 |
| Distributed Synchronizers | 2 | 0.44 | 1988 |
| Parallel Access to Synchronization Variables | 3 | 2.13 | 1987 |
