You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
216 lines
8.0 KiB
216 lines
8.0 KiB
\newcommand{\noopsort}[1]{} \newcommand{\printfirst}[2]{#1}
|
|
\newcommand{\singleletter}[1]{#1} \newcommand{\switchargs}[2]{#2#1}
|
|
\begin{thebibliography}{OX{\singleletter{stoc}}83b}
|
|
|
|
\bibitem[Aam86a]{article-minimal}
|
|
L[eslie]~A. Aamport.
|
|
\newblock The gnats and gnus document preparation system.
|
|
\newblock {\em \mbox{G-Animal's} Journal}, 1986.
|
|
|
|
\bibitem[Aam86b]{article-full}
|
|
L[eslie]~A. Aamport.
|
|
\newblock The gnats and gnus document preparation system.
|
|
\newblock {\em \mbox{G-Animal's} Journal}, 41(7):73+, July 1986.
|
|
\newblock This is a full ARTICLE entry.
|
|
|
|
\bibitem[Aam86c]{article-crossref}
|
|
L[eslie]~A. Aamport.
|
|
\newblock The gnats and gnus document preparation system.
|
|
\newblock In {\em \mbox{G-Animal's} Journal\/} \cite{whole-journal}, pages 73+.
|
|
\newblock This is a cross-referencing ARTICLE entry.
|
|
|
|
\bibitem[GAJ86]{whole-journal}
|
|
{\em \mbox{G-Animal's} Journal}, 41(7), July 1986.
|
|
\newblock The entire issue is devoted to gnats and gnus (this entry is a
|
|
cross-referenced ARTICLE (journal)).
|
|
|
|
\bibitem[Knu68]{whole-set}
|
|
Donald~E. Knuth.
|
|
\newblock {\em The Art of Computer Programming}.
|
|
\newblock Four volumes. Addison-Wesley,
|
|
{\noopsort{1973a}}{\switchargs{--90}{1968}}.
|
|
\newblock Seven volumes planned (this is a cross-referenced set of BOOKs).
|
|
|
|
\bibitem[Knu73a]{inbook-minimal}
|
|
Donald~E. Knuth.
|
|
\newblock {\em Fundamental Algorithms}, chapter 1.2.
|
|
\newblock Addison-Wesley, {\noopsort{1973b}}1973.
|
|
|
|
\bibitem[Knu73b]{inbook-full}
|
|
Donald~E. Knuth.
|
|
\newblock {\em Fundamental Algorithms}, volume~1 of {\em The Art of Computer
|
|
Programming}, section 1.2, pages 10--119.
|
|
\newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
|
|
{\noopsort{1973b}}1973.
|
|
\newblock This is a full INBOOK entry.
|
|
|
|
\bibitem[Knu73c]{inbook-crossref}
|
|
Donald~E. Knuth.
|
|
\newblock {\em Fundamental Algorithms}, section 1.2.
|
|
\newblock Volume~1 of {\em The Art of Computer Programming\/} \cite{whole-set},
|
|
second edition, {\noopsort{1973b}}1973.
|
|
\newblock This is a cross-referencing INBOOK entry.
|
|
|
|
\bibitem[Knu81a]{book-minimal}
|
|
Donald~E. Knuth.
|
|
\newblock {\em Seminumerical Algorithms}.
|
|
\newblock Addison-Wesley, {\noopsort{1973c}}1981.
|
|
|
|
\bibitem[Knu81b]{book-full}
|
|
Donald~E. Knuth.
|
|
\newblock {\em Seminumerical Algorithms}, volume~2 of {\em The Art of Computer
|
|
Programming}.
|
|
\newblock Addison-Wesley, Reading, Massachusetts, second edition, 10~January
|
|
{\noopsort{1973c}}1981.
|
|
\newblock This is a full BOOK entry.
|
|
|
|
\bibitem[Knu81c]{book-crossref}
|
|
Donald~E. Knuth.
|
|
\newblock {\em Seminumerical Algorithms}.
|
|
\newblock Volume~2 of {\em The Art of Computer Programming\/} \cite{whole-set},
|
|
second edition, {\noopsort{1973c}}1981.
|
|
\newblock This is a cross-referencing BOOK entry.
|
|
|
|
\bibitem[Kn{\printfirst{v}{1987}}]{booklet-minimal}
|
|
The programming of computer art.
|
|
|
|
\bibitem[Knv88]{booklet-full}
|
|
Jill~C. Knvth.
|
|
\newblock The programming of computer art.
|
|
\newblock Vernier Art Center, Stanford, California, February 1988.
|
|
\newblock This is a full BOOKLET entry.
|
|
|
|
\bibitem[Lin77a]{incollection-minimal}
|
|
Daniel~D. Lincoll.
|
|
\newblock Semigroups of recurrences.
|
|
\newblock In {\em High Speed Computer and Algorithm Organization}. Academic
|
|
Press, 1977.
|
|
|
|
\bibitem[Lin77b]{incollection-full}
|
|
Daniel~D. Lincoll.
|
|
\newblock Semigroups of recurrences.
|
|
\newblock In David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors, {\em
|
|
High Speed Computer and Algorithm Organization}, number~23 in Fast Computers,
|
|
part~3, pages 179--183. Academic Press, New York, third edition, September
|
|
1977.
|
|
\newblock This is a full INCOLLECTION entry.
|
|
|
|
\bibitem[Lin77c]{incollection-crossref}
|
|
Daniel~D. Lincoll.
|
|
\newblock Semigroups of recurrences.
|
|
\newblock In Lipcoll et~al. \cite{whole-collection}, pages 179--183.
|
|
\newblock This is a cross-referencing INCOLLECTION entry.
|
|
|
|
\bibitem[LLS77]{whole-collection}
|
|
David~J. Lipcoll, D.~H. Lawrie, and A.~H. Sameh, editors.
|
|
\newblock {\em High Speed Computer and Algorithm Organization}.
|
|
\newblock Number~23 in Fast Computers. Academic Press, New York, third edition,
|
|
September 1977.
|
|
\newblock This is a cross-referenced BOOK (collection) entry.
|
|
|
|
\bibitem[Man]{manual-minimal}
|
|
{\em The Definitive Computer Manual}.
|
|
|
|
\bibitem[Man86]{manual-full}
|
|
Larry Manmaker.
|
|
\newblock {\em The Definitive Computer Manual}.
|
|
\newblock Chips-R-Us, Silicon Valley, silver edition, April-May 1986.
|
|
\newblock This is a full MANUAL entry.
|
|
|
|
\bibitem[Mas88a]{mastersthesis-minimal}
|
|
{\'{E}}douard Masterly.
|
|
\newblock Mastering thesis writing.
|
|
\newblock Master's thesis, Stanford University, 1988.
|
|
|
|
\bibitem[Mas88b]{mastersthesis-full}
|
|
{\'{E}}douard Masterly.
|
|
\newblock Mastering thesis writing.
|
|
\newblock Master's project, Stanford University, English Department,
|
|
June-August 1988.
|
|
\newblock This is a full MASTERSTHESIS entry.
|
|
|
|
\bibitem[Mis]{misc-minimal}
|
|
This is a minimal MISC entry.
|
|
|
|
\bibitem[Mis84]{misc-full}
|
|
Joe-Bob Missilany.
|
|
\newblock Handing out random pamphlets in airports.
|
|
\newblock Handed out at O'Hare, October 1984.
|
|
\newblock This is a full MISC entry.
|
|
|
|
\bibitem[OUY83a]{inproceedings-minimal}
|
|
Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
|
|
\newblock On notions of information transfer in {VLSI} circuits.
|
|
\newblock In {\em Proc. Fifteenth Annual ACM Symposium on the Theory of
|
|
Computing}, 1983.
|
|
|
|
\bibitem[OUY83b]{inproceedings-full}
|
|
Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
|
|
\newblock On notions of information transfer in {VLSI} circuits.
|
|
\newblock In Wizard~V. Oz and Mihalis Yannakakis, editors, {\em 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.
|
|
\newblock This is a full INPROCEDINGS entry.
|
|
|
|
\bibitem[OUY83c]{inproceedings-crossref}
|
|
Alfred~V. Oaho, Jeffrey~D. Ullman, and Mihalis Yannakakis.
|
|
\newblock On notions of information transfer in {VLSI} circuits.
|
|
\newblock In OX{\singleletter{stoc}} \cite{whole-proceedings}, pages 133--139.
|
|
\newblock This is a cross-referencing INPROCEEDINGS entry.
|
|
|
|
\bibitem[OX{\singleletter{stoc}}83a]{whole-proceedings}
|
|
The OX Association for Computing Machinery.
|
|
\newblock {\em Proc. Fifteenth Annual Symposium on the Theory of Computing},
|
|
Boston, 1983.
|
|
\newblock This is a cross-referenced PROCEEDINGS.
|
|
|
|
\bibitem[OX{\singleletter{stoc}}83b]{proceedings-minimal}
|
|
{\em Proc. Fifteenth Annual Symposium on the Theory of Computing}, 1983.
|
|
|
|
\bibitem[OY83]{proceedings-full}
|
|
Wizard~V. Oz and Mihalis Yannakakis, editors.
|
|
\newblock {\em 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.
|
|
\newblock This is a full PROCEEDINGS entry.
|
|
|
|
\bibitem[PB88a]{phdthesis-minimal}
|
|
F.~Phidias Phony-Baloney.
|
|
\newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
|
|
\newblock PhD thesis, Fanstord University, 1988.
|
|
|
|
\bibitem[PB88b]{phdthesis-full}
|
|
F.~Phidias Phony-Baloney.
|
|
\newblock {\em Fighting Fire with Fire: Festooning {F}rench Phrases}.
|
|
\newblock {PhD} dissertation, Fanstord University, Department of French,
|
|
June-August 1988.
|
|
\newblock This is a full PHDTHESIS entry.
|
|
|
|
\bibitem[Ter88a]{techreport-minimal}
|
|
Tom Terrific.
|
|
\newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
|
|
\newblock Technical report, Fanstord University, 1988.
|
|
|
|
\bibitem[T{\'{e}}r88b]{techreport-full}
|
|
Tom T{\'{e}}rrific.
|
|
\newblock An {$O(n \log n / \! \log\log n)$} sorting algorithm.
|
|
\newblock Wishful Research Result~7, Fanstord University, Computer Science
|
|
Department, Fanstord, California, October 1988.
|
|
\newblock This is a full TECHREPORT entry.
|
|
|
|
\bibitem[{\"{U}}{\~N}{\={P}}]{unpublished-minimal}
|
|
Ulrich {\"{U}}nderwood, Ned {\~N}et, and Paul {\={P}}ot.
|
|
\newblock Lower bounds for wishful research results.
|
|
\newblock Talk at Fanstord University (this is a minimal UNPUBLISHED entry).
|
|
|
|
\bibitem[{\"{U}}{\~N}{\={P}}88]{unpublished-full}
|
|
Ulrich {\"{U}}nderwood, Ned {\~N}et, and Paul {\={P}}ot.
|
|
\newblock Lower bounds for wishful research results.
|
|
\newblock Talk at Fanstord University (this is a full UNPUBLISHED entry),
|
|
November, December 1988.
|
|
|
|
\bibitem[Vol]{random-note-crossref}
|
|
Volume~2 is listed under Knuth \cite{book-full}.
|
|
|
|
\end{thebibliography}
|
|
|