Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Incremental algorithms in graph theory.
Incremental algorithms in graph theory.
Efficient gateway synthesis from formal specifications
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
A polynomial algorithm for gateway generation from formal specifications
IEEE/ACM Transactions on Networking (TON)
A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic algorithms for chordal graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
Word encoding tree connectivity works
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences - STOC 1999
Maintaining all-pairs approximate shortest paths under deletion of edges
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Data structures for on-line updating of minimum spanning trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
An Experimental Study of Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Artificial Intelligence
Incremental heuristic search in AI
AI Magazine
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
Formal Methods in System Design
Incremental computation of shortest paths in semi-dynamic graphs using software components
Proceedings of the 44th annual Southeast regional conference
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Dynamic algorithms for graph spanners
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On Cartesian Trees and Range Minimum Queries
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Proceedings of the forty-second ACM symposium on Theory of computing
Algorithms and theory of computation handbook
Delineating imprecise regions via shortest-path graphs
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
An O(n2) time algorithm for alternating Büchi games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fully dynamic randomized algorithms for graph spanners
ACM Transactions on Algorithms (TALG)
Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
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
Mining most frequently changing component in evolving graphs
World Wide Web
| Hi-index | 0.00 |