|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
| |
3
|
Tarjan, R.E., "Amortized computational complexity," SIAM J. Algebraic Discrete Methods 6(2) pp. 306-318 (April 1985).
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
Bowen Alpern , Roger Hoover , Barry K. Rosen , Peter F. Sweeney , F. Kenneth Zadeck, Incremental evaluation of computational circuits, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.32-42, January 22-24, 1990, San Francisco, California, United States
|
| |
12
|
Rarnalingam, G. and Reps, T., "On the computational complexity of incremental algorithms," TR-1033, Computer Sciences Department, University of Wisconsin, Madison, WI (August 1991).
|
| |
13
|
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).
|
| |
14
|
Ramalingam, G. and Reps, T., "On the complexity of incremental computation," Unpublished report, Computer Sciences Department, University of Wisconsin, Madison, WI (October 1992).
|
| |
15
|
Dionne, R., "Etude et extension d'un algorithme de Murchland," 1NFOR 16(2) pp. 132-146 (June 1978).
|
| |
16
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
|
| |
21
|
|
| |
22
|
|
| |
23
|
|
| |
24
|
|
| |
25
|
|
| |
26
|
Yeh, D., "On incremental evaluation of ordered attributed grammars," B/T 23 pp, 308-320 (1983).
|
| |
27
|
A. J. Kfoury , J. Tiuryn , P. Urzyczyn, A proper extension of ML with an effective type-assignment, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.58-69, January 10-13, 1988, San Diego, California, United States
[doi> 10.1145/73560.73565]
|
| |
28
|
|
| |
29
|
|
| |
30
|
|
| |
31
|
|
| |
32
|
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).
|
| |
33
|
|
| |
34
|
|
| |
35
|
|
| |
36
|
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).
|
| |
37
|
Bowen Alpern , Roger Hoover , Barry K. Rosen , Peter F. Sweeney , F. Kenneth Zadeck, Incremental evaluation of computational circuits, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.32-42, January 22-24, 1990, San Francisco, California, United States
|
| |
38
|
Ramalingam, G. and Reps, T., "On the computational complexity of incremental algorithms," TR-1033, Computer Sciences Department, University of Wisconsin, Madison, WI (August 1991).
|
| |
39
|
Ramalingam, 13. and Reps, T., "On the complexity of incremental computation," Unpublished report, Computer Sciences Department, University of Wisconsin, Madison, WI (October 1992).
|
| |
40
|
|
| |
41
|
|
| |
42
|
|
| |
43
|
|
| |
44
|
|
| |
45
|
|
| |
46
|
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).
|
| |
47
|
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),
|
| |
48
|
|
| |
49
|
|
| |
50
|
|
| |
51
|
|
| |
52
|
|
| |
53
|
Ramalingam, G. and Reps, T., "On the computational complexity of incremental algorithms," TR- 1033, Computer Sciences Department, University of Wisconsin, Madison, WI (August 1991).
|
| |
54
|
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).
|
| |
55
|
Loubal, P., "A network evaluation procedure," Highway Research Record 205 pp. 96-109 (1967).
|
| |
56
|
Rodionov, V., "The parametric problem of shortest distances," USS.R. Computational math. and math. Phys. 8(5) pp. 336-343 (1968).
|
| |
57
|
Halder, A.K., "The method of competing links," Transportation Science 4 pp. 36-51 (1970).
|
| |
58
|
Dionne, R., "Etude et extension d'un algorithme de Murchland," INFOR 16(2)pp. 132-146 (June 1978).
|
| |
59
|
|
| |
60
|
Goto, S. and Sangiovmmi-Vincentelli, A., "A new shortest path updating algorithm," Networks 8(4) pp. 341-372 (1978).
|
| |
61
|
|
| |
62
|
Even, S. and Gazit, H., "Updating distances in dynamic graphs," Methods of Operations Research 49pp. 371-387 (1985).
|
| |
63
|
|
| |
64
|
|
| |
65
|
Ramalingam, O. and Reps, T., "On the computational complexity of incremental algorithms," TR-1033, Computer Sciences Department, University of Wisconsin, Madison, WI (August 1991).
|
| |
66
|
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).
|
| |
67
|
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).
|
| |
68
|
|
| |
69
|
|
| |
70
|
|
| |
71
|
|
| |
72
|
|
| |
73
|
|
| |
74
|
|
| |
75
|
|
| |
76
|
|
| |
77
|
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).
|
| |
78
|
|
| |
79
|
Frededckson, G., "Data structures for on-line updating of minimum spanning trees," SIAM J. Computing 14pp. 781-798 (1985).
|
| |
80
|
|
| |
81
|
|
| |
82
|
|
| |
83
|
|
| |
84
|
YeUin, D.M., "A dynamic transitive closure algorithm," Research Report, IBM T.J. Watson Research Center, Yorktown Heights, NY (1988).
|
| |
85
|
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).
|
| |
86
|
Adam L. Buchsbaum , Paris C. Kanellakis , Jeffrey S. Vitter, A data structure for arc insertion and regular path finding, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.22-31, January 22-24, 1990, San Francisco, California, United States
|
| |
87
|
|
| |
88
|
|
| |
89
|
|
| |
90
|
|
| |
91
|
|
| |
92
|
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).
|
| |
93
|
Bentley, J.L., "Decomposable searching problems," Information Processing Letters 8 pp. 244-251 (1979).
|
| |
94
|
Bentley, J.L. and Saxe, J.B., "Decomposable searching problems I: Static-to-dynamic transformations," Journal of Algorithms 1 pp. 301-358 (1980).
|
| |
95
|
|
| |
96
|
|
| |
97
|
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).
|
| |
98
|
|
| |
99
|
Earley, J., "High-level iterators and a method for automatically designing data structure representation," J. Con~uter Languages 1(4) pp. 321-342 (1976).
|
| |
100
|
|
| |
101
|
|
| |
102
|
|
| |
103
|
|
| |
104
|
|
| |
105
|
Paige, R., "Programming with invariants," IEEE Software 3(1) pp. 56-69 (January 1986).
|
| |
106
|
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).
|
| |
107
|
Lombardi, L.A., "incremental computation," pp. 247-333 in Advances in Computers, Vol. 8, ed. F.L. Alt and M. Rubinoff, Aeademic Press (1967).
|
| |
108
|
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).
|
| |
109
|
|
| |
110
|
|
| |
111
|
|
| |
112
|
|
| |
113
|
|
| |
114
|
|
| |
115
|
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).
|
| |
116
|
|
| |
117
|
Kaiser, G.E. and Kant, E., "incremental parsing without a parser," Journal of Systems and Software 5(2)pp. 121-144 (May 1985).
|
| |
118
|
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).
|
| |
119
|
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).
|
| |
120
|
MacLennan, B.J., "A calculus of functional differences and integrals," Unpublished Draft, Department of Computer Science, University of Tennessee, Knoxville, TN 0-
|
| |
121
|
Doyle, J., "A truth maintenance system," Artijicial Intelligence 12 pp. 231-272 (1979).
|
| |
122
|
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).
|
| |
123
|
Perlis, D., "Bibliography of literature on non-monotonic reasoning," (Source unknown), (1984).
|
| |
124
|
|
| |
125
|
|
| |
126
|
|
| |
127
|
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).
|
| |
128
|
Shmueli, O., Tsur, S., and Zfira, H., "Rule support in Prolog," (Source unknown), (1984).
|
| |
129
|
|
| |
130
|
|
| |
131
|
|
| |
132
|
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).
|
| |
133
|
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).
|
| |
134
|
|
| |
135
|
Ballance, R.A. and Graham, S.L., "Incremental consistency maintenance for interactive applications," in Proceedings of the Eighth International Conference on Logic Programming, (1991).
|
| |
136
|
|
| |
137
|
|
| |
138
|
|
| |
139
|
|
| |
140
|
|
| |
141
|
|
| |
142
|
|
| |
143
|
|
| |
144
|
|
| |
145
|
|
| |
146
|
Donald D. Chamberlin , James C. King , Donald R. Slutz , Stephen J.P. Todd , Bradford W. Wade, JANUS: An interactive system for document composition, Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation, p.82-91, June 08-10, 1981, Portland, Oregon, United States
|
| |
147
|
|
| |
148
|
|
| |
149
|
|
| |
150
|
|
| |
151
|
|
| |
152
|
Brooks, K.P., "A two-view document editor with userdefinable document structure," Technical Report 33, DEC Systems Research Center, Palo Alto, CA (November 1988).
|
| |
153
|
John K. Ousterhout , Gordon T. Hamachi , Robert N. Mayo , Walter S. Scott , George S. Taylor, Magic: A VLSI layout system, Proceedings of the 21st conference on Design automation, p.152-159, June 25-27, 1984, Albuquerque, New Mexico, United States
|
| |
154
|
|
| |
155
|
|
| |
156
|
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).
|
| |
157
|
Bricklin, D. and Frankston, B., VisiCalc Computer Software Program for the Apple H and H Plus, Personal Software, Inc., Sunnyv ale, CA (1979).
|
| |
158
|
|
| |
159
|
|
| |
160
|
Konopasek, M. and Jayararnan, S., The TK!Solver Book, Osborne/McGraw-Hill, Berkeley, CA (1984).
|
| |
161
|
|
| |
162
|
|
| |
163
|
P. Borras , D. Clement , Th. Despeyroux , J. Incerpi , G. Kahn , B. Lang , V. Pascual, Centaur: the system, ACM SIGPLAN Notices, v.24 n.2, p.14-24, Feb. 1989
|
| |
164
|
|
| |
165
|
|
| |
166
|
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).
|
| |
167
|
|
| |
168
|
|
| |
169
|
|
| |
170
|
Paige, R., "Programming with invariants," IEEE Software 3(1) pp. 56-69 (January 1986).
|
| |
171
|
|
| |
172
|
|
| |
173
|
|
| |
174
|
|
| |
175
|
|
| |
176
|
|
| |
177
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
A.2