    
**References**




.. [article-minimal] 
   L[eslie]\ |unicode(a0)|\ A. Aamport.
   The gnats and gnus document preparation system.
   *G-Animal's Journal*, 1986.

.. [article-full] 
   L[eslie]\ |unicode(a0)|\ A. Aamport.
   The gnats and gnus document preparation system.
   *G-Animal's Journal*, 41(7):73+, July 1986.
   This is a full ARTICLE entry.

.. [article-crossref] 
   L[eslie]\ |unicode(a0)|\ A. Aamport.
   The gnats and gnus document preparation system.
   In *G-Animal's Journal* \ [whole-journal]_, pages 73+.
   This is a cross-referencing ARTICLE entry.

.. [whole-journal] 
   *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)).

.. [inbook-minimal] 
   Donald\ |unicode(a0)|\ E. Knuth.
   *Fundamental Algorithms*, chapter 1.2.
   Addison-Wesley, 1973.

.. [inbook-full] 
   Donald\ |unicode(a0)|\ E. Knuth.
   *Fundamental Algorithms*, volume\ |unicode(a0)|\ 1 of *The Art of Computer Programming*, section 1.2, pages 10\ |unicode(2013)|\ 119.
   Addison-Wesley, Reading, Massachusetts, second edition, 10\ |unicode(a0)|\ January 1973.
   This is a full INBOOK entry.

.. [inbook-crossref] 
   Donald\ |unicode(a0)|\ E. Knuth.
   *Fundamental Algorithms*, section 1.2.
   Volume\ |unicode(a0)|\ 1 of *The Art of Computer Programming* \ [whole-set]_, second edition, 1973.
   This is a cross-referencing INBOOK entry.

.. [book-minimal] 
   Donald\ |unicode(a0)|\ E. Knuth.
   *Seminumerical Algorithms*.
   Addison-Wesley, 1981.

.. [book-full] 
   Donald\ |unicode(a0)|\ E. Knuth.
   *Seminumerical Algorithms*, volume\ |unicode(a0)|\ 2 of *The Art of Computer Programming*.
   Addison-Wesley, Reading, Massachusetts, second edition, 10\ |unicode(a0)|\ January 1981.
   This is a full BOOK entry.

.. [book-crossref] 
   Donald\ |unicode(a0)|\ E. Knuth.
   *Seminumerical Algorithms*.
   Volume\ |unicode(a0)|\ 2 of *The Art of Computer Programming* \ [whole-set]_, second edition, 1981.
   This is a cross-referencing BOOK entry.

.. [whole-set] 
   Donald\ |unicode(a0)|\ E. Knuth.
   *The Art of Computer Programming*.
   Four volumes. Addison-Wesley, 1968\ |unicode(2013)|\ 90.
   Seven volumes planned (this is a cross-referenced set of BOOKs).

.. [booklet-minimal] 
   The programming of computer art.

.. [booklet-full] 
   Jill\ |unicode(a0)|\ C. Knvth.
   The programming of computer art.
   Vernier Art Center, Stanford, California, February 1988.
   This is a full BOOKLET entry.

.. [incollection-minimal] 
   Daniel\ |unicode(a0)|\ D. Lincoll.
   Semigroups of recurrences.
   In *High Speed Computer and Algorithm Organization*. Academic Press, 1977.

.. [incollection-full] 
   Daniel\ |unicode(a0)|\ D. Lincoll.
   Semigroups of recurrences.
   In David\ |unicode(a0)|\ J. Lipcoll, D.\ |unicode(a0)|\ H. Lawrie, and A.\ |unicode(a0)|\ H. Sameh, editors, *High Speed Computer and Algorithm Organization*, number\ |unicode(a0)|\ 23 in Fast Computers, part\ |unicode(a0)|\ 3, pages 179\ |unicode(2013)|\ 183. Academic Press, New York, third edition, September 1977.
   This is a full INCOLLECTION entry.

.. [incollection-crossref] 
   Daniel\ |unicode(a0)|\ D. Lincoll.
   Semigroups of recurrences.
   In Lipcoll et\ |unicode(a0)|\ al. \ [whole-collection]_, pages 179\ |unicode(2013)|\ 183.
   This is a cross-referencing INCOLLECTION entry.

.. [whole-collection] 
   David\ |unicode(a0)|\ J. Lipcoll, D.\ |unicode(a0)|\ H. Lawrie, and A.\ |unicode(a0)|\ H. Sameh, editors.
   *High Speed Computer and Algorithm Organization*.
   Number\ |unicode(a0)|\ 23 in Fast Computers. Academic Press, New York, third edition, September 1977.
   This is a cross-referenced BOOK (collection) entry.

.. [manual-minimal] 
   *The Definitive Computer Manual*.

.. [manual-full] 
   Larry Manmaker.
   *The Definitive Computer Manual*.
   Chips-R-Us, Silicon Valley, silver edition, April-May 1986.
   This is a full MANUAL entry.

.. [mastersthesis-minimal] 
   \ |unicode(c9)|\ douard Masterly.
   Mastering thesis writing.
   Master's thesis, Stanford University, 1988.

.. [mastersthesis-full] 
   \ |unicode(c9)|\ douard Masterly.
   Mastering thesis writing.
   Master's project, Stanford University, English Department, June-August 1988.
   This is a full MASTERSTHESIS entry.

.. [misc-minimal] 
   This is a minimal MISC entry.

.. [misc-full] 
   Joe-Bob Missilany.
   Handing out random pamphlets in airports.
   Handed out at O'Hare, October 1984.
   This is a full MISC entry.

.. [inproceedings-minimal] 
   Alfred\ |unicode(a0)|\ V. Oaho, Jeffrey\ |unicode(a0)|\ 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.

.. [inproceedings-full] 
   Alfred\ |unicode(a0)|\ V. Oaho, Jeffrey\ |unicode(a0)|\ D. Ullman, and Mihalis Yannakakis.
   On notions of information transfer in VLSI circuits.
   In Wizard\ |unicode(a0)|\ V. Oz and Mihalis Yannakakis, editors, *Proc. Fifteenth Annual ACM Symposium on the Theory of Computing*, number\ |unicode(a0)|\ 17 in All ACM Conferences, pages 133\ |unicode(2013)|\ 139, Boston, March 1983. The OX Association for Computing Machinery, Academic Press.
   This is a full INPROCEDINGS entry.

.. [inproceedings-crossref] 
   Alfred\ |unicode(a0)|\ V. Oaho, Jeffrey\ |unicode(a0)|\ D. Ullman, and Mihalis Yannakakis.
   On notions of information transfer in VLSI circuits.
   In OXstoc \ [whole-proceedings]_, pages 133\ |unicode(2013)|\ 139.
   This is a cross-referencing INPROCEEDINGS entry.

.. [proceedings-minimal] 
   *Proc. Fifteenth Annual Symposium on the Theory of Computing*, 1983.

.. [proceedings-full] 
   Wizard\ |unicode(a0)|\ V. Oz and Mihalis Yannakakis, editors.
   *Proc. Fifteenth Annual Symposium on the Theory of Computing*, number\ |unicode(a0)|\ 17 in All ACM Conferences, Boston, March 1983. The OX Association for Computing Machinery, Academic Press.
   This is a full PROCEEDINGS entry.

.. [whole-proceedings] 
   The OX Association for Computing Machinery.
   *Proc. Fifteenth Annual Symposium on the Theory of Computing*, Boston, 1983.
   This is a cross-referenced PROCEEDINGS.

.. [phdthesis-minimal] 
   F.\ |unicode(a0)|\ Phidias Phony-Baloney.
   *Fighting Fire with Fire: Festooning French Phrases*.
   PhD thesis, Fanstord University, 1988.

.. [phdthesis-full] 
   F.\ |unicode(a0)|\ 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.

.. [techreport-minimal] 
   Tom Terrific.
   An \ :mathml:`O(n \log n / \! \log\log n)`\  sorting algorithm.
   Technical report, Fanstord University, 1988.

.. [techreport-full] 
   Tom T\ |unicode(e9)|\ rrific.
   An \ :mathml:`O(n \log n / \! \log\log n)`\  sorting algorithm.
   Wishful Research Result\ |unicode(a0)|\ 7, Fanstord University, Computer Science Department, Fanstord, California, October 1988.
   This is a full TECHREPORT entry.

.. [unpublished-minimal] 
   Ulrich \ |unicode(dc)|\ nderwood, Ned \ |unicode(d1)|\ et, and Paul Pot.
   Lower bounds for wishful research results.
   Talk at Fanstord University (this is a minimal UNPUBLISHED entry).

.. [unpublished-full] 
   Ulrich \ |unicode(dc)|\ nderwood, Ned \ |unicode(d1)|\ et, and Paul Pot.
   Lower bounds for wishful research results.
   Talk at Fanstord University (this is a full UNPUBLISHED entry), November, December 1988.

.. [random-note-crossref] 
   Volume\ |unicode(a0)|\ 2 is listed under Knuth \ [book-full]_.


.. |unicode(a0)| unicode:: U+a0
.. |unicode(c9)| unicode:: U+c9
.. |unicode(d1)| unicode:: U+d1
.. |unicode(dc)| unicode:: U+dc
.. |unicode(e9)| unicode:: U+e9
.. |unicode(2013)| unicode:: U+2013
