Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
ISPD '00 Proceedings of the 2000 international symposium on Physical design
ABCD: eliminating array bounds checks on demand
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Optimal Algorithms of Event-Driven Re-evaluation of Boolean Functions
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A fully dynamic algorithm for distributed shortest paths
Theoretical Computer Science - Latin American theoretical informatics
Short path queries in planar graphs in constant time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quality of EDA CAD Tools: Definitions, Metrics and Directions
ISQED '00 Proceedings of the 1st International Symposium on Quality of Electronic Design
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL
ACM Transactions on Database Systems (TODS)
Weighted pushdown systems and their application to interprocedural dataflow analysis
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Oracles for bounded-length shortest paths in planar graphs
ACM Transactions on Algorithms (TALG)
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Does path cleaning help in dynamic all-pairs shortest paths?
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Weighted pushdown systems and their application to interprocedural dataflow analysis
SAS'03 Proceedings of the 10th international conference on Static analysis
| Hi-index | 0.00 |