ssme-thesis/example.bib

357 lines
9.7 KiB
BibTeX
Raw Normal View History

2018-06-27 21:44:00 +02:00
@preamble{ "\newcommand{\noopsort}[1]{} "
# "\newcommand{\printfirst}[2]{#1} "
# "\newcommand{\singleletter}[1]{#1} "
# "\newcommand{\switchargs}[2]{#2#1} " }
@ARTICLE{article-minimal,
author = {L[eslie] A. Aamport},
title = {The Gnats and Gnus Document Preparation System},
journal = {\mbox{G-Animal's} Journal},
year = 1986,
}
@ARTICLE{article-full,
author = {L[eslie] A. Aamport},
title = {The Gnats and Gnus Document Preparation System},
journal = {\mbox{G-Animal's} Journal},
year = 1986,
volume = 41,
number = 7,
pages = "73+",
month = jul,
note = "This is a full ARTICLE entry",
}
The KEY field is here to override the KEY field in the journal being
cross referenced (so is the NOTE field, in addition to its imparting
information).
@ARTICLE{article-crossref,
crossref = {WHOLE-JOURNAL},
key = "",
author = {L[eslie] A. Aamport},
title = {The Gnats and Gnus Document Preparation System},
pages = "73+",
note = "This is a cross-referencing ARTICLE entry",
}
@ARTICLE{whole-journal,
key = "GAJ",
journal = {\mbox{G-Animal's} Journal},
year = 1986,
volume = 41,
number = 7,
month = jul,
note = {The entire issue is devoted to gnats and gnus
(this entry is a cross-referenced ARTICLE (journal))},
}
@INBOOK{inbook-minimal,
author = "Donald E. Knuth",
title = "Fundamental Algorithms",
publisher = "Addison-Wesley",
year = "{\noopsort{1973b}}1973",
chapter = "1.2",
}
@INBOOK{inbook-full,
author = "Donald E. Knuth",
title = "Fundamental Algorithms",
volume = 1,
series = "The Art of Computer Programming",
publisher = "Addison-Wesley",
address = "Reading, Massachusetts",
edition = "Second",
month = "10~" # jan,
year = "{\noopsort{1973b}}1973",
type = "Section",
chapter = "1.2",
pages = "10--119",
note = "This is a full INBOOK entry",
}
@INBOOK{inbook-crossref,
crossref = "whole-set",
title = "Fundamental Algorithms",
volume = 1,
series = "The Art of Computer Programming",
edition = "Second",
year = "{\noopsort{1973b}}1973",
type = "Section",
chapter = "1.2",
note = "This is a cross-referencing INBOOK entry",
}
@BOOK{book-minimal,
author = "Donald E. Knuth",
title = "Seminumerical Algorithms",
publisher = "Addison-Wesley",
year = "{\noopsort{1973c}}1981",
}
@BOOK{book-full,
author = "Donald E. Knuth",
title = "Seminumerical Algorithms",
volume = 2,
series = "The Art of Computer Programming",
publisher = "Addison-Wesley",
address = "Reading, Massachusetts",
edition = "Second",
month = "10~" # jan,
year = "{\noopsort{1973c}}1981",
note = "This is a full BOOK entry",
}
@BOOK{book-crossref,
crossref = "whole-set",
title = "Seminumerical Algorithms",
volume = 2,
series = "The Art of Computer Programming",
edition = "Second",
year = "{\noopsort{1973c}}1981",
note = "This is a cross-referencing BOOK entry",
}
@BOOK{whole-set,
author = "Donald E. Knuth",
publisher = "Addison-Wesley",
title = "The Art of Computer Programming",
series = "Four volumes",
year = "{\noopsort{1973a}}{\switchargs{--90}{1968}}",
note = "Seven volumes planned (this is a cross-referenced set of BOOKs)",
}
@BOOKLET{booklet-minimal,
key = "Kn{\printfirst{v}{1987}}",
title = "The Programming of Computer Art",
}
@BOOKLET{booklet-full,
author = "Jill C. Knvth",
title = "The Programming of Computer Art",
howpublished = "Vernier Art Center",
address = "Stanford, California",
month = feb,
year = 1988,
note = "This is a full BOOKLET entry",
}
@INCOLLECTION{incollection-minimal,
author = "Daniel D. Lincoll",
title = "Semigroups of Recurrences",
booktitle = "High Speed Computer and Algorithm Organization",
publisher = "Academic Press",
year = 1977,
}
@INCOLLECTION{incollection-full,
author = "Daniel D. Lincoll",
title = "Semigroups of Recurrences",
editor = "David J. Lipcoll and D. H. Lawrie and A. H. Sameh",
booktitle = "High Speed Computer and Algorithm Organization",
number = 23,
series = "Fast Computers",
chapter = 3,
type = "Part",
pages = "179--183",
publisher = "Academic Press",
address = "New York",
edition = "Third",
month = sep,
year = 1977,
note = "This is a full INCOLLECTION entry",
}
@INCOLLECTION{incollection-crossref,
crossref = "whole-collection",
author = "Daniel D. Lincoll",
title = "Semigroups of Recurrences",
pages = "179--183",
note = "This is a cross-referencing INCOLLECTION entry",
}
@BOOK{whole-collection,
editor = "David J. Lipcoll and D. H. Lawrie and A. H. Sameh",
title = "High Speed Computer and Algorithm Organization",
booktitle = "High Speed Computer and Algorithm Organization",
number = 23,
series = "Fast Computers",
publisher = "Academic Press",
address = "New York",
edition = "Third",
month = sep,
year = 1977,
note = "This is a cross-referenced BOOK (collection) entry",
}
@MANUAL{manual-minimal,
key = "Manmaker",
title = "The Definitive Computer Manual",
}
@MANUAL{manual-full,
author = "Larry Manmaker",
title = "The Definitive Computer Manual",
organization = "Chips-R-Us",
address = "Silicon Valley",
edition = "Silver",
month = apr # "-" # may,
year = 1986,
note = "This is a full MANUAL entry",
}
@MASTERSTHESIS{mastersthesis-minimal,
author = "{\'{E}}douard Masterly",
title = "Mastering Thesis Writing",
school = "Stanford University",
year = 1988,
}
@MASTERSTHESIS{mastersthesis-full,
author = "{\'{E}}douard Masterly",
title = "Mastering Thesis Writing",
school = "Stanford University",
type = "Master's project",
address = "English Department",
month = jun # "-" # aug,
year = 1988,
note = "This is a full MASTERSTHESIS entry",
}
@MISC{misc-minimal,
key = "Missilany",
note = "This is a minimal MISC entry",
}
@MISC{misc-full,
author = "Joe-Bob Missilany",
title = "Handing out random pamphlets in airports",
howpublished = "Handed out at O'Hare",
month = oct,
year = 1984,
note = "This is a full MISC entry",
}
@STRING{STOC-key = "OX{\singleletter{stoc}}"}
@STRING{ACM = "The OX Association for Computing Machinery"}
@STRING{STOC = " Symposium on the Theory of Computing"}
@INPROCEEDINGS{inproceedings-minimal,
author = "Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis",
title = "On Notions of Information Transfer in {VLSI} Circuits",
booktitle = "Proc. Fifteenth Annual ACM" # STOC,
year = 1983,
}
@INPROCEEDINGS{inproceedings-full,
author = "Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis",
title = "On Notions of Information Transfer in {VLSI} Circuits",
editor = "Wizard V. Oz and Mihalis Yannakakis",
booktitle = "Proc. Fifteenth Annual ACM" # STOC,
number = 17,
series = "All ACM Conferences",
pages = "133--139",
month = mar,
year = 1983,
address = "Boston",
organization = ACM,
publisher = "Academic Press",
note = "This is a full INPROCEDINGS entry",
}
@INPROCEEDINGS{inproceedings-crossref,
crossref = "whole-proceedings",
author = "Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis",
title = "On Notions of Information Transfer in {VLSI} Circuits",
organization = "",
pages = "133--139",
note = "This is a cross-referencing INPROCEEDINGS entry",
}
@PROCEEDINGS{proceedings-minimal,
key = STOC-key,
title = "Proc. Fifteenth Annual" # STOC,
year = 1983,
}
@PROCEEDINGS{proceedings-full,
editor = "Wizard V. Oz and Mihalis Yannakakis",
title = "Proc. Fifteenth Annual" # STOC,
number = 17,
series = "All ACM Conferences",
month = mar,
year = 1983,
address = "Boston",
organization = ACM,
publisher = "Academic Press",
note = "This is a full PROCEEDINGS entry",
}
@PROCEEDINGS{whole-proceedings,
key = STOC-key,
organization = ACM,
title = "Proc. Fifteenth Annual" # STOC,
address = "Boston",
year = 1983,
booktitle = "Proc. Fifteenth Annual ACM" # STOC,
note = "This is a cross-referenced PROCEEDINGS",
}
@PHDTHESIS{phdthesis-minimal,
author = "F. Phidias Phony-Baloney",
title = "Fighting Fire with Fire: Festooning {F}rench Phrases",
school = "Fanstord University",
year = 1988,
}
@PHDTHESIS{phdthesis-full,
author = "F. Phidias Phony-Baloney",
title = "Fighting Fire with Fire: Festooning {F}rench Phrases",
school = "Fanstord University",
type = "{PhD} Dissertation",
address = "Department of French",
month = jun # "-" # aug,
year = 1988,
note = "This is a full PHDTHESIS entry",
}
@TECHREPORT{techreport-minimal,
author = "Tom Terrific",
title = "An {$O(n \log n / \! \log\log n)$} Sorting Algorithm",
institution = "Fanstord University",
year = 1988,
}
@TECHREPORT{techreport-full,
author = "Tom T{\'{e}}rrific",
title = "An {$O(n \log n / \! \log\log n)$} Sorting Algorithm",
institution = "Fanstord University",
type = "Wishful Research Result",
number = "7",
address = "Computer Science Department, Fanstord, California",
month = oct,
year = 1988,
note = "This is a full TECHREPORT entry",
}
@UNPUBLISHED{unpublished-minimal,
author = "Ulrich {\"{U}}nderwood and Ned {\~N}et and Paul Pot",
title = "Lower Bounds for Wishful Research Results",
note = "Talk at Fanstord University (this is a minimal UNPUBLISHED entry)",
}
@UNPUBLISHED{unpublished-full,
author = "Ulrich {\"{U}}nderwood and Ned {\~N}et and Paul Pot",
title = "Lower Bounds for Wishful Research Results",
month = nov # ", " # dec,
year = 1988,
note = "Talk at Fanstord University (this is a full UNPUBLISHED entry)",
}
@MISC{random-note-crossref,
key = {Volume-2},
note = "Volume~2 is listed under Knuth \cite{book-full}"
}