Random number generators: good ones are hard to find
Communications of the ACM
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Queueing Theory Analysis of Greedy Routing on Square Arrays
Queueing Theory Analysis of Greedy Routing on Square Arrays
Bounds on the greedy routing algorithm for array networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Bounding delays in packet-routing networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Dynamic deflection routing on arrays (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Greedy dynamic routing on arrays
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
A general approach to dynamic packet routing with bounded buffers
Journal of the ACM (JACM)
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Tight Bounds for the Performance of Longest-in-System on DAGs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
Proceedings of the 3rd international symposium on Information processing in sensor networks
Tight bounds for the performance of longest in system on DAGs
Journal of Algorithms
Lattice networks: capacity limits, optimal routing, and queueing behavior
IEEE/ACM Transactions on Networking (TON)
Efficient routing with small buffers in dense networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
| Hi-index | 0.00 |