Data Structures and Algorithms in C++, Second Edition

Bibliography

[b001] [1]G. M. Adel'son-Vel'skiiY. 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.

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

[b003] [3]A. V. Aho, "Algorithms for finding patterns in strings," in Handbook of Theoretical Computer Science (J.van Leeuwen, ed.), vol. A. Algorithms and Complexity, pp. 255–300, Amsterdam: Elsevier, 1990.

[b004] [4]A. V. AhoJ. E. HopcroftJ. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.

[b005] [5]A. V. AhoJ. E. HopcroftJ. D. Ullman, Data Structures and Algorithms. Reading, MA: Addison-Wesley, 1983.

[b006] [6]R. K. AhujaT. L. MagnantiJ. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice Hall, 1993.

[b007] [7]R. Baeza-YatesB. Ribeiro-Neto, Modern Information Retrieval. Reading, Mass.: Addison-Wesley, 1999.

[b008] [8]O. Baruvka, "O jistem problemu minimalnim," Praca Moravske Prirodovedecke Spolecnosti, vol. 3, pp. 37–58, 1926. (in Czech).

[b009] [9]R. Bayer, "Symmetric binary B-trees: Data structure and maintenance," Acta Informatica, vol. 1, no. 4, pp. 290–306, 1972.

[b010] [10]R. BayerMcCreight, "Organization of large ordered indexes," Acta Inform., vol. 1, pp. 173–189, 1972.

[b011] [11]J. L. Bentley, "Programming pearls: Writing correct ...