A fully dynamic algorithm for distributed shortest paths
Theoretical Computer Science - Latin American theoretical informatics
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science
A speed-up technique for distributed shortest paths computation
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part II
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networks
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A loop-free shortest-path routing algorithm for dynamic networks
Theoretical Computer Science
| Hi-index | 0.00 |