Incremental Distance and Diameter Sequences of a Graph: New Measures of Network Performance
IEEE Transactions on Computers
Running algorithms efficiently on faulty hypercubes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Running algorithms efficiently on faulty hypercubes (extended abstract)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Tolerating Faults in Hypercubes Using Subcube Partitioning
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Dynamic fault-tolerant clock synchronization
Journal of the ACM (JACM)
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
IEEE Transactions on Computers
An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
Theoretical Computer Science
Reconfigurable disruption tolerant routing via reinforcement learning
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 0.01 |