Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A performance analysis of view materialization strategies
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
On the time-space complexity of reachability queries for preprocessed graphs
Information Processing Letters
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Fully dynamic algorithms for edge connectivity problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On geometric assembly planning
On geometric assembly planning
Offline algorithms for dynamic minimum spanning tree problems
Journal of Algorithms
Geometric reasoning about mechanical assembly
Artificial Intelligence
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Maintaining Materialized Views in Distributed Databases
Proceedings of the Fifth International Conference on Data Engineering
How to Treat Delete Requests in Semi-Online Problems
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
Fully dynamic biconnectivity and transitive closure
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On the automatic generation of plans for mechanical assembly
On the automatic generation of plans for mechanical assembly
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Dynamic tree isomorphism via first-order updates to a relational database
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A general framework for assembly planning: the motion space approach
Proceedings of the fourteenth annual symposium on Computational geometry
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
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences - STOC 1999
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Dynamic plane transitive closure
ESA'07 Proceedings of the 15th annual European conference on Algorithms
| Hi-index | 0.00 |