B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Bounded Incremental Parsing - Wiren (Correct)
....current input. However, making this notion precise in a way which is independent of particular incremental algorithms is not always straightforward. Two early approaches along these lines are Goodwin [6, 7] reason maintenance) and Reps [13] language based editing) More recently, Alpern et al. [1] and Ramalingam and Reps [12] have provided a framework for analysing incremental algorithms, in which the basic measure used is the sum of the sizes of the changes in the input and output. This framework presupposes a problem instance (a representation of the current input) P and a solution S ....
....time depending only on ffi . Intuitively, this means that it only processes the region where the input or output changes. Algorithms of this kind can then be classified according to their respective degrees of boundedness (see Ramalingam and Reps We have modified the notation of Alpern et al. [1] slightly. 12, section 5] For example, an algorithm which is linear in ffi is asymptotically optimal. Furthermore, an incremental algorithm is said to be unbounded if the time it takes to update the solution can be arbitrarily large for a given ffi . It might seem that what has been discussed ....
[Article contains additional citation context not shown here]
Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, and F. Kenneth Zadeck. Incremental Evaluation of Computational Circuits. In Proc. First Annual ACM--SIAM Symposium on Discrete Algorithms, pages 32--42, San Francisco, California, USA, 1990.
Incremental Computation for Transformational Software.. - Yanhong Liu Tim (1995) (Correct)
....results used in computing the output f(x) also need to be maintained for efficient incremental computation of f(x Phi y) Moreover, certain auxiliary information about x may need to be discovered and maintained as well. Numerous techniques for incremental computation have been developed, e.g. [3, 4, 16, 20, 21, 24, 31, 36, 38, 40, 43, 44, 47, 52]. In [31] we give a systematic transformational approach for deriving an incremental program f from a given program f and an input change Phi. The basic idea is to identify in the computation of f(x Phi y) those subcomputations that are also performed in the computation of f(x) and whose ....
B. Alpern, R. Hoover, B. Rosen, P. Sweeney, and K. Zadeck. Incremental evaluation of computational circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42, San Francisco, California, January 1990.
A Constraint-Based Architecture for Local Search - Michel, Van Hentenryck (2002) (3 citations) (Correct)
....in programming languages. It integrates one way constraints pioneered in the Sketchpad and ThingLab object oriented systems [24, 4] and generalizes them to accommodate nite di erencing techniques on algebraic and set expressions [19, 29] It also encapsulates ecient incremental graph algorithms [21, 1], and uses polymorphism heavily to obtain its compositional nature. Observe also that the resulting architecture has some avor of aspect oriented programming [13] since constraints represent and maintain properties across a wide range of objects. Finally, note also that many of the concepts ....
....and specify a relation which must be maintained under assignments of new values to its variables. For instance, the code fragment incfintg s(m) sum(i in 1. 10) a[i] declares an incremental variable s of type int (in a model m) and an invariant specifying that s is always the summation of a[1], a[10] Each time, a new value is assigned to an element a[i] the value of s is updated accordingly (in constant time) Note that the invariant speci es the relation to be maintained incrementally, not how to update it. Incremental variables are always associated with a model (m in this ....
[Article contains additional citation context not shown here]
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32-42, San Francisco, California, 22-24 Jan. 1990.
Adaptive Negative Cycle Detection in Dynamic Graphs - Chandrachoodan.. (2001) (Correct)
....In these situations, it is often more efficient to adapt existing information to aid the solution of the constraint system. In the area of computer aided system design, it is often easy to cast the problem of design space exploration in a way that benefits from this approach. Several researchers[4, 5, 6] have worked on the area of incremental computation. They have presented analyses of algorithms for the shortest path problem and negative cycle detection in dynamic graphs. These approaches have focussed on the incremental (single change) problem and cannot be extended to take advantage of ....
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck, "Incremental evaluation of computational circuits," in Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, pp. 32--42, 1990.
Strengthening Invariants for Efficient Computation - Liu, Stoller, Teitelbaum (2001) (Correct)
.... computation is a fundamental issue relevant throughout computer software, e.g. optimizing compilers [2,3,17,23,78] transformational program development [8,20,62,65,77] and interactive systems [5,6,10,22,33,41,71,72] Numerous techniques for incremental computation have been developed, e.g. [3,4,25,34 36,56,64,68,70,73,76,79,86]. Strengthening invariants for incrementalization. We are engaged in an ambitious e ort to derive incremental extended programs automatically (or semi automatically) from non incremental programs written in standard programming languages.This approach contrasts with many other approaches that aim ....
B. Alpern, R. Hoover, B. Rosen, P. Sweeney, and K. Zadeck. Incremental evaluation of computational circuits. In Proceedings of the 1st Annual ACMSIAM Symposium on Discrete Algorithms, pages 32-42. ACM, New York, Jan. 1990.
A dynamic algorithm for topologically sorting - Directed Acyclic Graphs (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42, 1990.
Online Cycle Detection and Difference Propagation for.. - David Pearce Paul (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42, 1990.
Tree Decompositions With Small Cost - Irit Katriel Hans (2005) (2 citations) (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. Kenneth Zadeck. Incremental evaluation of computational circuits. In Proc. of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42. SIAM, 1990.
Dynamic Expression Trees - Robert Cohen Roberto (1995) (4 citations) (Correct)
No context found.
B. Alpern, R. Hoover, B. Rosen, P. Sweeney, and F.K. Zadeck, "Incremental Evaluation of Computational Circuits," Proc. ACM-SIAM Symp. on Discrete Algorithms (1990), 32--42.
Maintaining Longest Paths Incrementally - Michel, Van Hentenryck (2003) (2 citations) (Correct)
No context found.
B. Alpern, R. Hoover, B. Rosen, P. Sweeney, and K. Zadeck. Incremental Evaluation of Computational Circuits. In SODA-90, 1990.
Maintaining Longest Paths Incrementally - Irit Katriel Irit (2005) (Correct)
No context found.
Alpern, B., Carle, A., Rosen, B., Sweeney, P., & Zadeck, K. (1990). Incremental evaluation of computational circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-90), San Francisco, California (January).
Online Topological Ordering - Katriel, Bodlaender (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. Kenneth Zadeck. Incremental evaluation of computational circuits. In Proc. of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32-42. SIAM, 1990.
Online Topological Ordering - Irit Katriel And (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. Kenneth Zadeck. Incremental evaluation of computational circuits. In Proceedings of the rst annual ACM-SIAM symposium on Discrete algorithms, pages 32-42. Society for Industrial and Applied Mathematics, 1990.
Incremental Algorithms for Some Network Flow Problems - Kumar (2001) (Correct)
No context found.
Alpern B., Hoover, Rosen R., Sweeney P.F. and Zadeek F.K. Incremental evaluation of computational circuits Proceedings of 1st Annual ACM-SIAM Symposium on discrete algorithms, 33-42 : 1990
Online Cycle Detection and Difference Propagation for.. - Pearce, Kelly, Hankin (2003) (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42, 1990.
Online Cycle Detection and Difference Propagation for.. - David Pearce Paul (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42, 1990.
Online Cycle Detection and Difference Propagation for.. - David Pearce Paul (2003) (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42, 1990.
On the Computational Complexity of Dynamic Graph Problems - Ramalingam And Thomas (1996) (25 citations) (Correct)
No context found.
Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., and Zadeck, F.K., "Incremental evaluation of computational circuits," pp. 32-42 in Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, (San Francisco, CA, Jan. 22-24, 1990), Society for Industrial and Applied Mathematics, Philadelphia, PA (1990).
Online Algorithms for Topological Order and Strongly Connected.. - Pearce (2003) (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42, 1990.
Unknown - (Correct)
No context found.
Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, and F. Kenneth Zadeck. Incremental evaluation of computational circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32-42, San Francisco, California, 22-24 January 1990.
An Incremental Algorithm for a Generalization of the.. - Ramalingam And Thomas (1992) (46 citations) (Correct)
No context found.
Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., and Zadeck, F.K., "Incremental evaluation of computational circuits," pp. 32-42 in Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, (San Francisco, CA, Jan. 22-24, 1990), Society for Industrial and Applied Mathematics, Philadelphia, PA (1990).
Maintaining Longest Paths Incrementally - Laurent Michel And (2003) (2 citations) (Correct)
No context found.
B. Alpern, R. Hoover, B. Rosen, P. Sweeney, and K. Zadeck. Incremental Evaluation of Computational Circuits. In SODA-90, 1990.
A Fully Dynamic Algorithm for Distributed Shortest Paths - Cicerone, Di Stefano.. (Correct)
No context found.
B. Alpern, R. Hoover, B.K. Rosen, P.F. Sweeney and F.K. Zadeck. Incremental evaluation of computational circuits. Proc. ACM-SIAM Symposium on Discrete Algorithms, 32-42, 1990.
An Incremental Algorithm for a Generalization of the.. - Ramalingam And Thomas (1992) (46 citations) (Correct)
No context found.
Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., and Zadeck, F.K., "Incremental evaluation of computational circuits," pp. 32-42 in Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, (San Francisco, CA, Jan. 22-24, 1990), Society for Industrial and Applied Mathematics, Philadelphia, PA (1990).
A Dynamic Algorithm for Topologically Sorting Directed Acyclic .. - Pearce, Kelly (2004) (3 citations) (Correct)
No context found.
B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32--42, 1990.
First 50 documents
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