G. RAMALINGAM and THOMAS REPS University of Wisconsin-Madison A common way to ...  Home/Search
Context Related
| wisc.edu/wpis/papers/tcs96a.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisc.edu/~reps/reps (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper explores a different way to analyze incremental algorithms. Rather than express the cost of an incremental computation as a function of the size of the current input, we measure the cost in terms of the sum of the sizes of the changes in the input and the output. This change in approach allows us to develop a more informative theory of computational complexity for dynamic problems (Update)
Cited by: More
Tree Decompositions With Small Cost - Irit Katriel Hans (2005) (Correct)
Maintaining Longest Paths Incrementally - Michel, Van Hentenryck (2003) (Correct)
Online Topological Ordering - Katriel, Bodlaender (Correct)
Active bibliography (related documents): More All
2.4: An Incremental Algorithm for a Generalization of the.. - Ramalingam And Thomas (1992) (Correct)
2.3: An Incremental Algorithm for a Generalization of the.. - Ramalingam, Reps (1992) (Correct)
1.4: Lower And Upper Bounds For Incremental Algorithms - Berman (1992) (Correct)
Similar documents based on text: More All
0.2: Experimental Analysis of Dynamic Algorithms for.. - Frigioni.. (1997) (Correct)
0.2: New Programs From Old - Ramalingam And Thomas (Correct)
0.2: Semantics of Program Representation Graphs - Ramalingam, Reps (1989) (Correct)
Related documents from co-citation: More All
15: An incremental algorithm for a generalization of the shortest-path problem - Ramalingam, Reps - 1992
11: Incremental algorithms for minimal length paths (context) - Ausiello, Italiano et al. - 1991
10: Fibonacci heaps and their uses in improved network optimization algorithms (context) - Fredman, Tarjan - 1987
BibTeX entry: (Update)
G. Ramalingam, T. Reps, On the Computational Complexity of Dynamic Graph Problems, Theoretical Computer Science, 158, 1996, 233--277. http://citeseer.ist.psu.edu/ramalingam96computational.html More
@article{ ramalingam96computational,
author = "G. Ramalingam and Thomas Reps",
title = "On the computational complexity of dynamic graph problems",
journal = "Theoretical Computer Science",
volume = "158",
number = "1--2",
pages = "233--277",
year = "1996",
url = "citeseer.ist.psu.edu/ramalingam96computational.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
171 The Synthesizer Generator: A System for Constructing Languag.. (context) - Reps, Teitelbaum - 1988
164 Society for Industrial and Applied Mathematics (context) - Tarjan - 1983
68 Theoretical improvements in algorithmic efficiency for netwo.. (context) - Edmonds, Karp - 1972
62 Generating Language-Based Environments (context) - Reps - 1984
61 Incremental context-dependent analysis for language-based ed.. (context) - Reps, Teitelbaum et al. - 1983
53 Relaxed heaps: An alternative to Fibonacci heaps with applic.. (context) - Driscoll, Gabow et al. - 1988
50 line edge-deletion problem (context) - Even, Shiloach - 1981
50 Incremental algorithms for minimal length paths (context) - Ausiello, Italiano et al. - 1990
49 Incremental evaluation of computational circuits (context) - Alpern, Hoover et al. - 1990
35 Incremental data flow analysis algorithms (context) - Ryder, Paull - 1988
33 Bounded Incremental Computation (context) - Ramalingam - 1993
33 Updating distances in dynamic graphs (context) - Even, Gazit - 1985
32 An efficient hybrid algorithm for incremental data flow anal.. (context) - Marlowe, Ryder - 1990
31 On finding and updating spanning trees and shortest paths (context) - Spira, Pan - 1975
27 Incremental data flow analysis in a structured program edito.. (context) - Zadeck - 1984
24 Incremental graph evaluation (context) - Hoover - 1987
18 A dynamization of the all pairs least cost path problem (context) - Rohnert - 1985
14 A topological approach to dynamic graph connectivity (context) - Reif - 1987
13 the computational complexity of incremental algorithms (context) - Ramalingam, Reps - 1991
13 Proving relative lower bounds for incremental algorithms (context) - Berman, Paull et al. - 1990
12 Optimal-time incremental semantic analysis for syntax-direct.. (context) - Reps - 1982
10 A network evaluation procedure (context) - Loubal - 1967
10 The parametric problem of shortest distances (context) - Rodionov - 1968
10 Data flow analysis and incremental iteration (context) - Marlowe - 1989
10 A fixed matrix method for all shortest distances in a direct.. (context) - Murchland
8 Graph property update algorithms and their application to di.. (context) - Cheston, Corneil - 1982
8 A new shortest path updating algorithm (context) - Goto, Sangiovanni-Vincentelli - 1978
8 Etude et extension d'un algorithme de Murchland (context) - Dionne - 1978
8 the dynamic shortest path problem (context) - Lin, Chang - 1990
7 Incremental algorithms in graph theory (context) - Cheston - 1976
7 Profiling an incremental data flow analysis algorithm (context) - Ryder, Landi et al. - 1990
7 Remote attribute updating for language-based editors (context) - Reps, Marceau et al. - 1986
7 Binding performance at language design time (context) - Cai, Paige - 1987
7 Languages polynomial in the input plus output (context) - Cai, Paige - 1991
7 Incremental data flow update via attribute and dominator upd.. (context) - Carroll, Ryder - 1988
6 On incremental evaluation of ordered attributed grammars (context) - Yeh - 1983
5 The effect of increasing or decreasing the length of a singl.. (context) - Murchland - 1967
5 Linear cost is sometimes quadratic (context) - Rosen - 1981
5 Data flow update via dominator and attribute updates (context) - Carroll - 1988
4 Netzwerk-veraenderungen und korrektur kuerzester weglaengen .. (context) - Pape - 1974
4 Constrained routing in large sparse networks (context) - Hsieh, Kershenbaum et al. - 1976
4 The method of competing links (context) - Halder - 1970
4 Incremental evaluation for attribute grammars with unrestric.. (context) - Reps - 1988
2 Time polynomial in input or output (context) - Gurevich, Shelah - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.wisc.edu/~reps/reps.html): More
Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999) (Correct)
Putting Static Analysis to Work for Verification: A Case.. - Lev-Ami, Reps, Sagiv.. (2000) (Correct)
Program Slicing for VHDL - Clarke, Fujita, Rajan, Reps.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC