Testing and Debugging Distributed Programs Using Global Predicates
IEEE Transactions on Software Engineering
IEEE Transactions on Parallel and Distributed Systems
Distributed LTL Model Checking Based on Negative Cycle Detection
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
How to Employ Reverse Search in Distributed Single Source Shortest Paths
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
A fully dynamic algorithm for distributed shortest paths
Theoretical Computer Science - Latin American theoretical informatics
Parallel implementation of geometric shortest path algorithms
Parallel Computing - Special issue: High performance computing with geographical data
Efficient algorithms for optimistic crash recovery
Distributed Computing
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)
A distributed algorithm for interference aware routing in wireless networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science
On distributed time-dependent shortest paths over duty-cycled wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Parallel computation of best connections in public transportation networks
Journal of Experimental Algorithmics (JEA)
Engineering a new loop-free shortest paths routing algorithm
SEA'12 Proceedings of the 11th 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.01 |