annotate thesis/aux/mitthesis/main.bib @ 425:efba8526a662

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