REFERENCES
ACM/IEEE-CS Joint Curriculum Task Force, Computing Curricula 1991, Association for Computing Machinery, New York, 1991.
Adel'son-Vel'skii, G.M., and E. M. Landis, "An Algorithm for the Organization of Information," Soviet Mathematics, Vol. 3, 1962: 1259-1263.
Albir, S. S., UML in a Nutshell, O'Reilly & Associates, Inc., Sebastopol, CA, 1998.
Andersson, A., T. Hagerup S. Nilson and R. Raman, "Sorting in Linear Time?", Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, 1995.
Arnold, K., J. Gosling, The Java Programming Language, Addison-Wesley Publishing Company, Reading, MA, 1996.
Bailey, D. A., Data Structures in Java for the Principled Programmer, Second Edition, The McGraw-Hill Companies, Inc., Burr Ridge, IL, 2003.
Bayer, R. "Symmetric Binary B-trees: Data Structure and Maintenance Algorithms", Acta Informatica, 1(4), 1972: 290-306.
Bentley, J. L. and M. D. McIlroy, "Engineering a Sort Function," Software—Practice and Experience, 23(11), November 1993: 1249-1265.
Bloch, J., Effective Java Programming Language Guide, Addison-Wesley, Boston, 2001.
Collins, W. J., Data Structures and the Standard Template Library, McGraw-Hill, New York, NY, 2003.
Cormen, T., C. Leierson R. and R. Rivest, Introduction to Algorithms, Second Edition, McGraw-Hill, New York, NY, 2002.
Dale, N. "If You Were Lost on a Desert Island, What One ADT Would You Like to Have with You?", Proceedings ofthe Twenty-First SIGCSE Technical Symposium, 22(1), March 1991: 139-142.
Dijkstra, ...
Get Data Structures and the Java Collections Framework, Third Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
