## References

[1] | L. A. Aamport, “The gnats and gnus document preparation system,” G-Animal's Journal, 1986.
[2] | L. A. Aamport, “The gnats and gnus document preparation system,” G-Animal's Journal, vol. 41, pp. 73+, July 1986. This is a full ARTICLE entry.
[3] | L. A. Aamport, “The gnats and gnus document preparation system,” in G-Animal's Journal [4], pp. 73+. This is a cross-referencing ARTICLE entry.
[4] | G-Animal's Journal, vol. 41, July 1986. The entire issue is devoted to gnats and gnus (this entry is a cross-referenced ARTICLE (journal)).
[5] | D. E. Knuth, Fundamental Algorithms, ch. 1.2. Addison-Wesley, 1973.
[6] | D. E. Knuth, Fundamental Algorithms, vol. 1 of The Art of Computer Programming, section 1.2, pp. 10–119. Reading, Massachusetts: Addison-Wesley, second ed., 10 Jan. 1973. This is a full INBOOK entry.
[7] | D. E. Knuth, Fundamental Algorithms, section 1.2. Vol. 1 of The Art of Computer Programming [11], second ed., 1973. This is a cross-referencing INBOOK entry.
[8] | D. E. Knuth, Seminumerical Algorithms. Addison-Wesley, 1981.
[9] | D. E. Knuth, Seminumerical Algorithms, vol. 2 of The Art of Computer Programming. Reading, Massachusetts: Addison-Wesley, second ed., 10 Jan. 1981. This is a full BOOK entry.
[10] | D. E. Knuth, Seminumerical Algorithms. Vol. 2 of The Art of Computer Programming [11], second ed., 1981. This is a cross-referencing BOOK entry.
[11] | D. E. Knuth, The Art of Computer Programming. Four volumes, Addison-Wesley, 1968–90. Seven volumes planned (this is a cross-referenced set of BOOKs).
[12] | “The programming of computer art.”
[13] | J. C. Knvth, “The programming of computer art.” Vernier Art Center, Stanford, California, Feb. 1988. This is a full BOOKLET entry.
[14] | D. D. Lincoll, “Semigroups of recurrences,” in High Speed Computer and Algorithm Organization, Academic Press, 1977.
[15] | D. D. Lincoll, “Semigroups of recurrences,” in High Speed Computer and Algorithm Organization (D. J. Lipcoll, D. H. Lawrie, and A. H. Sameh, eds.), no. 23 in Fast Computers, part 3, pp. 179–183, New York: Academic Press, third ed., Sept. 1977. This is a full INCOLLECTION entry.
[16] | D. D. Lincoll, “Semigroups of recurrences,” in Lipcoll et al. [17], pp. 179–183. This is a cross-referencing INCOLLECTION entry.
[17] | D. J. Lipcoll, D. H. Lawrie, and A. H. Sameh, eds., High Speed Computer and Algorithm Organization. No. 23 in Fast Computers, New York: Academic Press, third ed., Sept. 1977. This is a cross-referenced BOOK (collection) entry.
[18] | The Definitive Computer Manual.
[19] | L. Manmaker, The Definitive Computer Manual. Chips-R-Us, Silicon Valley, silver ed., Apr.-May 1986. This is a full MANUAL entry.
[20] | É. Masterly, “Mastering thesis writing,” Master's thesis, Stanford University, 1988.
[21] | É. Masterly, “Mastering thesis writing,” master's project, Stanford University, English Department, June-Aug. 1988. This is a full MASTERSTHESIS entry.
[22] | This is a minimal MISC entry.
[23] | J.-B. Missilany, “Handing out random pamphlets in airports.” Handed out at O'Hare, Oct. 1984. This is a full MISC entry.
[24] | A. V. Oaho, J. D. Ullman, and M. Yannakakis, “On notions of information transfer in VLSI circuits,” in Proc. Fifteenth Annual ACM Symposium on the Theory of Computing, 1983.
[25] | A. V. Oaho, J. D. Ullman, and M. Yannakakis, “On notions of information transfer in VLSI circuits,” in Proc. Fifteenth Annual ACM Symposium on the Theory of Computing (W. V. Oz and M. Yannakakis, eds.), no. 17 in All ACM Conferences, (Boston), pp. 133–139, The OX Association for Computing Machinery, Academic Press, Mar. 1983. This is a full INPROCEDINGS entry.
[26] | A. V. Oaho, J. D. Ullman, and M. Yannakakis, “On notions of information transfer in VLSI circuits,” in OXstoc [29], pp. 133–139. This is a cross-referencing INPROCEEDINGS entry.
[27] | Proc. Fifteenth Annual Symposium on the Theory of Computing, 1983.
[28] | W. V. Oz and M. Yannakakis, eds., Proc. Fifteenth Annual Symposium on the Theory of Computing, no. 17 in All ACM Conferences, (Boston), The OX Association for Computing Machinery, Academic Press, Mar. 1983. This is a full PROCEEDINGS entry.
[29] | The OX Association for Computing Machinery, Proc. Fifteenth Annual Symposium on the Theory of Computing, (Boston), 1983. This is a cross-referenced PROCEEDINGS.
[30] | F. P. Phony-Baloney, Fighting Fire with Fire: Festooning French Phrases. PhD thesis, Fanstord University, 1988.
[31] | F. P. Phony-Baloney, Fighting Fire with Fire: Festooning French Phrases. PhD dissertation, Fanstord University, Department of French, June-Aug. 1988. This is a full PHDTHESIS entry.
[32] | T. Terrific, “An O(n log n log log n) sorting algorithm,” tech. rep., Fanstord University, 1988.
[33] | T. Térrific, “An O(n log n log log n) sorting algorithm,” Wishful Research Result 7, Fanstord University, Computer Science Department, Fanstord, California, Oct. 1988. This is a full TECHREPORT entry.
[34] | U. Ünderwood, N. Ñet, and P. Pot, “Lower bounds for wishful research results.” Talk at Fanstord University (this is a minimal UNPUBLISHED entry).
[35] | U. Ünderwood, N. Ñet, and P. Pot, “Lower bounds for wishful research results.” Talk at Fanstord University (this is a full UNPUBLISHED entry), Nov., Dec. 1988.
[36] | Volume 2 is listed under Knuth [9].