Mercurial > cortex
view thesis/aux/mitthesis/main.bib @ 429:b5d0f0adf19f
improvements by Dylan!
author | Robert McIntyre <rlm@mit.edu> |
---|---|
date | Fri, 21 Mar 2014 20:56:56 -0400 |
parents | 6b0f77df0e53 |
children |
line wrap: on
line source
1 @preamble{ "\newcommand{\noopsort}[1]{} "2 # "\newcommand{\printfirst}[2]{#1} "3 # "\newcommand{\singleletter}[1]{#1} "4 # "\newcommand{\switchargs}[2]{#2#1} " }6 @ARTICLE{article-minimal,7 author = {L[eslie] A. Aamport},8 title = {The Gnats and Gnus Document Preparation System},9 journal = {\mbox{G-Animal's} Journal},10 year = 1986,11 }13 @ARTICLE{article-full,14 author = {L[eslie] A. Aamport},15 title = {The Gnats and Gnus Document Preparation System},16 journal = {\mbox{G-Animal's} Journal},17 year = 1986,18 volume = 41,19 number = 7,20 pages = "73+",21 month = jul,22 note = "This is a full ARTICLE entry",23 }25 The KEY field is here to override the KEY field in the journal being26 cross referenced (so is the NOTE field, in addition to its imparting27 information).29 @ARTICLE{article-crossref,30 crossref = {WHOLE-JOURNAL},31 key = "",32 author = {L[eslie] A. Aamport},33 title = {The Gnats and Gnus Document Preparation System},34 pages = "73+",35 note = "This is a cross-referencing ARTICLE entry",36 }38 @ARTICLE{whole-journal,39 key = "GAJ",40 journal = {\mbox{G-Animal's} Journal},41 year = 1986,42 volume = 41,43 number = 7,44 month = jul,45 note = {The entire issue is devoted to gnats and gnus46 (this entry is a cross-referenced ARTICLE (journal))},47 }49 @INBOOK{inbook-minimal,50 author = "Donald E. Knuth",51 title = "Fundamental Algorithms",52 publisher = "Addison-Wesley",53 year = "{\noopsort{1973b}}1973",54 chapter = "1.2",55 }57 @INBOOK{inbook-full,58 author = "Donald E. Knuth",59 title = "Fundamental Algorithms",60 volume = 1,61 series = "The Art of Computer Programming",62 publisher = "Addison-Wesley",63 address = "Reading, Massachusetts",64 edition = "Second",65 month = "10~" # jan,66 year = "{\noopsort{1973b}}1973",67 type = "Section",68 chapter = "1.2",69 pages = "10--119",70 note = "This is a full INBOOK entry",71 }73 @INBOOK{inbook-crossref,74 crossref = "whole-set",75 title = "Fundamental Algorithms",76 volume = 1,77 series = "The Art of Computer Programming",78 edition = "Second",79 year = "{\noopsort{1973b}}1973",80 type = "Section",81 chapter = "1.2",82 note = "This is a cross-referencing INBOOK entry",83 }85 @BOOK{book-minimal,86 author = "Donald E. Knuth",87 title = "Seminumerical Algorithms",88 publisher = "Addison-Wesley",89 year = "{\noopsort{1973c}}1981",90 }92 @BOOK{book-full,93 author = "Donald E. Knuth",94 title = "Seminumerical Algorithms",95 volume = 2,96 series = "The Art of Computer Programming",97 publisher = "Addison-Wesley",98 address = "Reading, Massachusetts",99 edition = "Second",100 month = "10~" # jan,101 year = "{\noopsort{1973c}}1981",102 note = "This is a full BOOK entry",103 }105 @BOOK{book-crossref,106 crossref = "whole-set",107 title = "Seminumerical Algorithms",108 volume = 2,109 series = "The Art of Computer Programming",110 edition = "Second",111 year = "{\noopsort{1973c}}1981",112 note = "This is a cross-referencing BOOK entry",113 }115 @BOOK{whole-set,116 author = "Donald E. Knuth",117 publisher = "Addison-Wesley",118 title = "The Art of Computer Programming",119 series = "Four volumes",120 year = "{\noopsort{1973a}}{\switchargs{--90}{1968}}",121 note = "Seven volumes planned (this is a cross-referenced set of BOOKs)",122 }124 @BOOKLET{booklet-minimal,125 key = "Kn{\printfirst{v}{1987}}",126 title = "The Programming of Computer Art",127 }129 @BOOKLET{booklet-full,130 author = "Jill C. Knvth",131 title = "The Programming of Computer Art",132 howpublished = "Vernier Art Center",133 address = "Stanford, California",134 month = feb,135 year = 1988,136 note = "This is a full BOOKLET entry",137 }139 @INCOLLECTION{incollection-minimal,140 author = "Daniel D. Lincoll",141 title = "Semigroups of Recurrences",142 booktitle = "High Speed Computer and Algorithm Organization",143 publisher = "Academic Press",144 year = 1977,145 }147 @INCOLLECTION{incollection-full,148 author = "Daniel D. Lincoll",149 title = "Semigroups of Recurrences",150 editor = "David J. Lipcoll and D. H. Lawrie and A. H. Sameh",151 booktitle = "High Speed Computer and Algorithm Organization",152 number = 23,153 series = "Fast Computers",154 chapter = 3,155 type = "Part",156 pages = "179--183",157 publisher = "Academic Press",158 address = "New York",159 edition = "Third",160 month = sep,161 year = 1977,162 note = "This is a full INCOLLECTION entry",163 }165 @INCOLLECTION{incollection-crossref,166 crossref = "whole-collection",167 author = "Daniel D. Lincoll",168 title = "Semigroups of Recurrences",169 pages = "179--183",170 note = "This is a cross-referencing INCOLLECTION entry",171 }173 @BOOK{whole-collection,174 editor = "David J. Lipcoll and D. H. Lawrie and A. H. Sameh",175 title = "High Speed Computer and Algorithm Organization",176 booktitle = "High Speed Computer and Algorithm Organization",177 number = 23,178 series = "Fast Computers",179 publisher = "Academic Press",180 address = "New York",181 edition = "Third",182 month = sep,183 year = 1977,184 note = "This is a cross-referenced BOOK (collection) entry",185 }187 @MANUAL{manual-minimal,188 key = "Manmaker",189 title = "The Definitive Computer Manual",190 }192 @MANUAL{manual-full,193 author = "Larry Manmaker",194 title = "The Definitive Computer Manual",195 organization = "Chips-R-Us",196 address = "Silicon Valley",197 edition = "Silver",198 month = apr # "-" # may,199 year = 1986,200 note = "This is a full MANUAL entry",201 }203 @MASTERSTHESIS{mastersthesis-minimal,204 author = "{\'{E}}douard Masterly",205 title = "Mastering Thesis Writing",206 school = "Stanford University",207 year = 1988,208 }210 @MASTERSTHESIS{mastersthesis-full,211 author = "{\'{E}}douard Masterly",212 title = "Mastering Thesis Writing",213 school = "Stanford University",214 type = "Master's project",215 address = "English Department",216 month = jun # "-" # aug,217 year = 1988,218 note = "This is a full MASTERSTHESIS entry",219 }221 @MISC{misc-minimal,222 key = "Missilany",223 note = "This is a minimal MISC entry",224 }226 @MISC{misc-full,227 author = "Joe-Bob Missilany",228 title = "Handing out random pamphlets in airports",229 howpublished = "Handed out at O'Hare",230 month = oct,231 year = 1984,232 note = "This is a full MISC entry",233 }235 @STRING{STOC-key = "OX{\singleletter{stoc}}"}237 @STRING{ACM = "The OX Association for Computing Machinery"}239 @STRING{STOC = " Symposium on the Theory of Computing"}241 @INPROCEEDINGS{inproceedings-minimal,242 author = "Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis",243 title = "On Notions of Information Transfer in {VLSI} Circuits",244 booktitle = "Proc. Fifteenth Annual ACM" # STOC,245 year = 1983,246 }248 @INPROCEEDINGS{inproceedings-full,249 author = "Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis",250 title = "On Notions of Information Transfer in {VLSI} Circuits",251 editor = "Wizard V. Oz and Mihalis Yannakakis",252 booktitle = "Proc. Fifteenth Annual ACM" # STOC,253 number = 17,254 series = "All ACM Conferences",255 pages = "133--139",256 month = mar,257 year = 1983,258 address = "Boston",259 organization = ACM,260 publisher = "Academic Press",261 note = "This is a full INPROCEDINGS entry",262 }264 @INPROCEEDINGS{inproceedings-crossref,265 crossref = "whole-proceedings",266 author = "Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis",267 title = "On Notions of Information Transfer in {VLSI} Circuits",268 organization = "",269 pages = "133--139",270 note = "This is a cross-referencing INPROCEEDINGS entry",271 }273 @PROCEEDINGS{proceedings-minimal,274 key = STOC-key,275 title = "Proc. Fifteenth Annual" # STOC,276 year = 1983,277 }279 @PROCEEDINGS{proceedings-full,280 editor = "Wizard V. Oz and Mihalis Yannakakis",281 title = "Proc. Fifteenth Annual" # STOC,282 number = 17,283 series = "All ACM Conferences",284 month = mar,285 year = 1983,286 address = "Boston",287 organization = ACM,288 publisher = "Academic Press",289 note = "This is a full PROCEEDINGS entry",290 }292 @PROCEEDINGS{whole-proceedings,293 key = STOC-key,294 organization = ACM,295 title = "Proc. Fifteenth Annual" # STOC,296 address = "Boston",297 year = 1983,298 booktitle = "Proc. Fifteenth Annual ACM" # STOC,299 note = "This is a cross-referenced PROCEEDINGS",300 }302 @PHDTHESIS{phdthesis-minimal,303 author = "F. Phidias Phony-Baloney",304 title = "Fighting Fire with Fire: Festooning {F}rench Phrases",305 school = "Fanstord University",306 year = 1988,307 }309 @PHDTHESIS{phdthesis-full,310 author = "F. Phidias Phony-Baloney",311 title = "Fighting Fire with Fire: Festooning {F}rench Phrases",312 school = "Fanstord University",313 type = "{PhD} Dissertation",314 address = "Department of French",315 month = jun # "-" # aug,316 year = 1988,317 note = "This is a full PHDTHESIS entry",318 }320 @TECHREPORT{techreport-minimal,321 author = "Tom Terrific",322 title = "An {$O(n \log n / \! \log\log n)$} Sorting Algorithm",323 institution = "Fanstord University",324 year = 1988,325 }327 @TECHREPORT{techreport-full,328 author = "Tom T{\'{e}}rrific",329 title = "An {$O(n \log n / \! \log\log n)$} Sorting Algorithm",330 institution = "Fanstord University",331 type = "Wishful Research Result",332 number = "7",333 address = "Computer Science Department, Fanstord, California",334 month = oct,335 year = 1988,336 note = "This is a full TECHREPORT entry",337 }339 @UNPUBLISHED{unpublished-minimal,340 author = "Ulrich {\"{U}}nderwood and Ned {\~N}et and Paul {\={P}}ot",341 title = "Lower Bounds for Wishful Research Results",342 note = "Talk at Fanstord University (this is a minimal UNPUBLISHED entry)",343 }345 @UNPUBLISHED{unpublished-full,346 author = "Ulrich {\"{U}}nderwood and Ned {\~N}et and Paul {\={P}}ot",347 title = "Lower Bounds for Wishful Research Results",348 month = nov # ", " # dec,349 year = 1988,350 note = "Talk at Fanstord University (this is a full UNPUBLISHED entry)",351 }353 @MISC{random-note-crossref,354 key = {Volume-2},355 note = "Volume~2 is listed under Knuth \cite{book-full}"356 }