1.

J. L. Bentley and C. C. McGeoch,

*Amortized analyses of self-organizing sequential heuristics*, Comm. ACM 28, No. 4 (1985), pp. 404–411.

CrossRef2.

T. S. Chen, W. P. Yang and R. C. T. Lee,*Amortized analyses of disk scheduling algorithms: SSTF and SCAN*, Proc. of National Computer Symposium, Taiwan, R.O.C., (1989), pp. 831–836.

3.

T. S. Chen and W. P. Yang,*Amortized analysis for a continuum of disk scheduling V(R)*, Proc. of International Conference on Information and Systems, AMSE, Hangzhou, China, (1991), pp. 1277–1280.

4.

E. G. Coffman, L. A. Klimko and B. Ryan,

*Analysis of scanning policies for reducing disc seek times*, SIAM Journal on Computing, 1, (1972), pp. 269–279.

CrossRefMATH5.

H. M. Deitel,*Operating Systems* (Second Edition), Addison-Wesley Publishing Co. Reading Mass., (1990).

6.

P. J. Denning,*Effects of scheduling on file memory operations*, Proc. AFIPS, Montvale, N.J., (1967), pp. 9–21.

7.

M. L. Fredman, R. Sedgewick, D. D. Sleator and R. E. Tarjan,*The pairing heap: a new form of self-adjusting heap*, Algorithmica No. 1 (1986), pp. 111–129.

8.

H. Frank,

*Analysis and optimization of disk storage devices for time sharing systems*, J. ACM 16, No. 4 (1969), pp. 602–620.

CrossRefMATH9.

R. Geist and S. Daniel,

*A continuum of disk scheduling algorithms*, ACM Trans. Computer Syst. 5, No. 1 (1987), pp. 77–92.

CrossRef10.

E. F. Grove,*The harmonic online k-server algorithm is competitive*, In Proc. 23rd ACM Symposium on Theory of Computing, (1991), pp. 260–266.

11.

M. Hofri,

*Disk scheduling FCFS vs. SSTF revisited*, Comm. ACM 23, No. 11 (1980), pp. 645–653.

CrossRef12.

R. C. T. Lee, R. C. Chang and S. S. Tseng,*Introduction to the Design and Analysis of Algorithms*, Prentice Hall, (1989).

13.

M. Manasse, L. A. McGeoch and D. D. Sleator,*Competitive algorithms for on-line problems*, In Proc. 20th Annual ACM Symposium on Theory of Computing, (1988), pp. 322–333.

14.

M. Manasse, L. A. McGeoch and D. D. Sleator,

*Competitive algorithms for server problems*, Journal of Algorithms, 11 (1990), pp. 208–230.

CrossRefMATHMathSciNet15.

B. M. E. Moret and H. D. Shapior,*Algorithms from P to NP, Volume I: Design and Efficiency*, The Benjamin/Cummings Publishing Company, Inc. Redwood City, CA 94065 (1991).

16.

P. W. Purdom, Jr. and C. A. Brown,*The Analysis of Algorithms*, CBS College Publishing, (1985).

17.

A. Silberschatz and J. L. Peterson,*Operating System Concepts*, Addison-Wesley Publishing, Reading Mass., (1988), pp. 263.

18.

D. D. Sleator and R. E. Tarjan,

*Self-adjusting binary search trees*, J. Assoc. Comput. Mach. 32, No. 3 (1985), pp. 652–686.

MATHMathSciNet19.

D. D. Sleator and R. E. Tarjan,

*Self-adjusting heaps*, SIAM J. Comput. 15, No. 1 (1986), pp. 52–69.

CrossRefMATHMathSciNet20.

R. E. Tarjan,*Data structure and network algorithms*, Society for Industrial and Applied Mathematics, Philadelphia, Pa., (1983).

21.

R. E. Tarjan,

*Amortized computational complexity*, SIAM J. Alg. Disc. Math. 6, No. 2 (1985), 306–318.

CrossRefMATHMathSciNet22.

T. J. Teorey and T. B. Pinkerton,

*A comparative analysis of disk scheduling policies*, Comm. ACM 15, No. 3 (1972), pp. 177–194.

CrossRefMATH23.

N. C. Wilhelm,

*An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses*, Comm. ACM 19, No. 1 (1976), 13–17.

CrossRefMATH24.

W. P. Yang and T. S. Chen,*The study of amortized complexity on disk system*, Technical Report, NSC79-0408-E009-01, National Chiao Tung University, Hsinchu, Taiwan, R.O.C., (1989).