Graphs and algorithms
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
The Computer Journal
A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On forwarding indices of networks
Discrete Applied Mathematics
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Efficient message routing in planar networks
SIAM Journal on Computing
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
On Multi-Label Linear Interval Routing Schemes (Extended Abstract)
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Local memory requirement of universal routing schemes
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Compact Routing in Directed Networks with Stretch Factor of Two
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Average stretch analysis of compact routing schemes
Discrete Applied Mathematics
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
Extended minimal routing in 2-D meshes with faulty blocks
International Journal of High Performance Computing and Networking
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Scalable routing on flat names
Proceedings of the 6th International COnference
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Fault-tolerant compact routing schemes for general graphs
Information and Computation
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |