Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks
IEEE Transactions on Computers
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A characterization of networks supporting linear interval routing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
METANET: principles of an arbitrary topology LAN
IEEE/ACM Transactions on Networking (TON)
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Bubbles: adaptive routing scheme for high-speed dynamic networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A Flexible Bit-Pattern Associative Router for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
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
Fault-tolerant routing in hypercubes using masked interval routing scheme
Proceedings of the 1999 ACM symposium on Applied computing
Periodically Regular Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the Space Requirement of Interval Routing
IEEE Transactions on Computers
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A fault-tolerant routing scheme in dynamic networks
Journal of Computer Science and Technology
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science
Routing in distributed networks: overview and open problems
ACM SIGACT News
Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network
IEEE Transactions on Parallel and Distributed Systems
The complexity of the characterization of networks supporting shortest-path interval routing
Theoretical Computer Science
Compact Routing in Directed Networks with Stretch Factor of Two
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Interval Routing on Layered Cross Product of Trees and Cycles
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Efficient Communication Schemes
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On Majority Voting Games in Trees
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Networks with Small Stretch Number
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Small k-Dominating Sets in Planar Graphs with Applications
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Interval routing in some planar networks
Theoretical Computer Science
Performance Analysis of STC104 Interconnection Networks
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Journal of Parallel and Distributed Computing
The compactness of adaptive routing tables
Journal of Discrete Algorithms
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
New bounds for multi-label interval routing
Theoretical Computer Science
Characterization of networks supporting multi-dimensional linear interval routing schemes
Theoretical Computer Science
A Memory-Effective Routing Strategy for Regular Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
The Josephus Cube: analysis of routing and fault tolerance
Journal of Parallel and Distributed Computing
A short note on the lower bound of dilation for O(logn)-label interval routing
Information Processing Letters
FIR: an efficient routing strategy for tori and meshes
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
Distance and routing labeling schemes for non-positively curved plane graphs
Journal of Algorithms
NOCS '07 Proceedings of the First International Symposium on Networks-on-Chip
Routing table minimization for irregular mesh NoCs
Proceedings of the conference on Design, automation and test in Europe
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
On the hardness of minimizing space for all-shortest-path interval routing schemes
Theoretical Computer Science
An Efficient Implementation of Distributed Routing Algorithms for NoCs
NOCS '08 Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip
Improved compact routing schemes for dynamic trees
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Note: A note on models for graph representations
Theoretical Computer Science
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
A short note on the lower bound of dilation for O(logn)-label interval routing
Information Processing Letters
Design of a viable fault-tolerant routing strategy for optical-based grids
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Routing to support communication in dependable networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Scalable network-on-chip architecture for configurable neural networks
Microprocessors & Microsystems
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Distributed node location in clustered multi-hop wireless networks
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
An improved interval routing scheme for almost all networks based on dominating cliques
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Max-stretch reduction for tree spanners
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On compact and efficient routing in certain graph classes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Geometric routing without geometry
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
A hierachical configuration system for a massively parallel neural hardware platform
Proceedings of the 9th conference on Computing Frontiers
| Hi-index | 0.01 |