1. F. N. Afrati, D. Q. Goldin, and P. C. Kanellakis. Efficient Parallelism for Structured Data: Directed Reachability in S-P Dags, Technical Report CS-88-07, Department of Computer Science, Brown University, 1988.
2. 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, pp. 32?42.
3. G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, and U. Nanni. Incremental algorithms for minimal length paths,Proc. ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 12?21.
4. S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees,SIAM J. Comput.,14 (1985), 545?568.
5. A. M. Berman, M. C. Paull, and B. G. Ryder. Proving relative lower bounds for incremental algorithms,Acta Inform.,27 (1990), 665?683.