The computer science and engineering handbook

Bibliography
[1] G. M. Adelson-Velskii and Y. M. Landis, An algorithm for the organization of information, Doklady Akademii Nauk SSSR, vol. 146, pp. 263– 266, 1962. English translation in Soviet Math. Dokl., 3, 1259–1262.

[2] A. Aggarwal and J. S. Vitter, The input/output complexity of sorting and related problems, Commun. ACM, vol. 31, pp. 1116–1127, 1988.

919

[7] K. Arnold and J. Gosling, The Java Programming Language. The Java Series, Reading, Mass.: Addison-Wesley, 1996.

J. L. Bentley, Programming pearls: Writing correct programs, [12]
Communications of the ACM, vol. 26, pp. 1040–1045, 1983.

[13] J. L. Bentley, Programming pearls: Thanks, heaps, Communications of the ACM, vol. 28, pp. 245–250, 1985.

[18] D. Burger, J. R. Goodman, and G. S. Sohi, Memory systems, in The Computer Science and Engineering Handbook (A. B. Tucker, Jr., ed.), ch. 18, pp. 447–461, CRC Press, 1997.

[19] M. Campione and H. Walrath, The Java Tutorial: Programming for the Internet. Reading, Mass.: Addison Wesley, 1996.

[24] D. Comer, The ubiquitous B-tree, ACM Comput. Surv., vol. 11, pp. 121–137, 1979.

[25] T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.