Skip header Section
Skip Bibliometrics Section
Bounded Incremental ComputationJune 1996
- Author:
- G. Ramalingam,
- Editors:
- J. van Leeuwen,
- J. Hartmanis,
- G. Goos
Abstract
No abstract available.
Cited By
- Zhang Y, Yu J, Zhang Y and Qin L (2024). Maintaining Top-
$t$ - Yin F and Shi F (2022). A Comparative Survey of Big Data Computing and HPC: From a Parallel Programming Model to a Cluster Architecture, International Journal of Parallel Programming, 50:1, (27-64), Online publication date: 1-Feb-2022.
- Wang D, Hoffmann J and Reps T (2018). PMAF: an algebraic framework for static analysis of probabilistic programs, ACM SIGPLAN Notices, 53:4, (513-528), Online publication date: 2-Dec-2018.
- Wang D, Hoffmann J and Reps T PMAF: an algebraic framework for static analysis of probabilistic programs Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, (513-528)
- Reps T, Turetsky E and Prabhu P (2017). Newtonian Program Analysis via Tensor Product, ACM Transactions on Programming Languages and Systems, 39:2, (1-72), Online publication date: 30-Jun-2017.
- Greco S, Molinaro C and Pulice C Efficient Maintenance of All-Pairs Shortest Distances Proceedings of the 28th International Conference on Scientific and Statistical Database Management, (1-12)
- Nepomniaschaya A Constructions Used in Associative Parallel Algorithms for Directed Graphs Proceedings of the 13th International Conference on Parallel Computing Technologies - Volume 9251, (201-209)
- Ardakani M and Sun L (2012). Decremental algorithm for adaptive routing incorporating traveler information, Computers and Operations Research, 39:12, (3012-3020), Online publication date: 1-Dec-2012.
- Nepomniaschaya A Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph Proceedings of the 10th International Conference on Parallel Computing Technologies, (257-268)
- Demetrescu C and Italiano G (2006). Experimental analysis of dynamic all pairs shortest path algorithms, ACM Transactions on Algorithms (TALG), 2:4, (578-601), Online publication date: 1-Oct-2006.
- Kowalik L and Kurowski M (2006). Oracles for bounded-length shortest paths in planar graphs, ACM Transactions on Algorithms (TALG), 2:3, (335-363), Online publication date: 1-Jul-2006.
- Reps T, Schwoon S, Jha S and Melski D (2005). Weighted pushdown systems and their application to interprocedural dataflow analysis, Science of Computer Programming, 58:1-2, (206-263), Online publication date: 1-Oct-2005.
- Pang C, Dong G and Ramamohanarao K (2005). Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL, ACM Transactions on Database Systems (TODS), 30:3, (698-721), Online publication date: 1-Sep-2005.
- Demetrescu C, Emiliozzi S and Italiano G Experimental analysis of dynamic all pairs shortest path algorithms Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (369-378)
- Reps T, Schwoon S and Jha S Weighted pushdown systems and their application to interprocedural dataflow analysis Proceedings of the 10th international conference on Static analysis, (189-213)
- Kowalik L and Kurowski M Short path queries in planar graphs in constant time Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (143-148)
- Cicerone S, Di Stefano G, Frigioni D and Nanni U (2003). A fully dynamic algorithm for distributed shortest paths, Theoretical Computer Science, 297:1-3, (83-102), Online publication date: 17-Mar-2003.
- Bodík R, Gupta R and Sarkar V ABCD Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, (321-333)
- Bodík R, Gupta R and Sarkar V (2019). ABCD, ACM SIGPLAN Notices, 35:5, (321-333), Online publication date: 1-May-2000.
- Cong J and Sarrafzadeh M Incremental physical design Proceedings of the 2000 international symposium on Physical design, (84-92)
- Farrahi A, Hathaway D, Wang M and Sarrafzadeh M Quality of EDA CAD Tools Proceedings of the 1st International Symposium on Quality of Electronic Design
- Frigioni D, Ioffreda M, Nanni U and Pasqualone G (1998). Experimental analysis of dynamic algorithms for the single source shortest paths problem, Journal of Experimental Algorithmics (JEA), 3, (5-es), Online publication date: 1-Sep-1998.
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Incremental computation with names
OOPSLA '15Over the past thirty years, there has been significant progress in developing general-purpose, language-based approaches to incremental computation, which aims to efficiently update the result of a computation when an input is changed. A key design ...