## References

[Aam86a] | L[eslie] A. Aamport. The gnats and gnus document preparation system. G-Animal's Journal, 1986.
[Aam86b] | L[eslie] A. Aamport. The gnats and gnus document preparation system. G-Animal's Journal, 41(7):73+, July 1986. This is a full ARTICLE entry.
[Aam86c] | L[eslie] A. Aamport. The gnats and gnus document preparation system. In G-Animal's Journal [GAJ86], pages 73+. This is a cross-referencing ARTICLE entry.
[GAJ86] | G-Animal's Journal, 41(7), July 1986. The entire issue is devoted to gnats and gnus (this entry is a cross-referenced ARTICLE (journal)).
[Knu68] | Donald E. Knuth. The Art of Computer Programming. Four volumes. Addison-Wesley, 1968–90. Seven volumes planned (this is a cross-referenced set of BOOKs).
[Knu73a] | Donald E. Knuth. Fundamental Algorithms, chapter 1.2. Addison-Wesley, 1973.
[Knu73b] | Donald E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming, section 1.2, pages 10–119. Addison-Wesley, Reading, Massachusetts, second edition, 10 January 1973. This is a full INBOOK entry.
[Knu73c] | Donald E. Knuth. Fundamental Algorithms, section 1.2. Volume 1 of The Art of Computer Programming [Knu68], second edition, 1973. This is a cross-referencing INBOOK entry.
[Knu81a] | Donald E. Knuth. Seminumerical Algorithms. Addison-Wesley, 1981.
[Knu81b] | Donald E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, second edition, 10 January 1981. This is a full BOOK entry.
[Knu81c] | Donald E. Knuth. Seminumerical Algorithms. Volume 2 of The Art of Computer Programming [Knu68], second edition, 1981. This is a cross-referencing BOOK entry.
[Knv] | The programming of computer art.
[Knv88] | Jill C. Knvth. The programming of computer art. Vernier Art Center, Stanford, California, February 1988. This is a full BOOKLET entry.
[Lin77a] | Daniel D. Lincoll. Semigroups of recurrences. In High Speed Computer and Algorithm Organization. Academic Press, 1977.
[Lin77b] | Daniel D. Lincoll. Semigroups of recurrences. In David J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors, High Speed Computer and Algorithm Organization, number 23 in Fast Computers, part 3, pages 179–183. Academic Press, New York, third edition, September 1977. This is a full INCOLLECTION entry.
[Lin77c] | Daniel D. Lincoll. Semigroups of recurrences. In Lipcoll et al. [LLS77], pages 179–183. This is a cross-referencing INCOLLECTION entry.
[LLS77] | David J. Lipcoll, D. H. Lawrie, and A. H. Sameh, editors. High Speed Computer and Algorithm Organization. Number 23 in Fast Computers. Academic Press, New York, third edition, September 1977. This is a cross-referenced BOOK (collection) entry.
[Man] | The Definitive Computer Manual.
[Man86] | Larry Manmaker. The Definitive Computer Manual. Chips-R-Us, Silicon Valley, silver edition, April-May 1986. This is a full MANUAL entry.
[Mas88a] | Édouard Masterly. Mastering thesis writing. Master's thesis, Stanford University, 1988.
[Mas88b] | Édouard Masterly. Mastering thesis writing. Master's project, Stanford University, English Department, June-August 1988. This is a full MASTERSTHESIS entry.
[Mis] | This is a minimal MISC entry.
[Mis84] | Joe-Bob Missilany. Handing out random pamphlets in airports. Handed out at O'Hare, October 1984. This is a full MISC entry.
[OUY83a] | Alfred V. Oaho, Jeffrey D. Ullman, and Mihalis Yannakakis. On notions of information transfer in VLSI circuits. In Proc. Fifteenth Annual ACM Symposium on the Theory of Computing, 1983.
[OUY83b] | Alfred V. Oaho, Jeffrey D. Ullman, and Mihalis Yannakakis. On notions of information transfer in VLSI circuits. In Wizard V. Oz and Mihalis Yannakakis, editors, Proc. Fifteenth Annual ACM Symposium on the Theory of Computing, number 17 in All ACM Conferences, pages 133–139, Boston, March 1983. The OX Association for Computing Machinery, Academic Press. This is a full INPROCEDINGS entry.
[OUY83c] | Alfred V. Oaho, Jeffrey D. Ullman, and Mihalis Yannakakis. On notions of information transfer in VLSI circuits. In OXstoc [OXstoc83a], pages 133–139. This is a cross-referencing INPROCEEDINGS entry.
[OXstoc83a] | The OX Association for Computing Machinery. Proc. Fifteenth Annual Symposium on the Theory of Computing, Boston, 1983. This is a cross-referenced PROCEEDINGS.
[OXstoc83b] | Proc. Fifteenth Annual Symposium on the Theory of Computing, 1983.
[OY83] | Wizard V. Oz and Mihalis Yannakakis, editors. Proc. Fifteenth Annual Symposium on the Theory of Computing, number 17 in All ACM Conferences, Boston, March 1983. The OX Association for Computing Machinery, Academic Press. This is a full PROCEEDINGS entry.
[PB88a] | F. Phidias Phony-Baloney. Fighting Fire with Fire: Festooning French Phrases. PhD thesis, Fanstord University, 1988.
[PB88b] | F. Phidias Phony-Baloney. Fighting Fire with Fire: Festooning French Phrases. PhD dissertation, Fanstord University, Department of French, June-August 1988. This is a full PHDTHESIS entry.
[Ter88a] | Tom Terrific. An O(n log n! log log n) sorting algorithm. Technical report, Fanstord University, 1988.
[Tér88b] | Tom Térrific. An O(n log n! log log n) sorting algorithm. Wishful Research Result 7, Fanstord University, Computer Science Department, Fanstord, California, October 1988. This is a full TECHREPORT entry.
[ÜÑP] | Ulrich Ünderwood, Ned Ñet, and Paul Pot. Lower bounds for wishful research results. Talk at Fanstord University (this is a minimal UNPUBLISHED entry).
[ÜÑP88] | Ulrich Ünderwood, Ned Ñet, and Paul Pot. Lower bounds for wishful research results. Talk at Fanstord University (this is a full UNPUBLISHED entry), November, December 1988.
[Vol] | Volume 2 is listed under Knuth [Knu81b].