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, E. W., "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik 1, 1959: 269-271.

Dijkstra. E. W., A Discipline ofProgramming, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1976.

Flajolet, P. and A. Odlyzko, "The Average Height of Binary Trees and Other Simple Trees," Raports de Recherche, #56, Institut National de Recherche en Informatique et en Informatique, February 1981.

Fowler, M., K. Scott, UML Distilled, Second Edition, Addison-Wesley, Reading, MA, 2000.

Gamma, E., R. Helm R. Johnson, and J. Vlissides, Design Patterns: Elements ofReusable Object-Oriented Software, Addison-Wesley Publishing Company, Reading, MA, 1995.

Goodrich, M., and R. Tamassia, Data Structures and Algorithms in Java, Second Edition, John Wiley & Sons, Inc., New York, 2001.

Gries, D., Science of Programming, Springer-Verlag, New York, 1981.

Guibas, L., R. Sedgewick, "A Diochromatic Framework for Balanced Trees", Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, 1978: 8-21.

Habibi, M., Java Regular Expressions: Taming the java.util.regex Engine, Apress, Berkeley, CA, 2004.

Heileman, G. L., Data Structures, Algorithms and Object-Oriented Programming, The McGraw-Hill Companies, Inc., New York, 1996.

Hoare C. A. R., "Quicksort," Computer Journal, 5(4), April 1962: 10-15.

Huffman, D. A., "A Model for the Construction of Minimum Redundancy Codes," Proceedings of the IRE, 40, 1952: 1098-1101.

Knuth, D. E., The Art of Computer Programming, Volume 1: "Fundamental Algorithms," Second Edition, Addison-Wesley Publishing Company, Reading, MA, 1973.

Knuth, D. E., The Art of Computer Programming, Volume 2: "Seminumerical Algorithms," Second Edition, Addison-Wesley Publishing Company, Reading, MA, 1973.

Knuth, D. E., The Art of Computer Programming, Volume 3: "Sorting and Searching," Addison-Wesley Publishing Company, Reading, MA, 1973.

Kruse, R. L., Data Structures and Program Design, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1987.

Lewis, J., and W. Loftus, Java Software Solutions: Foundations of Program Design, Second Edition, Addison Wesley Longman, Inc., Reading, MA, 2000.

McIlroy, M., "A Killer Adversary for Quicksort," Software—Practice and Experience 29(0), 1999: 1-4.

Meyer, B., Object-oriented Software Construction, Prentice-Hall International, London, 1988.

Newhall, T. L. Meeden, "A Comprehensive Project for CS2: Combining Key Data Structures and Algorithms into an Integrated Web Browser and Search Engine," Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, March 2002: 386-290.

Noonan, R. E., "An Object-Oriented View of Backtracking," Proceedings of the 31st SIGCSE Technical Symposium on Computer Science Education, March 2000: 362-366.

Pfleeger, S. L., Software Engineering: Theory and Practice, Prentice-Hall, Inc., Upper Saddle River, New Jersey, 1998.

Pohl, I., C. McDowell, Java by Dissection, Addison Wesley Longman, Inc., Reading, MA, 2000.

Prim, R. C., "Shortest Connection Networks and Some Generalizations", Bell System Technical Journal 36, 1957: 1389-1401.

Rawlins, G. J., Compared to What? An Introduction to the Analysis of Algorithms, Computer Science Press, New York, NY, 1992.

Riel, A. J., Object-Oriented Design Heuristics, Addison-Wesley Publishing Company, Reading, MA, 1996.

Roberts, S., Thinking Recursively, John Wiley & Sons, Inc., New York, 1986.

Sahni, S., Data Structures, Algorithms, and Applications in Java, The McGraw-Hill Companies, Inc., Burr Ridge, IL, 2000.

Schaffer, R., and R. Sedgewick, "The Analysis of Heapsort," Journal of Algorithms 14, 1993: 76-100.

Shaffer, C., A Practical Introduction to Data Structures and Algorithm Analysis, Prentice-Hall, Inc., Upper Saddle River, New Jersey, 1998.

Simmons, G. J. (Editor), Contemporary Cryptology: The Science ofInformation Integrity, IEEE Press, New York, NY, 1992.

Wallace, S. P., Programming Web Graphics, O'Reilly & Associates, Sebastopol, CA, 1999.

Weiss, M. A., Data Structures and Problem Solving Using Java, Second Edition, Addison Wesley Longman, Inc., Reading, MA, 2002.

Whitehead, A. N. B. Russell, Principia Mathematica, Cambridge University Press, Cambridge, England, 1910 (Volume 1), 1912 (Volume 2), 1913 (Volume 3).

Williams, J. W., "Algorithm 232: Heapsort", Communications of the ACM 7(6), 1964: 347-348.

Wirth, N., Algorithms + Data Structures = Programs, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1976.

Zwillinger, Daniel, CRC Standard Mathematical Tables and Formulae, Thirty-First Edition, Chemical Rubber Company, Cleveland, OH, 2002.