Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
A generalization of Janson inequalities and its application to finding shortest paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
Key Point Based Data Analysis Technique
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
A simpler algorithm for the all pairs shortest path problem with o(n2 log n) expected time
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Faster Algorithms for Max-Product Message-Passing
The Journal of Machine Learning Research
Constructing interference-minimal networks
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Computation of shortest path in cellular automata
Mathematical and Computer Modelling: An International Journal
A simplified algorithm for the all pairs shortest path problem with O(n2logn) expected time
Journal of Combinatorial Optimization
All-pairs shortest paths in O(n2) time with high probability
Journal of the ACM (JACM)
| Hi-index | 0.00 |