Appendix A References

[Aho 1986].   Aho, A. V., R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986. ISBN 0-201-10088-6.

[Bentley 2000].   Bentley, J., Programming Pearls, 2nd ed. Addison-Wesley, 2000. ISBN 0-201-65788-0.

[Brown 2001].   Brown, S., “Identifiers NOT To Use in C Programs”. Oak Road Systems, Feb. 15, 2001. http://www.oakroadsystems.com/tech/c-predef.htm.

[Cormen 1990].   Cormen, C. H., C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. McGraw-Hill, 1990. ISBN 0-262-03141-8.

[FSF 1999].   Free Software Foundation, GNU C Library Reference Manual, version 0.08, 1999.

[FSF 2001].   Free Software Foundation, “GNU Coding Standards”, ed. of March 23, 2001.

[ISO 1990].   International Organization for Standardization, ANSI/ISO 9899-1990: American National Standard for Programming Languages—C, 1990. Reprinted in The Annotated ANSI C Standard, ISBN 0-07-881952-0.

[ISO 1998].   International Organization for Standardization, ISO/IEC 14882:1998(E): Programming languages—C++, 1998.

[ISO 1999].   International Orgnaization for Standardization, ISO/IEC 9899:1999: Programming Languages—C, 2nd ed., 1999.

[Kernighan 1976].   Kernighan, B. W., and P. J. Plauger, Software Tools. Addison-Wesley, 1976. ISBN 0-201-03669-X.

[Kernighan 1988].   Kernighan, B. W., and D. M. Ritchie, The C Programming Language, 2nd ed. Prentice-Hall, 1988. ISBN 0-13-110362-8.

[Knuth 1997].   Knuth, D. E., The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd ed. Addison-Wesley, 1997. ISBN 0-201-89683-4.

[Knuth 1998a].   Knuth, D. E., The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd ed. Addison-Wesley, 1998. ISBN 0-201-89684-2.

[Knuth 1998b].   Knuth, D. E., The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd ed. Addison-Wesley, 1998. ISBN 0-201-89685-0.

[Knuth 1977].   Knuth, D. E., “Deletions that Preserve Randomness”, IEEE Trans. on Software Eng. SE-3 (1977), pp. 351–9. Reprinted in [Knuth 2000].

[Knuth 1978].   Knuth, D. E., “A Trivial Algorithm Whose Analysis Isn't”, Journal of Algorithms 6 (1985), pp. 301–22. Reprinted in [Knuth 2000].

[Knuth 1992].   Knuth, D. E., Literate Programming, CSLI Lecture Notes Number 27. Center for the Study of Language and Information, Leland Stanford Junior University, 1992. ISBN 0-9370-7380-6.

[Knuth 2000].   Knuth, D. E., Selected Papers on Analysis of Algorithms, CSLI Lecture Notes Number 102. Center for the Study of Language and Information, Leland Stanford Junior University, 2000. ISBN 1-57586-212-3.

[Pfaff 1998].   Pfaff, B. L., “An Iterative Algorithm for Deletion from AVL-Balanced Binary Trees”. Presented July 1998, annual meeting of Pi Mu Epsilon, Toronto, Canada. http://benpfaff.org/avl/.

[Sedgewick 1998].   Sedgewick, R., Algorithms in C, Parts 1-4, 3rd ed. Addison-Wesley, 1998. ISBN 0-201-31452-5.

[SGI 1993].   Silicon Graphics, Inc., Standard Template Library Programmer's Guide. http://www.sgi.com/tech/stl/.

[Stout 1986].   Stout, Q. F. and B. L. Warren, “Tree Rebalancing in Optimal Time and Space”, Communications of the ACM 29 (1986), pp. 902–908.

[Summit 1999].   Summit, S., “comp.lang.c Answers to Frequently Asked Questions”, version 3.5. http://www.eskimo.com/~scs/C-faq/top.html. ISBN 0-201-84519-9.