G. Ramalingam
Thomas Reps
- Yellin, D. and Strom, R., "INC: A language for incremental computations," ACM Trans. Program. Lang. Syst. 13(2)pp. 211-236 (April 1991).]] Google Scholar
Digital Library
- Sleator, D.D. and Tarjart, R.E., "A data structure for dynamic trees," Journal of Computer and System Sciences 26pp. 362-391 (1983).]] Google ScholarDigital Library
- Tarjan, R.E., "Amortized computational complexity," SIAM J. Algebraic Discrete Methods 6(2) pp. 306-318 (April 1985).]]Google ScholarDigital Library
- Sleator, D.D. and Tarjan, R.E., "Amortized efficiency of list update and paging rules," Commun. of the ACM 28(2)pp. 202-208 (February 1985).]] Google ScholarDigital Library
- McGeoch, L.A. and Sleator, D.D. (eds.), On-Line Algorithms, American Mathematical Society, Providence, RI (1992).]] Google ScholarDigital Library
- Karp, R.M., "On-line algorithms versus off-line algorithms: How much is it worth to know the future?," pp. 416-429 in Information Processing 92: Proceedings of the IFIP Twelfth Worm Computer Congress, ed. J. van Leeuwen,North- Holland, Amsterdam (September 1992).]] Google ScholarDigital Library
- Louchard, G., Randrianarimanana, B., and Schott, R., "Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis," Theoretical Computer Science 93pp. 201-225 (1992).]] Google ScholarDigital Library
- Berman, A.M., PaulL M.C., and Ryder, B.G., "Proving relative lower bounds for incremental algorithms," Acta Informatica 27 pp. 665-683 (1990).]] Google ScholarDigital Library
- Reif, J.H., "A topological approach to dynamic graph connectivity," Information Processing Letters 25(1)pp. 65-70 (1987).]] Google ScholarDigital Library
- Reps, T., Teitelbaum, T., and Demers, A., "Incremental context-dependent analysis for language-based editors," ACM Trans. Program.Lang. Syst. 5(3) pp. 449-477 (July 1983).]] Google ScholarDigital Library
- Alpem, 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).]] Google ScholarDigital Library
- Rarnalingam, G. and Reps, T., "On the computational complexity of incremental algorithms," TR-1033, Computer Sciences Department, University of Wisconsin, Madison, WI (August 1991).]]Google Scholar
- Ramalingam, G. and Reps0 T., "An incremental algorithm for a generalization of the shortest-path problem," TR-1087, Computer Sciences Department, University of Wisconsin, Madison, WI (May 1992).]]Google Scholar
- Ramalingam, G. and Reps, T., "On the complexity of incremental computation," Unpublished report, Computer Sciences Department, University of Wisconsin, Madison, WI (October 1992).]]Google Scholar
- Dionne, R., "Etude et extension d'un algorithme de Murchland," 1NFOR 16(2) pp. 132-146 (June 1978).]]Google Scholar
- Taylor, G.S. and Ousterhout, LK., "Magic's incremental design-rule checker," pp. 160-165 in Proceedings of the Twenty-First Design Automation Conference, IEEE Computer Society, Washington, I3(3 (1984).]] Google ScholarDigital Library
- Scott, W.S. and Ousterhout, J.K., "Plowing: Interactive stretching and compaction in Magic," pp. 166-172 in Proceedings of the Twenty.First Design Automation Conference, IEEE Computer Society, Washington" DC (1984).]] Google ScholarDigital Library
- Hoover, R., "Incremental graph evaluation," Ph.D. dissertation and Teeh. Rep. 87-836, Dept. of Computer Science, Cornell University, Ithaca, NY (May 1987).]] Google ScholarDigital Library
- Ryder, B.G., Landi, W., and Pande, H.D., "Profiling an incremental data flow analysis algorithm," IEEE Transactions on Software Engineering SE-16(2)(February 1990).]] Google ScholarDigital Library
- Zaring, A., "Parallel evaluation in attribute grammar based systems," Ph.D. dissertation and Teeh. Rep. 90-1149, Dept. of Computer Science, Cornell University, Ithaca, NY (August 1990).]] Google ScholarDigital Library
- Harrison, M.A. and Munson, E.V., "Numbering document components," Electronic Publishing 4(1)(January 1991).]] Google ScholarDigital Library
- Demers, A., Reps, T., and Teitelbaum, T., "Incremental evaluation for attribute gram.mars with application to syntaxdirected editors," pp. 105-116 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, Jan. 26-28, 1981), ACM, New York, NY (1981).]] Google ScholarDigital Library
- Reps, T., "Optimal-time incremental semantic analysis for syntax-directed editors," pp. 169-176 in Conference Record of the Ninth ACM Symposium on Principles of Programming Languages, (Albuquerque, NM, January 25-27, 1982), ACM, New York, NY (1982).]] Google ScholarDigital Library
- Reps, T., Teitelbaum, T., and Demers, A., "Incremental context-dependent analysis for language-based editors," ACM Trans. Program. Lang. Syst. 5(3) pp. 449-477 (July 1983),]] Google ScholarDigital Library
- Reps, T., Generating Language-Based Environments, The M.I.T. Press, Cambridge, MA (1984).]] Google ScholarDigital Library
- Yeh, D., "On incremental evaluation of ordered attributed grammars," B/T 23 pp, 308-320 (1983).]]Google Scholar
- Jones, L. and Simon, J., "Hierarchical VLSI design systems based on attribute grammars," pp. 58-69 in Conference Record of the Thirteenth ACM Symposium on Principles of Programming Languages, (St. Petersburg, FL, Jan. 13-15, 1986), ACM, New York, NY (1986).]] Google ScholarDigital Library
- Reps, T., Marceau, C., and Teitelbaum, T., "Remote attribute updating for language-based editors," pp. 1-13 in Conference Record of the Thirteenth ACM Symposium on Principles of Programming Languages, (St. Petersburg, FL, Jan. 13-15, 1986), ACM, New York, NY (1986).]] Google ScholarDigital Library
- Kaplan, S. and Kaiser, (3., "Incremental attribute evaluation in distributed language-based editors," pp. 121-130 in Proceedings of the Fifth ACM Symposium on Principles of Distributed Computing, (1986).]] Google ScholarDigital Library
- Hoover, R. and Teitelbaum, T., "Efficient incremental evaluation of aggregate values in attribute grammars," Proceedings of the SIGPLAN 86 Symposium on Compiler Construction, (Palo Alto, CA, June 25-27, 1986), ACM SIGPLAN Notices 21(7) pp. 39-50 (July 1986).]] Google ScholarDigital Library
- Hoover, R., "Incremental graph evaluation," Ph.D. dissertation and Tech. Rep. 87-836, Dept. of Computer Science, Cornell University, Ithaca, NY (May 1987).]] Google ScholarDigital Library
- Parigot, D., "Transformations, (~valuation incr~mentale et optimizations des grammaires attributes: Le syst~me FNC-2," These de Doctorat, L'Universit~ Paris XI, Centre D'Orsay, Orsay, France (1988).]]Google Scholar
- Kaiser, G.E., "Incremental dynamic semantics for languagebased programming environments," ACM Trans. Program. Lang. Syst. 11(2)pp. 169-193 (April 1989).]] Google ScholarDigital Library
- Teitelbaum, T. and Chapman, R., "Higher-order attribute grammars and editing environments," Proceedings of the ACM SIGPLAN 90 Conference on Programming Language Design and implementation, (White Plains, NY, June 20-22, 1990), ACM SIGPLAN Notices 25(6)pp. 197-208 (June 1990).]] Google ScholarDigital Library
- Zaring, A., "Parallel evaluation in attribute grammar based systems," Ph.D. dissertation and Tech. Rep. 90-1149, Dept. of Computer Science, ComeI1 University, Ithaca, NY (August 1990).]] Google ScholarDigital Library
- Pardo, R.K. and Landau, R., "Process and apparatus for converting a source program into an object program," U.S. Patent No. 4,398,249, United States Patent Office, Washington, DC (August 9, 1983).]]Google Scholar
- Alpem, 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- SlAM Symposium on Discrete Algorithms, (San Francisco, CA, Jan. 22-24, 1990), Society for Industrial and Applied Mathematics, Philadelphia, PA (1990).]] Google ScholarDigital Library
- Ramalingam, G. and Reps, T., "On the computational complexity of incremental algorithms," TR-1033, Computer Sciences Department, University of Wisconsin, Madison, WI (August 1991).]]Google Scholar
- Ramalingam, 13. and Reps, T., "On the complexity of incremental computation," Unpublished report, Computer Sciences Department, University of Wisconsin, Madison, WI (October 1992).]]Google Scholar
- Rosen, B.K., "Linear cost is sometimes quadratic," pp. 117-124 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), ACM, New York, NY (1981).]] Google ScholarDigital Library
- Ryder, B., "Incremental data flow analysis based on a unified model of elimination algorithms," Ph.D. dissertation and Tech. Rep. DCS-TR-117, Rutgers University. New Brunswick, Nj (September 1982).]] Google ScholarDigital Library
- Ghodssi, V., "Incremental analysis of programs," Ph.D. dissertation, Dept. of Computer Science, University of Central Florida, Orlando, FL (1983).]] Google ScholarDigital Library
- Zadeck, F.K., "Incremental data flow analysis in a structured program editor," Ph.D. dissertation, Mathematical Sciences Dept., Rice University, Houston, TX (October 1983).]] Google ScholarDigital Library
- Zadeck, F.K., "Incremental data flow analysis in a structured program editor," Proceedings of the SIGPLAN 84 Symposium on Compiler Construction, (Montreal, Can., June 20-22, 1984), ACM SIGPLAN Notices 19(6)pp. 132-143 (June 1984).]] Google ScholarDigital Library
- Cooper, K.D. and Kennedy, K., "The impact of interprocedural analysis and optimization in the R" programming environmerit," ACM Trans. Program. Lang. Syst. 8(4)pp. 491-523 (October 1986).]] Google ScholarDigital Library
- Burke, M., "An interval-based approach to exhaustive and incremental interprocedural data flow analysis," Res. Rep. RC 12702, IBM T.J. Watson Research Center, Yorktown Heights, NY (April 1987).]]Google Scholar
- Burke, M. and Ryder, B., "Incremental iterative data flow analysis algorithms," Res. Rep. RC 13170, IBM T.J. Watson Research Center, Yorktown Heights, NY (October 1987),]]Google Scholar
- Carroll, M. and Ryder, B., "Incremental data flow update via attribute and dominator updates," pp. 274-284 in Conference Record of the Fifteenth ACM Symposium on Principles of Programming Languages, (San Diego, CA, January 13-15, 1988), ACM, New York, NY (1988).]] Google ScholarDigital Library
- Ryder, B.G. and Paull, M.C., "Incremental data flow analysis algorithms," ACM Trans. Program. Lang. Syst. 10(1)pp. 1-50 (January 1988).]] Google ScholarDigital Library
- Marlowe, T.J., "Data flow analysis and incremental iteration," Ph.D. dissertation and Tech. Rep. DCS-TR-255, Rutgers University, New Brunswick, NJ (October 1989).]] Google ScholarDigital Library
- Marlowe, T.J. and Ryder, B.G., "An efficient hybrid algorithm for incremental data flow analysis," pp. 184-196 in Conference Record of the Seventeenth ACM Symposium on Principles of Programming Languages, (San Francisco, CA, Jan. 17-19, 1990), ACM, New York, NY (1990).]] Google ScholarDigital Library
- Rosene, C.M., "Incremental dependence analysis," Ph.D. dissertation and Tech Rep. CRPC-TR90044, Center for Research on Parallel Computation, Rice University, Houston, TX (March 1990).]] Google ScholarDigital Library
- Ramalingam, G. and Reps, T., "On the computational complexity of incremental algorithms," TR- 1033, Computer Sciences Department, University of Wisconsin, Madison, WI (August 1991).]]Google Scholar
- Murchland, J.D., "The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph," Tech. Rep. LBS-TNT-26, London Business School, Transport Network Theory Unit, London, UK (1967).]]Google Scholar
- Loubal, P., "A network evaluation procedure," Highway Research Record 205 pp. 96-109 (1967).]]Google Scholar
- Rodionov, V., "The parametric problem of shortest distances," USS.R. Computational math. and math. Phys. 8(5) pp. 336-343 (1968).]]Google ScholarCross Ref
- Halder, A.K., "The method of competing links," Transportation Science 4 pp. 36-51 (1970).]]Google ScholarDigital Library
- Dionne, R., "Etude et extension d'un algorithme de Murchland," INFOR 16(2)pp. 132-146 (June 1978).]]Google Scholar
- Cheston, G.A., "Incremental algorithms in graph theory," Ph.D. dissertation and Tech. Rep. 91, Dept. of Computer Science, University of Toronto, Toronto, Canada (March 1976).]] Google ScholarDigital Library
- Goto, S. and Sangiovmmi-Vincentelli, A., "A new shortest path updating algorithm," Networks 8(4) pp. 341-372 (1978).]]Google ScholarCross Ref
- Rohnert, H., "A dynamization of the all pairs least cost path problem," pp. 279-286 in Proceedings of STACS 85: Second Annual Symposium on Theoretical Aspects of Computer Science, (Saarbruecken, W. Ger., Jan. 3-5, 1985), Lecture Notes in Computer Science, Vol. 182, ed. K. Mehlhom, Springer- Verlag, New York, NY (1985).]] Google ScholarDigital Library
- Even, S. and Gazit, H., "Updating distances in dynamic graphs," Methods of Operations Research 49pp. 371-387 (1985).]]Google Scholar
- Lin, C.-C. and Chang, R.-C., "On the dynamic shortest path problem," Journal of lnformation Processing 13(4)(1990).]] Google ScholarDigital Library
- Ausiello, (3., Italiano, G.F., Spaccamela, A.M., and Nanni, U., "Incremental algorithms for minimal length paths," Journal of Algorithms 12 Pp. 615-638 (1991).]] Google ScholarDigital Library
- Ramalingam, O. and Reps, T., "On the computational complexity of incremental algorithms," TR-1033, Computer Sciences Department, University of Wisconsin, Madison, WI (August 1991).]]Google Scholar
- Ramalingam, G. and Reps, T., "An incremental algorithm for a generalization of the shortest-path problem," TR-1087, Computer Sciences Department, University of Wisconsin, Madison, WI (May 1992).]]Google Scholar
- Koenig, S. and Paige, R., "A transfomaational framework for the automatic control of derived data," pp. 306-318 in Proceedings of the Seventh International Conference on Very Large Data Bases, (Cannes, France, September 1981), (1981).]]Google Scholar
- Shmueli, O. and Itai, A., "Maintenance of views," pp. 240-255 in Proceedings of the ACM SIGMOD 84 Conference, (Boston, MA, 1984), ACM, New York, NY (1984).]] Google ScholarDigital Library
- Horwitz, S., "Generating language-based editors: A relafionally-attributed approach," Ph.D. dissertation, Dept. of Computer Science, ComeU University, Ithaca, NY (August 1985).]] Google ScholarDigital Library
- Horwitz, S. and Teitelbaum, T., "Generating editing environments based on relations and attributes," ACM Trans. Program. Lang. Syst. 8(4) pp. 577-608 (October 1986).]] Google ScholarDigital Library
- Yellin, D. and Strom, R., "INC: A language for incremental computations," ACM Trans. Program. Lang. Syst. 13(2)pp. 211-236 (April 1991).]] Google ScholarDigital Library
- Pugh, W.W., "incremental computation and the incremental evaluation of functional programs," Ph.D. dissertation and Teeh. Rep. 88-936, Dept. of Computer Science, Comell University, Ithaca, NY (August 1988).]] Google ScholarDigital Library
- Pugh, W. and Teitelbaum, T., "Incremental computation via function caching," pp. 315-328 in Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, (Austin, TX, Jan. 11-13, 1989), ACM, New York, NY (1989).]] Google ScholarDigital Library
- Field, J. and Teitelbaum, T., "incremental reduction in the lambda calculus," in Conference Record of the 1990 ACM Symposium on Lisp and Functional Programming, (Nice, France, June 1990), ACM, New York, NY (1990).]] Google ScholarDigital Library
- Field, J., "Incremental reduction in the lambda calculus and related reduction systems," Ph.D. dissertation, Dept. of Computer Science, Comell University, Ithaca, NY (May 1991).]] Google ScholarDigital Library
- Cohen, R.F. and Tamassia, R., "Dynamic expression trees and their applications," pp. 52-61 in Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, (San Francisco, CA, Jan. 28-30, 1991), Society for Industrial and Applied Mathematics, Philadelphia, PA (1991).]] Google ScholarDigital Library
- Chestort, G.A., "incremental algorithms in graph theory," Ph.D. dissertation and Tech. Rep. 91, Dept. of Computer Science, University of Toronto, Toronto, Canada (March 1976).]]Google Scholar
- Even, S. and Shiloach, Y., "An on-line edge-deletion problem," J. ACM 28(1) pp. 1-4 (January 1981).]] Google ScholarDigital Library
- Frededckson, G., "Data structures for on-line updating of minimum spanning trees," SIAM J. Computing 14pp. 781-798 (1985).]]Google ScholarDigital Library
- Italiano, G.F., "Amortized efficiency of a path retrieval data structure," Theoretical Computer Science 48 pp. 273-281 (1986).]] Google ScholarDigital Library
- Reif, J.H., "A topological approach to dynamic graph connectivity," Information Processing Letters 25(1)pp. 65-70 (1987).]] Google ScholarDigital Library
- La Poutr6, JA. and van Leeuwerh J., "Maintenance of transitive closures and transitive reductions of graphs," pp. 106-120 in Graph-Theoretic Concepts in Computer Science: Proceedings of the 14th International Workshop (1988), Lecture Notes in Computer Science, (1988).]] Google ScholarDigital Library
- Italiano, G.F., "Finding paths and deleting edges in directed acyclic graphs," Information Processing Letters 28 pp. 5-11 (1988).]] Google ScholarDigital Library
- YeUin, D.M., "A dynamic transitive closure algorithm," Research Report, IBM T.J. Watson Research Center, Yorktown Heights, NY (1988).]]Google Scholar
- Di Battista, G. and Tamassia, R., "incremental planarity testing, pp. 436-441 in Proceedings of the Thirtieth IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC (1989).]]Google Scholar
- Buchsbattm, A.L., Kanellakis, P.C., and Vitter, J.S., "A data structure for arc insertion and regular path finding," pp. 22-31 in Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, (San Francisco, CA,/an. 22-24, 1990), Society for Industrial and Applied Mathematics, Philadelphia, PA (1990).]] Google ScholarDigital Library
- Yannakakis, M., "Graph-theoretic methods in database theory," pp. 230-242 in Proceedings of the Symposium on Principles of Database Systems, (1990).]] Google ScholarDigital Library
- Frederickson, G., "Ambivalent data structures for dynamic 2- edge-connectivity and k smallest spanning trees," pp. 632-641 in Proceedings of the Thirty-Second IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC (1991).]] Google ScholarDigital Library
- Gall1, Z. and Italiano, G.F., "Fully dynamic algorithms for edge-connectivity problems," pp. 317-327 in Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, ACM, New York, NY (1991).]] Google ScholarDigital Library
- Kanevsky, A., Tamassia, R., Di Battista, G., and Chen, J., "On-line maintenance of the four-connected components of a graph," pp. 793-801 in Proceedings of the Thirty-Second IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC (1991).]] Google ScholarDigital Library
- La Poutr6, J.A., "Maintenance of triconnected components of graphs," pp. 354-365 in Proceedings of the Nineteenth International Collquium on Automata, Languages, and Programming, (1992).]] Google ScholarDigital Library
- Eppstein, D., Galil, Z., Italiano, G.F., and Nissenzweig, A., "Sparsification- A technique for spewing up dynamic graph algorithms," in Proceedings of the Thirty.ttu'rd IEEE Symposium on Foundations of Computer Science, (Pittsburgh, PA, Oct. 25-27, 1992), IEEE Computer Society, Washington, DC (1992).]]Google Scholar
- Bentley, J.L., "Decomposable searching problems," Information Processing Letters 8 pp. 244-251 (1979).]]Google Scholar
- Bentley, J.L. and Saxe, J.B., "Decomposable searching problems I: Static-to-dynamic transformations," Journal of Algorithms 1 pp. 301-358 (1980).]]Google ScholarCross Ref
- Overmars, M.H., The Design of Dynamic Data Structures, Lecture Notes in Computer Science, Vol. 156, Springer- Verlag, New York, NY (1983).]] Google ScholarDigital Library
- Mehlhorn, K., Data Structures and Algorithms 3: Multi- Dimensional Searching and Computational Geometry, Springer-Veflag, Berlin (1984).]] Google ScholarDigital Library
- Eppstein, D., Galil, Z., Italiano, G.F., and Nissenzweig, A., "Sparsification- A technique for speeding up dynamic graph algorithms," in Proceedings of the Thirty-third IEEE Symposium on Foundations of Computer Science, (Pittsburgh, PA, Oct. 25-27, 1992), IEEE Computer Society, Washington, DC (1992).]]Google Scholar
- Earley, J,, "High-level operations in automatic programming," Proceedings of the ACM SIGPLAN Symposium on Very High Lever Languages, (March 1974), ACM SIGPLAN Notices 9(4)(April 1974).]] Google ScholarDigital Library
- Earley, J., "High-level iterators and a method for automatically designing data structure representation," J. Con~uter Languages 1(4) pp. 321-342 (1976).]]Google Scholar
- Fong, A. and Ullman, J., "induction variables in very high level languages," pp. 104-112 in Conference Record of the Third ACM Symposium on Principles of Programming Languages, (Atlanta, GA, Jan. 19-21, 1976), ACM, New York, NY (1976).]] Google ScholarDigital Library
- Fong, A., "Elimination of common subexpressions in very high level languages," pp. 48-57 in Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, (Los Angeles, CA, January 17-19, 1977), ACM, New York, NY (1977).]] Google ScholarDigital Library
- Fong, A., "Inductively computable constructs in very high level languages," pp. 21-28 in Conference Record of the Sixth ACM Symposium on Principles of Programming Languages, (San Antonio, TX, Jan. 29-31, 1979), ACM, New York, NY (1979).]] Google ScholarDigital Library
- Paige, R. and Koenig, S., "Finite differencing of computable expressions," ACM Trans. Program. Lang. Syst. 4(3)pp. 402-454 (July 1982).]] Google ScholarDigital Library
- Goldberg, A. and Paige, R., "Stream processing," in Conferentre Record of the 1984 ACM Symposium on Lisp and Functional Programming, (Austin, TX, August 6-8, 1984), ACM, New York, NY (1984).]] Google ScholarDigital Library
- Paige, R., "Programming with invariants," IEEE Software 3(1) pp. 56-69 (January 1986).]]Google ScholarDigital Library
- Lombardi, L.A. and Raphael, B., "Lisp as the language for an incremental computer," pp. 204-219 in The Programming Language Lisp: Its Operation and Applications, ed. E.C. Berkeley and D.G. Bobrow,The M.I.T. Press, Cambridge, MA (1964).]]Google Scholar
- Lombardi, L.A., "incremental computation," pp. 247-333 in Advances in Computers, Vol. 8, ed. F.L. Alt and M. Rubinoff, Aeademic Press (1967).]]Google Scholar
- Sundaresh, R.S. and Hudak, P., "Incremental computation via partial evaluation," in Conference Record of the Eighteenth ACM Symposium on Principles of Programming Languages, (Orlando, FL, January 1991), ACM, New York, NY (1991).]] Google ScholarDigital Library
- Sundaresh, R.S., "Building incremental programs using partial evaluation," Proceedings of the SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM 91), (New Haven, CT, June 17-19, 1991), ACM SIGPLAN Notices 26(9) pp. 83-93 (September 1991).]] Google ScholarDigital Library
- Sundaresh, R.S., "incremental computation via parial evaluation," Ph.D. dissertation and Res. Rep. YALEU~S/RR-889, Dept. of Computer Science, Yale University, New Haven, CT (December 1991).]] Google ScholarDigital Library
- Field, J. and Teitelbaum, T., "incremental reduction in the lambda calculus," in Conference Record of the 1990 ACM Symposium on Lisp and Functional Programming, (Nice, France, June 1990), ACM, New York, NY (1990).]] Google ScholarDigital Library
- Field, J., "Incremental reduction in the lambda calculus and related reduction systems," Ph.D. dissertation, Dept. of Computer Science, Comell University, Ithaca, NY (May 1991).]] Google ScholarDigital Library
- Ghezzi, C. and Mandrioli, D., "incremental parsing," ACM Trans. Program. Lang. Syst. 1(1) pp. 58-70 (July 1979).]] Google ScholarDigital Library
- Ghezzi, C. and Mandrioli, D., "Augmenting parsers to support incrementality," Journal of the ACM 27(3)pp. 564-579 (October 1980).]] Google ScholarDigital Library
- Wegman, M., "Parsing for structural editors," pp. 320-327 in Proceedings of the Twenty-First IEEE Symposium on Foundations of Computer Science (Syracuse, NY, October 1980), IEEE Computer Society, Washington, DC (1980).]]Google Scholar
- Jalili, F. and Gallier, J., "Building friendly parsers," pp. 196-206 in Conference Record of the Ninth ACM Symposium on Principles of Programming Languages, (Albuquerque, NM, Jan. 25-27, 1982), ACM, New York, NY (1982).]] Google ScholarDigital Library
- Kaiser, G.E. and Kant, E., "incremental parsing without a parser," Journal of Systems and Software 5(2)pp. 121-144 (May 1985).]]Google Scholar
- MacLennan, B.J., "Preliminary investigation of a calculus of functional differences: Fixed differences," Report NPS52-86- 010, Computer Science Department, Naval Postgraduate School, Monterey, CA (February 1986).]]Google Scholar
- MacLenuan, B.J., "An algebraic approach to a calculus of functional differences: Fix~ed differences and integrals," Report NPS52-87-041, Computer Science Department, Naval Postgraduate School, Monterey, CA (September 1987).]]Google Scholar
- MacLennan, B.J., "A calculus of functional differences and integrals," Unpublished Draft, Department of Computer Science, University of Tennessee, Knoxville, TN 0-]]Google Scholar
- Doyle, J., "A truth maintenance system," Artijicial Intelligence 12 pp. 231-272 (1979).]]Google ScholarCross Ref
- Doyle, J., "A glimpse of truth maintenance," in Artiftcial Intelligence: An MJ.T. Perspective, ed. P.H. Winston and R.H. Brown,The M.I.T. Press, Cambridge, MA (1979).]]Google Scholar
- Perlis, D., "Bibliography of literature on non-monotonic reasoning," (Source unknown), (1984).]]Google Scholar
- de Kleer, J., "An assumption-based TMS," Artificial Intelligence 28 pp. 127-162 (1986).]] Google ScholarDigital Library
- de Kleer, J., "Extending the ATMS," Artificial Intelligence 28 pp. 163-196 (1986).]] Google ScholarDigital Library
- de Kleer, J., "Problem solving with the ATMS," Artiftcial Intelligence 28 pp. 197-224 (1986).]] Google ScholarDigital Library
- McAllester, D., "Truth maintenance," pp. 92-104 in Proceedings of the Eighth National Conference on Artificial Intelligence, (Boston, MA, July 29 - August 3, 1990), AAM Press/Fhe M.I.T. Press, Cambridge, MA (1990).]]Google Scholar
- Shmueli, O., Tsur, S., and Zfira, H., "Rule support in Prolog," (Source unknown), (1984).]]Google Scholar
- Mannila, H. and Ukkonen, E., "Time parameter and arbitrary deunions in the set union problem," pp. 34-42 in Proceedings of the First Scandinavian Workshop on Algorithm Theory (SWAT 88), Lecture Notes in Computer Science, Vol. 318, Springer-Verlag, New York, NY (1988).]] Google ScholarDigital Library
- Snelting, G. and Henhapl, W., "Unification in many-sorted algebras as a device for incremental semantic analysis," pp. 229-235 in Conference Record of the Th&teenth ACM Symposium on Principles of Programming Languages, (St. Petersburg, FL, Jan. 13-15, 1986), ACM, New York, NY (1986).]] Google ScholarDigital Library
- Attali, I., "Compiling TYPOL with attribute grammars," pp. 252-272 in Proceedings of the International Workshop on Programming Language Implementation and Logic Programming '88, Lecture Notes in Computer Science, Vol. 348, ed. P. Deransart, B. Lorho, and J. Maluszynski, Springer-Verlag, New York, NY (1988).]] Google ScholarDigital Library
- Atmli, I. and Franchi-Zannettacci, P., "Unification-free execution of TYPOL programs by semantic attribute evaluation," pp. 160-177 in Proceedings of the Fifth International Conference and Symposium on Logic Programming, ed. R. Kowalski and K. Bowen,The M.I.T. Press, Cambridge, MA (1988).]]Google Scholar
- van der Meulen, E.A., "Deriving incremental implementations from algebraic specifications," Report CS-R9072, Computer Science/Department of Software Technology, Center for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands (December 1990).]]Google Scholar
- Ballance, R.A., "Syntactic and semantic checking in language-based editing systems," Ph.D. dissertation and Tech. Rep. UCB/CSD 89/548, Dept. of Electrical Engineering and Computer Science, University of California--Berkeley, Berkeley, CA (December 1989).]] Google ScholarDigital Library
- Ballance, R.A. and Graham, S.L., "Incremental consistency maintenance for interactive applications," in Proceedings of the Eighth International Conference on Logic Programming, (1991).]]Google Scholar
- Vander Zanden, B. T., "Incremental constraint satisfaction and its application to graphical interfaces," Ph.D. dissertation and Tech. Rep. TR 88-941, Dept. of Computer Science, Cornell University, Ithaca, NY (October 1988).]] Google ScholarDigital Library
- Freeman-Benson, B.N, Maloney, J., and Borning, A., "An incremental constraint solver," Commun. of the ACM 33(1)pp. 54-63 (January 1990).]] Google ScholarDigital Library
- Fritzson, P., "Preliminary experience from the DICE system, a distributed incremental compiling environment," Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, (Pittsburgh, PA, Apr. 23-25, 1984), ACM SIGPLAN Notices 19(5)pp. 113-123 (May 1984).]] Google ScholarDigital Library
- Fritzson, P., "Towards a distributed programming environment based on incremental compilation," Link~ping Studies in Science and Technology Dissertation No. 109, Dept. of Comp. and Inf. Sci., Link~ping University, Link~ping, Sweden (1984).]] Google ScholarDigital Library
- Schwartz, M., Delisle, N., and Begwani, V., "Incremental compilation in Magpie," Proceedings of the SIGPLAN 84 Symposium on Compiler Construction, (Montreal, Can., June 20-22, 1984), ACM SIGPLAN Notices 19(6) pp. 122-131 (June 1984).]] Google ScholarDigital Library
- Tichy, W.F., "Smart recompilation," ACM Trans. Program. Lang. Syst. 8(3) pp. 637-654 (July 1986).]] Google ScholarDigital Library
- Schwanke, R.W. and Kaiser, G.E., ''Technical Correspondence: Smarter recompilation," ACM Trans. Program. Lang. Syst. 10(4) pp. 627-632 (October 1988).]] Google ScholarDigital Library
- Tichy, W.F., '~rechnical Correspondence: Tichy's response to R.W. Schwanke and G.E. Kaiser's "Smarter recompilation"," ACM Trans. Program. Lang. Syst. 10(4)pp. 633-634 (October 1988).]] Google ScholarDigital Library
- Cooper, K.D. and Kennedy, K., "The impact of interprocedural analysis and optimization in the R" programming environment," ACM Trans. Program. Lang. Syst. 8(4)pp. 491-523 (October 1986).]] Google ScholarDigital Library
- Burke, M. and Torczon, L., "Interprocedural optimization: Eliminating unnecessary recompilation," ACM Trans. Program. Lang. Syst., O. (To appear.)]] Google ScholarDigital Library
- Chamberlin, D.D., King, J.C., Slutz, D.R., Todd, S.J.P., and Wade, B.W., "JANUS: An interactive system for document composition," Proceedings of the ACM SIGPLAN/SIGOA Symposium on Text Manipulation, (Portland, OR, June 8-10, 1981), ACM SIGPLAN Notices 16(6) pp. 82-91 (June 1981).]] Google ScholarDigital Library
- Chamberlin, D.D., "Document convergence in an interactive formatting system," IBM Systems Journal 31(1)pp. 58-72 (January 1987).]] Google ScholarDigital Library
- Chen, P. and Harrison, M.A., "Multiple representation document development," IEEE Computer 21(1) pp. 15-31 (January 1988).]] Google ScholarDigital Library
- Chen, P., "A multiple-representation paradigm for document development," Ph.D. dissertation and Tech. Rep. UCB/CSD 88/436, Dept. of Electrical Engineering and Computer Science, University of California-Berkeley, Berkeley, CA (1988).]] Google ScholarDigital Library
- Harrison, M.A. and Munson, E.V., "On integrated bibliography processing," Electronic Publishing 2(4) pp. 193-210 (December 1989).]] Google ScholarDigital Library
- Harrison, M.A. and Munson, E.V., "Numbering document components," Electronic Publishing 4( 1 )(January 1991).]] Google ScholarDigital Library
- Brooks, K.P., "A two-view document editor with userdefinable document structure," Technical Report 33, DEC Systems Research Center, Palo Alto, CA (November 1988).]]Google Scholar
- Ot~terhout, J.K., Hamachi, G.T., Mayo, R.N., Scott, W.S., and Taylor, G.S., "Magic: A VLSI layout system," pp. 152-159 in Proceedings of the Twenty-First Design Automation Conference, IEEE Computer Society, Washington, DC (1984).]] Google ScholarDigital Library
- Taylor, G.S. and Ousterhout, J.K., "Magic's incremental design-rule checker," pp. 160-165 in Proceedings of the Twenty-First Design Automation Conference, IEEE Computer Society, Washington, DC (1984).]] Google ScholarDigital Library
- Scott, W.S. and Ousterhout, J.K., "Plowing: Interactive stretching and compaction in Magic," pp. 166-172 in Proceedings of the Twenty-First Design Automation Conference, IEEE Computer Society, Washington, 13(2 (1984).]] Google ScholarDigital Library
- Ousterhout, J.K., "Comer stitching: A data-structuring technique for VLSI layout tools," IEEE Transactions on Computer-Aided Design CAD-3(1)pp. 87-100 (January 1984).]]Google Scholar
- Bricklin, D. and Frankston, B., VisiCalc Computer Software Program for the Apple H and H Plus, Personal Software, Inc., Sunnyv ale, CA (1979).]]Google Scholar
- Alpem, B., Carle, A., Rosen, B., Sweeney, P., and Zadeck, K., "Graph attribution as a specification paradigm," Proceedings of the ACM SIGSOFTISIGPLAN Software Engineering Symposium on Practical Software Development Environments, (Boston, MA, November 28-30, 1988), ACM SIG- PLAN Notices 24(2) pp. 121-129 (February 1989).]] Google ScholarDigital Library
- Borning, A.H., "/'hingLab--A constraint-oriented simulation laboratory," Ph.D. dissertation, Comp. Sei. Dept., Stanford University, and Tech. Rep. SSL-79-3, Xerox Palo Alto Research Center, Palo Alto, CA (July 1979).]] Google ScholarDigital Library
- Konopasek, M. and Jayararnan, S., The TK!Solver Book, Osborne/McGraw-Hill, Berkeley, CA (1984).]]Google Scholar
- Reps, T. and Teitelbaum, T., The Synthesizer Generator: A System for Constructing Language-Based Editors, Springer- Verlag, New York, NY (1988).]] Google ScholarDigital Library
- Reps, T. and Teitelbaum, T., The Synthesizer Generator Reference Manual: Third Edition, Springer-Verlag, New York, NY (1988).]] Google ScholarDigital Library
- Borras, P., Cl&aent, D., Despeyroux, T., Ineerpi, J., Kahn, G,, Lang, B., and Pascual, V., "CENTAUR: The system," Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, (Boston, MA, November 28-30, 1988), ACM SIGPLAN Notices 24(2) pp. 14-24 (February 1989).]] Google ScholarDigital Library
- Bahlke, R. and Snelting, G., "The PSG system: From formal language defirtitions to interactive programming environments," ACM Trans. Program. Lang. Syst. 8(4)pp. 547-576 (October 1986).]] Google ScholarDigital Library
- Ballance, R.A., Graham, S.L., and Van De Vanter, M.L., "The Pan language-based editing system," ACM Trans. Software Engineering and Methodology l(1)pp. 95-127 (January 1992).]] Google ScholarDigital Library
- Klint, P. (ed.), "The ASF+SDF Meta-environment user's guide," Draft, Computer Science/Department of Software Technology, Center for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands (1992).]]Google Scholar
- Paige, R. and Koenig, S., "Finite differencing of computable expressions," ACM Trans. Program. Lang. Syst, 4(3)pp. 402-454 (July 1982).]] Google ScholarDigital Library
- Paige, R., "Transformational programmingmapplications to algorithms and systems," pp. 73-87 in Conference Record of the Tenth ACM Symposium on Principles of Programming Languages, (Austin, TX, Jan. 24-26, 1983), ACM, New York, NY (1983).]] Google ScholarDigital Library
- Goldberg, A. and Paige, R., "Stream processing," in Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, (Austin, TX, August 6-8, 1984), ACM, New York, NY (1984).]] Google ScholarDigital Library
- Paige, R., "Programming with invariants," IEEE Software 3(1) pp. 56-69 (January 1986).]]Google ScholarDigital Library
- Ca.i, J. and Paige, R., "Binding performance at language design time," pp. 85-97 in Conference Record of the Fourteenth ACM Symposium on Principles of Programming Languages, (Munich, W. Germany, January 1987), ACM, New York, NY (1987).]] Google ScholarDigital Library
- Cai, J. and Paige, R., "Program derivation by fixed point computation," Science of Computer Programming 11 pp. 197-261 (1988/89).]] Google ScholarDigital Library
- Cai, J. and Paige, R., "Languages polynomial in the input plus output," in Proceedings of the Second International Conference on Algebraic Methodology and Software Technology (AMAST), (Iowa City, Iowa, May 22-25, 1991), (1991).]] Google ScholarDigital Library
- Hoover, R., "Alphonse: Incremental computation as a programming abstraction," Proceedings of the A CM SIGPLAN 92 Conference on Programming Language Design and Implementation, (San Francisco, CA, June 17-19, 1992), ACM SIG- PLA222N Notices 27(7) pp. 261-272 (July 1992).]] Google ScholarDigital Library
- Bertsekas, D.P., Linear Network Optimization: Algorithms and Codes, The M.I.T. Press, Cambridge, MA (1991).]] Google ScholarDigital Library
- Gallo, G., Grigoriadis, M.D., and Tarjan, R.E., "A fast parametric maximum flow algorithm and applications," SIAM J. Computing 18(1) pp. 30-55 (February 1989).]] Google ScholarDigital Library
- Henderson, P. and Weiser, M., "Continuous execution: The Visiprog environment," in Proceedings of the Eighth IEEE International Conference on Software Engineering, IEEE Computer Society, Washington, DC (1985).]] Google ScholarDigital Library
Index Terms
- A categorized bibliography on incremental computation
Recommendations
Incremental computation with names
OOPSLA 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and ApplicationsOver 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 ...
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 ...
Comments