summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/bibtex/bib/beebe/texbook2.bib
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2019-03-06 22:50:00 +0000
committerKarl Berry <karl@freefriends.org>2019-03-06 22:50:00 +0000
commit4f01f3f908e7dc7db76d968aae01edf4580f1372 (patch)
treef876d9052244e6cba263124373f8149c08b04ef5 /Master/texmf-dist/bibtex/bib/beebe/texbook2.bib
parentdb28af0c6e1e6a1e6ccd86b36e0741fefe34e830 (diff)
doc,sync
git-svn-id: svn://tug.org/texlive/trunk@50267 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/bibtex/bib/beebe/texbook2.bib')
-rw-r--r--Master/texmf-dist/bibtex/bib/beebe/texbook2.bib683
1 files changed, 625 insertions, 58 deletions
diff --git a/Master/texmf-dist/bibtex/bib/beebe/texbook2.bib b/Master/texmf-dist/bibtex/bib/beebe/texbook2.bib
index f6edbe7fa11..d5f9f423aa2 100644
--- a/Master/texmf-dist/bibtex/bib/beebe/texbook2.bib
+++ b/Master/texmf-dist/bibtex/bib/beebe/texbook2.bib
@@ -5,9 +5,9 @@
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
-%%% version = "2.13",
-%%% date = "31 January 2019",
-%%% time = "15:43:31 MST",
+%%% version = "2.14",
+%%% date = "04 March 2019",
+%%% time = "06:09:30 MST",
%%% filename = "texbook2.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
@@ -16,7 +16,7 @@
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
-%%% checksum = "14909 11091 43929 427780",
+%%% checksum = "05986 11658 47199 456204",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
@@ -32,30 +32,31 @@
%%% printed if the is-alpha.bst or is-plain.bst
%%% style files are used.
%%%
-%%% At version 2.13, the year coverage looked
+%%% At version 2.14, the year coverage looked
%%% like this:
%%%
-%%% 1985 ( 1) 1996 ( 5) 2007 ( 1)
-%%% 1986 ( 1) 1997 ( 3) 2008 ( 0)
-%%% 1987 ( 0) 1998 ( 4) 2009 ( 0)
-%%% 1988 ( 2) 1999 ( 3) 2010 ( 1)
-%%% 1989 ( 2) 2000 ( 2) 2011 ( 0)
-%%% 1990 ( 3) 2001 ( 2) 2012 ( 0)
-%%% 1991 ( 4) 2002 ( 1) 2013 ( 0)
-%%% 1992 ( 5) 2003 ( 2) 2014 ( 0)
-%%% 1993 ( 0) 2004 ( 1) 2015 ( 0)
-%%% 1994 ( 0) 2005 ( 2) 2016 ( 2)
-%%% 1995 ( 4) 2006 ( 2)
+%%% 1982 ( 1) 1994 ( 1) 2006 ( 2)
+%%% 1983 ( 0) 1995 ( 5) 2007 ( 1)
+%%% 1984 ( 0) 1996 ( 5) 2008 ( 1)
+%%% 1985 ( 1) 1997 ( 2) 2009 ( 1)
+%%% 1986 ( 1) 1998 ( 5) 2010 ( 1)
+%%% 1987 ( 0) 1999 ( 3) 2011 ( 0)
+%%% 1988 ( 2) 2000 ( 2) 2012 ( 0)
+%%% 1989 ( 3) 2001 ( 2) 2013 ( 0)
+%%% 1990 ( 3) 2002 ( 1) 2014 ( 0)
+%%% 1991 ( 4) 2003 ( 2) 2015 ( 0)
+%%% 1992 ( 5) 2004 ( 1) 2016 ( 2)
+%%% 1993 ( 1) 2005 ( 4)
%%%
%%% Article: 2
-%%% Book: 407
+%%% Book: 411
%%% Booklet: 1
%%% Misc: 11
%%% Periodical: 93
%%% Proceedings: 10
%%% TechReport: 1
%%%
-%%% Total entries: 525
+%%% Total entries: 529
%%%
%%% CONVENTIONS
%%%
@@ -4528,7 +4529,7 @@
acknowledgement = ack-mz,
}
-@Book{Fraser:RCC95,
+@Book{Fraser:1995:RCC,
author = "Chris W. Fraser and David R. Hanson",
title = "A Retargetable {C} Compiler: Design and
Implementation",
@@ -4562,7 +4563,7 @@
price = "US\$55.95",
URL = "https://www.pearson.com/us/higher-education/program/Hanson-Retargetable-C-Compiler-A-Design-and-Implementation/PGM166351.html",
abstract = "This new text examines the design and implementation
- of Icc, a production-quality, retargetable compiler,
+ of lcc, a production-quality, retargetable compiler,
designed at AT\&T Bell Laboratories and Princeton
University for the ANSI C programming language. The
authors' innovative approach --- a ``literate program''
@@ -4582,13 +4583,13 @@
constructing a real ANSI C compiler, illustrating the
interaction between theory and practice; covers
compiler theory only as needed to understand the
- implementation of Icc, focusing instead on practical,
+ implementation of lcc, focusing instead on practical,
applied issues; encourages a deeper understanding of
programming in C, by providing C programmers with a
tour of the language from the perspective of compiler
authors; includes coverage of code generators for the
MIPS R3000, SPARC, and Intel 386 and its successors;
- and provides access to the full source code for the Icc
+ and provides access to the full source code for the lcc
compiler, the three back ends, and the code-generator
generator, either on disk or via FTP.",
acknowledgement = ack-nhfb,
@@ -5144,7 +5145,132 @@
acknowledgement = ack-mz,
}
-@Book{Graham:CM94,
+@Book{Graham:1989:CM,
+ author = "Ronald L. Graham and Donald E. Knuth and Oren
+ Patashnik",
+ title = "Concrete Mathematics",
+ publisher = pub-AW,
+ address = pub-AW:adr,
+ pages = "xiii + 625",
+ year = "1989",
+ ISBN = "0-201-14236-8",
+ ISBN-13 = "978-0-201-14236-5",
+ LCCN = "QA39.2 .G7331 1989",
+ MRclass = "00A05 (00-01 05-01 68-01 68Rxx)",
+ MRnumber = "91f:00001",
+ MRreviewer = "Volker Strehl",
+ bibdate = "Wed Dec 15 08:01:55 1993",
+ bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
+ http://www.math.utah.edu/pub/tex/bib/fibquart.bib;
+ http://www.math.utah.edu/pub/tex/bib/master.bib;
+ http://www.math.utah.edu/pub/tex/bib/sigact.bib;
+ http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
+ acknowledgement = ack-nhfb,
+ keywords = "computer science -- mathematics; mathematics",
+ remark-1 = "Second printing, revised, January 1989. Third
+ printing, revised, May 1989. Fourth printing, revised,
+ January 1990. Fifth printing, revised, July 1990. Sixth
+ printing, revised, October 1990. Seventh printing,
+ revised, December 1991. Eighth printing, revised,
+ October 1992.",
+ remark-2 = "See translations
+ \cite{Knuth:1990:JTS,Knuth:1991:JTS,Knuth:1992:MD,Knuth:1992:xx,Knuth:1993:KS,Knuth:199x:xxc}.",
+ shorttableofcontents = "1: Recurrent Problems / 1 \\
+ 2: Sums / 21 \\
+ 3: Integer Functions / 67 \\
+ 4: Number Theory / 102 \\
+ 5: Binomial Coefficients / 153 \\
+ 6: Special Numbers / 243 \\
+ 7: Generating Functions / 306 \\
+ 8: Discrete Probability / 367 \\
+ 9: Asymptotics / 425 \\
+ A: Answers to Exercises / 483 \\
+ B: Bibliography / 578 \\
+ C: Credits for Exercises / 601 \\
+ Index / 606 \\
+ List of Tables / 624",
+ tableofcontents = "1: Recurrent Problems / 1 \\
+ 1.1 The Tower of Hanoi / 1 \\
+ 1.2 Lines in the Plane / 4 \\
+ 1.3 The Josephus Problem / 8 \\
+ Exercises / 17 \\
+ 2: Sums / 21 \\
+ 2.1 Notation / 21 \\
+ 2.2 Sums and Recurrences / 25 \\
+ 2.3 Manipulation of Sums / 30 \\
+ 2.4 Multiple Sums / 34 \\
+ 2.5 General Methods / 41 \\
+ 2.6 Finite and Infinite Calculus / 47 \\
+ 2.7 Infinite Sums / 56 \\
+ Exercises / 62 \\
+ 3: Integer Functions / 67 \\
+ 3.1 Floors and Ceilings / 67 \\
+ 3.2 Floor/Ceiling Applications / 70 \\
+ 3.3 Floor/Ceiling Recurrences / 78 \\
+ 3.4 `mod': The Binary Operation / 81 \\
+ 3.5 Floor/Ceiling Sums / 86 \\
+ Exercises / 95 \\
+ 4: Number Theory / 102 \\
+ 4.1 Divisibility / 102 \\
+ 4.2 Primes / 105 \\
+ 4.3 Prime Examples / 107 \\
+ 4.4 Factorial Factors / 111 \\
+ 4.5 Relative Primality / 115 \\
+ 4.6 `mod': The Congruence Relation / 123 \\
+ 4.7 Independent Residues / 126 \\
+ 4.8 Additional Applications / 129 \\
+ 4.9 Phi and Mu / 133 \\
+ Exercises / 144 \\
+ 5: Binomial Coefficients / 153 \\
+ 5.1 Basic Identities / 153 \\
+ 5.2 Basic Practice / 172 \\
+ 5.3 Tricks of the Trade / 186 \\
+ 5.4 Generating Functions / 196 \\
+ 5.5 Hypergeometric Functions / 204 \\
+ 5.6 Hypergeometric Transformations / 216 \\
+ 5.7 Partial Hypergeometric Sums / 223 \\
+ Exercises / 230 \\
+ 6: Special Numbers / 243 \\
+ 6.1 Stirling Numbers / 243 \\
+ 6.2 Eulerian Numbers / 253 \\
+ 6.3 Harmonic Numbers / 258 \\
+ 6.4 Harmonic Summation / 265 \\
+ 6.5 Bernoulli Numbers / 269 \\
+ 6.6 Fibonacci Numbers / 276 \\
+ 6.7 Continuants / 287 \\
+ Exercises / 295 \\
+ 7: Generating Functions / 306 \\
+ 7.1 Domino Theory and Change / 306 \\
+ 7.2 Basic Maneuvers / 317 \\
+ 7.3 Solving Recurrences / 323 \\
+ 7.4 Special Generating Functions / 336 \\
+ 7.5 Convolutions / 339 \\
+ 7.6 Exponential Generating Functions / 350 \\
+ 7.7 Dirichlet Generating Functions / 356 \\
+ Exercises / 357 \\
+ 8: Discrete Probability / 367 \\
+ 8.1 Definitions / 367 \\
+ 8.2 Mean and Variance / 373 \\
+ 8.3 Probability Generating Functions / 380 \\
+ 8.4 Flipping Coins / 387 \\
+ 8.5 Hashing / 397 \\
+ Exercises / 413 \\
+ 9: Asymptotics / 425 \\
+ 9.1 A Hierarchy / 426 \\
+ 9.2 0 Notation / 429 \\
+ 9.3 0 Manipulation / 436 \\
+ 9.4 Two Asymptotic Tricks / 449 \\
+ 9.5 Euler's Summation Formula / 455 \\
+ 9.6 Final Summations / 462 \\
+ Exercises / 475 \\
+ A: Answers to Exercises / 483 \\
+ B: Bibliography / 578 \\
+ C: Credits for Exercises / 601 \\
+ Index / 606 \\
+ List of Tables / 624",
+}
+
+@Book{Graham:1994:CM,
author = "Ronald L. Graham and Donald E. Knuth and Oren
Patashnik",
title = "Concrete Mathematics",
@@ -5156,27 +5282,110 @@
ISBN = "0-201-55802-5",
ISBN-13 = "978-0-201-55802-9",
LCCN = "QA39.2 .G733 1994",
+ MRclass = "68-01 (00-01 00A05 05-01 68Rxx)",
+ MRnumber = "97d:68003",
bibdate = "Wed Jul 6 14:39:36 1994",
- bibsource = "http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
+ bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
+ http://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib;
+ http://www.math.utah.edu/pub/tex/bib/fibquart.bib;
+ http://www.math.utah.edu/pub/tex/bib/master.bib;
+ http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
acknowledgement = ack-nhfb,
-}
-
-@Book{Graham:CMF89,
- author = "Ronald L. Graham and Donald E. Knuth and Oren
- Patashnik",
- title = "Concrete Mathematics: {A} Foundation for Computer
- Science",
- publisher = pub-AW,
- address = pub-AW:adr,
- pages = "xiii + 625",
- year = "1989",
- ISBN = "0-201-14236-8",
- ISBN-13 = "978-0-201-14236-5",
- LCCN = "QA39.2 .G7331 1989",
- bibdate = "Wed Dec 15 08:04:45 1993",
- bibsource = "http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
- note = prep-tex,
- acknowledgement = ack-mz,
+ keywords = "computer science -- mathematics; mathematics",
+ shorttableofcontents = "1: Recurrent Problems / 1 \\
+ 2: Sums / 21 \\
+ 3: Integer Functions / 67 \\
+ 4: Number Theory / 102 \\
+ 5: Binomial Coefficients / 153 \\
+ 6: Special Numbers / 257 \\
+ 7: Generating Functions / 320 \\
+ 8: Discrete Probability / 381 \\
+ 9: Asymptotics / 439 \\
+ A: Answers to Exercises / 497 \\
+ B: Bibliography / 604 \\
+ C: Credits for Exercises / 632 \\
+ Index / 637 \\
+ List of Tables / 657",
+ tableofcontents = "1: Recurrent Problems / 1 \\
+ 1.1 The Tower of Hanoi / 1 \\
+ 1.2 Lines in the Plane / 4 \\
+ 1.3 The Josephus Problem / 8 \\
+ Exercises / 17 \\
+ 2: Sums / 21 \\
+ 2.1 Notation / 21 \\
+ 2.2 Sums and Recurrences / 25 \\
+ 2.3 Manipulation of Sums / 30 \\
+ 2.4 Multiple Sums / 34 \\
+ 2.5 General Methods / 41 \\
+ 2.6 Finite and Infinite Calculus / 47 \\
+ 2.7 Infinite Sums / 56 \\
+ Exercises / 62 \\
+ 3: Integer Functions / 67 \\
+ 3.1 Floors and Ceilings / 67 \\
+ 3.2 Floor/Ceiling Applications / 70 \\
+ 3.3 Floor/Ceiling Recurrences / 78 \\
+ 3.4 `mod': The Binary Operation / 81 \\
+ 3.5 Floor/Ceiling Sums / 86 \\
+ Exercises / 95 \\
+ 4: Number Theory / 102 \\
+ 4.1 Divisibility / 102 \\
+ 4.2 Primes / 105 \\
+ 4.3 Prime Examples / 107 \\
+ 4.4 Factorial Factors / 111 \\
+ 4.5 Relative Primality / 115 \\
+ 4.6 `mod': The Congruence Relation / 123 \\
+ 4.7 Independent Residues / 126 \\
+ 4.8 Additional Applications / 129 \\
+ 4.9 Phi and Mu / 133 \\
+ Exercises / 144 \\
+ 5: Binomial Coefficients / 153 \\
+ 5.1 Basic Identities / 153 \\
+ 5.2 Basic Practice / 172 \\
+ 5.3 Tricks of the Trade / 186 \\
+ 5.4 Generating Functions / 196 \\
+ 5.5 Hypergeometric Functions / 204 \\
+ 5.6 Hypergeometric Transformations / 216 \\
+ 5.7 Partial Hypergeometric Sums / 223 \\
+ 5.8 Mechanical Summation / 229 \\
+ Exercises / 242 \\
+ 6: Special Numbers / 257 \\
+ 6.1 Stirling Numbers / 257 \\
+ 6.2 Eulerian Numbers / 267 \\
+ 6.3 Harmonic Numbers / 272 \\
+ 6.4 Harmonic Summation / 279 \\
+ 6.5 Bernoulli Numbers / 283 \\
+ 6.6 Fibonacci Numbers / 290 \\
+ 6.7 Continuants / 301 \\
+ Exercises / 309 \\
+ 7: Generating Functions / 320 \\
+ 7.1 Domino Theory and Change / 320 \\
+ 7.2 Basic Maneuvers / 331 \\
+ 7.3 Solving Recurrences / 337 \\
+ 7.4 Special Generating Functions / 350 \\
+ 7.5 Convolutions / 353 \\
+ 7.6 Exponential Generating Functions / 364 \\
+ 7.7 Dirichlet Generating Functions / 370 \\
+ Exercises / 371 \\
+ 8: Discrete Probability / 381 \\
+ 8.1 Definitions / 381 \\
+ 8.2 Mean and Variance / 387 \\
+ 8.3 Probability Generating Functions / 394 \\
+ 8.4 Flipping Coins / 401 \\
+ 8.5 Hashing / 411 \\
+ Exercises / 427 \\
+ 9: Asymptotics / 439 \\
+ 9.1 A Hierarchy / 440 \\
+ 9.2 O Notation / 443 \\
+ 9.3 O Manipulation / 450 \\
+ 9.4 Two Asymptotic Tricks / 463 \\
+ 9.5 Euler's Summation Formula / 469 \\
+ 9.6 Final Summations / 476 \\
+ Exercises / 489 \\
+ A: Answers to Exercises / 497 \\
+ B: Bibliography / 604 \\
+ C: Credits for Exercises / 632 \\
+ Index / 637 \\
+ List of Tables / 657",
}
@Book{Grandine:1990:NMP,
@@ -5323,7 +5532,7 @@
Problems",
}
-@Book{Greene:MAA82,
+@Book{Greene:1982:MAA,
author = "Daniel H. Greene and Donald E. Knuth",
title = "Mathematics for the Analysis of Algorithms",
publisher = pub-BIRKHAUSER,
@@ -5334,9 +5543,91 @@
ISBN = "3-7643-3102-X",
ISBN-13 = "978-3-7643-3102-3",
LCCN = "QA76.6 .G7423 1982",
- bibdate = "Tue Dec 14 23:01:29 1993",
- bibsource = "http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
+ bibdate = "Tue Dec 14 22:54:24 1993",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/hash.bib;
+ http://www.math.utah.edu/pub/tex/bib/master.bib;
+ http://www.math.utah.edu/pub/tex/bib/sigact.bib;
+ http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
acknowledgement = ack-nhfb,
+ descriptor = "Algorithmus, Asymptotische Analyse, Erzeugende
+ Funktion, Identitaet, Komplexitaetsanalyse, Mathematik,
+ Operationsmethode, Rekursionsformel",
+ keywords = "computer algorithms; electronic digital computers --
+ programming",
+ remark = "{Mathematische Methoden zur Aufwandsabschaetzung von
+ Algorithmen. Allgemein Dargestellt, Aber Haeufig durch
+ Beispiele Motiviert (z.b. Zeitaufwand von
+ Hash-verfahren). Zum Teil Vertiefende Darstellung der
+ "optionalen" Kapitel aus "the Art of Computer
+ Programming, Band 3". Themengebiete: Rechnen MIT
+ Binomialkoeffizienten, Geschlossene Darstellungen fuer
+ Rekurrente Relationen, Operatormethoden, Herleitung
+ Asymptotischer Abschaetzungen}.",
+ shorttableofcontents = "1: Binomial Identities / 5 \\
+ 2: Recurrence Relations / 15 \\
+ 3: Operator Methods / 35 \\
+ 4: Asymptotic Analysis / 46 \\
+ 5: Bibliography / 81 \\
+ 6: Appendices / 85 \\
+ A: Lectures / 85 \\
+ B: Homework Assignments / 87 \\
+ C: Midterm Exam I and Solutions / 88 \\
+ D: Final Exam I and Solutions / 99 \\
+ E: Midterm Exam II and Solutions / 105 \\
+ F: Final Exam II and Solutions / 111 \\
+ G: A Qualifying Exam Problem and Solution / 115 \\
+ 7: Index / 120",
+ tableofcontents = "1: Binomial Identities / 5 \\
+ 1.1 Summary of Useful Identities / 5 \\
+ 1.2 Deriving the Identities / 7 \\
+ 1.3 Inverse Relations / 9 \\
+ 1.4 Operator Calculus / 12 \\
+ 1.5 Hypergeometric Series / 13 \\
+ 1.6 Identities with the Harmonic Numbers / 14 \\
+ 2: Recurrence Relations / 15 \\
+ 2.1 Linear Recurrence Relations / 15 \\
+ 2.1.1 Finite History / 16 \\
+ 2.1.1.1 Constant Coefficients / 16 \\
+ 2.1.1.2 Variable Coefficients / 18 \\
+ 2.1.2 Full History / 21 \\
+ 2.1.2.1 Differencing / 21 \\
+ 2.1.2.2 By Repertoire / 21 \\
+ 2.2 Nonlinear Recurrence Relations / 25 \\
+ 2.2.1 Relations with Maximum or Minimum Functions / 25
+ \\
+ 2.2.2 Continued Fractions / 29 \\
+ 2.2.3 Doubly Exponential Sequences / 31 \\
+ 3: Operator Methods / 35 \\
+ 3.1 The Cookie Monster / 35 \\
+ 3.2 Coalesced Hashing / 38 \\
+ 3.3 Open Addressing: Uniform Hashing / 42 \\
+ 3.4 Open Addressing: Secondary Clustering / 43 \\
+ 4: Asymptotic Analysis / 46 \\
+ 4.1 Basic Concepts / 46 \\
+ 4.1.1 Notation / 47 \\
+ 4.1.2 Bootstrapping / 47 \\
+ 4.1.3 Dissecting / 48 \\
+ 4.1.4 Limits of Limits / 49 \\
+ 4.1.5 Summary of Useful Asymptotic Expansions / 51 \\
+ 4.1.6 An Example / 52 \\
+ 4.2 Stieltjes Integration / 59 \\
+ 4.2.1 $O$-notation and Integrals / 61 \\
+ 4.2.2 Euler's Summation Formula / 62 \\
+ 4.2.3 A Number Theory Example / 63 \\
+ 4.3 Asymptotics from Generating Functions / 69 \\
+ 4.3.1 Darboux's Method / 69 \\
+ 4.3.2 Residue Calculus / 72 \\
+ 4.3.3 The Saddle Point Method / 74 \\
+ 5: Bibliography / 81 \\
+ 6: Appendices / 85 \\
+ A: Lectures / 85 \\
+ B: Homework Assignments / 87 \\
+ C: Midterm Exam I and Solutions / 88 \\
+ D: Final Exam I and Solutions / 99 \\
+ E: Midterm Exam II and Solutions / 105 \\
+ F: Final Exam II and Solutions / 111 \\
+ G: A Qualifying Exam Problem and Solution / 115 \\
+ 7: Index / 120",
}
@Book{Gries:EMR89,
@@ -6374,29 +6665,152 @@
ISBN-13 = "978-0-201-89683-1",
LCCN = "QA76.6 .K64 1997",
bibdate = "Fri Jul 11 15:41:22 1997",
- bibsource = "http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/fibquart.bib;
+ http://www.math.utah.edu/pub/tex/bib/master.bib",
price = "US\$49.50",
series = "The Art of Computer Programming",
acknowledgement = ack-nhfb,
-}
-
-@Book{Knuth:1997:SA,
+ keywords = "computer algorithms; electronic digital computers --
+ programming",
+ tableofcontents = "1: Basic Concepts / 1 \\
+ 1.1. Algorithms / 1 \\
+ 1.2. Mathematical Preliminaries / 10 \\
+ 1.2.1. Mathematical Induction / 11 \\
+ 1.2.2. Numbers, Powers, and Logarithms / 21 \\
+ 1.2.3. Sums and Products / 27 \\
+ 1.2.4. Integer Functions and Elementary Number Theory /
+ 39 \\
+ 1.2.5. Permutations and Factorials / 45 \\
+ 1.2.6. Binomial Coefficients / 52 \\
+ 1.2.7. Harmonic Numbers / 75 \\
+ 1.2.8. Fibonacci Numbers / 79 \\
+ 1.2.9. Generating Functions / 87 \\
+ 1.2.10. Analysis of an Algorithm / 96 \\
+ * 1.2.11. Asymptotic Representations / 107 \\
+ *1.2.11.1. The $O$-notation / 107 \\
+ *1.2.11.2. Euler's summation formula / 111 \\
+ *1.2.11.3. Some asymptotic calculations / 116 \\
+ 1.3. MIX / 124 \\
+ 1.3.1. Description of MIX / 124 \\
+ 1.3.2. The MIX Assembly Language / 144 \\
+ 1.3.3. Applications to Permutations / 164 \\
+ 1.4. Some Fundamental Programming Techniques / 186 \\
+ 1.4.1. Subroutines / 186 \\
+ 1.4.2. Coroutines / 193 \\
+ 1.4.3. Interpretive Routines / 200 \\
+ 1.4.3.1. A MIX simulator / 202 \\
+ *1.4.3.2. Trace routines / 212 \\
+ 1.4.4. Input and Output / 215 \\
+ 1.4.5. History and Bibliography / 229 \\
+ 2: Information Structures / 232 \\
+ 2.1. Introduction / 232 \\
+ 2.2. Linear Lists / 238 \\
+ 2.2.1. Stacks, Queues, and Deques / 238 \\
+ 2.2.2. Sequential Allocation / 244 \\
+ 2.2.3. Linked Allocation / 254 \\
+ 2.2.4. Circular Lists / 273 \\
+ 2.2.5. Doubly Linked Lists / 280 \\
+ 2.2.6. Arrays and Orthogonal Lists / 298 \\
+ 2.3. Trees / 308 \\
+ 2.3.1. Traversing Binary Trees / 318 \\
+ 2.3.2. Binary Tree Representation of Trees / 334 \\
+ 2.3.3. Other Representations of Trees / 348 \\
+ 2.3.4. Basic Mathematical Properties of Trees / 362 \\
+ 2.3.4.1. Free trees / 363 \\
+ 2.3.4.2. Oriented trees / 372 \\
+ *2.3.4.3. The ``infinity lemma'' / 382 \\
+ *2.3.4.4. Enumeration of trees / 386 \\
+ 2.3.4.5. Path length / 399 \\
+ *2.3.4.6. History and bibliography / 406 \\
+ 2.3.5. Lists and Garbage Collection / 408 \\
+ 2.4. Multilinked Structures / 424 \\
+ 2.5. Dynamic Storage Allocation / 435 \\
+ 2.6. History and Bibliography / 457 \\
+ Answers to Exercises / 466 \\
+ Appendix A: Tables of Numerical Quantities / 619 \\
+ 1. Fundamental Constants (decimal) / 619 \\
+ 2. Fundamental Constants (octal) / 620 \\
+ 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
+ Numbers / 621 \\
+ Appendix B: Index to Notations / 623 \\
+ Appendix C: Index to Algorithms and Theorems / 628 \\
+ Index and Glossary / 630",
+}
+
+@Book{Knuth:1998:SA,
author = "Donald E. Knuth",
title = "Seminumerical Algorithms",
volume = "2",
publisher = pub-AW,
address = pub-AW:adr,
edition = "Third",
- pages = "704",
- year = "1997",
+ pages = "xiii + 762",
+ year = "1998",
ISBN = "0-201-89684-2",
ISBN-13 = "978-0-201-89684-8",
- LCCN = "",
- bibdate = "Fri Jan 31 07:40:01 1997",
- bibsource = "http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
- price = "US\$49.44",
+ LCCN = "QA76.6 .K64 1997",
+ bibdate = "Fri Jul 11 15:41:22 1997",
+ bibsource = "http://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
+ http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
+ http://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
+ http://www.math.utah.edu/pub/tex/bib/css.bib;
+ http://www.math.utah.edu/pub/tex/bib/fparith.bib;
+ http://www.math.utah.edu/pub/tex/bib/master.bib;
+ http://www.math.utah.edu/pub/tex/bib/prng.bib;
+ http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
+ price = "US\$52.75",
series = "The Art of Computer Programming",
acknowledgement = ack-nhfb,
+ tableofcontents = "3: Random Numbers / 1 \\
+ 3.1. Introduction / 1 \\
+ 3.2. Generating Uniform Random Numbers / 10 \\
+ 3.2.1. The Linear Congruential Method / 10 \\
+ 3.2 1.1. Choice of modulus / 12 \\
+ 3.2.1.2 Choice of multiplier / 16 \\
+ 3.2.1.3. Potency / 23 \\
+ 3.2.2. Other Methods / 26 \\
+ 3.3. Statistical Tests / 41 \\
+ 3.3.1. General Test Procedures for Studying Random Data
+ / 41 \\
+ 3.3.2. Empirical Tests / 61 \\
+ *3.3.3. Theoretical Tests / 80 \\
+ 3.3.4. The Spectral Test / 93 \\
+ 3.4. Other Types of Random Quantities / 119 \\
+ 3.4 1. Numerical Distributions / 119 \\
+ 3.4.2. Random Sampling and Shuffling / 142 \\
+ *3.5. What Is a Random Sequence? / 149 \\
+ 3.6. Summary / 184 \\
+ 4: Arithmetic / 194 \\
+ 4.1. Positional Number Systems / 195 \\
+ 4.2. Floating Point Arithmetic / 214 \\
+ 4.2.1. Single-Precision Calculations / 214 \\
+ 4.2 2. Accuracy of Floating Point Arithmetic / 229 \\
+ *4.2.3. Double-Precision Calculations / 246 \\
+ 4.2.4. Distribution of Floating Point Numbers / 253 \\
+ 4.3 Multiple Precision Arithmetic / 265 \\
+ 4.3.1. The Classical Algorithms / 265 \\
+ *4.3.2. Modular Arithmetic / 284 \\
+ *4.3.3. How Fast Can We Multiply? / 294 \\
+ 4.4. Radix Conversion / 319 \\
+ 4.5. Rational Arithmetic / 330 \\
+ 4.5.1. Fractions / 330 \\
+ 4.5.2. The Greatest Common Divisor / 333 \\
+ *4.5.3. Analysis of Euclid's Algorithm / 356 \\
+ 4.5.4. Factoring into Primes / 379 \\
+ 4.6. Polynomial Arithmetic / 418 \\
+ 4.6.1. Division of Polynomials / 420 \\
+ *4.6.2. Factorization of Polynomials / 439 \\
+ 4.6.3. Evaluation of Powers / 461 \\
+ 4.6.4. Evaluation of Polynomials / 485 \\
+ *4.7. Manipulation of Power Series / 525 \\
+ Answers to Exercises / 538 \\
+ Appendix A: Tables of Numerical Quantities / 726 \\
+ 1. Fundamental Constants (decimal) / 726 \\
+ 2; Fundamental Constants ( octal) / 727 \\
+ 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
+ Numbers / 728 \\
+ Appendix B: Index to Notations / 730 \\
+ Index and Glossary / 735",
}
@Book{Knuth:1998:SS,
@@ -6406,16 +6820,55 @@
publisher = pub-AW,
address = pub-AW:adr,
edition = "Second",
- pages = "704",
+ pages = "xiv + 780",
year = "1998",
ISBN = "0-201-89685-0",
ISBN-13 = "978-0-201-89685-5",
LCCN = "QA76.6.K64 1997",
bibdate = "Sat Feb 27 11:11:53 1999",
- bibsource = "http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib;
+ http://www.math.utah.edu/pub/tex/bib/string-matching.bib;
+ http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
price = "US\$49.95",
series = "The Art of Computer Programming",
acknowledgement = ack-nhfb,
+ tableofcontents = "5: Sorting / 1 \\
+ *5.1. Combinatorial Properties of Permutations / 11 \\
+ *5.1.1. Inversions / 11 \\
+ *5.1.2. Permutations of a Multiset / 22 \\
+ *5.1.3. Runs / 35 \\
+ *5.1.4 Tableaux and Involutions / 47 \\
+ 5.2. Internal sorting / 73 \\
+ 5.2 l. Sorting by Insertion / 80 \\
+ 5.2.2. Sorting by Exchanging / 105 \\
+ 5.2.3. Sorting by Selection / 138 \\
+ 5.2.4 Sorting by Merging / 158 \\
+ 5.2 5. Sorting by Distribution / 168 \\
+ 5.3. Optimum Sorting / 180 \\
+ 5.3 l. Minimum-Comparison Sorting / 180 \\
+ *5.3.2. Minimum-Comparison Merging / 197 \\
+ *5.3.3. Minimum-Comparison Selection / 207 \\
+ *5.3.4. Networks for Sorting / 219 \\
+ 5.4. External Sorting / 248 \\
+ 5.4.1. Multiway Merging and Replacement Selection / 252
+ \\
+ *5.4.2. The Polyphase Merge / 267 \\
+ *5.4.3 The Cascade Merge / 288 \\
+ *5.4.4. Reading Tape Backwards / 299 \\
+ *5.4.5. The Oscillating Sort / 311 \\
+ *5.4.6. Practical Considerations for Tape Merging / 317
+ \\
+ *5.4.7. External Radix Sorting / 343 \\
+ *5.4.8. Two-Tape Sorting / 348 \\
+ *5.4.9 Disks and Drums / 356 \\
+ 5.5. Summary, History, and Bibliography / 380 \\
+ 6: Searching / 392 \\
+ 6.1. Sequential Searching / 396 \\
+ 6.2. Searching by Comparison of Keys / 409 \\
+ 6.2.1. Searching an Ordered Table / 409 \\
+ 6.2.2 Binary Tree Searching / 426 \\
+ 6.2.3. Balanced Trees / 458 \\
+ 6.2.4. Multiway Trees / 481",
}
@Book{Knuth:2000:SPA,
@@ -6434,6 +6887,58 @@
acknowledgement = ack-nhfb,
}
+@Book{Knuth:2008:ICA,
+ author = "Donald E. Knuth",
+ title = "The Art of Computer Programming: Volume 4, Fascicle 0.
+ Introduction to Combinatorial Algorithms and {Boolean}
+ Functions",
+ publisher = pub-AW,
+ address = pub-AW:adr,
+ pages = "ix + 216",
+ year = "2008",
+ ISBN = "0-321-53496-4",
+ ISBN-13 = "978-0-321-53496-5",
+ LCCN = "QA76.6 .K64 2005",
+ bibdate = "Fri Jun 12 07:16:46 2009",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib;
+ http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
+ series = "The art of computer programming",
+ acknowledgement = ack-nhfb,
+ tableofcontents = "7: Combinatorial Searching / 1 \\
+ 7.1. Zeros and Ones / 47 \\
+ 7.1.1. Boolean Basics / 47 \\
+ 7.1.2 Boolean Evaluation / 96 \\
+ Answers to Exercises / 134 \\
+ Index and Glossary / 201",
+}
+
+@Book{Knuth:2009:ACP,
+ author = "Donald E. Knuth",
+ title = "The Art of Computer Programming: Volume 4, Fascicle 1.
+ {Bitwise} Tricks and Techniques. {Binary} Decision
+ Diagrams",
+ publisher = pub-AW,
+ address = pub-AW:adr,
+ pages = "vii + 260",
+ year = "2009",
+ ISBN = "0-321-58050-8",
+ ISBN-13 = "978-0-321-58050-4",
+ LCCN = "QA76.6 .K64 2009",
+ bibdate = "Fri Jun 12 07:20:05 2009",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib;
+ http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
+ series = "The art of computer programming",
+ acknowledgement = ack-nhfb,
+ tableofcontents = "7: Combinatorial Searching / 1 \\
+ 7 1. Zeros And Ones / 1 \\
+ 7.1.1. Boolean Basics / 1 \\
+ 7.1.2. Boolean Evaluation / 1 \\
+ 7.1.3. Bitwise Tricks and Techniques / 1 \\
+ 7.1.4. Binary Decision Diagrams / 70 \\
+ Answers to Exercises / 149 \\
+ Index and Glossary / 244",
+}
+
@Book{Koenderink:SS89,
author = "Jan Koenderink",
title = "Solid Shape",
@@ -8280,6 +8785,68 @@
acknowledgement = ack-nhfb,
}
+@Book{Knuth:2005:ACPa,
+ author = "Donald E. Knuth",
+ title = "The Art of Computer Programming: Volume 1, Fascicle 1.
+ {MMIX}, a {RISC} Computer for the New Millennium",
+ publisher = pub-AW,
+ address = pub-AW:adr,
+ pages = "v + 134",
+ year = "2005",
+ ISBN = "0-201-85392-2",
+ ISBN-13 = "978-0-201-85392-6",
+ LCCN = "QA76.6 .K64 2005",
+ MRclass = "68-02 (68M01 68N15)",
+ MRnumber = "MR2245382 (2007f:68004a)",
+ bibdate = "Tue Oct 11 05:24:35 MDT 2005",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib;
+ http://www.math.utah.edu/pub/tex/bib/texbook2.bib;
+ z3950.loc.gov:7090/Voyager",
+ acknowledgement = ack-nhfb,
+ subject = "Computer programming; Computer algorithms",
+ tableofcontents = "1: Basic Concepts / 1 \\
+ 1.3'. MMIX / 2 \\
+ 1.3.1'. Description of MMIX / 2 \\
+ 1.3.2'. The MMIX Assembly Language / 28 \\
+ 1.3.3'. Applications to Permutations / 51 \\
+ 1.4'. Some Fundamental Programming Techniques / 52 \\
+ 1.4.1' Subroutines / 52 \\
+ 1.4.2' Coroutines / 66 \\
+ 1.4.3'. Interpretive Routines / 73 \\
+ Answers to Exercises / 94 \\
+ Index and Glossary / 127",
+}
+
+@Book{Knuth:2005:ACPb,
+ author = "Donald E. Knuth",
+ title = "The Art of Computer Programming: Volume 4, Fascicle 3.
+ Generating All Combinations and Partitions",
+ publisher = pub-AW,
+ address = pub-AW:adr,
+ pages = "iv + 150",
+ year = "2005",
+ ISBN = "0-201-85394-9",
+ ISBN-13 = "978-0-201-85394-0",
+ LCCN = "QA76.6 .K64 2005",
+ bibdate = "Tue Oct 11 05:24:35 MDT 2005",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib;
+ http://www.math.utah.edu/pub/tex/bib/string-matching.bib;
+ http://www.math.utah.edu/pub/tex/bib/texbook2.bib;
+ z3950.loc.gov:7090/Voyager",
+ acknowledgement = ack-nhfb,
+ subject = "Computer programming; Computer algorithms",
+ tableofcontents = "7: Combinatorial Searching / 0 \\
+ 7.2. Generating All Possibilities / 0 \\
+ 7.2.1. Generating Basic Combinatorial Patterns / 0 \\
+ 7.2.1.1. Generating all n-tuples / 0 \\
+ 7.2.1.2. Generating all permutations / 0 \\
+ 7.2.1.3. Generating all combinations / 1 \\
+ 7.2.1.4. Generating all partitions / 36 \\
+ 7.2.1.5. Generating all set partitions / 61 \\
+ Answers to Exercises / 87 \\
+ Index and Glossary / 144",
+}
+
@Book{Salomon:2005:CDC,
author = "David Salomon",
title = "Coding for data and computer communications",
@@ -9752,7 +10319,7 @@
only on ISO 8879 itself, but many helpful hints and
ideas on developing SGML, applications and discussions
of the current software written to be conforming to the
- ISO standard. 'Ibis book is critical for any end-user
+ ISO standard. This book is critical for any end-user
and application developer to understand the many issues
necessary to develop SGML implementations (software
selection is one of the topics discussed) and SGML