# bibtab

bibtype: book
filename: master.bib
label: Klabnik:2019:RPL
author: Steve Klabnik and Carol Nichols
title: The Rust programming language
publisher: pub-NO-STARCH
address: pub-NO-STARCH:adr
edition: Second
pages: xxix + 526
year: 2019
ISBN: 1-09-812253-4, 1-71850-044-0 (paperback) OR 1098122534, 1718500440 (paperback)
ISBN13: 978-1-09-812253-9, 978-1-71850-044-0 (paperback) OR 9781098122539, 9781718500440 (paperback)
LCCN: QA76.73.R87
bibdate: Fri Nov 8 05:59:02 MST 2019
bibtimestamp: 2019.11.08 05:59:02 MST
acknowledgement: ack-nhfb
rawauthor: Steve Klabnik and Carol Nichols
rawtitle: The {Rust} programming language
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/multithreading.bib

URL:
http://proquest.safaribooksonline.com/?fpi=9781098122539; https://nostarch.com/download/samples/RustProgrammingLanguage2018_Sample_ToC.pdf; https://nostarch.com/Rust2018

abstract:
booktitle The Rust Programming Language is the official book on Rust: an open source systems programming language that helps you write faster, more reliable software. Rust offers control over low-level details (such as memory usage) in combination with high-level ergonomics, eliminating the hassle traditionally associated with low-level languages. The authors of booktitle The Rust Programming Language, members of the Rust Core Team, share their knowledge and experience to show you how to take full advantage of Rust's features-from installation to creating robust and scalable programs. You'll begin with basics like creating functions, choosing data types, and binding variables and then move on to more advanced concepts, such as: * Ownership and borrowing, lifetimes, and traits * Using Rust's memory safety guarantees to build fast, safe programs; * Testing, error handling, and effective refactoring; * Generics, smart pointers, multithreading, trait objects, and advanced pattern matching; * Using Cargo, Rust's built-in package manager, to build, test, and document your code and manage dependencies; * How best to use Rust's advanced compiler with compiler-led programming techniques You'll find plenty of code examples throughout the book, as well as three chapters dedicated to building complete projects to test your learning: a number guessing game, a Rust implementation of a command line tool, and a multithreaded server. New to this edition: An extended section on Rust macros, an expanded chapter on modules, and appendixes on Rust development tools and editions.

subject:
Rust (Computer program language); Computer programming; Computer programming.; Rust (Computer program language)

TOC:
1: Getting started 2: Programming a guessing game 3: Common programming concepts 4: Understanding ownership 5: Using structs to structure related data 6: Enums and pattern matching 7: Managing growing projects with packages, crates, and modules 8: Common collections 9: Error handling 10: Generic types, traits, and lifetimes 11: Writing automated tests 12: An I/O project: building a command line program 13: Functional language features: iterators and closures 14: More about Cargo and Crates.io 15: Smart pointers 16: Fearless concurrency 17: Object-oriented programming features of Rust 18: Patterns and matching 19: Advanced features 20: Final project: building a multithreaded web server Appendix A: Keywords Appendix B: Operators and Symbols Appendix C: Derivable Traits Appendix D: Useful Development Tools Appendix E: Editions Index

rawabstract:
\booktitle{The Rust Programming Language} is the official book on Rust: an open source systems programming language that helps you write faster, more reliable software. Rust offers control over low-level details (such as memory usage) in combination with high-level ergonomics, eliminating the hassle traditionally associated with low-level languages. The authors of \booktitle{The Rust Programming Language}, members of the Rust Core Team, share their knowledge and experience to show you how to take full advantage of Rust's features-from installation to creating robust and scalable programs. You'll begin with basics like creating functions, choosing data types, and binding variables and then move on to more advanced concepts, such as: * Ownership and borrowing, lifetimes, and traits * Using Rust's memory safety guarantees to build fast, safe programs; * Testing, error handling, and effective refactoring; * Generics, smart pointers, multithreading, trait objects, and advanced pattern matching; * Using Cargo, Rust's built-in package manager, to build, test, and document your code and manage dependencies; * How best to use Rust's advanced compiler with compiler-led programming techniques You'll find plenty of code examples throughout the book, as well as three chapters dedicated to building complete projects to test your learning: a number guessing game, a Rust implementation of a command line tool, and a multithreaded server. New to this edition: An extended section on Rust macros, an expanded chapter on modules, and appendixes on Rust development tools and editions.

rawTOC:
1: Getting started \\ 2: Programming a guessing game \\ 3: Common programming concepts \\ 4: Understanding ownership \\ 5: Using structs to structure related data \\ 6: Enums and pattern matching \\ 7: Managing growing projects with packages, crates, and modules \\ 8: Common collections \\ 9: Error handling \\ 10: Generic types, traits, and lifetimes \\ 11: Writing automated tests \\ 12: An I/O project: building a command line program \\ 13: Functional language features: iterators and closures \\ 14: More about Cargo and Crates.io \\ 15: Smart pointers \\ 16: Fearless concurrency \\ 17: Object-oriented programming features of Rust \\ 18: Patterns and matching \\ 19: Advanced features \\ 20: Final project: building a multithreaded web server \\ Appendix A: Keywords \\ Appendix B: Operators and Symbols \\ Appendix C: Derivable Traits \\ Appendix D: Useful Development Tools \\ Appendix E: Editions \\ Index

entry:
@Book{Klabnik:2019:RPL,
  author =       "Steve Klabnik and Carol Nichols",
  title =        "The {Rust} programming language",
  publisher =    pub-NO-STARCH,
  address =      pub-NO-STARCH:adr,
  edition =      "Second",
  pages =        "xxix + 526",
  year =         "2019",
  ISBN =         "1-09-812253-4, 1-71850-044-0 (paperback)",
  ISBN-13 =      "978-1-09-812253-9, 978-1-71850-044-0 (paperback)",
  LCCN =         "QA76.73.R87",
  bibdate =      "Fri Nov 8 05:59:02 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/multithreading.bib",
  URL =          "http://proquest.safaribooksonline.com/?fpi=9781098122539;
                 https://nostarch.com/download/samples/RustProgrammingLanguage2018_Sample_ToC.pdf;
                 https://nostarch.com/Rust2018",
  abstract =     "\booktitle{The Rust Programming Language} is the
                 official book on Rust: an open source systems
                 programming language that helps you write faster, more
                 reliable software. Rust offers control over low-level
                 details (such as memory usage) in combination with
                 high-level ergonomics, eliminating the hassle
                 traditionally associated with low-level languages. The
                 authors of \booktitle{The Rust Programming Language},
                 members of the Rust Core Team, share their knowledge
                 and experience to show you how to take full advantage
                 of Rust's features-from installation to creating robust
                 and scalable programs. You'll begin with basics like
                 creating functions, choosing data types, and binding
                 variables and then move on to more advanced concepts,
                 such as: * Ownership and borrowing, lifetimes, and
                 traits * Using Rust's memory safety guarantees to build
                 fast, safe programs; * Testing, error handling, and
                 effective refactoring; * Generics, smart pointers,
                 multithreading, trait objects, and advanced pattern
                 matching; * Using Cargo, Rust's built-in package
                 manager, to build, test, and document your code and
                 manage dependencies; * How best to use Rust's advanced
                 compiler with compiler-led programming techniques
                 You'll find plenty of code examples throughout the
                 book, as well as three chapters dedicated to building
                 complete projects to test your learning: a number
                 guessing game, a Rust implementation of a command line
                 tool, and a multithreaded server. New to this edition:
                 An extended section on Rust macros, an expanded chapter
                 on modules, and appendixes on Rust development tools
                 and editions.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Rust (Computer program language); Computer
                 programming; Computer programming.; Rust (Computer
                 program language)",
  tableofcontents = "1: Getting started \\
                 2: Programming a guessing game \\
                 3: Common programming concepts \\
                 4: Understanding ownership \\
                 5: Using structs to structure related data \\
                 6: Enums and pattern matching \\
                 7: Managing growing projects with packages, crates, and
                 modules \\
                 8: Common collections \\
                 9: Error handling \\
                 10: Generic types, traits, and lifetimes \\
                 11: Writing automated tests \\
                 12: An I/O project: building a command line program \\
                 13: Functional language features: iterators and
                 closures \\
                 14: More about Cargo and Crates.io \\
                 15: Smart pointers \\
                 16: Fearless concurrency \\
                 17: Object-oriented programming features of Rust \\
                 18: Patterns and matching \\
                 19: Advanced features \\
                 20: Final project: building a multithreaded web server
                 \\
                 Appendix A: Keywords \\
                 Appendix B: Operators and Symbols \\
                 Appendix C: Derivable Traits \\
                 Appendix D: Useful Development Tools \\
                 Appendix E: Editions \\
                 Index",
}


bibtype: incollection
filename: master.bib
label: Kleene:1956:REN
author: S. C. Kleene
editor: Claude E. Shannon and John McCarthy
booktitle: Automata studies
title: Representation of events in nerve nets and finte automata
volume: 34
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: 3--40
year: 1956
LCCN: QA1.A626 no.34; TJ211 .S47
bibdate: Thu Sep 19 08:19:19 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.09.19 08:19:19 ???
series: Annals of mathematics studies
acknowledgement: ack-nhfb
bookpages: viii + 285
rawauthor: S. C. Kleene
rawbooktitle: Automata studies
raweditor: Claude E. Shannon and John McCarthy
rawtitle: Representation of events in nerve nets and finte automata
note:
This is the original paper that introduced the concept of regular expressions, later widely implemented in software tools in the Bell Laboratories Unix operating system.

rawnote:
This is the original paper that introduced the concept of regular expressions, later widely implemented in software tools in the Bell Laboratories Unix operating system.

entry:
@InCollection{Kleene:1956:REN,
  author =       "S. C. Kleene",
  editor =       "Claude E. Shannon and John McCarthy",
  booktitle =    "Automata studies",
  title =        "Representation of events in nerve nets and finte
                 automata",
  volume =       "34",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  bookpages =    "viii + 285",
  pages =        "3--40",
  year =         "1956",
  LCCN =         "QA1.A626 no.34; TJ211 .S47",
  bibdate =      "Thu Sep 19 08:19:19 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This is the original paper that introduced the concept
                 of regular expressions, later widely implemented in
                 software tools in the Bell Laboratories Unix operating
                 system.",
  series =       "Annals of mathematics studies",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Klemens:2006:MYC
author: Ben Klemens
title: Ma$+$h you can't use: patents, copyright, and software
publisher: Brookings Institution Press
address: Washington, DC, USA
pages: ix + 181
year: 2006
ISBN: 0-8157-4942-2 (cloth) OR 0815749422 (cloth)
ISBN13: 978-0-8157-4942-4 (cloth) OR 9780815749424 (cloth)
LCCN: K1519.C6 K54 2006
bibdate: Wed Oct 14 08:20:54 MDT 2009
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2009.10.14 08:20:54 MDT
URL: http://www.loc.gov/catdir/toc/ecip0519/2005027332.html
subject: Intellectual property; United States; Computer software; Law and legislation
acknowledgement: ack-nhfb
rawauthor: Ben Klemens
rawtitle: Ma$+$h you can't use: patents, copyright, and software
abstract:
Gathering perspectives from law, computer science, mathematics, and economics, examines the intellectual property issues surrounding computer software and suggests how patents might accommodate the unique structure of code and copyright for software could be more effectively implemented.

TOC:
Introduction Optimal breadth From equations to software Patenting math Profiting from overbroad patents The decentralized software market Interoperability Protecting text Policy recommendations

rawabstract:
Gathering perspectives from law, computer science, mathematics, and economics, examines the intellectual property issues surrounding computer software and suggests how patents might accommodate the unique structure of code and copyright for software could be more effectively implemented.

rawTOC:
Introduction \\ Optimal breadth \\ From equations to software \\ Patenting math \\ Profiting from overbroad patents \\ The decentralized software market \\ Interoperability \\ Protecting text \\ Policy recommendations

entry:
@Book{Klemens:2006:MYC,
  author =       "Ben Klemens",
  title =        "Ma$+$h you can't use: patents, copyright, and
                 software",
  publisher =    "Brookings Institution Press",
  address =      "Washington, DC, USA",
  pages =        "ix + 181",
  year =         "2006",
  ISBN =         "0-8157-4942-2 (cloth)",
  ISBN-13 =      "978-0-8157-4942-4 (cloth)",
  LCCN =         "K1519.C6 K54 2006",
  bibdate =      "Wed Oct 14 08:20:54 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0519/2005027332.html",
  abstract =     "Gathering perspectives from law, computer science,
                 mathematics, and economics, examines the intellectual
                 property issues surrounding computer software and
                 suggests how patents might accommodate the unique
                 structure of code and copyright for software could be
                 more effectively implemented.",
  acknowledgement = ack-nhfb,
  subject =      "Intellectual property; United States; Computer
                 software; Law and legislation",
  tableofcontents = "Introduction \\
                 Optimal breadth \\
                 From equations to software \\
                 Patenting math \\
                 Profiting from overbroad patents \\
                 The decentralized software market \\
                 Interoperability \\
                 Protecting text \\
                 Policy recommendations",
}


bibtype: book
filename: master.bib
label: Klerer:1967:DCU
editor: Melvin Klerer and Granino A. Korn
title: Digital Computer User's Handbook
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: ix + 181
year: 1967
LCCN: QA76.5 .K524
bibdate: Wed Dec 15 17:52:19 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 17:52:19 ???
acknowledgement: ack-nhfb
raweditor: Melvin Klerer and Granino A. Korn
rawtitle: Digital Computer User's Handbook
entry:
@Book{Klerer:1967:DCU,
  editor =       "Melvin Klerer and Granino A. Korn",
  title =        "Digital Computer User's Handbook",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  year =         "1967",
  LCCN =         "QA76.5 .K524",
  bibdate =      "Wed Dec 15 17:52:19 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Klotz:1986:DDF
author: Irving M. (Irving Myron) Klotz
title: Diamond Dealers and Feather Merchants: Tales from the Sciences
publisher: pub-BIRKHAUSER
address: pub-BIRKHAUSER:adr
pages: x + 120
year: 1986
ISBN: 0-8176-3303-0 OR 0817633030
ISBN13: 978-0-8176-3303-5 OR 9780817633035
LCCN: Q173 .K5735 1986
bibdate: Tue Dec 13 11:59:04 MST 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.12.13 11:59:04 MST
remark: False claims and mistakes in science.
subject: Science; Miscellanea
acknowledgement: ack-nhfb
rawauthor: Irving M. (Irving Myron) Klotz
rawtitle: Diamond Dealers and Feather Merchants: Tales from the Sciences
abstract:
To paraphrase Saul Bellow, it is extremely difficult to escape from the conceptual bottles into which we have been processed, or even to become aware that we are confined within them. Anthropocentrism, an ancient tradition, is an intellectual constraint that has continually impeded objective probing of the universe around and within us. We are probably born with that constriction, perhaps as a result of evolutionary selection or because each of us has been created in the image of the Deity. But it is only the core of our mental ``gestalt.'' Around it we find additional shells of intellectual obstructions deposited by accretion from our family, our teachers, our experiences and the society in which we are immersed. It is very hazardous to embrace novel scientific ideas. Personal and social experiences show that the vast majority turn out to be failures. What standards can one use to make judgments? There is a universal tendency to rely on ``common sense;'' but as Einstein pointed out, this is a collection of views, sensible or not, imprinted in us before the age of sixteen. I have found it a challenge to convince young students that much of what they are certain about and, in fact, correct about, is actually contrary to common sense. For example, on any bright day, anyone who is not blind or an idiot can see the sun literally moving around the earth, from east to west.

TOC:
Preface / ix I: Bending Perception to Wish: The Future as Froth and Fantasy / 1 II: The Clouded Crystal Ball: Creases of the Mind / 21 III: Great Discoveries Not Mentioned in Textbooks: N Rays / 39 IV: Grand Illusions: Russian Water / 67 V: People Yearn to Believe: Dr. Fox Experiments / 97 Epilogue / 117 Acknowledgments / 119

rawabstract:
To paraphrase Saul Bellow, it is extremely difficult to escape from the conceptual bottles into which we have been processed, or even to become aware that we are confined within them. Anthropocentrism, an ancient tradition, is an intellectual constraint that has continually impeded objective probing of the universe around and within us. We are probably born with that constriction, perhaps as a result of evolutionary selection or because each of us has been created in the image of the Deity. But it is only the core of our mental ``gestalt.'' Around it we find additional shells of intellectual obstructions deposited by accretion from our family, our teachers, our experiences and the society in which we are immersed. It is very hazardous to embrace novel scientific ideas. Personal and social experiences show that the vast majority turn out to be failures. What standards can one use to make judgments? There is a universal tendency to rely on ``common sense;'' but as Einstein pointed out, this is a collection of views, sensible or not, imprinted in us before the age of sixteen. I have found it a challenge to convince young students that much of what they are certain about and, in fact, correct about, is actually contrary to common sense. For example, on any bright day, anyone who is not blind or an idiot can see the sun literally moving around the earth, from east to west.

rawTOC:
Preface / ix \\ I: Bending Perception to Wish: The Future as Froth and Fantasy / 1 \\ II: The Clouded Crystal Ball: Creases of the Mind / 21 \\ III: Great Discoveries Not Mentioned in Textbooks: N Rays / 39 \\ IV: Grand Illusions: Russian Water / 67 \\ V: People Yearn to Believe: Dr. Fox Experiments / 97 \\ Epilogue / 117 \\ Acknowledgments / 119

entry:
@Book{Klotz:1986:DDF,
  author =       "Irving M. (Irving Myron) Klotz",
  title =        "Diamond Dealers and Feather Merchants: Tales from the
                 Sciences",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "x + 120",
  year =         "1986",
  ISBN =         "0-8176-3303-0",
  ISBN-13 =      "978-0-8176-3303-5",
  LCCN =         "Q173 .K5735 1986",
  bibdate =      "Tue Dec 13 11:59:04 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "To paraphrase Saul Bellow, it is extremely difficult
                 to escape from the conceptual bottles into which we
                 have been processed, or even to become aware that we
                 are confined within them. Anthropocentrism, an ancient
                 tradition, is an intellectual constraint that has
                 continually impeded objective probing of the universe
                 around and within us. We are probably born with that
                 constriction, perhaps as a result of evolutionary
                 selection or because each of us has been created in the
                 image of the Deity. But it is only the core of our
                 mental ``gestalt.'' Around it we find additional shells
                 of intellectual obstructions deposited by accretion
                 from our family, our teachers, our experiences and the
                 society in which we are immersed. It is very hazardous
                 to embrace novel scientific ideas. Personal and social
                 experiences show that the vast majority turn out to be
                 failures. What standards can one use to make judgments?
                 There is a universal tendency to rely on ``common
                 sense;'' but as Einstein pointed out, this is a
                 collection of views, sensible or not, imprinted in us
                 before the age of sixteen. I have found it a challenge
                 to convince young students that much of what they are
                 certain about and, in fact, correct about, is actually
                 contrary to common sense. For example, on any bright
                 day, anyone who is not blind or an idiot can see the
                 sun literally moving around the earth, from east to
                 west.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "False claims and mistakes in science.",
  subject =      "Science; Miscellanea",
  tableofcontents = "Preface / ix \\
                 I: Bending Perception to Wish: The Future as Froth and
                 Fantasy / 1 \\
                 II: The Clouded Crystal Ball: Creases of the Mind / 21
                 \\
                 III: Great Discoveries Not Mentioned in Textbooks: N
                 Rays / 39 \\
                 IV: Grand Illusions: Russian Water / 67 \\
                 V: People Yearn to Believe: Dr. Fox Experiments / 97
                 \\
                 Epilogue / 117 \\
                 Acknowledgments / 119",
}


bibtype: article
filename: master.bib
label: Klotz:1995:NMS
author: Irving M. Klotz
title: Number mysticism in scientific thinking
journal: j-MATH-INTEL
volume: 17
number: 1
pages: 43--51
year: 1995
CODEN: MAINDC
ISSN: 0343-6993 OR 03436993
bibdate: Tue Dec 13 12:02:19 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.13 12:02:19 ???
acknowledgement: ack-nhfb
rawauthor: Irving M. Klotz
rawtitle: Number mysticism in scientific thinking
entry:
@Article{Klotz:1995:NMS,
  author =       "Irving M. Klotz",
  title =        "Number mysticism in scientific thinking",
  journal =      j-MATH-INTEL,
  volume =       "17",
  number =       "1",
  pages =        "43--51",
  year =         "1995",
  CODEN =        "MAINDC",
  ISSN =         "0343-6993",
  bibdate =      "Tue Dec 13 12:02:19 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Knuth:1979:TMN
author: Donald E. Knuth
title: TeX and METAFONT : New Directions in Typesetting
publisher: pub-DP
address: pub-DP:adr
pages: xi + 201 + 105
year: 1979
ISBN: 0-932376-02-9 OR 0932376029
ISBN13: 978-0-932376-02-2 OR 9780932376022
LCCN: Z253.3 .K58 1979
bibdate: Wed Dec 15 10:37:42 1993
bibtimestamp: 1993.12.15 10:37:42 ???
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: {\TeX} and {\METAFONT}: New Directions in Typesetting
bibsource:
Graphics/imager/imager.books.bib; Graphics/siggraph/79.bib; https://www.math.utah.edu/pub/tex/bib/font.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/siggraph/new/79.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/texgraph.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib

keywords:
Applications; character display/generation; character display/generation and Applications; general references; printing/publishing industry; programming systems; software; standards text books; standards text books and software

remark:
A landmark book at the time it was published. Newer versions exist. Less than portable as claimed, but still significant. Required reading for anyone doing font design and type setting.

TOC:
Part 1: Mathematical Typography Part 2: TeX , a system for technical text Part 3: METAFONT, a system for alphabet design

rawTOC:
Part 1: Mathematical Typography \\ Part 2: \TeX, a system for technical text \\ Part 3: METAFONT, a system for alphabet design

entry:
@Book{Knuth:1979:TMN,
  author =       "Donald E. Knuth",
  title =        "{\TeX} and {\METAFONT}: New Directions in
                 Typesetting",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xi + 201 + 105",
  year =         "1979",
  ISBN =         "0-932376-02-9",
  ISBN-13 =      "978-0-932376-02-2",
  LCCN =         "Z253.3 .K58 1979",
  bibdate =      "Wed Dec 15 10:37:42 1993",
  bibsource =    "Graphics/imager/imager.books.bib;
                 Graphics/siggraph/79.bib;
                 https://www.math.utah.edu/pub/tex/bib/font.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/siggraph/new/79.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Applications; character display/generation; character
                 display/generation and Applications; general
                 references; printing/publishing industry; programming
                 systems; software; standards text books; standards text
                 books and software",
  remark =       "A landmark book at the time it was published. Newer
                 versions exist. Less than portable as claimed, but
                 still significant. Required reading for anyone doing
                 font design and type setting.",
  tableofcontents = "Part 1: Mathematical Typography \\
                 Part 2: \TeX, a system for technical text \\
                 Part 3: METAFONT, a system for alphabet design",
}


bibtype: article
filename: master.bib
label: Knuth:1984:LP
author: Donald E. Knuth
title: Literate Programming
journal: j-CJ
volume: 27
number: 2
pages: 97--111
month: may
monthnumber: 5
year: 1984
bibdate: Wed Aug 24 17:14:45 MDT 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.24 17:14:45 MDT
keywords: design; human factors; languages
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Literate Programming
subject:
D.2.7 Software, SOFTWARE ENGINEERING, Distribution and Maintenance, Documentation I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing, Languages H.1.2 Information Systems, MODELS AND PRINCIPLES, User/Machine Systems, Human factors D.3 Software, PROGRAMMING LANGUAGES, Language Constructs I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing, WEB

entry:
@Article{Knuth:1984:LP,
  author =       "Donald E. Knuth",
  title =        "Literate Programming",
  journal =      j-CJ,
  volume =       "27",
  number =       "2",
  pages =        "97--111",
  month =        may,
  year =         "1984",
  bibdate =      "Wed Aug 24 17:14:45 MDT 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "design; human factors; languages",
  review =       "ACM CR 8501-0018",
  subject =      "D.2.7 Software, SOFTWARE ENGINEERING, Distribution and
                 Maintenance, Documentation \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing, Languages
                 \\ H.1.2 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human factors \\ D.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs \\ I.7.1
                 Computing Methodologies, TEXT PROCESSING, Text Editing,
                 WEB",
}


bibtype: book
filename: master.bib
label: Knuth:1984:TB
author: Donald E. Knuth
title: The TeX book
volume: {\noopsort{1984a}}A
publisher: pub-AW
address: pub-AW:adr
pages: ix + 483
year: 1984
LCCN: Z253.4.T47 K58 1986
bibdate: Wed Dec 15 10:36:52 1993
bibtimestamp: 1993.12.15 10:36:52 ???
series: Computers and Typesetting
remark: See translations cite Knuth:1989:TBK,Knuth:1993:VT.
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: The {\TeX}book
ISBN:
0-201-13447-0 (hardcover), 0-201-13448-9 (paperback) OR 0201134470 (hardcover), 0201134489 (paperback)

ISBN13:
978-0-201-13447-6 (hardcover), 978-0-201-13448-3 (paperback) OR 9780201134476 (hardcover), 9780201134483 (paperback)

bibsource:
https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/texgraph.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib

note:
Second printing, revised, October 1984. Sixth printing, revised, January 1986; also published as sl Computers & Typesetting, Vol. A. Twenty-fourth printing, summer 1993, contains final revisions. Twenty-first printing, June 1992.

keywords:
computerized typesetting; documentation; languages; mathematics printing -- computer programs; TeX (computer file)

subject:
TeX (Computer file); TeX (Logiciel); TeX (Computer file); Computerized typesetting; Mathematics printing; Computer programs; Imprimerie; Composition automatique; Mathematiques; Impression; Logiciels; Mathematiques; Imprimerie; Computerized typesetting; Computer programs; TeX (logiciel); TeX; I.7.2 Computing Methodologies, TEXT PROCESSING, Document Preparation J.7 Computer Applications, COMPUTERS IN OTHER SYSTEMS, Publishing I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing

TOC:
1: The Name of the Game / 1 2: Book Printing versus Ordinary Typing / 3 3: Controlling TeX / 7 4: Fonts of Type / 13 5: Grouping / 19 6: Running TeX / 23 7: How TeX Reads What You Type / 37 8: The Characters You Type / 43 9: TeX 's Roman Fonts / 51 10: Dimensions / 57 11: Boxes / 63 12: Glue / 69 13: Modes / 85 14: How TeX Breaks Paragraphs into Lines / 91 15: How TeX Makes Lines into Pages / 109 16: Typing Math Formulas / 127 17: More about Math / 139 18: Fine Points of Mathematics Typing / 161 19: Displayed Equations / 185 20: Definitions (also called Macros) / 199 21: Making Boxes / 221 22: Alignment / 231 23: Output Routines / 251 24: Summary of Vertical Mode / 267 25: Summary of Horizontal Mode / 285 26: Summary of Math Mode / 289 27: Recovery from Errors / 295 Appendices A: Answers to All the Exercises / 305 B: Basic Control Sequences / 339 C: Character Codes / 367 D: Dirty Tricks / 373 E: Example Formats / 403 F: Font Tables / 427 G: Generating Boxes from Formulas / 441 H: Hyphenation / 449 I: Index / 457 J: Joining the TeX Community / 483

rawnote:
Second printing, revised, October 1984. Sixth printing, revised, January 1986; also published as {\sl Computers \& Typesetting}, Vol. A. Twenty-fourth printing, summer 1993, contains final revisions. Twenty-first printing, June 1992.

rawTOC:
1: The Name of the Game / 1 \\ 2: Book Printing versus Ordinary Typing / 3 \\ 3: Controlling \TeX{} / 7 \\ 4: Fonts of Type / 13 \\ 5: Grouping / 19 \\ 6: Running \TeX{} / 23 \\ 7: How \TeX{} Reads What You Type / 37 \\ 8: The Characters You Type / 43 \\ 9: \TeX{}'s Roman Fonts / 51 \\ 10: Dimensions / 57 \\ 11: Boxes / 63 \\ 12: Glue / 69 \\ 13: Modes / 85 \\ 14: How \TeX{} Breaks Paragraphs into Lines / 91 \\ 15: How \TeX{} Makes Lines into Pages / 109 \\ 16: Typing Math Formulas / 127 \\ 17: More about Math / 139 \\ 18: Fine Points of Mathematics Typing / 161 \\ 19: Displayed Equations / 185 \\ 20: Definitions (also called Macros) / 199 \\ 21: Making Boxes / 221 \\ 22: Alignment / 231 \\ 23: Output Routines / 251 \\ 24: Summary of Vertical Mode / 267 \\ 25: Summary of Horizontal Mode / 285 \\ 26: Summary of Math Mode / 289 \\ 27: Recovery from Errors / 295 \\ Appendices \\ A: Answers to All the Exercises / 305 \\ B: Basic Control Sequences / 339 \\ C: Character Codes / 367 \\ D: Dirty Tricks / 373 \\ E: Example Formats / 403 \\ F: Font Tables / 427 \\ G: Generating Boxes from Formulas / 441 \\ H: Hyphenation / 449 \\ I: Index / 457 \\ J: Joining the \TeX{} Community / 483

entry:
@Book{Knuth:1984:TB,
  author =       "Donald E. Knuth",
  title =        "The {\TeX}book",
  volume =       "{\noopsort{1984a}}A",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "ix + 483",
  year =         "1984",
  ISBN =         "0-201-13447-0 (hardcover), 0-201-13448-9 (paperback)",
  ISBN-13 =      "978-0-201-13447-6 (hardcover), 978-0-201-13448-3
                 (paperback)",
  LCCN =         "Z253.4.T47 K58 1986",
  bibdate =      "Wed Dec 15 10:36:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  note =         "Second printing, revised, October 1984. Sixth
                 printing, revised, January 1986; also published as {\sl
                 Computers \& Typesetting}, Vol. A. Twenty-fourth
                 printing, summer 1993, contains final revisions.
                 Twenty-first printing, June 1992.",
  price =        "US\$15.95 (paperback), US\$32.95 (hardcover)",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  keywords =     "computerized typesetting; documentation; languages;
                 mathematics printing -- computer programs; TeX
                 (computer file)",
  remark =       "See translations
                 \cite{Knuth:1989:TBK,Knuth:1993:VT}.",
  subject =      "TeX (Computer file); TeX (Logiciel); TeX (Computer
                 file); Computerized typesetting; Mathematics printing;
                 Computer programs; Imprimerie; Composition automatique;
                 Math{\'e}matiques; Impression; Logiciels;
                 Math{\'e}matiques; Imprimerie; Computerized
                 typesetting; Computer programs; TeX (logiciel); TeX;
                 I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation \\ J.7 Computer Applications,
                 COMPUTERS IN OTHER SYSTEMS, Publishing \\ I.7.1
                 Computing Methodologies, TEXT PROCESSING, Text
                 Editing",
  tableofcontents = "1: The Name of the Game / 1 \\
                 2: Book Printing versus Ordinary Typing / 3 \\
                 3: Controlling \TeX{} / 7 \\
                 4: Fonts of Type / 13 \\
                 5: Grouping / 19 \\
                 6: Running \TeX{} / 23 \\
                 7: How \TeX{} Reads What You Type / 37 \\
                 8: The Characters You Type / 43 \\
                 9: \TeX{}'s Roman Fonts / 51 \\
                 10: Dimensions / 57 \\
                 11: Boxes / 63 \\
                 12: Glue / 69 \\
                 13: Modes / 85 \\
                 14: How \TeX{} Breaks Paragraphs into Lines / 91 \\
                 15: How \TeX{} Makes Lines into Pages / 109 \\
                 16: Typing Math Formulas / 127 \\
                 17: More about Math / 139 \\
                 18: Fine Points of Mathematics Typing / 161 \\
                 19: Displayed Equations / 185 \\
                 20: Definitions (also called Macros) / 199 \\
                 21: Making Boxes / 221 \\
                 22: Alignment / 231 \\
                 23: Output Routines / 251 \\
                 24: Summary of Vertical Mode / 267 \\
                 25: Summary of Horizontal Mode / 285 \\
                 26: Summary of Math Mode / 289 \\
                 27: Recovery from Errors / 295 \\
                 Appendices \\
                 A: Answers to All the Exercises / 305 \\
                 B: Basic Control Sequences / 339 \\
                 C: Character Codes / 367 \\
                 D: Dirty Tricks / 373 \\
                 E: Example Formats / 403 \\
                 F: Font Tables / 427 \\
                 G: Generating Boxes from Formulas / 441 \\
                 H: Hyphenation / 449 \\
                 I: Index / 457 \\
                 J: Joining the \TeX{} Community / 483",
}


bibtype: incollection
filename: master.bib
label: Knuth:1990:SPW
author: Donald E. Knuth
editor: W. H. J. Feijen and A. J. M. van Gasteren and D. Gries and J. Misra
title: A Simple Program Whose Proof Isn't
crossref: Feijen:1990:BOB
chapter: 27
pages: 233--242
year: 1990
bibdate: Sun Mar 27 17:53:57 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.03.27 17:53:57 ???
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
raweditor: W. H. J. Feijen and A. J. M. van Gasteren and D. Gries and J. Misra
rawtitle: A Simple Program Whose Proof Isn't
note:
This paper discusses the algorithm used in TeX for converting between decimal and scaled fixed-point binary values, and for guaranteeing a minimum number of digits in the decimal representation. See also cite Clinger:floating-point-input for decimal to binary conversion, cite Steele:floating-point-output for binary to decimal conversion, and cite Gries:1990:BDO for an alternate proof of Knuth's algorithm.

rawnote:
This paper discusses the algorithm used in {\TeX} for converting between decimal and scaled fixed-point binary values, and for guaranteeing a minimum number of digits in the decimal representation. See also \cite{Clinger:floating-point-input} for decimal to binary conversion, \cite{Steele:floating-point-output} for binary to decimal conversion, and \cite{Gries:1990:BDO} for an alternate proof of Knuth's algorithm.

entry:
@InCollection{Knuth:1990:SPW,
  author =       "Donald E. Knuth",
  editor =       "W. H. J. Feijen and A. J. M. van Gasteren and D. Gries
                 and J. Misra",
  title =        "A Simple Program Whose Proof Isn't",
  crossref =     "Feijen:1990:BOB",
  chapter =      "27",
  pages =        "233--242",
  year =         "1990",
  bibdate =      "Sun Mar 27 17:53:57 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper discusses the algorithm used in {\TeX} for
                 converting between decimal and scaled fixed-point
                 binary values, and for guaranteeing a minimum number of
                 digits in the decimal representation. See also
                 \cite{Clinger:floating-point-input} for decimal to
                 binary conversion, \cite{Steele:floating-point-output}
                 for binary to decimal conversion, and
                 \cite{Gries:1990:BDO} for an alternate proof of Knuth's
                 algorithm.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Knuth:1992:LP
author: Donald E. Knuth
title: Literate Programming
volume: 27
publisher: pub-SUCSLI
address: pub-SUCSLI:adr
pages: xv + 368
year: 1992
LCCN: QA76.6.K644
bibdate: Tue Mar 03 12:24:41 1998
bibtimestamp: 1998.03.03 12:24:41 ???
series: CSLI Lecture Notes
URL: http://csli-www.stanford.edu/publications/literate.html
keywords: electronic digital computers --- programming
remark: See translation cite Knuth:1994:BP.
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Literate Programming
ISBN:
0-937073-80-6 (paperback), 0-937073-81-4 (hardcover) OR 0937073806 (paperback), 0937073814 (hardcover)

ISBN13:
978-0-937073-80-3 (paperback), 978-0-937073-81-0 (hardcover) OR 9780937073803 (paperback), 9780937073810 (hardcover)

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib; https://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/css.bib; https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib

TOC:
1: Computer programming as an art / 1 2: Structured programming with go to statements / 17 3: A structured program to generate all topological sorting arrangements / 91 4: Literate programming / 99 5: Programming pearls: Sampling / 137 6: Programming pearls, continued: Common Words / 151 7: How to read a WEB / 179 8: Excerpts from the programs for TeX and METAFONT / 185 9: Mathematical writing / 235 10: Errors of TeX / 243 11: Error log of TeX / 293 12: Example of CWEB / 341 Further Reading / 349 Index / 359

rawTOC:
1: Computer programming as an art / 1 \\ 2: Structured programming with go to statements / 17 \\ 3: A structured program to generate all topological sorting arrangements / 91 \\ 4: Literate programming / 99 \\ 5: Programming pearls: Sampling / 137 \\ 6: Programming pearls, continued: Common Words / 151 \\ 7: How to read a WEB / 179 \\ 8: Excerpts from the programs for \TeX{} and METAFONT / 185 \\ 9: Mathematical writing / 235 \\ 10: Errors of \TeX{} / 243 \\ 11: Error log of \TeX{} / 293 \\ 12: Example of CWEB / 341 \\ Further Reading / 349 \\ Index / 359

entry:
@Book{Knuth:1992:LP,
  author =       "Donald E. Knuth",
  title =        "Literate Programming",
  volume =       "27",
  publisher =    pub-SUCSLI,
  address =      pub-SUCSLI:adr,
  pages =        "xv + 368",
  year =         "1992",
  ISBN =         "0-937073-80-6 (paperback), 0-937073-81-4 (hardcover)",
  ISBN-13 =      "978-0-937073-80-3 (paperback), 978-0-937073-81-0
                 (hardcover)",
  LCCN =         "QA76.6.K644",
  bibdate =      "Tue Mar 03 12:24:41 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 https://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/litprog.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/spell.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  series =       "CSLI Lecture Notes",
  URL =          "http://csli-www.stanford.edu/publications/literate.html",
  acknowledgement = ack-nhfb,
  keywords =     "electronic digital computers --- programming",
  remark =       "See translation \cite{Knuth:1994:BP}.",
  tableofcontents = "1: Computer programming as an art / 1 \\
                 2: Structured programming with go to statements / 17
                 \\
                 3: A structured program to generate all topological
                 sorting arrangements / 91 \\
                 4: Literate programming / 99 \\
                 5: Programming pearls: Sampling / 137 \\
                 6: Programming pearls, continued: Common Words / 151
                 \\
                 7: How to read a WEB / 179 \\
                 8: Excerpts from the programs for \TeX{} and METAFONT /
                 185 \\
                 9: Mathematical writing / 235 \\
                 10: Errors of \TeX{} / 243 \\
                 11: Error log of \TeX{} / 293 \\
                 12: Example of CWEB / 341 \\
                 Further Reading / 349 \\
                 Index / 359",
}


bibtype: book
filename: master.bib
label: Knuth:1993:CSS
author: Donald E. Knuth and Silvio Levy
title: The CWEB System of Structured Documentation, Version 3.0
publisher: pub-AW
address: pub-AW:adr
pages: 226
year: 1993
ISBN: 0-201-57569-8 OR 0201575698
ISBN13: 978-0-201-57569-9 OR 9780201575699
LCCN: QA76.9.D3 K6 1993
bibdate: Thu May 12 08:36:22 1994
bibtimestamp: 1994.05.12 08:36:22 ???
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth and Silvio Levy
rawtitle: The {CWEB} System of Structured Documentation, Version 3.0
bibsource:
https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib

abstract:
WEB is a software system that facilitates the creation of readable programs. It was originally developed by Donald E. Knuth as he programmed the TEX typesetting system. Users of WEB are able to write programs of superior quality; produce state-of-the-art documentation; greatly reduce debugging time and maintain programs easily as conditions change. CWEB is a version of WEB for documenting C and C++ programs. WEB was adapted to C by Silvio Levy in 1987, and since then both Knuth and Levy have revised and enhanced the system in many ways, notably to support C++ and ANSI C. Thus CWEB combines TEX with two of today's most widely used professional programming languages. This book is the definitive user's guide and reference manual for the CWEB system. The CWEB software itself is freely available via anonymous ftp from labrea.stanford.edu on the Internet.

rawabstract:
WEB is a software system that facilitates the creation of readable programs. It was originally developed by Donald E. Knuth as he programmed the TEX typesetting system. Users of WEB are able to write programs of superior quality; produce state-of-the-art documentation; greatly reduce debugging time and maintain programs easily as conditions change. CWEB is a version of WEB for documenting C and C++ programs. WEB was adapted to C by Silvio Levy in 1987, and since then both Knuth and Levy have revised and enhanced the system in many ways, notably to support C++ and ANSI C. Thus CWEB combines TEX with two of today's most widely used professional programming languages. This book is the definitive user's guide and reference manual for the CWEB system. The CWEB software itself is freely available via anonymous ftp from labrea.stanford.edu on the Internet.

entry:
@Book{Knuth:1993:CSS,
  author =       "Donald E. Knuth and Silvio Levy",
  title =        "The {CWEB} System of Structured Documentation, Version
                 3.0",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "226",
  year =         "1993",
  ISBN =         "0-201-57569-8",
  ISBN-13 =      "978-0-201-57569-9",
  LCCN =         "QA76.9.D3 K6 1993",
  bibdate =      "Thu May 12 08:36:22 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/litprog.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  abstract =     "WEB is a software system that facilitates the creation
                 of readable programs. It was originally developed by
                 Donald E. Knuth as he programmed the TEX typesetting
                 system. Users of WEB are able to write programs of
                 superior quality; produce state-of-the-art
                 documentation; greatly reduce debugging time and
                 maintain programs easily as conditions change. CWEB is
                 a version of WEB for documenting C and C++ programs.
                 WEB was adapted to C by Silvio Levy in 1987, and since
                 then both Knuth and Levy have revised and enhanced the
                 system in many ways, notably to support C++ and ANSI C.
                 Thus CWEB combines TEX with two of today's most widely
                 used professional programming languages. This book is
                 the definitive user's guide and reference manual for
                 the CWEB system. The CWEB software itself is freely
                 available via anonymous ftp from labrea.stanford.edu on
                 the Internet.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Knuth:1997:FA
author: Donald E. Knuth
title: Fundamental Algorithms
volume: 1
publisher: pub-AW
address: pub-AW:adr
edition: Third
pages: xix + 650
year: 1997
ISBN: 0-201-89683-4 OR 0201896834
ISBN13: 978-0-201-89683-1 OR 9780201896831
LCCN: QA76.6 .K64 1997
bibdate: Fri Jul 11 15:41:22 1997
bibtimestamp: 1997.07.11 15:41:22 ???
series: The Art of Computer Programming
keywords: computer algorithms; electronic digital computers -- programming
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Fundamental Algorithms
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; https://www.math.utah.edu/pub/tex/bib/fibquart.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

TOC:
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

rawTOC:
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

entry:
@Book{Knuth:1997:FA,
  author =       "Donald E. Knuth",
  title =        "Fundamental Algorithms",
  volume =       "1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xix + 650",
  year =         "1997",
  ISBN =         "0-201-89683-4",
  ISBN-13 =      "978-0-201-89683-1",
  LCCN =         "QA76.6 .K64 1997",
  bibdate =      "Fri Jul 11 15:41:22 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$49.50",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  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",
}


bibtype: book
filename: master.bib
label: Knuth:1998:SA
author: Donald E. Knuth
title: Seminumerical Algorithms
volume: 2
publisher: pub-AW
address: pub-AW:adr
edition: Third
pages: xiii + 762
year: 1998
ISBN: 0-201-89684-2 OR 0201896842
ISBN13: 978-0-201-89684-8 OR 9780201896848
LCCN: QA76.6 .K64 1997
bibdate: Fri Jul 11 15:41:22 1997
bibtimestamp: 1997.07.11 15:41:22 ???
series: The Art of Computer Programming
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Seminumerical Algorithms
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; https://www.math.utah.edu/pub/tex/bib/benfords-law.bib; https://www.math.utah.edu/pub/tex/bib/css.bib; https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

TOC:
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

rawTOC:
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

entry:
@Book{Knuth:1998:SA,
  author =       "Donald E. Knuth",
  title =        "Seminumerical Algorithms",
  volume =       "2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xiii + 762",
  year =         "1998",
  ISBN =         "0-201-89684-2",
  ISBN-13 =      "978-0-201-89684-8",
  LCCN =         "QA76.6 .K64 1997",
  bibdate =      "Fri Jul 11 15:41:22 1997",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/css.bib;
                 https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://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",
}


bibtype: book
filename: master.bib
label: Knuth:1998:SS
author: Donald E. Knuth
title: Sorting and Searching
volume: 3
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xiv + 780
year: 1998
ISBN: 0-201-89685-0 OR 0201896850
ISBN13: 978-0-201-89685-5 OR 9780201896855
LCCN: QA76.6.K64 1997
bibdate: Sat Feb 27 11:11:53 1999
bibtimestamp: 1999.02.27 11:11:53 ???
series: The Art of Computer Programming
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Sorting and Searching
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

TOC:
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

rawTOC:
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

entry:
@Book{Knuth:1998:SS,
  author =       "Donald E. Knuth",
  title =        "Sorting and Searching",
  volume =       "3",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  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 =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://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",
}


bibtype: book
filename: master.bib
label: Knuth:1999:DT
author: Donald E. Knuth
title: Digital Typography
volume: 78
publisher: pub-CSLI
address: pub-CSLI:adr
pages: xvi + 685
year: 1999
LCCN: Z249.3.K59 1998
MRclass: 68U15
MRnumber: MR1676044 (2002k:68194)
bibdate: Mon May 10 18:01:36 1999
bibtimestamp: 1999.05.10 18:01:36 ???
series: CSLI Lecture Notes
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Digital Typography
ISBN:
1-57586-010-4 (paperback), 1-57586-011-2 (hardcover) OR 1575860104 (paperback), 1575860112 (hardcover)

ISBN13:
978-1-57586-010-7 (paperback), 978-1-57586-011-4 (hardcover) OR 9781575860107 (paperback), 9781575860114 (hardcover)

bibsource:
https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib; MathSciNet database

TOC:
1: Digital Typography / 1 2: Mathematical Typography / 19 3: Breaking Paragraphs Into Lines / 67 4: Mixing Right-to-Left Texts with Left-to-Right Texts / 157 5: Recipes and Fractions / 177 6: The TeX Logo in Various Fonts / 181 7: Printing Out Selected Pages / 183 8: Macros for Jill / 185 9: Problem for a Saturday Morning / 195 10: Exercises for TeX : The Program / 197 11: Mini-Indexes for Literate Programs / 225 12: Virtual Fonts: More Fun for Grand Wizards / 247 13: The Letter S / 263 14: My First Experience with Indian Scripts / 285 15: Concept of a Meta-Font / 289 16: Lessons Learned from METAFONT / 315 17: AMS Euler --- A New Typeface for Mathematics / 339 18: Typesetting Concrete Mathematics / 367 19: Course on METAFONT Programming / 379 20: Punk Meta-Font / 391 21: Fonts for Digital Halftones / 415 22: Digital Halftones by Dot Diffusion / 449 23: A Note on Digital Angles / 473 24: TEXDR.AFT / 481 25: TEX.ONE / 505 26: TeX Incunabula / 533 27: Icons for TeX and METAFONT / 547 28: Computers and Typesetting / 555 29: The New Versions of TeX and METAFONT / 563 30: The Future of TeX and METAFONT / 571 31: Questions and Answers, I / 573 32: Questions and Answers, II / 601 33: Questions and Answers, III / 625 34: Final Errors of TeX / 655 Index / 663

rawTOC:
1: Digital Typography / 1 \\ 2: Mathematical Typography / 19 \\ 3: Breaking Paragraphs Into Lines / 67 \\ 4: Mixing Right-to-Left Texts with Left-to-Right Texts / 157 \\ 5: Recipes and Fractions / 177 \\ 6: The \TeX{} Logo in Various Fonts / 181 \\ 7: Printing Out Selected Pages / 183 \\ 8: Macros for Jill / 185 \\ 9: Problem for a Saturday Morning / 195 \\ 10: Exercises for \TeX{}: The Program / 197 \\ 11: Mini-Indexes for Literate Programs / 225 \\ 12: Virtual Fonts: More Fun for Grand Wizards / 247 \\ 13: The Letter S / 263 \\ 14: My First Experience with Indian Scripts / 285 \\ 15: Concept of a Meta-Font / 289 \\ 16: Lessons Learned from METAFONT / 315 \\ 17: AMS Euler --- A New Typeface for Mathematics / 339 \\ 18: Typesetting Concrete Mathematics / 367 \\ 19: Course on METAFONT Programming / 379 \\ 20: Punk Meta-Font / 391 \\ 21: Fonts for Digital Halftones / 415 \\ 22: Digital Halftones by Dot Diffusion / 449 \\ 23: A Note on Digital Angles / 473 \\ 24: TEXDR.AFT / 481 \\ 25: TEX.ONE / 505 \\ 26: \TeX{} Incunabula / 533 \\ 27: Icons for \TeX{} and METAFONT / 547 \\ 28: Computers and Typesetting / 555 \\ 29: The New Versions of \TeX{} and METAFONT / 563 \\ 30: The Future of \TeX{} and METAFONT / 571 \\ 31: Questions and Answers, I / 573 \\ 32: Questions and Answers, II / 601 \\ 33: Questions and Answers, III / 625 \\ 34: Final Errors of \TeX{} / 655 \\ Index / 663

entry:
@Book{Knuth:1999:DT,
  author =       "Donald E. Knuth",
  title =        "Digital Typography",
  volume =       "78",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xvi + 685",
  year =         "1999",
  ISBN =         "1-57586-010-4 (paperback), 1-57586-011-2 (hardcover)",
  ISBN-13 =      "978-1-57586-010-7 (paperback), 978-1-57586-011-4
                 (hardcover)",
  LCCN =         "Z249.3.K59 1998",
  MRclass =      "68U15",
  MRnumber =     "MR1676044 (2002k:68194)",
  bibdate =      "Mon May 10 18:01:36 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/litprog.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib;
                 MathSciNet database",
  price =        "US\$90.00 (cloth), US\$39.95 (paperback)",
  series =       "CSLI Lecture Notes",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Digital Typography / 1 \\
                 2: Mathematical Typography / 19 \\
                 3: Breaking Paragraphs Into Lines / 67 \\
                 4: Mixing Right-to-Left Texts with Left-to-Right Texts
                 / 157 \\
                 5: Recipes and Fractions / 177 \\
                 6: The \TeX{} Logo in Various Fonts / 181 \\
                 7: Printing Out Selected Pages / 183 \\
                 8: Macros for Jill / 185 \\
                 9: Problem for a Saturday Morning / 195 \\
                 10: Exercises for \TeX{}: The Program / 197 \\
                 11: Mini-Indexes for Literate Programs / 225 \\
                 12: Virtual Fonts: More Fun for Grand Wizards / 247 \\
                 13: The Letter S / 263 \\
                 14: My First Experience with Indian Scripts / 285 \\
                 15: Concept of a Meta-Font / 289 \\
                 16: Lessons Learned from METAFONT / 315 \\
                 17: AMS Euler --- A New Typeface for Mathematics / 339
                 \\
                 18: Typesetting Concrete Mathematics / 367 \\
                 19: Course on METAFONT Programming / 379 \\
                 20: Punk Meta-Font / 391 \\
                 21: Fonts for Digital Halftones / 415 \\
                 22: Digital Halftones by Dot Diffusion / 449 \\
                 23: A Note on Digital Angles / 473 \\
                 24: TEXDR.AFT / 481 \\
                 25: TEX.ONE / 505 \\
                 26: \TeX{} Incunabula / 533 \\
                 27: Icons for \TeX{} and METAFONT / 547 \\
                 28: Computers and Typesetting / 555 \\
                 29: The New Versions of \TeX{} and METAFONT / 563 \\
                 30: The Future of \TeX{} and METAFONT / 571 \\
                 31: Questions and Answers, I / 573 \\
                 32: Questions and Answers, II / 601 \\
                 33: Questions and Answers, III / 625 \\
                 34: Final Errors of \TeX{} / 655 \\
                 Index / 663",
}


bibtype: book
filename: master.bib
label: Knuth:1999:MRC
author: Donald E. Knuth
title: MMIXware: a RISC computer for the third millennium
volume: 1750
publisher: pub-SV
address: pub-SV:adr
pages: viii + 550
year: 1999
DOI: https://doi.org/10.1007/3-540-46611-8
ISBN: 3-540-66938-8 (softcover) OR 3540669388 (softcover)
ISBN13: 978-3-540-66938-8 (softcover) OR 9783540669388 (softcover)
ISSN: 0302-9743 (print), 1611-3349 (electronic) OR 03029743 (print), 16113349 (electronic)
ISSNL: 0302-9743 OR 03029743
LCCN: QA76.9.A73 K62 1999
bibdate: Mon Oct 16 18:31:56 MDT 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/lncs.bib; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.10.16 18:31:56 MDT
series: ser-LNCS
keywords: computer architecture; Reduced Instruction Set Computers
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: {MMIXware}: a {RISC} computer for the third millennium
URL:
http://link.springer-ny.com/link/service/series/0558/tocs/t1750.htm; http://www.springerlink.com/content/978-3-540-66938-8; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1750

TOC:
READ ME (a preface) / v CONTENTS / 1 MMIX (a definition) / 2 MMIX-ARITH (a library) / 62 MMIX-CONFIG (a part of MMMIX) / 110 MMIX-IO (a library) / 138 MMIX-MEM (a triviality) / 148 MMIX-PIPE (a part of MMMIX) / 150 MMIX-SIM (a simulator) / 332 MMIXAL (an assembler) / 422 MMMIX (a meta-simulator) / 494 MMOTYPE (a utility program) / 510 Master Index (a table of references) / 524

rawTOC:
READ ME (a preface) / v \\ CONTENTS / 1 \\ MMIX (a definition) / 2 \\ MMIX-ARITH (a library) / 62 \\ MMIX-CONFIG (a part of MMMIX) / 110 \\ MMIX-IO (a library) / 138 \\ MMIX-MEM (a triviality) / 148 \\ MMIX-PIPE (a part of MMMIX) / 150 \\ MMIX-SIM (a simulator) / 332 \\ MMIXAL (an assembler) / 422 \\ MMMIX (a meta-simulator) / 494 \\ MMOTYPE (a utility program) / 510 \\ Master Index (a table of references) / 524

entry:
@Book{Knuth:1999:MRC,
  author =       "Donald E. Knuth",
  title =        "{MMIXware}: a {RISC} computer for the third
                 millennium",
  volume =       "1750",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 550",
  year =         "1999",
  DOI =          "https://doi.org/10.1007/3-540-46611-8",
  ISBN =         "3-540-66938-8 (softcover)",
  ISBN-13 =      "978-3-540-66938-8 (softcover)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA76.9.A73 K62 1999",
  bibdate =      "Mon Oct 16 18:31:56 MDT 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/lncs.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer-ny.com/link/service/series/0558/tocs/t1750.htm;
                 http://www.springerlink.com/content/978-3-540-66938-8;
                 http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1750",
  acknowledgement = ack-nhfb,
  keywords =     "computer architecture; Reduced Instruction Set
                 Computers",
  tableofcontents = "READ ME (a preface) / v \\
                 CONTENTS / 1 \\
                 MMIX (a definition) / 2 \\
                 MMIX-ARITH (a library) / 62 \\
                 MMIX-CONFIG (a part of MMMIX) / 110 \\
                 MMIX-IO (a library) / 138 \\
                 MMIX-MEM (a triviality) / 148 \\
                 MMIX-PIPE (a part of MMMIX) / 150 \\
                 MMIX-SIM (a simulator) / 332 \\
                 MMIXAL (an assembler) / 422 \\
                 MMMIX (a meta-simulator) / 494 \\
                 MMOTYPE (a utility program) / 510 \\
                 Master Index (a table of references) / 524",
}


bibtype: book
filename: master.bib
label: Knuth:2000:SPA
author: Donald E. Knuth
title: Selected Papers on Analysis of Algorithms
volume: 102
publisher: pub-CSLI
address: pub-CSLI:adr
pages: xvi + 621
year: 2000
LCCN: QA9.58 .K65 2000
MRclass: 68Q25 (01A75 68W40)
MRnumber: 1762319 (2001c:68066)
MRreviewer: A. D. Booth
bibdate: Fri Mar 22 18:03:29 MST 2002
bibtimestamp: 2002.03.22 18:03:29 MST
series: CSLI Lecture Notes
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Selected Papers on Analysis of Algorithms
ISBN:
1-57586-212-3 (paperback), 1-57586-211-5 (hardcover) OR 1575862123 (paperback), 1575862115 (hardcover)

ISBN13:
978-1-57586-212-5 (paperback), 978-1-57586-211-8 (cloth) OR 9781575862125 (paperback), 9781575862118 (cloth)

bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib; MathSciNet database

TOC:
1: Mathematical Analysis of Algorithms / 1 2: The Dangers of Computer Science Theory / 19 3: The Analysis of Algorithms / 27 4: Big Omicron and Big Omega and Big Theta / 35 5: Optimal Measurement Points for Program Frequency Counts / 43 6: Estimating the Efficiency of Backtrack Programs / 55 7: Ordered Hash Tables / 77 8: Activity in an Interleaved Memory / 101 9: An Analysis of Alpha-Beta Pruning / 105 10: Notes on Generalized Dedekind Sums / 149 11: The Distribution of Continued Fraction Approximations / 181 12: Evaluation of Porter's Constant / 189 13: The Subtractive Algorithm for Greatest Common Divisors / 195 14: Length of Strings for a Merge Sort / 205 15: The Average Height of Planted Plane Trees / 215 16: The Toilet Paper Problem / 225 17: An Analysis of Optimum Caching / 235 18: A Trivial Algorithm Whose Analysis Isn't / 257 19: Deletions That Preserve Randomness / 283 20: Analysis of a Simple Factorization Algorithm / 303 21: The Expected Linearity of a Simple Equivalence Algorithm / 341 22: Textbook Examples of Recursion / 391 23: An Exact Analysis of Stable Allocation / 415 24: Stable Husbands / 429 25 Shellsort With Three Increments / 447 26: The Average Time for Carry Propagation / 467 27: Linear Probing and Graphs / 473 28: A Terminological Proposal / 485 29: Postscript About NP-Hard Problems / 493 30: An Experiment in Optimal Sorting / 495 31: Duality in Addition Chains / 501 32: Complexity Results for Bandwidth Minimization / 505 33: The Problem of Compatible Representatives / 535 34: The Complexity of Nonuniform Random Number Generation / 545 Index / 605

rawTOC:
1: Mathematical Analysis of Algorithms / 1 \\ 2: The Dangers of Computer Science Theory / 19 \\ 3: The Analysis of Algorithms / 27 \\ 4: Big Omicron and Big Omega and Big Theta / 35 \\ 5: Optimal Measurement Points for Program Frequency Counts / 43 \\ 6: Estimating the Efficiency of Backtrack Programs / 55 \\ 7: Ordered Hash Tables / 77 \\ 8: Activity in an Interleaved Memory / 101 \\ 9: An Analysis of Alpha-Beta Pruning / 105 \\ 10: Notes on Generalized Dedekind Sums / 149 \\ 11: The Distribution of Continued Fraction Approximations / 181 \\ 12: Evaluation of Porter's Constant / 189 \\ 13: The Subtractive Algorithm for Greatest Common Divisors / 195 \\ 14: Length of Strings for a Merge Sort / 205 \\ 15: The Average Height of Planted Plane Trees / 215 \\ 16: The Toilet Paper Problem / 225 \\ 17: An Analysis of Optimum Caching / 235 \\ 18: A Trivial Algorithm Whose Analysis Isn't / 257 \\ 19: Deletions That Preserve Randomness / 283 \\ 20: Analysis of a Simple Factorization Algorithm / 303 \\ 21: The Expected Linearity of a Simple Equivalence Algorithm / 341 \\ 22: Textbook Examples of Recursion / 391 \\ 23: An Exact Analysis of Stable Allocation / 415 \\ 24: Stable Husbands / 429 \\ 25 Shellsort With Three Increments / 447 \\ 26: The Average Time for Carry Propagation / 467 \\ 27: Linear Probing and Graphs / 473 \\ 28: A Terminological Proposal / 485 \\ 29: Postscript About NP-Hard Problems / 493 \\ 30: An Experiment in Optimal Sorting / 495 \\ 31: Duality in Addition Chains / 501 \\ 32: Complexity Results for Bandwidth Minimization / 505 \\ 33: The Problem of Compatible Representatives / 535 \\ 34: The Complexity of Nonuniform Random Number Generation / 545 \\ Index / 605

entry:
@Book{Knuth:2000:SPA,
  author =       "Donald E. Knuth",
  title =        "Selected Papers on Analysis of Algorithms",
  volume =       "102",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xvi + 621",
  year =         "2000",
  ISBN =         "1-57586-212-3 (paperback), 1-57586-211-5 (hardcover)",
  ISBN-13 =      "978-1-57586-212-5 (paperback), 978-1-57586-211-8
                 (cloth)",
  LCCN =         "QA9.58 .K65 2000",
  MRclass =      "68Q25 (01A75 68W40)",
  MRnumber =     "1762319 (2001c:68066)",
  MRreviewer =   "A. D. Booth",
  bibdate =      "Fri Mar 22 18:03:29 MST 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 MathSciNet database",
  series =       "CSLI Lecture Notes",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Mathematical Analysis of Algorithms / 1 \\
                 2: The Dangers of Computer Science Theory / 19 \\
                 3: The Analysis of Algorithms / 27 \\
                 4: Big Omicron and Big Omega and Big Theta / 35 \\
                 5: Optimal Measurement Points for Program Frequency
                 Counts / 43 \\
                 6: Estimating the Efficiency of Backtrack Programs / 55
                 \\
                 7: Ordered Hash Tables / 77 \\
                 8: Activity in an Interleaved Memory / 101 \\
                 9: An Analysis of Alpha-Beta Pruning / 105 \\
                 10: Notes on Generalized Dedekind Sums / 149 \\
                 11: The Distribution of Continued Fraction
                 Approximations / 181 \\
                 12: Evaluation of Porter's Constant / 189 \\
                 13: The Subtractive Algorithm for Greatest Common
                 Divisors / 195 \\
                 14: Length of Strings for a Merge Sort / 205 \\
                 15: The Average Height of Planted Plane Trees / 215 \\
                 16: The Toilet Paper Problem / 225 \\
                 17: An Analysis of Optimum Caching / 235 \\
                 18: A Trivial Algorithm Whose Analysis Isn't / 257 \\
                 19: Deletions That Preserve Randomness / 283 \\
                 20: Analysis of a Simple Factorization Algorithm / 303
                 \\
                 21: The Expected Linearity of a Simple Equivalence
                 Algorithm / 341 \\
                 22: Textbook Examples of Recursion / 391 \\
                 23: An Exact Analysis of Stable Allocation / 415 \\
                 24: Stable Husbands / 429 \\
                 25 Shellsort With Three Increments / 447 \\
                 26: The Average Time for Carry Propagation / 467 \\
                 27: Linear Probing and Graphs / 473 \\
                 28: A Terminological Proposal / 485 \\
                 29: Postscript About NP-Hard Problems / 493 \\
                 30: An Experiment in Optimal Sorting / 495 \\
                 31: Duality in Addition Chains / 501 \\
                 32: Complexity Results for Bandwidth Minimization / 505
                 \\
                 33: The Problem of Compatible Representatives / 535 \\
                 34: The Complexity of Nonuniform Random Number
                 Generation / 545 \\
                 Index / 605",
}


bibtype: book
filename: master.bib
label: Knuth:2003:SPC
author: Donald E. Knuth
title: Selected Papers on Computer Languages
volume: 139
publisher: pub-CSLI
address: pub-CSLI:adr
pages: xviii + 594
year: 2003
LCCN: QA76.7 .K63 2002
MRclass: 68N15 (01A75 68-03 68-06)
MRnumber: MR2019164 (2005b:68045)
MRreviewer: Julian Padget
bibdate: Thu Sep 30 07:16:32 2004
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2004.09.30 07:16:32 ???
series: CSLI Lecture Notes
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Selected Papers on Computer Languages
ISBN:
1-57586-381-2 (hardcover), 1-57586-382-0 (paperback) OR 1575863812 (hardcover), 1575863820 (paperback)

ISBN13:
978-1-57586-381-8 (hardcover), 978-1-57586-382-5 (paperback) OR 9781575863818 (hardcover), 9781575863825 (paperback)

keywords:
Algol; attribute grammars; automata; BNF; compiler; Fortran; programming history; programming language; semantics; syntax

remark:
This book is the fifth volume of the papers written by Donald E. Knuth, the pioneer of computer science. The previous volumes were: 1. Literate Programming (1992); 2. Selected Papers on Computer Science (1996; Zbl 0866.68002); 3. Digital Typography (1999; Zbl 0927.68109); 4. Selected Papers on Analysis of Algorithms (2000; Zbl 0966.68082). This fifth volume contains 25 papers on programming languages, their syntax, semantics and translation. The book begins with a survey `The Early Development of Programming Languages' originally published in 1977. It is followed by the well known paper `Backus Normal Form versus Backus Naur Form' (1964). Five papers are concerned with Algol-60, two with SOL. The remaining papers deal with the theory of programming languages, context-free languages, formal semantics, attribute grammars, compilers, algebraic translation, coroutine generation, etc. The reader will be able to see the early history and development of fundamental concepts that have now become thoroughly integrated into modern software systems.

TOC:
1: The Early Development of Programming Languages 2: Backus Normal Form versus Backus Naur Form 3: Teaching ALGOL 60 4: ALGOL 60 Confidential 5: Smalgol-61 6: Man or Boy? 7: A Proposal for Input-Output Conventions in ALGOL 60 8: The Remaining Trouble Spots in ALGOL 60 9: SOL A Symbolic Language for Systems Simulation 10: A Formal Definition of SOL 11: The Science of Programming Languages 12: Programming Languages for Automata 13: A Characterization of Parenthesis Languages 14: Top-Down Syntax Analysis 15: On the Translation of Languages from Left to Right 16: Context-Free Multilanguages 17: Semantics of Context-Free Languages 18: Examples of Formal Semantics

rawTOC:
1: The Early Development of Programming Languages \\ 2: Backus Normal Form versus Backus Naur Form \\ 3: Teaching ALGOL 60 \\ 4: ALGOL 60 Confidential \\ 5: Smalgol-61 \\ 6: Man or Boy? \\ 7: A Proposal for Input-Output Conventions in ALGOL 60 \\ 8: The Remaining Trouble Spots in ALGOL 60 \\ 9: SOL \\ A Symbolic Language for Systems Simulation \\ 10: A Formal Definition of SOL \\ 11: The Science of Programming Languages \\ 12: Programming Languages for Automata \\ 13: A Characterization of Parenthesis Languages \\ 14: Top-Down Syntax Analysis \\ 15: On the Translation of Languages from Left to Right \\ 16: Context-Free Multilanguages \\ 17: Semantics of Context-Free Languages \\ 18: Examples of Formal Semantics

entry:
@Book{Knuth:2003:SPC,
  author =       "Donald E. Knuth",
  title =        "Selected Papers on Computer Languages",
  volume =       "139",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xviii + 594",
  year =         "2003",
  ISBN =         "1-57586-381-2 (hardcover), 1-57586-382-0 (paperback)",
  ISBN-13 =      "978-1-57586-381-8 (hardcover), 978-1-57586-382-5
                 (paperback)",
  LCCN =         "QA76.7 .K63 2002",
  MRclass =      "68N15 (01A75 68-03 68-06)",
  MRnumber =     "MR2019164 (2005b:68045)",
  MRreviewer =   "Julian Padget",
  bibdate =      "Thu Sep 30 07:16:32 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$75.00 (hardcover), US\$35.00 (paperback)",
  series =       "CSLI Lecture Notes",
  acknowledgement = ack-nhfb,
  classmath =    "68-03 (Historical (computer science)); 00B60
                 (Collections of reprinted articles); 01A75 (Collected
                 or selected works); 68-02 (Research monographs
                 (computer science))",
  keywords =     "Algol; attribute grammars; automata; BNF; compiler;
                 Fortran; programming history; programming language;
                 semantics; syntax",
  remark =       "This book is the fifth volume of the papers written by
                 Donald E. Knuth, the pioneer of computer science. The
                 previous volumes were: 1. Literate Programming (1992);
                 2. Selected Papers on Computer Science (1996; Zbl
                 0866.68002); 3. Digital Typography (1999; Zbl
                 0927.68109); 4. Selected Papers on Analysis of
                 Algorithms (2000; Zbl 0966.68082). This fifth volume
                 contains 25 papers on programming languages, their
                 syntax, semantics and translation. The book begins with
                 a survey `The Early Development of Programming
                 Languages' originally published in 1977. It is followed
                 by the well known paper `Backus Normal Form versus
                 Backus Naur Form' (1964). Five papers are concerned
                 with Algol-60, two with SOL. The remaining papers deal
                 with the theory of programming languages, context-free
                 languages, formal semantics, attribute grammars,
                 compilers, algebraic translation, coroutine generation,
                 etc. The reader will be able to see the early history
                 and development of fundamental concepts that have now
                 become thoroughly integrated into modern software
                 systems.",
  tableofcontents = "1: The Early Development of Programming Languages
                 \\
                 2: Backus Normal Form versus Backus Naur Form \\
                 3: Teaching ALGOL 60 \\
                 4: ALGOL 60 Confidential \\
                 5: Smalgol-61 \\
                 6: Man or Boy? \\
                 7: A Proposal for Input-Output Conventions in ALGOL 60
                 \\
                 8: The Remaining Trouble Spots in ALGOL 60 \\
                 9: SOL \\
                 A Symbolic Language for Systems Simulation \\
                 10: A Formal Definition of SOL \\
                 11: The Science of Programming Languages \\
                 12: Programming Languages for Automata \\
                 13: A Characterization of Parenthesis Languages \\
                 14: Top-Down Syntax Analysis \\
                 15: On the Translation of Languages from Left to Right
                 \\
                 16: Context-Free Multilanguages \\
                 17: Semantics of Context-Free Languages \\
                 18: Examples of Formal Semantics",
  xxpages =      "xvi + 594",
}


bibtype: book
filename: master.bib
label: Knuth:2003:SPD
author: Donald E. Knuth
title: Selected Papers on Discrete Mathematics
volume: 106
publisher: pub-CSLI
address: pub-CSLI:adr
pages: xvi + 812
year: 2003
LCCN: QA39.3 .K59 2001
MRclass: 01A75 (05-06 68-06)
MRnumber: MR2030307 (2005c:01030)
MRreviewer: Alexander Zvonkin
bibdate: Fri Mar 4 15:20:28 2011
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2011.03.04 15:20:28 ???
series: CSLI Lecture Notes
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Selected Papers on Discrete Mathematics
ISBN:
1-57586-248-4 (paperback), 1-57586-249-2 (hardcover) OR 1575862484 (paperback), 1575862492 (hardcover)

ISBN13:
978-1-57586-248-4 (paperback), 978-1-57586-249-1 (hardcover) OR 9781575862484 (paperback), 9781575862491 (hardcover)

abstract:
Donald Knuth's influence in computer science ranges from the invention of literate programming to the development of the TeX programming language. One of the foremost figures in the field of mathematical sciences, his papers are widely referenced and stand as milestones of development over a wide range of topics. This volume assembles more than three dozen of Professor Knuth's pioneering contributions to discrete mathematics. It includes a variety of topics in combinatorial mathematics (finite geometries, graph theory, enumeration, partitions, tableaux, matroids, codes); discrete algebra (finite fields, groupoids, closure operators, inequalities, convolutions, Pfaffians); and concrete mathematics (recurrence relations, special numbers and notations, identities, discrete probability). Of particular interest are two fundamental papers in which the evolution of random graphs is studied by means of generating functions.

keywords:
discrete mathematics; graph theory; groupoid; identities; matrix theory; matroid; partitions; permutations; recurrences

remark:
This book is number six in a series of eight of Donald E. Knuth's collected papers that Stanford's Center for the Study of Language and Information plans to publish. The previous already published volumes were: 1. Literate Programming (1992); 2. Selected Papers on Computer Science (1996; Zbl 0866.68002); 3. Digital Typography (1999; Zbl 0927.68109); 4. Selected Papers on Analysis of Algorithms (2000; Zbl 0966.68082). 5. Selected Papers on Computer Languages (2003; Zbl 1046.68003). This sixth volume is devoted to mathematical topics and contains 41 papers written during the last four decades.par Donald E. Knuth is widely known as a pioneer of the computer science and most of his papers are devoted to this field. However he has solid mathematical background and has published a lot of mathematical papers covering the entire range of discrete mathematics. Let us mention some topics exposed in this collection of papers: combinatorial analysis related to computers (sequences, backtrack, Latin squares, projective planes), notes on mathematical notation, notes on some 17th century mathematical publications, doubly stochastic matrices, Pfaffians (arrays of numbers), relations between matrices, graphs and trees, large numbers (power series raised to the power), floor function, random sequences, finite fields, central groupoids, algebraic approach of Huffman's algorithm, directed graphs, random matroids, permutations, efficient balanced codes, various aspects of partitions (enumeration, identities, etc.), recurrences (linear, minimization, related to trees), cycles in an evolving graph.par The collection ends with two lengthy papers: ``First Cycles in an Evolving Graph'' (56 pages) (see Zbl 0696.05045) and ``The Birth of the Giant Component'' (150 pages) devoted to random graph problems (see Zbl 0795.05127), initiated by [it P. Erdos and it A. Renyi, ``On random graphs I''. Publ. Math. (Debrecen) 6, 290--297 (1959; Zbl 0092.15705)]. The papers are self-contained so that a reader with a general mathematical background would be able to understand the content.par Almost every paper in this book is supplemented with an addendum where the author presents short information about what has happened after the paper was published: further investigations and new results related to the topic of the paper, comments, corrections.

TOC:
1: Discussion of Mr. Riordan's paper `Abel identities and inverse relations' 2: Duality in addition chains 3: Combinatorial analysis and computers 4: Tables of finite fields 5: Finite semifields and projective planes 6: A class of projective planes 7: Construction of a random sequence 8: Oriented subtrees of an arc digraph 9: Another enumeration of trees 10: Notes on central groupoids 11: Permutations, matrices, and generalized Young tableaux 12: A note on solid partitions 13: Subspaces, subsets, and partitions 14: Enumeration of plane partitions 15: Complements and transitive closures 16: Permutations with nonnegative partial sums 17: Wheels within wheels 18: The asymptotic number of geometries 19: Random matroids 20: Identities from partition involutions 21: Huffman's algorithm via algebra 22: A permanent inequality 23: Efficient balanced codes 24: The power of a prime that divides a generalized binomial coefficient 25: The first cycles in an evolving graph 26: The birth of the giant component 27: Polynomials involving the floor function 28: The sandwich theorem 29: Aztec diamonds, checkerboard graphs, and spanning trees

rawabstract:
Donald Knuth's influence in computer science ranges from the invention of literate programming to the development of the TeX programming language. One of the foremost figures in the field of mathematical sciences, his papers are widely referenced and stand as milestones of development over a wide range of topics. This volume assembles more than three dozen of Professor Knuth's pioneering contributions to discrete mathematics. It includes a variety of topics in combinatorial mathematics (finite geometries, graph theory, enumeration, partitions, tableaux, matroids, codes); discrete algebra (finite fields, groupoids, closure operators, inequalities, convolutions, Pfaffians); and concrete mathematics (recurrence relations, special numbers and notations, identities, discrete probability). Of particular interest are two fundamental papers in which the evolution of random graphs is studied by means of generating functions.

rawTOC:
1: Discussion of Mr. Riordan's paper `Abel identities and inverse relations' \\ 2: Duality in addition chains \\ 3: Combinatorial analysis and computers \\ 4: Tables of finite fields \\ 5: Finite semifields and projective planes \\ 6: A class of projective planes \\ 7: Construction of a random sequence \\ 8: Oriented subtrees of an arc digraph \\ 9: Another enumeration of trees \\ 10: Notes on central groupoids \\ 11: Permutations, matrices, and generalized Young tableaux \\ 12: A note on solid partitions \\ 13: Subspaces, subsets, and partitions \\ 14: Enumeration of plane partitions \\ 15: Complements and transitive closures \\ 16: Permutations with nonnegative partial sums \\ 17: Wheels within wheels \\ 18: The asymptotic number of geometries \\ 19: Random matroids \\ 20: Identities from partition involutions \\ 21: Huffman's algorithm via algebra \\ 22: A permanent inequality \\ 23: Efficient balanced codes \\ 24: The power of a prime that divides a generalized binomial coefficient \\ 25: The first cycles in an evolving graph \\ 26: The birth of the giant component \\ 27: Polynomials involving the floor function \\ 28: The sandwich theorem \\ 29: Aztec diamonds, checkerboard graphs, and spanning trees

entry:
@Book{Knuth:2003:SPD,
  author =       "Donald E. Knuth",
  title =        "Selected Papers on Discrete Mathematics",
  volume =       "106",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xvi + 812",
  year =         "2003",
  ISBN =         "1-57586-248-4 (paperback), 1-57586-249-2 (hardcover)",
  ISBN-13 =      "978-1-57586-248-4 (paperback), 978-1-57586-249-1
                 (hardcover)",
  LCCN =         "QA39.3 .K59 2001",
  MRclass =      "01A75 (05-06 68-06)",
  MRnumber =     "MR2030307 (2005c:01030)",
  MRreviewer =   "Alexander Zvonkin",
  bibdate =      "Fri Mar 4 15:20:28 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$40.00",
  series =       "CSLI Lecture Notes",
  abstract =     "Donald Knuth's influence in computer science ranges
                 from the invention of literate programming to the
                 development of the TeX programming language. One of the
                 foremost figures in the field of mathematical sciences,
                 his papers are widely referenced and stand as
                 milestones of development over a wide range of topics.
                 This volume assembles more than three dozen of
                 Professor Knuth's pioneering contributions to discrete
                 mathematics. It includes a variety of topics in
                 combinatorial mathematics (finite geometries, graph
                 theory, enumeration, partitions, tableaux, matroids,
                 codes); discrete algebra (finite fields, groupoids,
                 closure operators, inequalities, convolutions,
                 Pfaffians); and concrete mathematics (recurrence
                 relations, special numbers and notations, identities,
                 discrete probability). Of particular interest are two
                 fundamental papers in which the evolution of random
                 graphs is studied by means of generating functions.",
  acknowledgement = ack-nhfb,
  classmath =    "01A75 (Collected or selected works); 00B60
                 (Collections of reprinted articles)",
  keywords =     "discrete mathematics; graph theory; groupoid;
                 identities; matrix theory; matroid; partitions;
                 permutations; recurrences",
  remark =       "This book is number six in a series of eight of Donald
                 E. Knuth's collected papers that Stanford's Center for
                 the Study of Language and Information plans to publish.
                 The previous already published volumes were: 1.
                 Literate Programming (1992); 2. Selected Papers on
                 Computer Science (1996; Zbl 0866.68002); 3. Digital
                 Typography (1999; Zbl 0927.68109); 4. Selected Papers
                 on Analysis of Algorithms (2000; Zbl 0966.68082). 5.
                 Selected Papers on Computer Languages (2003; Zbl
                 1046.68003). This sixth volume is devoted to
                 mathematical topics and contains 41 papers written
                 during the last four decades.\par

                 Donald E. Knuth is widely known as a pioneer of the
                 computer science and most of his papers are devoted to
                 this field. However he has solid mathematical
                 background and has published a lot of mathematical
                 papers covering the entire range of discrete
                 mathematics. Let us mention some topics exposed in this
                 collection of papers: combinatorial analysis related to
                 computers (sequences, backtrack, Latin squares,
                 projective planes), notes on mathematical notation,
                 notes on some 17th century mathematical publications,
                 doubly stochastic matrices, Pfaffians (arrays of
                 numbers), relations between matrices, graphs and trees,
                 large numbers (power series raised to the power), floor
                 function, random sequences, finite fields, central
                 groupoids, algebraic approach of Huffman's algorithm,
                 directed graphs, random matroids, permutations,
                 efficient balanced codes, various aspects of partitions
                 (enumeration, identities, etc.), recurrences (linear,
                 minimization, related to trees), cycles in an evolving
                 graph.\par

                 The collection ends with two lengthy papers: ``First
                 Cycles in an Evolving Graph'' (56 pages) (see Zbl
                 0696.05045) and ``The Birth of the Giant Component''
                 (150 pages) devoted to random graph problems (see Zbl
                 0795.05127), initiated by [{\it P. Erd{\H{o}}s} and
                 {\it A. R{\'e}nyi}, ``On random graphs I''. Publ. Math.
                 (Debrecen) 6, 290--297 (1959; Zbl 0092.15705)]. The
                 papers are self-contained so that a reader with a
                 general mathematical background would be able to
                 understand the content.\par

                 Almost every paper in this book is supplemented with an
                 addendum where the author presents short information
                 about what has happened after the paper was published:
                 further investigations and new results related to the
                 topic of the paper, comments, corrections.",
  tableofcontents = "1: Discussion of Mr. Riordan's paper `Abel
                 identities and inverse relations' \\
                 2: Duality in addition chains \\
                 3: Combinatorial analysis and computers \\
                 4: Tables of finite fields \\
                 5: Finite semifields and projective planes \\
                 6: A class of projective planes \\
                 7: Construction of a random sequence \\
                 8: Oriented subtrees of an arc digraph \\
                 9: Another enumeration of trees \\
                 10: Notes on central groupoids \\
                 11: Permutations, matrices, and generalized Young
                 tableaux \\
                 12: A note on solid partitions \\
                 13: Subspaces, subsets, and partitions \\
                 14: Enumeration of plane partitions \\
                 15: Complements and transitive closures \\
                 16: Permutations with nonnegative partial sums \\
                 17: Wheels within wheels \\
                 18: The asymptotic number of geometries \\
                 19: Random matroids \\
                 20: Identities from partition involutions \\
                 21: Huffman's algorithm via algebra \\
                 22: A permanent inequality \\
                 23: Efficient balanced codes \\
                 24: The power of a prime that divides a generalized
                 binomial coefficient \\
                 25: The first cycles in an evolving graph \\
                 26: The birth of the giant component \\
                 27: Polynomials involving the floor function \\
                 28: The sandwich theorem \\
                 29: Aztec diamonds, checkerboard graphs, and spanning
                 trees",
}


bibtype: book
filename: master.bib
label: 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 OR 0201853922
ISBN13: 978-0-201-85392-6 OR 9780201853926
LCCN: QA76.6 .K64 2005
MRclass: 68-02 (68M01 68N15)
MRnumber: MR2245382 (2007f:68004a)
bibdate: Tue Oct 11 05:24:35 MDT 2005
bibtimestamp: 2005.10.11 05:24:35 MDT
subject: Computer programming; Computer algorithms
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib; z3950.loc.gov:7090/Voyager

TOC:
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

rawtitle:
The Art of Computer Programming: Volume 1, Fascicle 1. {MMIX}, a {RISC} Computer for the New Millennium

rawTOC:
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

entry:
@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 =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://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",
}


bibtype: book
filename: master.bib
label: 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 OR 0201853949
ISBN13: 978-0-201-85394-0 OR 9780201853940
LCCN: QA76.6 .K64 2005
bibdate: Tue Oct 11 05:24:35 MDT 2005
bibtimestamp: 2005.10.11 05:24:35 MDT
subject: Computer programming; Computer algorithms
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: The Art of Computer Programming: Volume 4, Fascicle 3. Generating All Combinations and Partitions
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib; z3950.loc.gov:7090/Voyager

TOC:
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

rawTOC:
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

entry:
@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 =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://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",
}


bibtype: book
filename: master.bib
label: Knuth:2008:ICA
author: Donald E. Knuth
publisher: pub-AW
address: pub-AW:adr
pages: ix + 216
year: 2008
ISBN: 0-321-53496-4 OR 0321534964
ISBN13: 978-0-321-53496-5 OR 9780321534965
LCCN: QA76.6 .K64 2005
bibdate: Fri Jun 12 07:16:46 2009
bibtimestamp: 2009.06.12 07:16:46 ???
series: The art of computer programming
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
title:
The Art of Computer Programming: Volume 4, Fascicle 0. Introduction to Combinatorial Algorithms and Boolean Functions

bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

TOC:
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

rawtitle:
The Art of Computer Programming: Volume 4, Fascicle 0. Introduction to Combinatorial Algorithms and {Boolean} Functions

rawTOC:
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

entry:
@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 =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://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",
}


bibtype: book
filename: master.bib
label: Knuth:2009:ACP
author: Donald E. Knuth
publisher: pub-AW
address: pub-AW:adr
pages: vii + 260
year: 2009
ISBN: 0-321-58050-8 OR 0321580508
ISBN13: 978-0-321-58050-4 OR 9780321580504
LCCN: QA76.6 .K64 2009
bibdate: Fri Jun 12 07:20:05 2009
bibtimestamp: 2009.06.12 07:20:05 ???
series: The art of computer programming
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
title:
The Art of Computer Programming: Volume 4, Fascicle 1. Bitwise Tricks and Techniques. Binary Decision Diagrams

bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

TOC:
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

rawtitle:
The Art of Computer Programming: Volume 4, Fascicle 1. {Bitwise} Tricks and Techniques. {Binary} Decision Diagrams

rawTOC:
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

entry:
@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 =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://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",
}


bibtype: book
filename: master.bib
label: Knuth:2011:ACP
author: Donald E. Knuth
title: The Art of Computer Programming: Volume 4, Combinatorial algorithms. Part 1
volume: 4A
publisher: pub-AW
address: pub-AW:adr
pages: xv + 883
year: 2011
ISBN: 0-201-03804-8 OR 0201038048
ISBN13: 978-0-201-03804-0 OR 9780201038040
LCCN: QA76.6 2005
bibdate: Fri Mar 4 17:53:38 MST 2011
bibtimestamp: 2011.03.04 17:53:38 MST
series: The art of computer programming
remark: Also issued from 2005 to 2010 in four fascicles prior to this complete edition.
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: The Art of Computer Programming: Volume 4, {Combinatorial} algorithms. {Part 1}
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/sigact.bib; z3950.gbv.de:20011/gvk

TOC:
7: Combinatorial Searching 7.1. Zeros and Ones 7.1.1. Boolean Baiscs 7.1.2. Boolean Evaluation 7.1.3. Bitwise Tricks and Techniques 7.1.4. Binary Decision Diagrams 7.2. Generating All Possibilities 7.2.1. Generating Basic Cambinatorial Patterns 7.2.1.1. Generating all n-Tuples 7.2.1.2. Generating all Permutations 7.2.1.3. Generating all Combinations 7.2.1.4. Generating all Partitions 7.2.1.5. Generating all Set Partitions 7.2.1.6. Generating all Trees 7.2.1.7. History and Further References Answers to Exercises Appendix A. Tables of Numerical Quantities 1. Fundamental Constants (decimal) 2. Fundamental Constants (hexadecimal) 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers Appendix B. Index to Notations Appendix C. Index to Algorithms and Theorems Appendix D. Index to Combinatorial Problems Index and Glossary

rawTOC:
7: Combinatorial Searching \\ 7.1. Zeros and Ones \\ 7.1.1. Boolean Baiscs \\ 7.1.2. Boolean Evaluation \\ 7.1.3. Bitwise Tricks and Techniques \\ 7.1.4. Binary Decision Diagrams \\ 7.2. Generating All Possibilities \\ 7.2.1. Generating Basic Cambinatorial Patterns \\ 7.2.1.1. Generating all n-Tuples \\ 7.2.1.2. Generating all Permutations \\ 7.2.1.3. Generating all Combinations \\ 7.2.1.4. Generating all Partitions \\ 7.2.1.5. Generating all Set Partitions \\ 7.2.1.6. Generating all Trees \\ 7.2.1.7. History and Further References \\ Answers to Exercises \\ Appendix A. Tables of Numerical Quantities \\ 1. Fundamental Constants (decimal) \\ 2. Fundamental Constants (hexadecimal) \\ 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers \\ Appendix B. Index to Notations \\ Appendix C. Index to Algorithms and Theorems \\ Appendix D. Index to Combinatorial Problems \\ Index and Glossary

entry:
@Book{Knuth:2011:ACP,
  author =       "Donald E. Knuth",
  title =        "The Art of Computer Programming: Volume 4,
                 {Combinatorial} algorithms. {Part 1}",
  volume =       "4A",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 883",
  year =         "2011",
  ISBN =         "0-201-03804-8",
  ISBN-13 =      "978-0-201-03804-0",
  LCCN =         "QA76.6 2005",
  bibdate =      "Fri Mar 4 17:53:38 MST 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.gbv.de:20011/gvk",
  series =       "The art of computer programming",
  acknowledgement = ack-nhfb,
  remark =       "Also issued from 2005 to 2010 in four fascicles prior
                 to this complete edition.",
  tableofcontents = "7: Combinatorial Searching \\
                 7.1. Zeros and Ones \\
                 7.1.1. Boolean Baiscs \\
                 7.1.2. Boolean Evaluation \\
                 7.1.3. Bitwise Tricks and Techniques \\
                 7.1.4. Binary Decision Diagrams \\
                 7.2. Generating All Possibilities \\
                 7.2.1. Generating Basic Cambinatorial Patterns \\
                 7.2.1.1. Generating all n-Tuples \\
                 7.2.1.2. Generating all Permutations \\
                 7.2.1.3. Generating all Combinations \\
                 7.2.1.4. Generating all Partitions \\
                 7.2.1.5. Generating all Set Partitions \\
                 7.2.1.6. Generating all Trees \\
                 7.2.1.7. History and Further References \\
                 Answers to Exercises \\
                 Appendix A. Tables of Numerical Quantities \\
                 1. Fundamental Constants (decimal) \\
                 2. Fundamental Constants (hexadecimal) \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers \\
                 Appendix B. Index to Notations \\
                 Appendix C. Index to Algorithms and Theorems \\
                 Appendix D. Index to Combinatorial Problems \\
                 Index and Glossary",
}


bibtype: book
filename: master.bib
label: Knuth:ACP68-1
author: Donald E. Knuth
title: Fundamental Algorithms
volume: 1
publisher: pub-AW
address: pub-AW:adr
pages: xxi + 634
year: 1968
ISBN: 0-201-03803-X OR 020103803X
ISBN13: 978-0-201-03803-3 OR 9780201038033
LCCN: QA76.5 .K74
bibdate: Wed Jun 26 15:14:29 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1996.06.26 15:14:29 ???
series: The Art of Computer Programming
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Fundamental Algorithms
entry:
@Book{Knuth:ACP68-1,
  author =       "Donald E. Knuth",
  title =        "Fundamental Algorithms",
  volume =       "1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxi + 634",
  year =         "{\noopsort{1968a}}1968",
  ISBN =         "0-201-03803-X",
  ISBN-13 =      "978-0-201-03803-3",
  LCCN =         "QA76.5 .K74",
  bibdate =      "Wed Jun 26 15:14:29 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.75",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Knuth:ACP69-2
author: Donald E. Knuth
title: Seminumerical Algorithms
volume: 2
publisher: pub-AW
address: pub-AW:adr
pages: xi + 624
year: 1969
ISBN: 0-201-03802-1 OR 0201038021
ISBN13: 978-0-201-03802-6 OR 9780201038026
LCCN: QA76.5 .K57
MRclass: 68.00 (65.00)
MRnumber: 44 \#3531
MRreviewer: M. Muller
bibdate: Wed Dec 15 15:47:38 1993
bibtimestamp: 1993.12.15 15:47:38 ???
series: The Art of Computer Programming
remark: Benford's Law is discussed on pp. 219--229.
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Seminumerical Algorithms
bibsource:
https://www.math.utah.edu/pub/tex/bib/benfords-law.bib; https://www.math.utah.edu/pub/tex/bib/cryptography.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
3: Random Numbers 3.1. Introduction / 1 3.2. Generating Uniform Random Numbers / 9 3.2.1. The Linear Congruential Method / 9 3.2.1.1. Choice of modulus / 11 3.2.1.2. Choice of multiplier / 15 3.2.1.3. Potency / 21 3.2.2. Other Methods / 25 3.3. Statistical Tests / 34 3.3.1. General Test Procedures for Studying Random Data / 35 3.3.2. Empirical Tests / 54 *3.3.3. Theoretical Tests / 69 3.3.4. The Spectral Test / 82 3.4. Other Types of Random Quantities / 100 3.4.1. Numerical Distributions / 101 3.4.2. Random Sampling and Shuffling / 121 *3.5. What is a Random Sequence? / 127 3.6. Summary / 155 4: Arithmetic 4.1. Positional Number Systems / 162 4.2. Floating-Point Arithmetic / 180 4.2.1. Single-Precision Calculations / 180 4.2.2. Accuracy of Floating-Point Arithmetic / 195 *4.2.3. Double-Precision Calculations / 210 4.2.4. Statistical Distribution / 218 4.3. Multiple-Precision Arithmetic / 229 4.3.1. The Classical Algorithms / 229 *4.3.2. Modular Arithmetic / 248 *4.3.3. How Fast Can We Multiply? / 258 4.4. Radix Conversion / 280 4.5. Rational Arithmetic / 290 4.5.1. Fractions / 290 4.5.2. The Greatest Common Divisor / 293 *4.5.3. Analysis of Euclid's Algorithm / 316 4.5.4. Factoring into Primes / 339 4.6. Polynomial Arithmetic / 360 4.6.1. Division of Polynomials / 363 *4.6.2. Factorization of Polynomials / 381 4.6.3. Evaluation of Powers / 398 4.6.4. Evaluation of Polynomials / 422 *4.7. Manipulation of Power Series / 444 Answers to Exercises / 452 Appendix A: MIX / 565 1. Description of MIX / 565 2. The MIX Assembly Language / 584 Appendix B: Tables of Numerical Quantities / 596 1. Fundamental Constants (decimal) / 596 2. Fundamental Constants (octal) / 597 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers / 598 Appendix C: Index to Notations / 600 Index and Glossary / 605

rawTOC:
3: Random Numbers \\ 3.1. Introduction / 1 \\ 3.2. Generating Uniform Random Numbers / 9 \\ 3.2.1. The Linear Congruential Method / 9 \\ 3.2.1.1. Choice of modulus / 11 \\ 3.2.1.2. Choice of multiplier / 15 \\ 3.2.1.3. Potency / 21 \\ 3.2.2. Other Methods / 25 \\ 3.3. Statistical Tests / 34 \\ 3.3.1. General Test Procedures for Studying Random Data / 35 \\ 3.3.2. Empirical Tests / 54 \\ *3.3.3. Theoretical Tests / 69 \\ 3.3.4. The Spectral Test / 82 \\ 3.4. Other Types of Random Quantities / 100 \\ 3.4.1. Numerical Distributions / 101 \\ 3.4.2. Random Sampling and Shuffling / 121 \\ *3.5. What is a Random Sequence? / 127 \\ 3.6. Summary / 155 \\ 4: Arithmetic \\ 4.1. Positional Number Systems / 162 \\ 4.2. Floating-Point Arithmetic / 180 \\ 4.2.1. Single-Precision Calculations / 180 \\ 4.2.2. Accuracy of Floating-Point Arithmetic / 195 \\ *4.2.3. Double-Precision Calculations / 210 \\ 4.2.4. Statistical Distribution / 218 \\ 4.3. Multiple-Precision Arithmetic / 229 \\ 4.3.1. The Classical Algorithms / 229 \\ *4.3.2. Modular Arithmetic / 248 \\ *4.3.3. How Fast Can We Multiply? / 258 \\ 4.4. Radix Conversion / 280 \\ 4.5. Rational Arithmetic / 290 \\ 4.5.1. Fractions / 290 \\ 4.5.2. The Greatest Common Divisor / 293 \\ *4.5.3. Analysis of Euclid's Algorithm / 316 \\ 4.5.4. Factoring into Primes / 339 \\ 4.6. Polynomial Arithmetic / 360 \\ 4.6.1. Division of Polynomials / 363 \\ *4.6.2. Factorization of Polynomials / 381 \\ 4.6.3. Evaluation of Powers / 398 \\ 4.6.4. Evaluation of Polynomials / 422 \\ *4.7. Manipulation of Power Series / 444 \\ Answers to Exercises / 452 \\ Appendix A: MIX / 565 \\ 1. Description of MIX / 565 \\ 2. The MIX Assembly Language / 584 \\ Appendix B: Tables of Numerical Quantities / 596 \\ 1. Fundamental Constants (decimal) / 596 \\ 2. Fundamental Constants (octal) / 597 \\ 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers / 598 \\ Appendix C: Index to Notations / 600 \\ Index and Glossary / 605

entry:
@Book{Knuth:ACP69-2,
  author =       "Donald E. Knuth",
  title =        "Seminumerical Algorithms",
  volume =       "2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 624",
  year =         "1969",
  ISBN =         "0-201-03802-1",
  ISBN-13 =      "978-0-201-03802-6",
  LCCN =         "QA76.5 .K57",
  MRclass =      "68.00 (65.00)",
  MRnumber =     "44 \#3531",
  MRreviewer =   "M. Muller",
  bibdate =      "Wed Dec 15 15:47:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$19.75",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  remark =       "Benford's Law is discussed on pp. 219--229.",
  tableofcontents = "3: Random Numbers \\
                 3.1. Introduction / 1 \\
                 3.2. Generating Uniform Random Numbers / 9 \\
                 3.2.1. The Linear Congruential Method / 9 \\
                 3.2.1.1. Choice of modulus / 11 \\
                 3.2.1.2. Choice of multiplier / 15 \\
                 3.2.1.3. Potency / 21 \\
                 3.2.2. Other Methods / 25 \\
                 3.3. Statistical Tests / 34 \\
                 3.3.1. General Test Procedures for Studying Random Data
                 / 35 \\
                 3.3.2. Empirical Tests / 54 \\
                 *3.3.3. Theoretical Tests / 69 \\
                 3.3.4. The Spectral Test / 82 \\
                 3.4. Other Types of Random Quantities / 100 \\
                 3.4.1. Numerical Distributions / 101 \\
                 3.4.2. Random Sampling and Shuffling / 121 \\
                 *3.5. What is a Random Sequence? / 127 \\
                 3.6. Summary / 155 \\
                 4: Arithmetic \\
                 4.1. Positional Number Systems / 162 \\
                 4.2. Floating-Point Arithmetic / 180 \\
                 4.2.1. Single-Precision Calculations / 180 \\
                 4.2.2. Accuracy of Floating-Point Arithmetic / 195 \\
                 *4.2.3. Double-Precision Calculations / 210 \\
                 4.2.4. Statistical Distribution / 218 \\
                 4.3. Multiple-Precision Arithmetic / 229 \\
                 4.3.1. The Classical Algorithms / 229 \\
                 *4.3.2. Modular Arithmetic / 248 \\
                 *4.3.3. How Fast Can We Multiply? / 258 \\
                 4.4. Radix Conversion / 280 \\
                 4.5. Rational Arithmetic / 290 \\
                 4.5.1. Fractions / 290 \\
                 4.5.2. The Greatest Common Divisor / 293 \\
                 *4.5.3. Analysis of Euclid's Algorithm / 316 \\
                 4.5.4. Factoring into Primes / 339 \\
                 4.6. Polynomial Arithmetic / 360 \\
                 4.6.1. Division of Polynomials / 363 \\
                 *4.6.2. Factorization of Polynomials / 381 \\
                 4.6.3. Evaluation of Powers / 398 \\
                 4.6.4. Evaluation of Polynomials / 422 \\
                 *4.7. Manipulation of Power Series / 444 \\
                 Answers to Exercises / 452 \\
                 Appendix A: MIX / 565 \\
                 1. Description of MIX / 565 \\
                 2. The MIX Assembly Language / 584 \\
                 Appendix B: Tables of Numerical Quantities / 596 \\
                 1. Fundamental Constants (decimal) / 596 \\
                 2. Fundamental Constants (octal) / 597 \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers / 598 \\
                 Appendix C: Index to Notations / 600 \\
                 Index and Glossary / 605",
  xxyear =       "{\noopsort{1968c}}1969",
}


bibtype: book
filename: master.bib
label: Knuth:ACP73-1
author: Donald E. Knuth
title: Fundamental Algorithms
volume: 1
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xxi + 634
year: 1973
ISBN: 0-201-03809-9 OR 0201038099
ISBN13: 978-0-201-03809-5 OR 9780201038095
LCCN: QA76.6 .K641 1973
bibdate: Wed Dec 15 10:36:21 1993
bibtimestamp: 1993.12.15 10:36:21 ???
series: The Art of Computer Programming
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Fundamental Algorithms
bibsource:
https://www.math.utah.edu/pub/tex/bib/cryptography.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
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 / 26 1.2.4. Integer Functions and Elementary Number Theory / 37 1.2.5. Permutations and Factorials / 44 1.2.6. Binomial Coefficients / 51 1.2.7. Harmonic Numbers / 73 1.2.8. Fibonacci Numbers / 78 1.2.9. Generating Functions / 86 1.2.10. Analysis of an Algorithm / 94 *1.2.11. Asymptotic Representations / 104 *1.2.11.1. The O-notation / 104 *1.2.11.2. Euler's summation formula / 108 *1.2.11.3. Some asymptotic calculations / 112 1.3. MIX / 120 1.3.1. Description of MIX / 120 1.3.2. The MIX Assembly Language / 141 1.3.3. Applications to Permutations / 160 1.4. Some Fundamental Programming Techniques / 182 1.4.1. Subroutines / 182 1.4.2. Coroutines / 190 1.4.3. Interpretive Routines / 197 1.4.3.1. A MIX simulator / 198 1.4.3.2. Trace routines / 208 1.4.4. Input and Output / 211 1.4.5. History and Bibliography / 225 2: Information Structures / 228 2.1. Introduction / 228 2.2 Linear Lists / 234 2.2.1. Stacks, Queues, and Deques / 234 2.2.2. Sequential Allocation / 240 2.2.3. Linked Allocation / 251 2.2.4. Circular Lists / 270 2.2.5. Doubly Linked Lists / 278 2.2.6. Arrays and Orthogonal Lists / 295 2.3. Trees / 305 2.3.1. Traversing Binary Trees / 315 2.3.2. Binary Tree Representation of Trees / 332 2.3.3. Other Representations of Trees / 347 2.3.4. Basic Mathematical Properties of Trees / 362 2.3.4.1. Free trees / 362 *2.3.4.2. Oriented trees / 371 *2.3.4.3. The ``infinity lemma'' / 381 *2.3.4.4. Enumeration of trees / 385 2.3.4.5. Path length / 399 *2.3.4.6. History and bibliography / 405 2.3.5. Lists and Garbage Collection / 406 2.4. Multilinked Structures / 423 2.5. Dynamic Storage Allocation / 435 2.6. History and Bibliography / 456 Answers to Exercises / 465 Appendix A: Index to Notations / 607 Appendix B: Tables of Numerical Quantities 1. Fundamental Constants (decimal) / 613 2. Fundamental Constants (octal) / 614 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers / 615 Index and Glossary / 617

rawTOC:
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 / 26 \\ 1.2.4. Integer Functions and Elementary Number Theory / 37 \\ 1.2.5. Permutations and Factorials / 44 \\ 1.2.6. Binomial Coefficients / 51 \\ 1.2.7. Harmonic Numbers / 73 \\ 1.2.8. Fibonacci Numbers / 78 \\ 1.2.9. Generating Functions / 86 \\ 1.2.10. Analysis of an Algorithm / 94 \\ *1.2.11. Asymptotic Representations / 104 \\ *1.2.11.1. The O-notation / 104 \\ *1.2.11.2. Euler's summation formula / 108 \\ *1.2.11.3. Some asymptotic calculations / 112 \\ 1.3. MIX / 120 \\ 1.3.1. Description of MIX / 120 \\ 1.3.2. The MIX Assembly Language / 141 \\ 1.3.3. Applications to Permutations / 160 \\ 1.4. Some Fundamental Programming Techniques / 182 \\ 1.4.1. Subroutines / 182 \\ 1.4.2. Coroutines / 190 \\ 1.4.3. Interpretive Routines / 197 \\ 1.4.3.1. A MIX simulator / 198 \\ 1.4.3.2. Trace routines / 208 \\ 1.4.4. Input and Output / 211 \\ 1.4.5. History and Bibliography / 225 \\ 2: Information Structures / 228 \\ 2.1. Introduction / 228 \\ 2.2 Linear Lists / 234 \\ 2.2.1. Stacks, Queues, and Deques / 234 \\ 2.2.2. Sequential Allocation / 240 \\ 2.2.3. Linked Allocation / 251 \\ 2.2.4. Circular Lists / 270 \\ 2.2.5. Doubly Linked Lists / 278 \\ 2.2.6. Arrays and Orthogonal Lists / 295 \\ 2.3. Trees / 305 \\ 2.3.1. Traversing Binary Trees / 315 \\ 2.3.2. Binary Tree Representation of Trees / 332 \\ 2.3.3. Other Representations of Trees / 347 \\ 2.3.4. Basic Mathematical Properties of Trees / 362 \\ 2.3.4.1. Free trees / 362 \\ *2.3.4.2. Oriented trees / 371 \\ *2.3.4.3. The ``infinity lemma'' / 381 \\ *2.3.4.4. Enumeration of trees / 385 \\ 2.3.4.5. Path length / 399 \\ *2.3.4.6. History and bibliography / 405 \\ 2.3.5. Lists and Garbage Collection / 406 \\ 2.4. Multilinked Structures / 423 \\ 2.5. Dynamic Storage Allocation / 435 \\ 2.6. History and Bibliography / 456 \\ Answers to Exercises / 465 \\ Appendix A: Index to Notations / 607 \\ Appendix B: Tables of Numerical Quantities \\ 1. Fundamental Constants (decimal) / 613 \\ 2. Fundamental Constants (octal) / 614 \\ 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers / 615 \\ Index and Glossary / 617

entry:
@Book{Knuth:ACP73-1,
  author =       "Donald E. Knuth",
  title =        "Fundamental Algorithms",
  volume =       "1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxi + 634",
  year =         "{\noopsort{1968b}}1973",
  ISBN =         "0-201-03809-9",
  ISBN-13 =      "978-0-201-03809-5",
  LCCN =         "QA76.6 .K641 1973",
  bibdate =      "Wed Dec 15 10:36:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Art of Computer Programming",
  acknowledgement = ack-nhfb,
  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 / 26 \\
                 1.2.4. Integer Functions and Elementary Number Theory /
                 37 \\
                 1.2.5. Permutations and Factorials / 44 \\
                 1.2.6. Binomial Coefficients / 51 \\
                 1.2.7. Harmonic Numbers / 73 \\
                 1.2.8. Fibonacci Numbers / 78 \\
                 1.2.9. Generating Functions / 86 \\
                 1.2.10. Analysis of an Algorithm / 94 \\
                 *1.2.11. Asymptotic Representations / 104 \\
                 *1.2.11.1. The O-notation / 104 \\
                 *1.2.11.2. Euler's summation formula / 108 \\
                 *1.2.11.3. Some asymptotic calculations / 112 \\
                 1.3. MIX / 120 \\
                 1.3.1. Description of MIX / 120 \\
                 1.3.2. The MIX Assembly Language / 141 \\
                 1.3.3. Applications to Permutations / 160 \\
                 1.4. Some Fundamental Programming Techniques / 182 \\
                 1.4.1. Subroutines / 182 \\
                 1.4.2. Coroutines / 190 \\
                 1.4.3. Interpretive Routines / 197 \\
                 1.4.3.1. A MIX simulator / 198 \\
                 1.4.3.2. Trace routines / 208 \\
                 1.4.4. Input and Output / 211 \\
                 1.4.5. History and Bibliography / 225 \\
                 2: Information Structures / 228 \\
                 2.1. Introduction / 228 \\
                 2.2 Linear Lists / 234 \\
                 2.2.1. Stacks, Queues, and Deques / 234 \\
                 2.2.2. Sequential Allocation / 240 \\
                 2.2.3. Linked Allocation / 251 \\
                 2.2.4. Circular Lists / 270 \\
                 2.2.5. Doubly Linked Lists / 278 \\
                 2.2.6. Arrays and Orthogonal Lists / 295 \\
                 2.3. Trees / 305 \\
                 2.3.1. Traversing Binary Trees / 315 \\
                 2.3.2. Binary Tree Representation of Trees / 332 \\
                 2.3.3. Other Representations of Trees / 347 \\
                 2.3.4. Basic Mathematical Properties of Trees / 362 \\
                 2.3.4.1. Free trees / 362 \\
                 *2.3.4.2. Oriented trees / 371 \\
                 *2.3.4.3. The ``infinity lemma'' / 381 \\
                 *2.3.4.4. Enumeration of trees / 385 \\
                 2.3.4.5. Path length / 399 \\
                 *2.3.4.6. History and bibliography / 405 \\
                 2.3.5. Lists and Garbage Collection / 406 \\
                 2.4. Multilinked Structures / 423 \\
                 2.5. Dynamic Storage Allocation / 435 \\
                 2.6. History and Bibliography / 456 \\
                 Answers to Exercises / 465 \\
                 Appendix A: Index to Notations / 607 \\
                 Appendix B: Tables of Numerical Quantities \\
                 1. Fundamental Constants (decimal) / 613 \\
                 2. Fundamental Constants (octal) / 614 \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers / 615 \\
                 Index and Glossary / 617",
}


bibtype: book
filename: master.bib
label: Knuth:ACP73-3
author: Donald E. Knuth
title: Sorting and Searching
volume: 3
publisher: pub-AW
address: pub-AW:adr
pages: xi + 723
year: 1973
ISBN: 0-201-03803-X OR 020103803X
ISBN13: 978-0-201-03803-3 OR 9780201038033
LCCN: QA76.5 .K74
bibdate: Wed Dec 15 15:47:47 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 15:47:47 ???
series: The Art of Computer Programming
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Sorting and Searching
TOC:
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 / 34 *5.1.4. Tableaux and Involutions / 48 5.2. Internal Sorting / 73 5.2.1. Sorting by Insertion / 80 5.2.2. Sorting by Exchanging / 105 5.2.3. Sorting by Selection / 139 5.2.4. Sorting by Merging / 159 5.2.5. Sorting by Distribution / 170 5.3. Optimum Sorting / 181 5.3.1. Minimum-Comparison Sorting / 181 *5.3.2. Minimum-Comparison Merging / 198 *5.3.3. Minimum-Comparison Selection / 209 *5.3.4. Networks for Sorting / 220 5.4. External Sorting / 247 5.4.1. Multiway Merging and Replacement Selection / 251 5.4.2. The Polyphase Merge / 266 5.4.3. The Cascade Merge / 289 5.4.4. Reading Tape Backwards / 301 5.4.5. The Oscillating Sort / 314 5.4.6. Practical Considerations for Tape Merging / 320 *5.4.7. External Radix Sorting / 347 *5.4.8. Two-Tape Sorting / 352 5.4.9. Disks and Drums / 361 5.5. Summary, History, and Bibliography / 379 6: Searching / 389 6.1. Sequential Searching / 393 6.2. Searching by Comparison of Keys / 406 6.2.1. Searching an Ordered Table / 406 6.2.2. Binary Tree Searching / 422 6.2.3. Balanced Trees / 451 6.2.4. Multiway Trees / 471 6.3. Digital Searching / 481 6.4. Hashing / 506 6.5. Retrieval on Secondary Keys / 550 Answers to Exercises / 571 Appendix A --- Tables of Numerical Quantities / 701 1. Fundamental Constants (decimal) / 701 2. Fundamental Constants (octal) / 702 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers / 703 Appendix B --- Index to Notations / 705 Index and Glossary / 710

rawTOC:
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 / 34 \\ *5.1.4. Tableaux and Involutions / 48 \\ 5.2. Internal Sorting / 73 \\ 5.2.1. Sorting by Insertion / 80 \\ 5.2.2. Sorting by Exchanging / 105 \\ 5.2.3. Sorting by Selection / 139 \\ 5.2.4. Sorting by Merging / 159 \\ 5.2.5. Sorting by Distribution / 170 \\ 5.3. Optimum Sorting / 181 \\ 5.3.1. Minimum-Comparison Sorting / 181 \\ *5.3.2. Minimum-Comparison Merging / 198 \\ *5.3.3. Minimum-Comparison Selection / 209 \\ *5.3.4. Networks for Sorting / 220 \\ 5.4. External Sorting / 247 \\ 5.4.1. Multiway Merging and Replacement Selection / 251 \\ 5.4.2. The Polyphase Merge / 266 \\ 5.4.3. The Cascade Merge / 289 \\ 5.4.4. Reading Tape Backwards / 301 \\ 5.4.5. The Oscillating Sort / 314 \\ 5.4.6. Practical Considerations for Tape Merging / 320 \\ *5.4.7. External Radix Sorting / 347 \\ *5.4.8. Two-Tape Sorting / 352 \\ 5.4.9. Disks and Drums / 361 \\ 5.5. Summary, History, and Bibliography / 379 \\ 6: Searching / 389 \\ 6.1. Sequential Searching / 393 \\ 6.2. Searching by Comparison of Keys / 406 \\ 6.2.1. Searching an Ordered Table / 406 \\ 6.2.2. Binary Tree Searching / 422 \\ 6.2.3. Balanced Trees / 451 \\ 6.2.4. Multiway Trees / 471 \\ 6.3. Digital Searching / 481 \\ 6.4. Hashing / 506 \\ 6.5. Retrieval on Secondary Keys / 550 \\ Answers to Exercises / 571 \\ Appendix A --- Tables of Numerical Quantities / 701 \\ 1. Fundamental Constants (decimal) / 701 \\ 2. Fundamental Constants (octal) / 702 \\ 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers / 703 \\ Appendix B --- Index to Notations / 705 \\ Index and Glossary / 710

entry:
@Book{Knuth:ACP73-3,
  author =       "Donald E. Knuth",
  title =        "Sorting and Searching",
  volume =       "3",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 723",
  year =         "1973",
  ISBN =         "0-201-03803-X",
  ISBN-13 =      "978-0-201-03803-3",
  LCCN =         "QA76.5 .K74",
  bibdate =      "Wed Dec 15 15:47:47 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  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 / 34 \\
                 *5.1.4. Tableaux and Involutions / 48 \\
                 5.2. Internal Sorting / 73 \\
                 5.2.1. Sorting by Insertion / 80 \\
                 5.2.2. Sorting by Exchanging / 105 \\
                 5.2.3. Sorting by Selection / 139 \\
                 5.2.4. Sorting by Merging / 159 \\
                 5.2.5. Sorting by Distribution / 170 \\
                 5.3. Optimum Sorting / 181 \\
                 5.3.1. Minimum-Comparison Sorting / 181 \\
                 *5.3.2. Minimum-Comparison Merging / 198 \\
                 *5.3.3. Minimum-Comparison Selection / 209 \\
                 *5.3.4. Networks for Sorting / 220 \\
                 5.4. External Sorting / 247 \\
                 5.4.1. Multiway Merging and Replacement Selection / 251
                 \\
                 5.4.2. The Polyphase Merge / 266 \\
                 5.4.3. The Cascade Merge / 289 \\
                 5.4.4. Reading Tape Backwards / 301 \\
                 5.4.5. The Oscillating Sort / 314 \\
                 5.4.6. Practical Considerations for Tape Merging / 320
                 \\
                 *5.4.7. External Radix Sorting / 347 \\
                 *5.4.8. Two-Tape Sorting / 352 \\
                 5.4.9. Disks and Drums / 361 \\
                 5.5. Summary, History, and Bibliography / 379 \\
                 6: Searching / 389 \\
                 6.1. Sequential Searching / 393 \\
                 6.2. Searching by Comparison of Keys / 406 \\
                 6.2.1. Searching an Ordered Table / 406 \\
                 6.2.2. Binary Tree Searching / 422 \\
                 6.2.3. Balanced Trees / 451 \\
                 6.2.4. Multiway Trees / 471 \\
                 6.3. Digital Searching / 481 \\
                 6.4. Hashing / 506 \\
                 6.5. Retrieval on Secondary Keys / 550 \\
                 Answers to Exercises / 571 \\
                 Appendix A --- Tables of Numerical Quantities / 701 \\
                 1. Fundamental Constants (decimal) / 701 \\
                 2. Fundamental Constants (octal) / 702 \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers / 703 \\
                 Appendix B --- Index to Notations / 705 \\
                 Index and Glossary / 710",
}


bibtype: book
filename: master.bib
label: Knuth:ct-b
author: Donald E. Knuth
title: TeX : The Program
volume: B
publisher: pub-AW
address: pub-AW:adr
pages: xv + 594
year: 1986
ISBN: 0-201-13437-3 OR 0201134373
ISBN13: 978-0-201-13437-7 OR 9780201134377
LCCN: Z253.4.T47 K578 1986
bibdate: Wed Dec 15 10:36:54 1993
bibtimestamp: 1993.12.15 10:36:54 ???
series: Computers and Typesetting
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: {\TeX}: The Program
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/texgraph.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib

TOC:
1 Introduction / 1 2 The character set / 17 3 Input and output / 25 4 String handling / 38 5 On-line and off-line printing / 54 6 Reporting errors / 72 7 Arithmetic with scaled dimensions / 99 8 Packed data / 110 9 Dynamic memory allocation / 115 10 Data structures for boxes and their friends / 133 11 Memory layout / 162 12 Displaying boxes / 173 13 Destroying boxes / 199 14 Copying boxes / 203 15 The command codes / 207 16 The semantic nest / 211 17 The table of equivalents / 220 18 The hash table / 256 19 Saving and restoring equivalents / 268 20 Token lists / 289 21 Introduction to the syntactic routines / 297 22 Input stacks and states / 300 23 Maintaining the input stacks / 321 24 Getting the next token / 332 25 Expanding the next token / 366 26 Basic scanning subroutines / 402 27 Building token lists / 464 28 Conditional processing / 487 29 File names / 511 30 Font metric data / 539 31 Device-independent file format / 583 32 Shipping pages out / 592 33 Packaging / 644 34 Data structures for math mode / 680 35 Subroutines for math mode / 699 36 Typesetting math formulas / 719 37 Alignment / 768 38 Breaking paragraphs into lines / 813 39 Breaking paragraphs into lines, continued / 862 40 Pre-hyphenation / 891 41 Post-hyphenation / 900 42 Hyphenation / 919 43 Initializing the hyphenation tables / 942 44 Breaking vertical lists into pages / 967 45 The page builder / 980 46 The chief executive / 1029 47 Building boxes and lists / 1055 48 Building math lists / 1136 49 Mode-independent processing / 1208 50 Dumping and undumping the tables / 1299 51 The main program / 1330 52 Debugging / 1338 53 Extensions / 1340 54 System-dependent changes / 1376 55 Index / 1377

rawTOC:
1 Introduction / \S 1 \\ 2 The character set / \S 17 \\ 3 Input and output / \S 25 \\ 4 String handling / \S 38 \\ 5 On-line and off-line printing / \S 54 \\ 6 Reporting errors / \S 72 \\ 7 Arithmetic with scaled dimensions / \S 99 \\ 8 Packed data / \S 110 \\ 9 Dynamic memory allocation / \S 115 \\ 10 Data structures for boxes and their friends / \S 133 \\ 11 Memory layout / \S 162 \\ 12 Displaying boxes / \S 173 \\ 13 Destroying boxes / \S 199 \\ 14 Copying boxes / \S 203 \\ 15 The command codes / \S 207 \\ 16 The semantic nest / \S 211 \\ 17 The table of equivalents / \S 220 \\ 18 The hash table / \S 256 \\ 19 Saving and restoring equivalents / \S 268 \\ 20 Token lists / \S 289 \\ 21 Introduction to the syntactic routines / \S 297 \\ 22 Input stacks and states / \S 300 \\ 23 Maintaining the input stacks / \S 321 \\ 24 Getting the next token / \S 332 \\ 25 Expanding the next token / \S 366 \\ 26 Basic scanning subroutines / \S 402 \\ 27 Building token lists / \S 464 \\ 28 Conditional processing / \S 487 \\ 29 File names / \S 511 \\ 30 Font metric data / \S 539 \\ 31 Device-independent file format / \S 583 \\ 32 Shipping pages out / \S 592 \\ 33 Packaging / \S 644 \\ 34 Data structures for math mode / \S 680 \\ 35 Subroutines for math mode / \S 699 \\ 36 Typesetting math formulas / \S 719 \\ 37 Alignment / \S 768 \\ 38 Breaking paragraphs into lines / \S 813 \\ 39 Breaking paragraphs into lines, continued / \S 862 \\ 40 Pre-hyphenation / \S 891 \\ 41 Post-hyphenation / \S 900 \\ 42 Hyphenation / \S 919 \\ 43 Initializing the hyphenation tables / \S 942 \\ 44 Breaking vertical lists into pages / \S 967 \\ 45 The page builder / \S 980 \\ 46 The chief executive / \S 1029 \\ 47 Building boxes and lists / \S 1055 \\ 48 Building math lists / \S 1136 \\ 49 Mode-independent processing / \S 1208 \\ 50 Dumping and undumping the tables / \S 1299 \\ 51 The main program / \S 1330 \\ 52 Debugging / \S 1338 \\ 53 Extensions / \S 1340 \\ 54 System-dependent changes / \S 1376 \\ 55 Index / \S 1377

entry:
@Book{Knuth:ct-b,
  author =       "Donald E. Knuth",
  title =        "{\TeX}: The Program",
  volume =       "B",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 594",
  year =         "{\noopsort{1986b}}1986",
  ISBN =         "0-201-13437-3",
  ISBN-13 =      "978-0-201-13437-7",
  LCCN =         "Z253.4.T47 K578 1986",
  bibdate =      "Wed Dec 15 10:36:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/litprog.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Introduction / \S 1 \\
                 2 The character set / \S 17 \\
                 3 Input and output / \S 25 \\
                 4 String handling / \S 38 \\
                 5 On-line and off-line printing / \S 54 \\
                 6 Reporting errors / \S 72 \\
                 7 Arithmetic with scaled dimensions / \S 99 \\
                 8 Packed data / \S 110 \\
                 9 Dynamic memory allocation / \S 115 \\
                 10 Data structures for boxes and their friends / \S 133
                 \\
                 11 Memory layout / \S 162 \\
                 12 Displaying boxes / \S 173 \\
                 13 Destroying boxes / \S 199 \\
                 14 Copying boxes / \S 203 \\
                 15 The command codes / \S 207 \\
                 16 The semantic nest / \S 211 \\
                 17 The table of equivalents / \S 220 \\
                 18 The hash table / \S 256 \\
                 19 Saving and restoring equivalents / \S 268 \\
                 20 Token lists / \S 289 \\
                 21 Introduction to the syntactic routines / \S 297 \\
                 22 Input stacks and states / \S 300 \\
                 23 Maintaining the input stacks / \S 321 \\
                 24 Getting the next token / \S 332 \\
                 25 Expanding the next token / \S 366 \\
                 26 Basic scanning subroutines / \S 402 \\
                 27 Building token lists / \S 464 \\
                 28 Conditional processing / \S 487 \\
                 29 File names / \S 511 \\
                 30 Font metric data / \S 539 \\
                 31 Device-independent file format / \S 583 \\
                 32 Shipping pages out / \S 592 \\
                 33 Packaging / \S 644 \\
                 34 Data structures for math mode / \S 680 \\
                 35 Subroutines for math mode / \S 699 \\
                 36 Typesetting math formulas / \S 719 \\
                 37 Alignment / \S 768 \\
                 38 Breaking paragraphs into lines / \S 813 \\
                 39 Breaking paragraphs into lines, continued / \S 862
                 \\
                 40 Pre-hyphenation / \S 891 \\
                 41 Post-hyphenation / \S 900 \\
                 42 Hyphenation / \S 919 \\
                 43 Initializing the hyphenation tables / \S 942 \\
                 44 Breaking vertical lists into pages / \S 967 \\
                 45 The page builder / \S 980 \\
                 46 The chief executive / \S 1029 \\
                 47 Building boxes and lists / \S 1055 \\
                 48 Building math lists / \S 1136 \\
                 49 Mode-independent processing / \S 1208 \\
                 50 Dumping and undumping the tables / \S 1299 \\
                 51 The main program / \S 1330 \\
                 52 Debugging / \S 1338 \\
                 53 Extensions / \S 1340 \\
                 54 System-dependent changes / \S 1376 \\
                 55 Index / \S 1377",
}


bibtype: book
filename: master.bib
label: Knuth:ct-c
author: Donald E. Knuth
title: The METAFONT book
volume: C
publisher: pub-AW
address: pub-AW:adr
pages: xi + 361
year: 1986
LCCN: Z250.8.M46 K58 1986
bibdate: Wed Dec 15 10:37:29 1993
bibtimestamp: 1993.12.15 10:37:29 ???
series: Computers and Typesetting
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: The {\METAFONT}book
ISBN:
0-201-13445-4 (hardcover), 0-201-13444-6 (paperback) OR 0201134454 (hardcover), 0201134446 (paperback)

ISBN13:
978-0-201-13445-2 (hardcover), 978-0-201-13444-5 (paperback) OR 9780201134452 (hardcover), 9780201134445 (paperback)

bibsource:
https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/font.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/texgraph.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib

TOC:
1 The Name of the Game / 1 2 Coordinates / 5 3 Curves / 13 4 Pens / 21 5 Running METAFONT / 31 6 How METAFONT Reads What You Type / 49 7 Variables / 53 8 Algebraic Expressions / 59 9 Equations / 75 10 Assignments / 87 11 Magnification and Resolution / 91 12 Boxes / 101 13 Drawing, Filling, and Erasing / 109 14 Paths / 123 15 Transformations / 141 16 Calligraphic Effects / 147 17 Grouping / 155 18 Definitions ( also called Macros) / 159 19 Conditions and Loops / 169 20 More about Macros / 175 21 Random Numbers / 183 22 Strings / 187 23 Online Displays / 191 24 Discreteness and Discretion / 195 25 Summary of Expressions / 209 26 Summary of the Language / 217 27 Recovering from Errors / 223 Appendices A Answers to All the Exercises / 233 B Basic Operations / 257 C Character Codes / 281 D Dirty Tricks / 285 E Examples / 301 F Font Metric Information / 315 G Generic Font Files / 323 H Hardcopy Proofs / 327 I Index / 345 J Joining the TeX Community / 361

rawTOC:
1 The Name of the Game / 1 \\ 2 Coordinates / 5 \\ 3 Curves / 13 \\ 4 Pens / 21 \\ 5 Running \METAFONT{} / 31 \\ 6 How \METAFONT{} Reads What You Type / 49 \\ 7 Variables / 53 \\ 8 Algebraic Expressions / 59 \\ 9 Equations / 75 \\ 10 Assignments / 87 \\ 11 Magnification and Resolution / 91 \\ 12 Boxes / 101 \\ 13 Drawing, Filling, and Erasing / 109 \\ 14 Paths / 123 \\ 15 Transformations / 141 \\ 16 Calligraphic Effects / 147 \\ 17 Grouping / 155 \\ 18 Definitions ( also called Macros) / 159 \\ 19 Conditions and Loops / 169 \\ 20 More about Macros / 175 \\ 21 Random Numbers / 183 \\ 22 Strings / 187 \\ 23 Online Displays / 191 \\ 24 Discreteness and Discretion / 195 \\ 25 Summary of Expressions / 209 \\ 26 Summary of the Language / 217 \\ 27 Recovering from Errors / 223 \\ Appendices \\ A Answers to All the Exercises / 233 \\ B Basic Operations / 257 \\ C Character Codes / 281 \\ D Dirty Tricks / 285 \\ E Examples / 301 \\ F Font Metric Information / 315 \\ G Generic Font Files / 323 \\ H Hardcopy Proofs / 327 \\ I Index / 345 \\ J Joining the \TeX{} Community / 361

entry:
@Book{Knuth:ct-c,
  author =       "Donald E. Knuth",
  title =        "The {\METAFONT}book",
  volume =       "C",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xi + 361",
  year =         "{\noopsort{1986c}}1986",
  ISBN =         "0-201-13445-4 (hardcover), 0-201-13444-6 (paperback)",
  ISBN-13 =      "978-0-201-13445-2 (hardcover), 978-0-201-13444-5
                 (paperback)",
  LCCN =         "Z250.8.M46 K58 1986",
  bibdate =      "Wed Dec 15 10:37:29 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/font.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 The Name of the Game / 1 \\
                 2 Coordinates / 5 \\
                 3 Curves / 13 \\
                 4 Pens / 21 \\
                 5 Running \METAFONT{} / 31 \\
                 6 How \METAFONT{} Reads What You Type / 49 \\
                 7 Variables / 53 \\
                 8 Algebraic Expressions / 59 \\
                 9 Equations / 75 \\
                 10 Assignments / 87 \\
                 11 Magnification and Resolution / 91 \\
                 12 Boxes / 101 \\
                 13 Drawing, Filling, and Erasing / 109 \\
                 14 Paths / 123 \\
                 15 Transformations / 141 \\
                 16 Calligraphic Effects / 147 \\
                 17 Grouping / 155 \\
                 18 Definitions ( also called Macros) / 159 \\
                 19 Conditions and Loops / 169 \\
                 20 More about Macros / 175 \\
                 21 Random Numbers / 183 \\
                 22 Strings / 187 \\
                 23 Online Displays / 191 \\
                 24 Discreteness and Discretion / 195 \\
                 25 Summary of Expressions / 209 \\
                 26 Summary of the Language / 217 \\
                 27 Recovering from Errors / 223 \\
                 Appendices \\
                 A Answers to All the Exercises / 233 \\
                 B Basic Operations / 257 \\
                 C Character Codes / 281 \\
                 D Dirty Tricks / 285 \\
                 E Examples / 301 \\
                 F Font Metric Information / 315 \\
                 G Generic Font Files / 323 \\
                 H Hardcopy Proofs / 327 \\
                 I Index / 345 \\
                 J Joining the \TeX{} Community / 361",
}


bibtype: book
filename: master.bib
label: Knuth:ct-d
author: Donald E. Knuth
title: METAFONT : The Program
volume: D
publisher: pub-AW
address: pub-AW:adr
pages: xv + 560
year: 1986
ISBN: 0-201-13438-1 OR 0201134381
ISBN13: 978-0-201-13438-4 OR 9780201134384
LCCN: Z250.8.M46 K578 1986
bibdate: Wed Dec 15 10:37:32 1993
bibtimestamp: 1993.12.15 10:37:32 ???
series: Computers and Typesetting
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: {\METAFONT}: The Program
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/font.bib; https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/texgraph.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib

TOC:
1 Introduction / 1 2 The character set / 17 3 Input and output / 24 4 String handling / 37 5 On-line and off-line printing / 54 6 Reporting errors / 67 7 Arithmetic with scaled numbers / 95 8 Algebraic and transcendental functions / 120 9 Packed data / 153 10 Dynamic memory allocation / 158 11 Memory layout / 175 12 The command codes / 186 13 The hash table / 200 14 Token lists / 214 15 Data structures for variables / 228 16 Saving and restoring equivalents / 250 17 Data structures for paths / 255 18 Choosing control points / 269 19 Generating discrete moves / 303 20 Edge structures / 323 21 Subdivision into octants / 386 22 Filling a contour / 460 23 Polygonal pens / 469 24 Filling an envelope / 490 25 Elliptical pens / 524 26 Direction and intersection times / 538 27 Online graphic output / 564 28 Dynamic linear equations / 585 29 Dynamic nonlinear equations / 618 30 Introduction to the syntactic routines / 624 31 Input stacks and states / 627 32 Maintaining the input stacks / 647 33 Getting the next token / 658 34 Scanning macro definitions / 683 35 Expanding the next token / 706 36 Conditional processing / 738 37 Iterations / 752 38 File names / 766 39 Introduction to the parsing routines / 796 40 Parsing primary expressions / 823 41 Parsing secondary and higher expressions / 862 42 Doing the operations / 893 43 Statements and commands / 989 44 Commands / 1020 45 Font metric data / 1087 46 Generic font file format / 1142 47 Shipping characters out / 1149 48 Dumping and undumping the tables / 1183 49 The main program / 1202 50 Debugging / 1212 51 System-dependent changes / 1214 52 Index / 1215

rawTOC:
1 Introduction / \S 1 \\ 2 The character set / \S 17 \\ 3 Input and output / \S 24 \\ 4 String handling / \S 37 \\ 5 On-line and off-line printing / \S 54 \\ 6 Reporting errors / \S 67 \\ 7 Arithmetic with scaled numbers / \S 95 \\ 8 Algebraic and transcendental functions / \S 120 \\ 9 Packed data / \S 153 \\ 10 Dynamic memory allocation / \S 158 \\ 11 Memory layout / \S 175 \\ 12 The command codes / \S 186 \\ 13 The hash table / \S 200 \\ 14 Token lists / \S 214 \\ 15 Data structures for variables / \S 228 \\ 16 Saving and restoring equivalents / \S 250 \\ 17 Data structures for paths / \S 255 \\ 18 Choosing control points / \S 269 \\ 19 Generating discrete moves / \S 303 \\ 20 Edge structures / \S 323 \\ 21 Subdivision into octants / \S 386 \\ 22 Filling a contour / \S 460 \\ 23 Polygonal pens / \S 469 \\ 24 Filling an envelope / \S 490 \\ 25 Elliptical pens / \S 524 \\ 26 Direction and intersection times / \S 538 \\ 27 Online graphic output / \S 564 \\ 28 Dynamic linear equations / \S 585 \\ 29 Dynamic nonlinear equations / \S 618 \\ 30 Introduction to the syntactic routines / \S 624 \\ 31 Input stacks and states / \S 627 \\ 32 Maintaining the input stacks / \S 647 \\ 33 Getting the next token / \S 658 \\ 34 Scanning macro definitions / \S 683 \\ 35 Expanding the next token / \S 706 \\ 36 Conditional processing / \S 738 \\ 37 Iterations / \S 752 \\ 38 File names / \S 766 \\ 39 Introduction to the parsing routines / \S 796 \\ 40 Parsing primary expressions / \S 823 \\ 41 Parsing secondary and higher expressions / \S 862 \\ 42 Doing the operations / \S 893 \\ 43 Statements and commands / \S 989 \\ 44 Commands / \S 1020 \\ 45 Font metric data / \S 1087 \\ 46 Generic font file format / \S 1142 \\ 47 Shipping characters out / \S 1149 \\ 48 Dumping and undumping the tables / \S 1183 \\ 49 The main program / \S 1202 \\ 50 Debugging / \S 1212 \\ 51 System-dependent changes / \S 1214 \\ 52 Index / \S 1215

entry:
@Book{Knuth:ct-d,
  author =       "Donald E. Knuth",
  title =        "{\METAFONT}: The Program",
  volume =       "D",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 560",
  year =         "{\noopsort{1986d}}1986",
  ISBN =         "0-201-13438-1",
  ISBN-13 =      "978-0-201-13438-4",
  LCCN =         "Z250.8.M46 K578 1986",
  bibdate =      "Wed Dec 15 10:37:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/font.bib;
                 https://www.math.utah.edu/pub/tex/bib/litprog.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Introduction / \S 1 \\
                 2 The character set / \S 17 \\
                 3 Input and output / \S 24 \\
                 4 String handling / \S 37 \\
                 5 On-line and off-line printing / \S 54 \\
                 6 Reporting errors / \S 67 \\
                 7 Arithmetic with scaled numbers / \S 95 \\
                 8 Algebraic and transcendental functions / \S 120 \\
                 9 Packed data / \S 153 \\
                 10 Dynamic memory allocation / \S 158 \\
                 11 Memory layout / \S 175 \\
                 12 The command codes / \S 186 \\
                 13 The hash table / \S 200 \\
                 14 Token lists / \S 214 \\
                 15 Data structures for variables / \S 228 \\
                 16 Saving and restoring equivalents / \S 250 \\
                 17 Data structures for paths / \S 255 \\
                 18 Choosing control points / \S 269 \\
                 19 Generating discrete moves / \S 303 \\
                 20 Edge structures / \S 323 \\
                 21 Subdivision into octants / \S 386 \\
                 22 Filling a contour / \S 460 \\
                 23 Polygonal pens / \S 469 \\
                 24 Filling an envelope / \S 490 \\
                 25 Elliptical pens / \S 524 \\
                 26 Direction and intersection times / \S 538 \\
                 27 Online graphic output / \S 564 \\
                 28 Dynamic linear equations / \S 585 \\
                 29 Dynamic nonlinear equations / \S 618 \\
                 30 Introduction to the syntactic routines / \S 624 \\
                 31 Input stacks and states / \S 627 \\
                 32 Maintaining the input stacks / \S 647 \\
                 33 Getting the next token / \S 658 \\
                 34 Scanning macro definitions / \S 683 \\
                 35 Expanding the next token / \S 706 \\
                 36 Conditional processing / \S 738 \\
                 37 Iterations / \S 752 \\
                 38 File names / \S 766 \\
                 39 Introduction to the parsing routines / \S 796 \\
                 40 Parsing primary expressions / \S 823 \\
                 41 Parsing secondary and higher expressions / \S 862
                 \\
                 42 Doing the operations / \S 893 \\
                 43 Statements and commands / \S 989 \\
                 44 Commands / \S 1020 \\
                 45 Font metric data / \S 1087 \\
                 46 Generic font file format / \S 1142 \\
                 47 Shipping characters out / \S 1149 \\
                 48 Dumping and undumping the tables / \S 1183 \\
                 49 The main program / \S 1202 \\
                 50 Debugging / \S 1212 \\
                 51 System-dependent changes / \S 1214 \\
                 52 Index / \S 1215",
}


bibtype: book
filename: master.bib
label: Knuth:ct-e
author: Donald E. Knuth
title: Computer Modern Typefaces
volume: E
publisher: pub-AW
address: pub-AW:adr
pages: xv + 588
year: 1986
ISBN: 0-201-13446-2 OR 0201134462
ISBN13: 978-0-201-13446-9 OR 9780201134469
LCCN: Z250.8.M46 K574 1986
bibdate: Wed Dec 15 10:37:33 1993
bibtimestamp: 1993.12.15 10:37:33 ???
series: Computers and Typesetting
remark: Reprinted with corrections July, 1987.
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: {Computer Modern} Typefaces
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/font.bib; https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib; https://www.math.utah.edu/pub/tex/bib/texgraph.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib

TOC:
Introduction to the Parameters / 1 Organization of the Files / 8 Parameter Files / 10 Driver Files / 36 tt roman: Roman text and typewriter text / 36 tt title: Caps and digits only / 38 tt texset: Extended ASCII character set / 38 tt csc: Caps and small caps / 40 tt textit: Italic text and typewriter text / 41 tt mathit: Math italic / 42 tt mathsy: Math symbols / 44 tt mathex: Math extension characters / 44 Program Files / 46 tt accent: Accents common to roman and italic / 49 tt bigacc: Wide accents for math extension font / 63 tt bigdel: Delimiters for math extension font / 66 tt bigop: Operators for math extension font / 103 tt calu: Calligraphic capitals / 123 tt comlig: Ligatures common to roman and italic / 141 tt cscspu: Special uppercase for caps and small caps / 145 tt greekl: Lowercase Greek / 147 tt greeku: Upper case Greek / 171 tt itald: Italic digits / 193 tt italig: Italic f-ligatures / 199 tt itall: Italic lowercase / 209 tt italms: Italic math specials / 233 tt italp: Italic punctuation / 239 tt italsp: Special lowercase for italic / 245 tt olddig: Oldstyle digits / 251 tt punct: Punctuation common to roman and italic / 265 tt romand: Roman digits / 285 tt romanl: Roman lowercase / 305 tt romanp: Roman punctuation / 361 tt romanu: Roman uppercase / 369 tt romlig: Roman f-ligatures / 421 tt romms: Roman math specials / 431 tt romspl: Special lowercase for roman / 443 tt romspu: Special uppercase for roman / 451 tt romsub: Substitutes for ligatures / 457 tt sym: Math symbols common to several fonts / 459 tt symbol: Math symbols in symbol font only / 483 tt tset: Extended ASCII symbols / 542 tt tsetsl: Extended ASCII symbols to be slanted / 543 The Base File / 545 Font Specimens / 554 General Index / 571 Index to Character Programs / 581

rawTOC:
Introduction to the Parameters / 1 \\ Organization of the Files / 8 \\ Parameter Files / 10 \\ Driver Files / 36 \\ {\tt roman}: Roman text and typewriter text / 36 \\ {\tt title}: Caps and digits only / 38 \\ {\tt texset}: Extended ASCII character set / 38 \\ {\tt csc}: Caps and small caps / 40 \\ {\tt textit}: Italic text and typewriter text / 41 \\ {\tt mathit}: Math italic / 42 \\ {\tt mathsy}: Math symbols / 44 \\ {\tt mathex}: Math extension characters / 44 \\ Program Files / 46 \\ {\tt accent}: Accents common to roman and italic / 49 \\ {\tt bigacc}: Wide accents for math extension font / 63 \\ {\tt bigdel}: Delimiters for math extension font / 66 \\ {\tt bigop}: Operators for math extension font / 103 \\ {\tt calu}: Calligraphic capitals / 123 \\ {\tt comlig}: Ligatures common to roman and italic / 141 \\ {\tt cscspu}: Special uppercase for caps and small caps / 145 \\ {\tt greekl}: Lowercase Greek / 147 \\ {\tt greeku}: Upper case Greek / 171 \\ {\tt itald}: Italic digits / 193 \\ {\tt italig}: Italic f-ligatures / 199 \\ {\tt itall}: Italic lowercase / 209 \\ {\tt italms}: Italic math specials / 233 \\ {\tt italp}: Italic punctuation / 239 \\ {\tt italsp}: Special lowercase for italic / 245 \\ {\tt olddig}: Oldstyle digits / 251 \\ {\tt punct}: Punctuation common to roman and italic / 265 \\ {\tt romand}: Roman digits / 285 \\ {\tt romanl}: Roman lowercase / 305 \\ {\tt romanp}: Roman punctuation / 361 \\ {\tt romanu}: Roman uppercase / 369 \\ {\tt romlig}: Roman f-ligatures / 421 \\ {\tt romms}: Roman math specials / 431 \\ {\tt romspl}: Special lowercase for roman / 443 \\ {\tt romspu}: Special uppercase for roman / 451 \\ {\tt romsub}: Substitutes for ligatures / 457 \\ {\tt sym}: Math symbols common to several fonts / 459 \\ {\tt symbol}: Math symbols in symbol font only / 483 \\ {\tt tset}: Extended ASCII symbols / 542 \\ {\tt tsetsl}: Extended ASCII symbols to be slanted / 543 \\ The Base File / 545 \\ Font Specimens / 554 \\ General Index / 571 Index to Character Programs / 581

entry:
@Book{Knuth:ct-e,
  author =       "Donald E. Knuth",
  title =        "{Computer Modern} Typefaces",
  volume =       "E",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 588",
  year =         "{\noopsort{1986e}}1986",
  ISBN =         "0-201-13446-2",
  ISBN-13 =      "978-0-201-13446-9",
  LCCN =         "Z250.8.M46 K574 1986",
  bibdate =      "Wed Dec 15 10:37:33 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/font.bib;
                 https://www.math.utah.edu/pub/tex/bib/litprog.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib",
  series =       "Computers and Typesetting",
  acknowledgement = ack-nhfb,
  remark =       "Reprinted with corrections July, 1987.",
  tableofcontents = "Introduction to the Parameters / 1 \\
                 Organization of the Files / 8 \\
                 Parameter Files / 10 \\
                 Driver Files / 36 \\
                 {\tt roman}: Roman text and typewriter text / 36 \\
                 {\tt title}: Caps and digits only / 38 \\
                 {\tt texset}: Extended ASCII character set / 38 \\
                 {\tt csc}: Caps and small caps / 40 \\
                 {\tt textit}: Italic text and typewriter text / 41 \\
                 {\tt mathit}: Math italic / 42 \\
                 {\tt mathsy}: Math symbols / 44 \\
                 {\tt mathex}: Math extension characters / 44 \\
                 Program Files / 46 \\
                 {\tt accent}: Accents common to roman and italic / 49
                 \\
                 {\tt bigacc}: Wide accents for math extension font / 63
                 \\
                 {\tt bigdel}: Delimiters for math extension font / 66
                 \\
                 {\tt bigop}: Operators for math extension font / 103
                 \\
                 {\tt calu}: Calligraphic capitals / 123 \\
                 {\tt comlig}: Ligatures common to roman and italic /
                 141 \\
                 {\tt cscspu}: Special uppercase for caps and small caps
                 / 145 \\
                 {\tt greekl}: Lowercase Greek / 147 \\
                 {\tt greeku}: Upper case Greek / 171 \\
                 {\tt itald}: Italic digits / 193 \\
                 {\tt italig}: Italic f-ligatures / 199 \\
                 {\tt itall}: Italic lowercase / 209 \\
                 {\tt italms}: Italic math specials / 233 \\
                 {\tt italp}: Italic punctuation / 239 \\
                 {\tt italsp}: Special lowercase for italic / 245 \\
                 {\tt olddig}: Oldstyle digits / 251 \\
                 {\tt punct}: Punctuation common to roman and italic /
                 265 \\
                 {\tt romand}: Roman digits / 285 \\
                 {\tt romanl}: Roman lowercase / 305 \\
                 {\tt romanp}: Roman punctuation / 361 \\
                 {\tt romanu}: Roman uppercase / 369 \\
                 {\tt romlig}: Roman f-ligatures / 421 \\
                 {\tt romms}: Roman math specials / 431 \\
                 {\tt romspl}: Special lowercase for roman / 443 \\
                 {\tt romspu}: Special uppercase for roman / 451 \\
                 {\tt romsub}: Substitutes for ligatures / 457 \\
                 {\tt sym}: Math symbols common to several fonts / 459
                 \\
                 {\tt symbol}: Math symbols in symbol font only / 483
                 \\
                 {\tt tset}: Extended ASCII symbols / 542 \\
                 {\tt tsetsl}: Extended ASCII symbols to be slanted /
                 543 \\
                 The Base File / 545 \\
                 Font Specimens / 554 \\
                 General Index / 571 Index to Character Programs / 581",
}


bibtype: article
filename: master.bib
label: Knuth:goto
author: D. E. Knuth
title: Structured Programming with Go To Statements
journal: j-CS
volume: 6
pages: 261--301
year: 1974
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
note: This paper is a response to cite Dijkstra:goto-harmful.
acknowledgement: ack-nhfb
rawauthor: D. E. Knuth
rawnote: This paper is a response to \cite{Dijkstra:goto-harmful}.
rawtitle: Structured Programming with Go To Statements
entry:
@Article{Knuth:goto,
  author =       "D. E. Knuth",
  title =        "Structured Programming with Go To Statements",
  journal =      j-CS,
  volume =       "6",
  pages =        "261--301",
  year =         "1974",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This paper is a response to
                 \cite{Dijkstra:goto-harmful}.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Knuth:halftone
author: Donald E. Knuth
title: Digital Halftones by Dot Diffusion
journal: j-TOG
volume: 6
number: 4
pages: 245--273
month: oct
monthnumber: 10
year: 1987
bibdate: Fri Aug 26 08:55:16 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.26 08:55:16 ???
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Digital Halftones by Dot Diffusion
entry:
@Article{Knuth:halftone,
  author =       "Donald E. Knuth",
  title =        "Digital Halftones by Dot Diffusion",
  journal =      j-TOG,
  volume =       "6",
  number =       "4",
  pages =        "245--273",
  month =        oct,
  year =         "1987",
  bibdate =      "Fri Aug 26 08:55:16 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: manual
filename: master.bib
label: Knuth:math-writing
author: Donald E. Knuth and Tracy Larrabee and Paul M. Roberts
title: Mathematical Writing
organization: Mathematical Association of America Notes Number 14
pages: 245--273
year: 1989
ISBN: 0-88385-063-X OR 088385063X
ISBN13: 978-0-88385-063-3 OR 9780883850633
LCCN: QA42 .K58 1989
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth and Tracy Larrabee and Paul M. Roberts
rawtitle: Mathematical Writing
entry:
@Manual{Knuth:math-writing,
  author =       "Donald E. Knuth and Tracy Larrabee and Paul M.
                 Roberts",
  title =        "Mathematical Writing",
  organization = "Mathematical Association of America Notes Number 14",
  year =         "1989",
  ISBN =         "0-88385-063-X",
  ISBN-13 =      "978-0-88385-063-3",
  LCCN =         "QA42 .K58 1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Knuth:new-tex-mf
author: Donald E. Knuth and Joe Weening
title: New TeX / METAFONT sources available on Stanford's master archive
journal: j-TEXHAX
volume: 90
number: 13
pages: 245--273
month: jan
monthnumber: 1
year: 1990
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth and Joe Weening
rawtitle: New {{\TeX\slash \METAFONT}} sources available on {Stanford's} master archive
entry:
@Article{Knuth:new-tex-mf,
  author =       "Donald E. Knuth and Joe Weening",
  title =        "New {{\TeX\slash \METAFONT}} sources available on
                 {Stanford's} master archive",
  journal =      j-TEXHAX,
  volume =       "90",
  number =       "13",
  month =        jan,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Knuth:string-search
author: Donald E. Knuth and J. H. Morris and V. R. Pratt
title: Fast pattern matching in strings
journal: j-SIAM-J-COMPUT
volume: 6
number: 2
pages: 323--350
month: jun
monthnumber: 6
year: 1977
bibdate: Sun May 2 07:50:30 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:50:30 ???
note: See also cite Boyer:string-search,Sunday:string-search,Baeza-Yates:j-CACM-35-10-74.
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth and J. H. Morris and V. R. Pratt
rawnote: See also \cite{Boyer:string-search,Sunday:string-search,Baeza-Yates:j-CACM-35-10-74}.
rawtitle: Fast pattern matching in strings
entry:
@Article{Knuth:string-search,
  author =       "Donald E. Knuth and J. H. Morris and V. R. Pratt",
  title =        "Fast pattern matching in strings",
  journal =      j-SIAM-J-COMPUT,
  volume =       "6",
  number =       "2",
  pages =        "323--350",
  month =        jun,
  year =         "1977",
  bibdate =      "Sun May 2 07:50:30 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also
                 \cite{Boyer:string-search,Sunday:string-search,Baeza-Yates:j-CACM-35-10-74}.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Knuth:tex-3.0
author: Donald E. Knuth
title: Calling all Grand Wizards
journal: j-TEXHAX
volume: 89
number: 98
pages: 323--350
month: nov
monthnumber: 11
year: 1989
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Calling all Grand Wizards
entry:
@Article{Knuth:tex-3.0,
  author =       "Donald E. Knuth",
  title =        "Calling all Grand Wizards",
  journal =      j-TEXHAX,
  volume =       "89",
  number =       "98",
  month =        nov,
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: master.bib
label: Knuth:tex-errors
author: Donald E. Knuth
title: The Errors of TeX
number: {STAN-CS-88-1223}
institution: pub-STAN-CS
address: pub-STAN-CS:adr
pages: 323--350
month: sep
monthnumber: 9
year: 1988
bibdate: Sun May 2 07:50:41 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:50:41 ???
note: See cite Knuth:tex-errors-2.
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawnote: See \cite{Knuth:tex-errors-2}.
rawtitle: The Errors of {\TeX}
entry:
@TechReport{Knuth:tex-errors,
  author =       "Donald E. Knuth",
  title =        "The Errors of {\TeX}",
  number =       "{STAN-CS-88-1223}",
  institution =  pub-STAN-CS,
  address =      pub-STAN-CS:adr,
  month =        sep,
  year =         "1988",
  bibdate =      "Sun May 2 07:50:41 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{Knuth:tex-errors-2}.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Knuth:tex-errors-2
author: Donald E. Knuth
title: The Errors of TeX
journal: j-SPE
volume: 19
number: 7
pages: 607--681
month: jul
monthnumber: 7
year: 1989
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
note: This is an updated version of cite Knuth:tex-errors.
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawnote: This is an updated version of \cite{Knuth:tex-errors}.
rawtitle: The Errors of {\TeX}
entry:
@Article{Knuth:tex-errors-2,
  author =       "Donald E. Knuth",
  title =        "The Errors of {\TeX}",
  journal =      j-SPE,
  volume =       "19",
  number =       "7",
  pages =        "607--681",
  month =        jul,
  year =         "1989",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This is an updated version of
                 \cite{Knuth:tex-errors}.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Knuth:virtual-fonts
author: Donald E. Knuth
title: Virtual fonts: More fun for Grand Wizards
journal: j-TEXHAX
volume: 90
number: 11 and 12
pages: 607--681
month: jan
monthnumber: 1
year: 1990
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Donald E. Knuth
rawtitle: Virtual fonts: More fun for Grand Wizards
entry:
@Article{Knuth:virtual-fonts,
  author =       "Donald E. Knuth",
  title =        "Virtual fonts: More fun for Grand Wizards",
  journal =      j-TEXHAX,
  volume =       "90",
  number =       "11 and 12",
  month =        jan,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Kogge:1981:APC
author: Peter M. Kogge
title: The Architecture of Pipelined Computers
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: xii + 334
year: 1981
ISBN: 0-07-035237-2 OR 0070352372
ISBN13: 978-0-07-035237-7 OR 9780070352377
LCCN: QA76.5 .K587
bibdate: Wed Dec 15 10:37:46 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:37:46 ???
acknowledgement: ack-nhfb
rawauthor: Peter M. Kogge
rawtitle: The Architecture of Pipelined Computers
entry:
@Book{Kogge:1981:APC,
  author =       "Peter M. Kogge",
  title =        "The Architecture of Pipelined Computers",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xii + 334",
  year =         "1981",
  ISBN =         "0-07-035237-2",
  ISBN-13 =      "978-0-07-035237-7",
  LCCN =         "QA76.5 .K587",
  bibdate =      "Wed Dec 15 10:37:46 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Kolbert:2014:SEU
author: Elizabeth Kolbert
title: The sixth extinction: an unnatural history
publisher: pub-HENRY-HOLT
address: pub-HENRY-HOLT:adr
pages: 319
year: 2014
LCCN: QE721.2.E97
bibdate: Tue Jun 3 10:54:11 MDT 2014
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2014.06.03 10:54:11 MDT
subject: Mass extinctions; Extinction (Biology); Environmental disasters
acknowledgement: ack-nhfb
rawauthor: Elizabeth Kolbert
rawtitle: The sixth extinction: an unnatural history
ISBN:
0-8050-9299-4 (hardcover), 0-8050-9979-4 (e-book), 1-4088-5123-7 (e-book), 1-4088-5122-9 (paperback), 1-4088-5121-0 (hardcover), 1-4088-5711-1 (paperback) OR 0805092994 (hardcover), 0805099794 (ebook), 1408851237 (ebook), 1408851229 (paperback), 1408851210 (hardcover), 1408857111 (paperback)

ISBN13:
978-0-8050-9299-8 (hardcover), 978-0-8050-9979-9 (e-book), 978-1-4088-5123-4 (e-book), 978-1-4088-5122-7 (paperback), 978-1-4088-5121-0 (hardcover), 978-1-4088-5711-3 (paperback) OR 9780805092998 (hardcover), 9780805099799 (ebook), 9781408851234 (ebook), 9781408851227 (paperback), 9781408851210 (hardcover), 9781408857113 (paperback)

abstract:
Over the last half billion years, there have been five major mass extinctions, when the diversity of life on Earth suddenly and dramatically contracted. Scientists are currently monitoring the sixth extinction, predicted to be the most devastating since the asteroid impact that wiped out the dinosaurs. This time around the cataclysm is us. In this book the author tells us why and how human beings have altered life on the planet in a way no species has before. She provides a moving account of the disappearances of various species occurring all around us and traces the evolution of extinction as concept, from its first articulation by Georges Cuvier in revolutionary Paris up to Lyell and Darwin, and through the present day. The sixth extinction is likely to be mankind's most lasting legacy, compelling us to rethink the fundamental question of what it means to be human.

TOC:
The sixth extinction The mastodon's molars The original penguin The luck of the ammonites Welcome to the Anthropocene The sea around us Dropping acid The forest and the trees Islands on dry land The new Pangaea The rhino gets an ultrasound The madness gene The thing with feathers

rawabstract:
Over the last half billion years, there have been five major mass extinctions, when the diversity of life on Earth suddenly and dramatically contracted. Scientists are currently monitoring the sixth extinction, predicted to be the most devastating since the asteroid impact that wiped out the dinosaurs. This time around the cataclysm is us. In this book the author tells us why and how human beings have altered life on the planet in a way no species has before. She provides a moving account of the disappearances of various species occurring all around us and traces the evolution of extinction as concept, from its first articulation by Georges Cuvier in revolutionary Paris up to Lyell and Darwin, and through the present day. The sixth extinction is likely to be mankind's most lasting legacy, compelling us to rethink the fundamental question of what it means to be human.

rawTOC:
The sixth extinction \\ The mastodon's molars \\ The original penguin \\ The luck of the ammonites \\ Welcome to the Anthropocene \\ The sea around us \\ Dropping acid \\ The forest and the trees \\ Islands on dry land \\ The new Pangaea \\ The rhino gets an ultrasound \\ The madness gene \\ The thing with feathers

entry:
@Book{Kolbert:2014:SEU,
  author =       "Elizabeth Kolbert",
  title =        "The sixth extinction: an unnatural history",
  publisher =    pub-HENRY-HOLT,
  address =      pub-HENRY-HOLT:adr,
  pages =        "319",
  year =         "2014",
  ISBN =         "0-8050-9299-4 (hardcover), 0-8050-9979-4 (e-book),
                 1-4088-5123-7 (e-book), 1-4088-5122-9 (paperback),
                 1-4088-5121-0 (hardcover), 1-4088-5711-1 (paperback)",
  ISBN-13 =      "978-0-8050-9299-8 (hardcover), 978-0-8050-9979-9
                 (e-book), 978-1-4088-5123-4 (e-book), 978-1-4088-5122-7
                 (paperback), 978-1-4088-5121-0 (hardcover),
                 978-1-4088-5711-3 (paperback)",
  LCCN =         "QE721.2.E97",
  bibdate =      "Tue Jun 3 10:54:11 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Over the last half billion years, there have been five
                 major mass extinctions, when the diversity of life on
                 Earth suddenly and dramatically contracted. Scientists
                 are currently monitoring the sixth extinction,
                 predicted to be the most devastating since the asteroid
                 impact that wiped out the dinosaurs. This time around
                 the cataclysm is us. In this book the author tells us
                 why and how human beings have altered life on the
                 planet in a way no species has before. She provides a
                 moving account of the disappearances of various species
                 occurring all around us and traces the evolution of
                 extinction as concept, from its first articulation by
                 Georges Cuvier in revolutionary Paris up to Lyell and
                 Darwin, and through the present day. The sixth
                 extinction is likely to be mankind's most lasting
                 legacy, compelling us to rethink the fundamental
                 question of what it means to be human.",
  acknowledgement = ack-nhfb,
  subject =      "Mass extinctions; Extinction (Biology); Environmental
                 disasters",
  tableofcontents = "The sixth extinction \\
                 The mastodon's molars \\
                 The original penguin \\
                 The luck of the ammonites \\
                 Welcome to the Anthropocene \\
                 The sea around us \\
                 Dropping acid \\
                 The forest and the trees \\
                 Islands on dry land \\
                 The new Pangaea \\
                 The rhino gets an ultrasound \\
                 The madness gene \\
                 The thing with feathers",
}


bibtype: book
filename: master.bib
label: Kolodin:2019:HMR
author: Denis Kolodin
publisher: pub-PACKT
address: pub-PACKT:adr
pages: 511 (est.)
year: 2019
ISBN: 1-78934-198-1, 1-78934-275-9 OR 1789341981, 1789342759
ISBN13: 978-1-78934-198-0, 978-1-78934-275-8 OR 9781789341980, 9781789342758
LCCN: QA76.73.R87
bibdate: Tue Dec 10 06:02:23 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.12.10 06:02:23 MST
URL: http://proquest.safaribooksonline.com/?fpi=9781789342758
acknowledgement: ack-nhfb
rawauthor: Denis Kolodin
title:
Hands-on Microservices with Rust: Build, Test, and Deploy Scalable and Reactive Microservices with Rust 2018

abstract:
A comprehensive guide in developing and deploying high performance microservices with Rust Key Features Start your microservices journey and get a broader perspective on microservices development using RUST 2018, Build, deploy, and test microservices using AWS Explore advanced techniques for developing microservices such as actor model, Requests Routing, and threads Book Description Microservice architecture is sweeping the world as the de facto pattern for building web-based applications. Rust is a language particularly well-suited for building microservices. It is a new system programming language that offers a practical and safe alternative to C. This book describes web development using the Rust programming language and will get you up and running with modern web frameworks and crates with examples of RESTful microservices creation. You will deep dive into Reactive programming, and asynchronous programming, and split your web application into a set of concurrent actors. The book provides several HTTP-handling examples with manageable memory allocations. You will walk through stateless high-performance microservices, which are ideally suitable for computation or caching tasks, and look at stateful microservices, which are filled with persistent data and database interactions. As we move along, you will learn how to use Rust macros to describe business or protocol entities of our application and compile them into native structs, which will be performed at full speed with the help of the server's CPU. Finally, you will be taken through examples of how to test and debug microservices and pack them into a tiny monolithic binary or put them into a container and deploy them to modern cloud platforms such as AWS. What you will learn Get acquainted with leveraging Rust web programming Get to grips with various Rust crates, such as hyper, Tokio, and Actix Explore RESTful microservices with Rust Understand how to pack Rust code to a container using Docker Familiarize yourself with Reactive microservices Deploy your microservices to modern cloud platforms such as AWS Who this book is for This book is for developers who have basic knowledge of RUST, and want to learn how to build, test, scale, and manage RUST microservices. No prior experience of writing microservices in RUST is assumed. Downloading the example code for this book You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com.

subject:
Rust (Computer program language); Application software; Development; Web applications; Development.; Rust (Computer program language); Web applications.

rawabstract:
A comprehensive guide in developing and deploying high performance microservices with Rust Key Features Start your microservices journey and get a broader perspective on microservices development using RUST 2018, Build, deploy, and test microservices using AWS Explore advanced techniques for developing microservices such as actor model, Requests Routing, and threads Book Description Microservice architecture is sweeping the world as the de facto pattern for building web-based applications. Rust is a language particularly well-suited for building microservices. It is a new system programming language that offers a practical and safe alternative to C. This book describes web development using the Rust programming language and will get you up and running with modern web frameworks and crates with examples of RESTful microservices creation. You will deep dive into Reactive programming, and asynchronous programming, and split your web application into a set of concurrent actors. The book provides several HTTP-handling examples with manageable memory allocations. You will walk through stateless high-performance microservices, which are ideally suitable for computation or caching tasks, and look at stateful microservices, which are filled with persistent data and database interactions. As we move along, you will learn how to use Rust macros to describe business or protocol entities of our application and compile them into native structs, which will be performed at full speed with the help of the server's CPU. Finally, you will be taken through examples of how to test and debug microservices and pack them into a tiny monolithic binary or put them into a container and deploy them to modern cloud platforms such as AWS. What you will learn Get acquainted with leveraging Rust web programming Get to grips with various Rust crates, such as hyper, Tokio, and Actix Explore RESTful microservices with Rust Understand how to pack Rust code to a container using Docker Familiarize yourself with Reactive microservices Deploy your microservices to modern cloud platforms such as AWS Who this book is for This book is for developers who have basic knowledge of RUST, and want to learn how to build, test, scale, and manage RUST microservices. No prior experience of writing microservices in RUST is assumed. Downloading the example code for this book You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com.

rawtitle:
Hands-on Microservices with {Rust}: Build, Test, and Deploy Scalable and Reactive Microservices with {Rust 2018}

entry:
@Book{Kolodin:2019:HMR,
  author =       "Denis Kolodin",
  title =        "Hands-on Microservices with {Rust}: Build, Test, and
                 Deploy Scalable and Reactive Microservices with {Rust
                 2018}",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "511 (est.)",
  year =         "2019",
  ISBN =         "1-78934-198-1, 1-78934-275-9",
  ISBN-13 =      "978-1-78934-198-0, 978-1-78934-275-8",
  LCCN =         "QA76.73.R87",
  bibdate =      "Tue Dec 10 06:02:23 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquest.safaribooksonline.com/?fpi=9781789342758",
  abstract =     "A comprehensive guide in developing and deploying high
                 performance microservices with Rust Key Features Start
                 your microservices journey and get a broader
                 perspective on microservices development using RUST
                 2018, Build, deploy, and test microservices using AWS
                 Explore advanced techniques for developing
                 microservices such as actor model, Requests Routing,
                 and threads Book Description Microservice architecture
                 is sweeping the world as the de facto pattern for
                 building web-based applications. Rust is a language
                 particularly well-suited for building microservices. It
                 is a new system programming language that offers a
                 practical and safe alternative to C. This book
                 describes web development using the Rust programming
                 language and will get you up and running with modern
                 web frameworks and crates with examples of RESTful
                 microservices creation. You will deep dive into
                 Reactive programming, and asynchronous programming, and
                 split your web application into a set of concurrent
                 actors. The book provides several HTTP-handling
                 examples with manageable memory allocations. You will
                 walk through stateless high-performance microservices,
                 which are ideally suitable for computation or caching
                 tasks, and look at stateful microservices, which are
                 filled with persistent data and database interactions.
                 As we move along, you will learn how to use Rust macros
                 to describe business or protocol entities of our
                 application and compile them into native structs, which
                 will be performed at full speed with the help of the
                 server's CPU. Finally, you will be taken through
                 examples of how to test and debug microservices and
                 pack them into a tiny monolithic binary or put them
                 into a container and deploy them to modern cloud
                 platforms such as AWS. What you will learn Get
                 acquainted with leveraging Rust web programming Get to
                 grips with various Rust crates, such as hyper, Tokio,
                 and Actix Explore RESTful microservices with Rust
                 Understand how to pack Rust code to a container using
                 Docker Familiarize yourself with Reactive microservices
                 Deploy your microservices to modern cloud platforms
                 such as AWS Who this book is for This book is for
                 developers who have basic knowledge of RUST, and want
                 to learn how to build, test, scale, and manage RUST
                 microservices. No prior experience of writing
                 microservices in RUST is assumed. Downloading the
                 example code for this book You can download the example
                 code files for all Packt books you have purchased from
                 your account at http://www.PacktPub.com.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Rust (Computer program language); Application
                 software; Development; Web applications; Development.;
                 Rust (Computer program language); Web applications.",
}


bibtype: book
filename: master.bib
label: Kolthoff:1952:TQI
author: I. M. Kolthoff and E. B. Sandell
title: Textbook of Quantitative Inorganic Analysis
publisher: pub-MACMILLAN
address: pub-MACMILLAN:adr
edition: Third
pages: xv + 759
year: 1952
LCCN: QD101 .K6 1952
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: I. M. Kolthoff and E. B. Sandell
rawtitle: Textbook of Quantitative Inorganic Analysis
entry:
@Book{Kolthoff:1952:TQI,
  author =       "I. M. Kolthoff and E. B. Sandell",
  title =        "Textbook of Quantitative Inorganic Analysis",
  publisher =    pub-MACMILLAN,
  address =      pub-MACMILLAN:adr,
  edition =      "Third",
  pages =        "xv + 759",
  year =         "1952",
  LCCN =         "QD101 .K6 1952",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Kopka:1988:LE
author: Helmut Kopka
title: LaTeX : Eine Einfuhrung
publisher: pub-AWV
address: pub-AWV:adr
edition: Second
pages: xvi + 340
year: 1988
ISBN: 3-89319-136-4, 3-89319-199-2 OR 3893191364, 3893191992
ISBN13: 978-3-89319-136-9, 978-3-89319-199-4 OR 9783893191369, 9783893191994
bibdate: Wed Jul 6 15:09:48 1994
bibtimestamp: 1994.07.06 15:09:48 ???
acknowledgement: ack-nhfb
rawauthor: Helmut Kopka
rawtitle: {{\LaTeX}: Eine Einf{\"u}hrung}
TOC:
1 Grundlagen / 1 1.1 TeX und LaTeX / 2 1.2 Text und Befehle / 3 1.3 Grundstruktur eines LaTeX-Files / 3 1.4 LaTeX-Bearbeitungsnioden / 5 1.5 Erlauterungen zum vorliegenden Text / 5 1.6 Die Erzeugung eines LaTeX-Dokuments / 6 1.7 Hinweise fur Autoren / 7 2 Befehle und Umgebungen / 9 2.1 Befehlsnamen und Befehlsargumente / 9 2.2 Umgebungen (environment) / 10 2.3 Erklarungen (declaration) / 11 2.4 Mass angaben / 12 2.4.1 Feste Mass e / 12 2.4.2 Elastische Mass e / 12 2.5 Sonderzeichen / 13 2.5.1 Eingabe der Umlaute und des ss / 13 2.5.2 Anfuhrungsstriche / 13 2.5.3 Trenn-, Binde- und Gedankenstriche / 14 2.5.4 Der Druck von Befehlszeichen / 14 2.5.5 Die Sonderzeichen , $dagger $, $ddagger $, $$, $copyright $ und $pounds $ / 14 2.5.6 Sonderbuchstaben in Fremdsprachen / 14 2.5.7 Akzente / 14 2.5.8 Ligaturen / 15 2.5.9 Das Datum / 15 2.6 Zerbrechliche Befehle / 15 2.7 Ubungen / 16 3 Dokument- und Seitenstil / 19 3.1 Der Dokumentstil / 19 3.2 Der Seitenstil / 21 3.2.1 Kopfdeklarationen / 21 3.2.2 Seitennumerierung / 22 3.2.3 Zeilen- und Absatzabstande / 23 3.2.4 Seitendeklarationen / 23 3.2.5 Ein- und zweispaltige Seiten / 25 3.3 Dokumentuntergliederung / 25 3.3.1 Die Titelseite / 26 3.3.2 Der Abstrakt / 28 3.3.3 Die fortlaufende Untergliederung / 28 3.3.4 Der Anhang / 30 3.4 Das Inhaltsverzeichnis / 31 3.4.1 Automatische Eintragungen / 31 3.4.2 Der Ausdruck des Inhaltsverzeichnisses / 31 3.4.3 Zusatzliche Eintragungen / 31 3.4.4 Weitere Verzeichnisse / 32 3.5 Formatierungshilfen / 33 3.5.1 Zeichen- und Wortabstande / 33 3.5.1.1 Der und das Satzende / 33 3.5.1.2 Frenchspacing / 33 3.5.1.3 Die Zeichenkombination `` und '' / 34 3.5.1.4 Italic-Korrektur / 34 3.5.1.5 Die Ausschaltung von Ligaturen / 34 3.5.1.6 Einfugung beliebiger Zwischenraume / 34 3.5.1.7 Einfugung von ldots und ___ Sequenzen / 35 3.5.2 Zeilenumbruch / 36 3.5.2.1 Der Befehl / 36 3.5.2.2 Weitere Zeilenumbruchbefehle / 36 3.5.3 Absatzabstand / 37 3.5.4 Absatzeinruckungen / 37 3.5.5 Seitenumbruch / 38 3.5.5.1 Normale Textseiten / 38 3.5.5.2 Seiten mit Bildern und Tabellen / 38 3.5.5.3 Zweispaltige Seiten / 39 3.5.5.4 Doppelseitiger Druck / 39 3.5.5.5 Eingeschrankter Umbruch / 39 3.5.5.6 Weitere Hilfen zum Seitenumbruch / 40 3.6 Trennhilfen / 41 3.6.1 Direkte Trennhilfen / 41 3.6.2 Erzeugung einer Trennliste / 42 3.6.3 Vermeidung von Trennungen / 42 3.6.4 Zeilenbreite und Trennungen / 43 3.6.5 Zusatzinformation uber Trennungen / 43 4 Texthervorhebungen / 45 4.1 Anderung der Schrift / 45 4.1.1 Die Standardumschaltung em / 45 4.1.2 Die verfugbaren Schriftarten / 46 4.1.3 Die Wahl der Schriftgross e / 46 4.1.4 Zusatzliche Schriftarten / 48 4.1.5 Zeichensatze und Symbole / 48 4.2 Textverschiebungen / 49 4.2.1 Zentrierter Text / 49 4.2.2 Einseitig bundiger Text / 49 4.2.3 Beidseitig eingeruckter Text / 49 4.2.4 Verseinruckungen / 50 4.3 Aufzahlungen / 51 4.3.1 Beispiel `itemize' / 51 4.3.2 Beispiel `enumerate' / 52 4.3.3 Beispiel `description' / 52 4.3.4 Geschachtelte Aufzahlungen / 52 4.3.5 Anderung der Markierungen / 54 4.3.6 Literaturverzeichnis / 56 4.4 Allgemeine Listen / 58 4.4.1 Die Standardmarke / 58 4.4.2 Die Listenerklarung / 59 4.4.3 Beispiel fur eine benutzergestaltete Liste / 60 4.4.4 Listendefinitionen als neue Umgebungen / 61 4.4.5 Triviale Listen / 62 4.4.6 Verschachtelte Listen / 62 4.5 Regelsatze / 63 4.6 Tabulatorsetzungen / 64 4.6.1 Grundlagen / 64 4.6.2 Musterzeile / 64 4.6.3 Tabstops und linker Rand / 65 4.6.4 Weitere Tabulatorbefehle / 65 4.6.5 Zusatzbemerkungen / 66 4.7 Boxen / 68 4.7.1 LR-Boxen / 68 4.7.2 Vertikale Verschiebungen von LR-Boxen / 69 4.7.3 Absatzboxen und Teilseiten / 70 4.7.4 Rule-Boxen / 71 4.7.5 Verschachtelte Boxen / 72 4.7.6 Box-Stilparameter / 73 4.8 Tabellen / 74 4.8.1 Die Konstruktion von Tabellen / 74 4.8.2 Die Anderung des Tabellenstils / 76 4.8.3 Beispiele von Tabellenkonstruktionen / 77 4.8.4 Gleitende Tabellen / 84 4.9 Fuss noten und Randnotizen / 86 4.9.1 Standardfuss noten / 86 4.9.2 Abweichungen vom Standard / 86 4.9.3 Anderung des Fuss notenstils / 87 4.9.4 Fuss noten in unerlaubten Moden / 88 4.9.5 Fuss noten in Minipages / 89 4.9.6 Randnotizen / 89 4.9.7 Stilparameter fur Randboxen / 91 4.10 Ausdruck von Originaltext / 91 4.11 Kommentare im Eingabetext / 92 5 Mathematische Formeln / 93 5.1 Mathematische Umgebungen / 93 5.2 Die Hauptkonstruktionselemente / 94 5.2.1 Konstante, Variable und ihre Verknupfungen / 94 5.2.2 Hoch- und Tiefstellungen von Zeichen / 95 5.2.3 Bruche / 95 5.2.4 Wurzeln / 96 5.2.5 Summen und Integrale / 96 5.2.6 Fortsetzungspunkte - Ellipsen / 97 5.3 Mathematische Symbole / 98 5.3.1 Griechische Buchstaben / 98 5.3.2 Kalligraphische Buchstaben / 98 5.3.3 Binare Operationssymbole / 99 5.3.4 Vergleichssymbole und deren Negation / 99 5.3.5 Pfeil- oder Zeigersymbole / 100 5.3.6 Verschiedene sonstige Symbole / 100 5.3.7 Symbole in zwei Gross en / 101 5.3.8 Funktionsnamen / 101 5.3.9 Mathematische Akzente / 102 5.4 Weitere Konstruktionselemente / 103 5.4.1 Automatische Gross enanpassung von Klammersymbolen / 104 5.4.2 Gewohnlicher Text innerhalb von Formeln / 105 5.4.3 Matrizen und Felder / 105 5.4.4 Uber- und Unterstreichen von Teilformeln / 108 5.4.5 Gestockte Symbole / 108 5.4.6 Zusatzliche mathematische Tss X-Befehle / 109 5.4.7 Mehrzellige Formeln / 110 5.4.8 Gerahmte oder nebeneinander stehende Formeln / 113 5.4.9 Chemische Formeln - Fettdruck in Formeln / 114 5.5 Mathematische Formatierungshilfen / 115 5.5.1 Horizontale Abstande / 115 5.5.2 Die Wahl der Schriftgross en in Formeln / 116 5.5.3 Manuelle Gross enwahl der Klammersymbole / 118 5.5.4 Mathematische Stilparameter / 118 5.5.5 Einige Zusatzempfehlungen / 119 5.5.6 Gerahmte abgesetzte Formeln / 121 5.5.7 Was ist sonst noch moglich? / 122 6 Bilder / 123 6.1 Mass - und Positionierungsangaben / 123 6.2 Die Bildumgebung - picture / 124 6.3 Die Positionierungsbefehle / 125 6.4 Die Bildobjekt-Befehle / 126 6.4.1 Text im Bild / 126 6.4.2 Bildboxen - Rechtecke / 126 6.4.3 Gerade Linien / 129 6.4.4 Pfeile / 130 6.4.5 Kreise / 131 6.4.6 Ovale und gerundete Ecken / 131 6.4.7 Vertikal gestockte Texte / 133 6.4.8 Textangepass te Rahmen / 133 6.5 Weitere Bildbefehle und Beispiele / 134 6.5.1 Strichstaxken / 134 6.5.2 Verschachtelte Bilder / 135 6.5.3 Speicherung von Bildteilen / 136 6.5.4 Erweiterte picture-Umgebung / 139 6.5.5 Weitere Beispiele / 139 6.5.6 Allgemeine Empfehlungen / 141 6.6 Gleitende Tabellen und Bilder / 142 6.6.1 Die Plazierung von Gleitobjekten / 142 6.6.2 Stilparameter fur gleitende Objekte / 143 6.6.3 Uber- und Unterschriften fur gleitende Objekte / 145 6.6.4 Beispiele fur Gleitobjekte / 146 6.6.5 Bild- und Tabellenreferenzen im Text / 148 7 Benutzereigene Strukturen / 149 7.1 Zahler / 149 7.1.1 M?ss X-eigene Zahler / 149 7.1.2 Benutzereigene Zahler / 150 7.1.3 Veranderung der Zahlerwerte / 150 7.1.4 Der Ausdruck von Zahlerstanden / 151 7.2 Langen / 152 7.3 Benutzereigene Befehle / 153 7.3.1 Befehle ohne Parameter / 153 7.3.2 Befehle mit Parametern / 155 7.3.3 Weitere Beispiele / 156 7.4 Benutzereigene Umgebungen / 159 7.4.1 Umgebungen ohne Parameter / 159 7.4.2 Umgebungen mit Parametern / 161 7.5 Allgemeine Bemerkungen zu Benutzerstrukturen / 163 7.5.1 Abspeichern von benutzereigenen Strukturen / 163 7.5.2 Strukturen zur Abkurzung / 163 7.5.3 Gleiche Befehls- und Zahlernamen / 164 7.5.4 Die Reichweite benutzereigener Definitionen / 164 7.5.5 Die Reihenfolge von Strukturdefinitionen / 164 7.5.6 Weitergereichte Parameter / 165 7.5.7 Verschachtelte Definitionen / 165 7.5.8 Unerwunschte Zwischenraume / 166 7.5.9 Zwei abschliess ende Beispiele / 167 7.6 Benutzerspezifische LaTeX-Anpassungen / 169 7.6.1 LaTeX-Strukturbeschreibung / 170 7.6.2 LaTeX-Anpassungen fur deutsche Texte / 171 7.6.3 Weitere Dokumentstil-Optionen / 173 7.6.4 Einige Zusatzhinweise / 174 7.6.5 PC-LaTeX Anpassungen / 175 7.6.6 Anmerkungen zum WEB-Programmsystem / 176 8 Miszellaneen / 177 8.1 Behandlung von Teildokumenten / 177 8.1.1 Der ``input'' Befehl / 177 8.1.2 Der ``include'' Befehl / 178 8.1.3 Terminal Ein- und Ausgabe / 180 8.2 Textbezuge / 182 8.2.1 Kreuzreferenzen / 182 8.2.2 Bezuge zum Literaturverzeichnis / 183 8.2.3 Indexregister / 185 8.2.4 Glossaxy / 186 8.3 Die verschiedenen LaTeX-Files / 187 8.4 Geladene und nachladbare Zeichensatze / 189 9 Fehlerbehandlung / 101 9.1 Grundstruktur der Fehlermeldungen / 191 9.1.1 TeX-Fehlermeldungen / 191 9.1.2 LaTeX-Fehlermeldungen / 194 9.1.3 Fehlermeldungen aus TeX-Makros / 198 9.2 Fehler durch Fehler / 199 9.2.1 Typische Fehler mit Folgewirkung / 201 9.2.2 Mathematische Fehlermeldungen / 203 9.2.3 Fehlermeldungen bei Mehrfiletexten / 205 9.3 Verzeichnis aller LaTeX-Fehler / 206 9.4 TeX-Fehlermeldungen / 209 9.5 Warnungen / 215 9.5.1 LaTeX-Warnungen / 215 9.5.2 TeX-Warnungen / 216 9.6 Suche nach versteckten Fehlern / 217 A Briefe / 219 A.1 Der LaTeX-letter Stil / 219 A.2 Ein hauseigener letter Stil / 223 A.3 Hinweise zur firmenspezifischen Anpassung / 226 A.3.1 Benutzereigene Briefbefehle / 227 A.3.2 Benutzereigene Briefformulare / 228 B Literaturdatenbanken / 231 B.1 Das BiBTeX-Programm / 231 B.2 Die Erstellung einer Literaturdatenbank / 233 B.2.1 Die verschiedenen Eingabetypen / 234 B.2.2 Felder / 236 B.2.3 Spezielle Feldformate / 237 B.2.4 Abkurzungen / 239 C Zeichensatze / 241 C.1 Vorbemerkungen / 241 C.2 Klassifizierung der TeX-Grundzeichensatze / 242 C.3 Proportionalschriften / 244 C.3.1 Serifenschriften / 244 C.3.1.1 Die Zeichensatzfamilie ``Roman'' / 244 C.3.1.2 Die Zeichensatzfamilie ``Slanted'' / 246 C.3.1.3 Die Zeichensatzfamilie ``Italic'' / 246 C.3.1.4 Die Zeichensatzfamilie ``Bold Face'' (Fettdruck) / 247 C.3.2 Sans Serifenschriften / 248 C.3.2.1 Die ``senkrechten Sans Serif'' Zeichensatze / 249 C.3.2.2 Die ``geneigten Sans Serif'' Zeichensatze / 250 C.3.2.3 Die ``fetten Sans Serif'' Zeichensatze / 251 C.3.2.4 Der Zeichensatz cminch / 251 C.3.3 Zier- und Sonderschriften / 253 C.4 Fixschriften - Schreibmaschinenschriften / 254 C.4.1 Senkrechte Schreibmaschinenschriften / 254 C.4.2 Gross schreibung / 255 C.4.3 Geneigte Schreibmaschinenschriften / 255 C.4.4 Mathematische Schreibmaschinenschrift / 255 C.5 Mathematik- und Symbolzeichensatze / 256 C.5.1 Mathematische Textzeichensatze / 256 C.5.2 Mathematische Symbole / 257 C.5.3 Variable Symbole / 258 C.5.4 Zusatzliche Zeichensatze / 258 C.5.4.1 Die LaTeX-lasy Zeichensatze / 259 C.5.4.2 Zeichensatze zur Erzeugung von Bildern / 259 C.5.4.3 Logo Zeichensatze / 259 C.6 Die Anordnung innerhalb der Zeichensatze / 260 C.7 Die Zeichensatzfiles / 265 C.7.1 Die Grundnamen / 265 C.7.2 Vergross erte Zeichensatze / 265 C.7.3 Pixel-Kodierung / 267 C.7.4 Gepackte Kodierung / 269 C.8 Anmerkungen zu METflFONT / 270 D LaTeX-Erganzungen / 273 D.1 Der deutsche TEX-Befehlszusatz / 273 D.1.1 Die Umlaute und das ss / 274 D.1.2 Trennhilfen / 274 D.1.3 Aufhebung von Ligaturen / 275 D.1.4 Deutsche Anfuhrungszeichen / 275 D.1.5 Franzosische Anfuhrungszeichen / 275 D.1.6 Sprachumschaltung / 276 D.1.7 Umschaltung auf das TeX-Original / 276 D.1.8 Der Aufruf des german.sty Files / 277 D.2 Der german.sty File / 278 D.2.1 Strukturbeschreibung des german.sty Files / 278 D.2.2 Anpassung der LaTeX .sty Files an den german.sty File / 281 D.2.3 Die Kombination der letter.sty und german.sty Files / 283 D.3 Weitere LaTeX Erganzungen / 285 Literaturverzeichnis / 287 Befehlsindex / 289 Kurzbeschreibung der LaTeX-Befehle / 289 Zusammenfassende Tabellen und Diagramme / 332 Verbotene TeX-Befehle / 339

rawTOC:
1 Grundlagen / 1 \\ 1.1 TeX und LaTeX / 2 \\ 1.2 Text und Befehle / 3 \\ 1.3 Grundstruktur eines LaTeX-Files / 3 \\ 1.4 LaTeX-Bearbeitungsnioden / 5 \\ 1.5 Erl{\"a}uterungen zum vorliegenden Text / 5 \\ 1.6 Die Erzeugung eines LaTeX-Dokuments / 6 \\ 1.7 Hinweise f{\"u}r Autoren / 7 \\ 2 Befehle und Umgebungen / 9 \\ 2.1 Befehlsnamen und Befehlsargumente / 9 \\ 2.2 Umgebungen (environment) / 10 \\ 2.3 Erkl{\"a}rungen (declaration) / 11 \\ 2.4 Ma{\ss}angaben / 12 \\ 2.4.1 Feste Ma{\ss}e / 12 \\ 2.4.2 Elastische Ma{\ss}e / 12 \\ 2.5 Sonderzeichen / 13 \\ 2.5.1 Eingabe der Umlaute und des {\ss} / 13 \\ 2.5.2 Anf{\"u}hrungsstriche / 13 \\ 2.5.3 Trenn-, Binde- und Gedankenstriche / 14 \\ 2.5.4 Der Druck von Befehlszeichen / 14 \\ 2.5.5 Die Sonderzeichen \S, $\dagger$, $\ddagger$, $\P$, $\copyright$ und $\pounds$ / 14 \\ 2.5.6 Sonderbuchstaben in Fremdsprachen / 14 \\ 2.5.7 Akzente / 14 \\ 2.5.8 Ligaturen / 15 \\ 2.5.9 Das Datum / 15 \\ 2.6 Zerbrechliche Befehle / 15 \\ 2.7 {\"U}bungen / 16 \\ 3 Dokument- und Seitenstil / 19 \\ 3.1 Der Dokumentstil / 19 \\ 3.2 Der Seitenstil / 21 \\ 3.2.1 Kopfdeklarationen / 21 \\ 3.2.2 Seitennumerierung / 22 \\ 3.2.3 Zeilen- und Absatzabst{\"a}nde / 23 \\ 3.2.4 Seitendeklarationen / 23 \\ 3.2.5 Ein- und zweispaltige Seiten / 25 \\ 3.3 Dokumentuntergliederung / 25 \\ 3.3.1 Die Titelseite / 26 \\ 3.3.2 Der Abstrakt / 28 \\ 3.3.3 Die fortlaufende Untergliederung / 28 \\ 3.3.4 Der Anhang / 30 \\ 3.4 Das Inhaltsverzeichnis / 31 \\ 3.4.1 Automatische Eintragungen / 31 \\ 3.4.2 Der Ausdruck des Inhaltsverzeichnisses / 31 \\ 3.4.3 Zus{\"a}tzliche Eintragungen / 31 \\ 3.4.4 Weitere Verzeichnisse / 32 \\ 3.5 Formatierungshilfen / 33 \\ 3.5.1 Zeichen- und Wortabst{\"a}nde / 33 \\ 3.5.1.1 Der und das Satzende / 33 \\ 3.5.1.2 Frenchspacing / 33 \\ 3.5.1.3 Die Zeichenkombination `` und '' / 34 \\ 3.5.1.4 Italic-Korrektur / 34 \\ 3.5.1.5 Die Ausschaltung von Ligaturen / 34 \\ 3.5.1.6 Einf{\"u}gung beliebiger Zwischenr{\"a}ume / 34 \\ 3.5.1.7 Einf{\"u}gung von \ldots{} und \_\_\_ Sequenzen / 35 \\ 3.5.2 Zeilenumbruch / 36 \\ 3.5.2.1 Der Befehl \\ / 36 \\ 3.5.2.2 Weitere Zeilenumbruchbefehle / 36 \\ 3.5.3 Absatzabstand / 37 \\ 3.5.4 Absatzeinr{\"u}ckungen / 37 \\ 3.5.5 Seitenumbruch / 38 \\ 3.5.5.1 Normale Textseiten / 38 \\ 3.5.5.2 Seiten mit Bildern und Tabellen / 38 \\ 3.5.5.3 Zweispaltige Seiten / 39 \\ 3.5.5.4 Doppelseitiger Druck / 39 \\ 3.5.5.5 Eingeschr{\"a}nkter Umbruch / 39 \\ 3.5.5.6 Weitere Hilfen zum Seitenumbruch / 40 \\ 3.6 Trennhilfen / 41 \\ 3.6.1 Direkte Trennhilfen / 41 \\ 3.6.2 Erzeugung einer Trennliste / 42 \\ 3.6.3 Vermeidung von Trennungen / 42 \\ 3.6.4 Zeilenbreite und Trennungen / 43 \\ 3.6.5 Zusatzinformation {\"u}ber Trennungen / 43 \\ 4 Texthervorhebungen / 45 \\ 4.1 {\"A}nderung der Schrift / 45 \\ 4.1.1 Die Standardumschaltung \em / 45 \\ 4.1.2 Die verf{\"u}gbaren Schriftarten / 46 \\ 4.1.3 Die Wahl der Schriftgr{\"o}{\ss}e / 46 \\ 4.1.4 Zus{\"a}tzliche Schriftarten / 48 \\ 4.1.5 Zeichens{\"a}tze und Symbole / 48 \\ 4.2 Textverschiebungen / 49 \\ 4.2.1 Zentrierter Text / 49 \\ 4.2.2 Einseitig b{\"u}ndiger Text / 49 \\ 4.2.3 Beidseitig einger{\"u}ckter Text / 49 \\ 4.2.4 Verseinr{\"u}ckungen / 50 \\ 4.3 Aufz{\"a}hlungen / 51 \\ 4.3.1 Beispiel `itemize' / 51 \\ 4.3.2 Beispiel `enumerate' / 52 \\ 4.3.3 Beispiel `description' / 52 \\ 4.3.4 Geschachtelte Aufz{\"a}hlungen / 52 \\ 4.3.5 {\"A}nderung der Markierungen / 54 \\ 4.3.6 Literaturverzeichnis / 56 \\ 4.4 Allgemeine Listen / 58 \\ 4.4.1 Die Standardmarke / 58 \\ 4.4.2 Die Listenerkl{\"a}rung / 59 \\ 4.4.3 Beispiel f{\"u}r eine benutzergestaltete Liste / 60 \\ 4.4.4 Listendefinitionen als neue Umgebungen / 61 \\ 4.4.5 Triviale Listen / 62 \\ 4.4.6 Verschachtelte Listen / 62 \\ 4.5 Regels{\"a}tze / 63 \\ 4.6 Tabulatorsetzungen / 64 \\ 4.6.1 Grundlagen / 64 \\ 4.6.2 Musterzeile / 64 \\ 4.6.3 Tabstops und linker Rand / 65 \\ 4.6.4 Weitere Tabulatorbefehle / 65 \\ 4.6.5 Zusatzbemerkungen / 66 \\ 4.7 Boxen / 68 \\ 4.7.1 LR-Boxen / 68 \\ 4.7.2 Vertikale Verschiebungen von LR-Boxen / 69 \\ 4.7.3 Absatzboxen und Teilseiten / 70 \\ 4.7.4 Rule-Boxen / 71 \\ 4.7.5 Verschachtelte Boxen / 72 \\ 4.7.6 Box-Stilparameter / 73 \\ 4.8 Tabellen / 74 \\ 4.8.1 Die Konstruktion von Tabellen / 74 \\ 4.8.2 Die {\"A}nderung des Tabellenstils / 76 \\ 4.8.3 Beispiele von Tabellenkonstruktionen / 77 \\ 4.8.4 Gleitende Tabellen / 84 \\ 4.9 Fu{\ss}noten und Randnotizen / 86 \\ 4.9.1 Standardfu{\ss}noten / 86 \\ 4.9.2 Abweichungen vom Standard / 86 \\ 4.9.3 {\"A}nderung des Fu{\ss}notenstils / 87 \\ 4.9.4 Fu{\ss}noten in unerlaubten Moden / 88 \\ 4.9.5 Fu{\ss}noten in Minipages / 89 \\ 4.9.6 Randnotizen / 89 \\ 4.9.7 Stilparameter f{\"u}r Randboxen / 91 \\ 4.10 Ausdruck von Originaltext / 91 \\ 4.11 Kommentare im Eingabetext / 92 \\ 5 Mathematische Formeln / 93 \\ 5.1 Mathematische Umgebungen / 93 \\ 5.2 Die Hauptkonstruktionselemente / 94 \\ 5.2.1 Konstante, Variable und ihre Verkn{\"u}pfungen / 94 \\ 5.2.2 Hoch- und Tiefstellungen von Zeichen / 95 \\ 5.2.3 Br{\"u}che / 95 \\ 5.2.4 Wurzeln / 96 \\ 5.2.5 Summen und Integrale / 96 \\ 5.2.6 Fortsetzungspunkte - Ellipsen / 97 \\ 5.3 Mathematische Symbole / 98 \\ 5.3.1 Griechische Buchstaben / 98 \\ 5.3.2 Kalligraphische Buchstaben / 98 \\ 5.3.3 Bin{\"a}re Operationssymbole / 99 \\ 5.3.4 Vergleichssymbole und deren Negation / 99 \\ 5.3.5 Pfeil- oder Zeigersymbole / 100 \\ 5.3.6 Verschiedene sonstige Symbole / 100 \\ 5.3.7 Symbole in zwei Gr{\"o}{\ss}en / 101 \\ 5.3.8 Funktionsnamen / 101 \\ 5.3.9 Mathematische Akzente / 102 \\ 5.4 Weitere Konstruktionselemente / 103 \\ 5.4.1 Automatische Gr{\"o}{\ss}enanpassung von Klammersymbolen / 104 \\ 5.4.2 Gew{\"o}hnlicher Text innerhalb von Formeln / 105 \\ 5.4.3 Matrizen und Felder / 105 \\ 5.4.4 Uber- und Unterstreichen von Teilformeln / 108 \\ 5.4.5 Gestockte Symbole / 108 \\ 5.4.6 Zus{\"a}tzliche mathematische T{\ss}X-Befehle / 109 \\ 5.4.7 Mehrzellige Formeln / 110 \\ 5.4.8 Gerahmte oder nebeneinander stehende Formeln / 113 \\ 5.4.9 Chemische Formeln - Fettdruck in Formeln / 114 \\ 5.5 Mathematische Formatierungshilfen / 115 \\ 5.5.1 Horizontale Abst{\"a}nde / 115 \\ 5.5.2 Die Wahl der Schriftgr{\"o}{\ss}en in Formeln / 116 \\ 5.5.3 Manuelle Gr{\"o}{\ss}enwahl der Klammersymbole / 118 \\ 5.5.4 Mathematische Stilparameter / 118 \\ 5.5.5 Einige Zusatzempfehlungen / 119 \\ 5.5.6 Gerahmte abgesetzte Formeln / 121 \\ 5.5.7 Was ist sonst noch m{\"o}glich? / 122 \\ 6 Bilder / 123 \\ 6.1 Ma{\ss}- und Positionierungsangaben / 123 \\ 6.2 Die Bildumgebung - picture / 124 \\ 6.3 Die Positionierungsbefehle / 125 \\ 6.4 Die Bildobjekt-Befehle / 126 \\ 6.4.1 Text im Bild / 126 \\ 6.4.2 Bildboxen - Rechtecke / 126 \\ 6.4.3 Gerade Linien / 129 \\ 6.4.4 Pfeile / 130 \\ 6.4.5 Kreise / 131 \\ 6.4.6 Ovale und gerundete Ecken / 131 \\ 6.4.7 Vertikal gestockte Texte / 133 \\ 6.4.8 Textangepa{\ss}te Rahmen / 133 \\ 6.5 Weitere Bildbefehle und Beispiele / 134 \\ 6.5.1 Strichst{\"a}xken / 134 \\ 6.5.2 Verschachtelte Bilder / 135 \\ 6.5.3 Speicherung von Bildteilen / 136 \\ 6.5.4 Erweiterte picture-Umgebung / 139 \\ 6.5.5 Weitere Beispiele / 139 \\ 6.5.6 Allgemeine Empfehlungen / 141 \\ 6.6 Gleitende Tabellen und Bilder / 142 \\ 6.6.1 Die Plazierung von Gleitobjekten / 142 \\ 6.6.2 Stilparameter f{\"u}r gleitende Objekte / 143 \\ 6.6.3 Uber- und Unterschriften f{\"u}r gleitende Objekte / 145 \\ 6.6.4 Beispiele f{\"u}r Gleitobjekte / 146 \\ 6.6.5 Bild- und Tabellenreferenzen im Text / 148 \\ 7 Benutzereigene Strukturen / 149 \\ 7.1 Z{\"a}hler / 149 \\ 7.1.1 M?{\ss}X-eigene Z{\"a}hler / 149 \\ 7.1.2 Benutzereigene Z{\"a}hler / 150 \\ 7.1.3 Ver{\"a}nderung der Z{\"a}hlerwerte / 150 \\ 7.1.4 Der Ausdruck von Z{\"a}hlerst{\"a}nden / 151 \\ 7.2 L{\"a}ngen / 152 \\ 7.3 Benutzereigene Befehle / 153 \\ 7.3.1 Befehle ohne Parameter / 153 \\ 7.3.2 Befehle mit Parametern / 155 \\ 7.3.3 Weitere Beispiele / 156 \\ 7.4 Benutzereigene Umgebungen / 159 \\ 7.4.1 Umgebungen ohne Parameter / 159 \\ 7.4.2 Umgebungen mit Parametern / 161 \\ 7.5 Allgemeine Bemerkungen zu Benutzerstrukturen / 163 \\ 7.5.1 Abspeichern von benutzereigenen Strukturen / 163 \\ 7.5.2 Strukturen zur Abk{\"u}rzung / 163 \\ 7.5.3 Gleiche Befehls- und Z{\"a}hlernamen / 164 \\ 7.5.4 Die Reichweite benutzereigener Definitionen / 164 \\ 7.5.5 Die Reihenfolge von Strukturdefinitionen / 164 \\ 7.5.6 Weitergereichte Parameter / 165 \\ 7.5.7 Verschachtelte Definitionen / 165 \\ 7.5.8 Unerw{\"u}nschte Zwischenr{\"a}ume / 166 \\ 7.5.9 Zwei abschlie{\ss}ende Beispiele / 167 \\ 7.6 Benutzerspezifische LaTeX-Anpassungen / 169 \\ 7.6.1 LaTeX-Strukturbeschreibung / 170 \\ 7.6.2 LaTeX-Anpassungen f{\"u}r deutsche Texte / 171 \\ 7.6.3 Weitere Dokumentstil-Optionen / 173 \\ 7.6.4 Einige Zusatzhinweise / 174 \\ 7.6.5 PC-LaTeX Anpassungen / 175 \\ 7.6.6 Anmerkungen zum WEB-Programmsystem / 176 \\ 8 Miszellaneen / 177 \\ 8.1 Behandlung von Teildokumenten / 177 \\ 8.1.1 Der ``input'' Befehl / 177 \\ 8.1.2 Der ``include'' Befehl / 178 \\ 8.1.3 Terminal Ein- und Ausgabe / 180 \\ 8.2 Textbez{\"u}ge / 182 \\ 8.2.1 Kreuzreferenzen / 182 \\ 8.2.2 Bez{\"u}ge zum Literaturverzeichnis / 183 \\ 8.2.3 Indexregister / 185 \\ 8.2.4 Glossaxy / 186 \\ 8.3 Die verschiedenen LaTeX-Files / 187 \\ 8.4 Geladene und nachladbare Zeichens{\"a}tze / 189 \\ 9 Fehlerbehandlung / 101 \\ 9.1 Grundstruktur der Fehlermeldungen / 191 \\ 9.1.1 TeX-Fehlermeldungen / 191 \\ 9.1.2 LaTeX-Fehlermeldungen / 194 \\ 9.1.3 Fehlermeldungen aus TeX-Makros / 198 \\ 9.2 Fehler durch Fehler / 199 \\ 9.2.1 Typische Fehler mit Folgewirkung / 201 \\ 9.2.2 Mathematische Fehlermeldungen / 203 \\ 9.2.3 Fehlermeldungen bei Mehrfiletexten / 205 \\ 9.3 Verzeichnis aller LaTeX-Fehler / 206 \\ 9.4 TeX-Fehlermeldungen / 209 \\ 9.5 Warnungen / 215 \\ 9.5.1 LaTeX-Warnungen / 215 \\ 9.5.2 TeX-Warnungen / 216 \\ 9.6 Suche nach versteckten Fehlern / 217 \\ A Briefe / 219 \\ A.1 Der LaTeX-letter Stil / 219 \\ A.2 Ein hauseigener letter Stil / 223 \\ A.3 Hinweise zur firmenspezifischen Anpassung / 226 \\ A.3.1 Benutzereigene Briefbefehle / 227 \\ A.3.2 Benutzereigene Briefformulare / 228 \\ B Literaturdatenbanken / 231 \\ B.1 Das BiBTeX-Programm / 231 \\ B.2 Die Erstellung einer Literaturdatenbank / 233 \\ B.2.1 Die verschiedenen Eingabetypen / 234 \\ B.2.2 Felder / 236 \\ B.2.3 Spezielle Feldformate / 237 \\ B.2.4 Abk{\"u}rzungen / 239 \\ C Zeichens{\"a}tze / 241 \\ C.1 Vorbemerkungen / 241 \\ C.2 Klassifizierung der TeX-Grundzeichens{\"a}tze / 242 \\ C.3 Proportionalschriften / 244 \\ C.3.1 Serifenschriften / 244 \\ C.3.1.1 Die Zeichensatzfamilie ``Roman'' / 244 \\ C.3.1.2 Die Zeichensatzfamilie ``Slanted'' / 246 \\ C.3.1.3 Die Zeichensatzfamilie ``Italic'' / 246 \\ C.3.1.4 Die Zeichensatzfamilie ``Bold Face'' (Fettdruck) / 247 \\ C.3.2 Sans Serifenschriften / 248 \\ C.3.2.1 Die ``senkrechten Sans Serif'' Zeichens{\"a}tze / 249 \\ C.3.2.2 Die ``geneigten Sans Serif'' Zeichens{\"a}tze / 250 \\ C.3.2.3 Die ``fetten Sans Serif'' Zeichens{\"a}tze / 251 \\ C.3.2.4 Der Zeichensatz cminch / 251 \\ C.3.3 Zier- und Sonderschriften / 253 \\ C.4 Fixschriften - Schreibmaschinenschriften / 254 \\ C.4.1 Senkrechte Schreibmaschinenschriften / 254 \\ C.4.2 Gro{\ss}schreibung / 255 \\ C.4.3 Geneigte Schreibmaschinenschriften / 255 \\ C.4.4 Mathematische Schreibmaschinenschrift / 255 \\ C.5 Mathematik- und Symbolzeichens{\"a}tze / 256 \\ C.5.1 Mathematische Textzeichens{\"a}tze / 256 \\ C.5.2 Mathematische Symbole / 257 \\ C.5.3 Variable Symbole / 258 \\ C.5.4 Zus{\"a}tzliche Zeichens{\"a}tze / 258 \\ C.5.4.1 Die LaTeX-lasy Zeichens{\"a}tze / 259 \\ C.5.4.2 Zeichens{\"a}tze zur Erzeugung von Bildern / 259 \\ C.5.4.3 Logo Zeichens{\"a}tze / 259 \\ C.6 Die Anordnung innerhalb der Zeichens{\"a}tze / 260 \\ C.7 Die Zeichensatzfiles / 265 \\ C.7.1 Die Grundnamen / 265 \\ C.7.2 Vergr{\"o}{\ss}erte Zeichens{\"a}tze / 265 \\ C.7.3 Pixel-Kodierung / 267 \\ C.7.4 Gepackte Kodierung / 269 \\ C.8 Anmerkungen zu METflFONT / 270 \\ D LaTeX-Erg{\"a}nzungen / 273 \\ D.1 Der deutsche TEX-Befehlszusatz / 273 \\ D.1.1 Die Umlaute und das {\ss} / 274 \\ D.1.2 Trennhilfen / 274 \\ D.1.3 Aufhebung von Ligaturen / 275 \\ D.1.4 Deutsche Anf{\"u}hrungszeichen / 275 \\ D.1.5 Franz{\"o}sische Anf{\"u}hrungszeichen / 275 \\ D.1.6 Sprachumschaltung / 276 \\ D.1.7 Umschaltung auf das TeX-Original / 276 \\ D.1.8 Der Aufruf des german.sty Files / 277 \\ D.2 Der german.sty File / 278 \\ D.2.1 Strukturbeschreibung des german.sty Files / 278 \\ D.2.2 Anpassung der LaTeX .sty Files an den german.sty File / 281 \\ D.2.3 Die Kombination der letter.sty und german.sty Files / 283 \\ D.3 Weitere LaTeX Erg{\"a}nzungen / 285 \\ Literaturverzeichnis / 287 \\ Befehlsindex / 289 \\ Kurzbeschreibung der LaTeX-Befehle / 289 \\ Zusammenfassende Tabellen und Diagramme / 332 \\ Verbotene TeX-Befehle / 339

entry:
@Book{Kopka:1988:LE,
  author =       "Helmut Kopka",
  title =        "{{\LaTeX}: Eine Einf{\"u}hrung}",
  publisher =    pub-AWV,
  address =      pub-AWV:adr,
  edition =      "Second",
  pages =        "xvi + 340",
  year =         "1988",
  ISBN =         "3-89319-136-4, 3-89319-199-2",
  ISBN-13 =      "978-3-89319-136-9, 978-3-89319-199-4",
  bibdate =      "Wed Jul 6 15:09:48 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Grundlagen / 1 \\
                 1.1 TeX und LaTeX / 2 \\
                 1.2 Text und Befehle / 3 \\
                 1.3 Grundstruktur eines LaTeX-Files / 3 \\
                 1.4 LaTeX-Bearbeitungsnioden / 5 \\
                 1.5 Erl{\"a}uterungen zum vorliegenden Text / 5 \\
                 1.6 Die Erzeugung eines LaTeX-Dokuments / 6 \\
                 1.7 Hinweise f{\"u}r Autoren / 7 \\
                 2 Befehle und Umgebungen / 9 \\
                 2.1 Befehlsnamen und Befehlsargumente / 9 \\
                 2.2 Umgebungen (environment) / 10 \\
                 2.3 Erkl{\"a}rungen (declaration) / 11 \\
                 2.4 Ma{\ss}angaben / 12 \\
                 2.4.1 Feste Ma{\ss}e / 12 \\
                 2.4.2 Elastische Ma{\ss}e / 12 \\
                 2.5 Sonderzeichen / 13 \\
                 2.5.1 Eingabe der Umlaute und des {\ss} / 13 \\
                 2.5.2 Anf{\"u}hrungsstriche / 13 \\
                 2.5.3 Trenn-, Binde- und Gedankenstriche / 14 \\
                 2.5.4 Der Druck von Befehlszeichen / 14 \\
                 2.5.5 Die Sonderzeichen \S, $\dagger$, $\ddagger$,
                 $\P$, $\copyright$ und $\pounds$ / 14 \\
                 2.5.6 Sonderbuchstaben in Fremdsprachen / 14 \\
                 2.5.7 Akzente / 14 \\
                 2.5.8 Ligaturen / 15 \\
                 2.5.9 Das Datum / 15 \\
                 2.6 Zerbrechliche Befehle / 15 \\
                 2.7 {\"U}bungen / 16 \\
                 3 Dokument- und Seitenstil / 19 \\
                 3.1 Der Dokumentstil / 19 \\
                 3.2 Der Seitenstil / 21 \\
                 3.2.1 Kopfdeklarationen / 21 \\
                 3.2.2 Seitennumerierung / 22 \\
                 3.2.3 Zeilen- und Absatzabst{\"a}nde / 23 \\
                 3.2.4 Seitendeklarationen / 23 \\
                 3.2.5 Ein- und zweispaltige Seiten / 25 \\
                 3.3 Dokumentuntergliederung / 25 \\
                 3.3.1 Die Titelseite / 26 \\
                 3.3.2 Der Abstrakt / 28 \\
                 3.3.3 Die fortlaufende Untergliederung / 28 \\
                 3.3.4 Der Anhang / 30 \\
                 3.4 Das Inhaltsverzeichnis / 31 \\
                 3.4.1 Automatische Eintragungen / 31 \\
                 3.4.2 Der Ausdruck des Inhaltsverzeichnisses / 31 \\
                 3.4.3 Zus{\"a}tzliche Eintragungen / 31 \\
                 3.4.4 Weitere Verzeichnisse / 32 \\
                 3.5 Formatierungshilfen / 33 \\
                 3.5.1 Zeichen- und Wortabst{\"a}nde / 33 \\
                 3.5.1.1 Der und das Satzende / 33 \\
                 3.5.1.2 Frenchspacing / 33 \\
                 3.5.1.3 Die Zeichenkombination `` und '' / 34 \\
                 3.5.1.4 Italic-Korrektur / 34 \\
                 3.5.1.5 Die Ausschaltung von Ligaturen / 34 \\
                 3.5.1.6 Einf{\"u}gung beliebiger Zwischenr{\"a}ume / 34
                 \\
                 3.5.1.7 Einf{\"u}gung von \ldots{} und \_\_\_ Sequenzen
                 / 35 \\
                 3.5.2 Zeilenumbruch / 36 \\
                 3.5.2.1 Der Befehl \\ / 36 \\
                 3.5.2.2 Weitere Zeilenumbruchbefehle / 36 \\
                 3.5.3 Absatzabstand / 37 \\
                 3.5.4 Absatzeinr{\"u}ckungen / 37 \\
                 3.5.5 Seitenumbruch / 38 \\
                 3.5.5.1 Normale Textseiten / 38 \\
                 3.5.5.2 Seiten mit Bildern und Tabellen / 38 \\
                 3.5.5.3 Zweispaltige Seiten / 39 \\
                 3.5.5.4 Doppelseitiger Druck / 39 \\
                 3.5.5.5 Eingeschr{\"a}nkter Umbruch / 39 \\
                 3.5.5.6 Weitere Hilfen zum Seitenumbruch / 40 \\
                 3.6 Trennhilfen / 41 \\
                 3.6.1 Direkte Trennhilfen / 41 \\
                 3.6.2 Erzeugung einer Trennliste / 42 \\
                 3.6.3 Vermeidung von Trennungen / 42 \\
                 3.6.4 Zeilenbreite und Trennungen / 43 \\
                 3.6.5 Zusatzinformation {\"u}ber Trennungen / 43 \\
                 4 Texthervorhebungen / 45 \\
                 4.1 {\"A}nderung der Schrift / 45 \\
                 4.1.1 Die Standardumschaltung \em / 45 \\
                 4.1.2 Die verf{\"u}gbaren Schriftarten / 46 \\
                 4.1.3 Die Wahl der Schriftgr{\"o}{\ss}e / 46 \\
                 4.1.4 Zus{\"a}tzliche Schriftarten / 48 \\
                 4.1.5 Zeichens{\"a}tze und Symbole / 48 \\
                 4.2 Textverschiebungen / 49 \\
                 4.2.1 Zentrierter Text / 49 \\
                 4.2.2 Einseitig b{\"u}ndiger Text / 49 \\
                 4.2.3 Beidseitig einger{\"u}ckter Text / 49 \\
                 4.2.4 Verseinr{\"u}ckungen / 50 \\
                 4.3 Aufz{\"a}hlungen / 51 \\
                 4.3.1 Beispiel `itemize' / 51 \\
                 4.3.2 Beispiel `enumerate' / 52 \\
                 4.3.3 Beispiel `description' / 52 \\
                 4.3.4 Geschachtelte Aufz{\"a}hlungen / 52 \\
                 4.3.5 {\"A}nderung der Markierungen / 54 \\
                 4.3.6 Literaturverzeichnis / 56 \\
                 4.4 Allgemeine Listen / 58 \\
                 4.4.1 Die Standardmarke / 58 \\
                 4.4.2 Die Listenerkl{\"a}rung / 59 \\
                 4.4.3 Beispiel f{\"u}r eine benutzergestaltete Liste /
                 60 \\
                 4.4.4 Listendefinitionen als neue Umgebungen / 61 \\
                 4.4.5 Triviale Listen / 62 \\
                 4.4.6 Verschachtelte Listen / 62 \\
                 4.5 Regels{\"a}tze / 63 \\
                 4.6 Tabulatorsetzungen / 64 \\
                 4.6.1 Grundlagen / 64 \\
                 4.6.2 Musterzeile / 64 \\
                 4.6.3 Tabstops und linker Rand / 65 \\
                 4.6.4 Weitere Tabulatorbefehle / 65 \\
                 4.6.5 Zusatzbemerkungen / 66 \\
                 4.7 Boxen / 68 \\
                 4.7.1 LR-Boxen / 68 \\
                 4.7.2 Vertikale Verschiebungen von LR-Boxen / 69 \\
                 4.7.3 Absatzboxen und Teilseiten / 70 \\
                 4.7.4 Rule-Boxen / 71 \\
                 4.7.5 Verschachtelte Boxen / 72 \\
                 4.7.6 Box-Stilparameter / 73 \\
                 4.8 Tabellen / 74 \\
                 4.8.1 Die Konstruktion von Tabellen / 74 \\
                 4.8.2 Die {\"A}nderung des Tabellenstils / 76 \\
                 4.8.3 Beispiele von Tabellenkonstruktionen / 77 \\
                 4.8.4 Gleitende Tabellen / 84 \\
                 4.9 Fu{\ss}noten und Randnotizen / 86 \\
                 4.9.1 Standardfu{\ss}noten / 86 \\
                 4.9.2 Abweichungen vom Standard / 86 \\
                 4.9.3 {\"A}nderung des Fu{\ss}notenstils / 87 \\
                 4.9.4 Fu{\ss}noten in unerlaubten Moden / 88 \\
                 4.9.5 Fu{\ss}noten in Minipages / 89 \\
                 4.9.6 Randnotizen / 89 \\
                 4.9.7 Stilparameter f{\"u}r Randboxen / 91 \\
                 4.10 Ausdruck von Originaltext / 91 \\
                 4.11 Kommentare im Eingabetext / 92 \\
                 5 Mathematische Formeln / 93 \\
                 5.1 Mathematische Umgebungen / 93 \\
                 5.2 Die Hauptkonstruktionselemente / 94 \\
                 5.2.1 Konstante, Variable und ihre Verkn{\"u}pfungen /
                 94 \\
                 5.2.2 Hoch- und Tiefstellungen von Zeichen / 95 \\
                 5.2.3 Br{\"u}che / 95 \\
                 5.2.4 Wurzeln / 96 \\
                 5.2.5 Summen und Integrale / 96 \\
                 5.2.6 Fortsetzungspunkte - Ellipsen / 97 \\
                 5.3 Mathematische Symbole / 98 \\
                 5.3.1 Griechische Buchstaben / 98 \\
                 5.3.2 Kalligraphische Buchstaben / 98 \\
                 5.3.3 Bin{\"a}re Operationssymbole / 99 \\
                 5.3.4 Vergleichssymbole und deren Negation / 99 \\
                 5.3.5 Pfeil- oder Zeigersymbole / 100 \\
                 5.3.6 Verschiedene sonstige Symbole / 100 \\
                 5.3.7 Symbole in zwei Gr{\"o}{\ss}en / 101 \\
                 5.3.8 Funktionsnamen / 101 \\
                 5.3.9 Mathematische Akzente / 102 \\
                 5.4 Weitere Konstruktionselemente / 103 \\
                 5.4.1 Automatische Gr{\"o}{\ss}enanpassung von
                 Klammersymbolen / 104 \\
                 5.4.2 Gew{\"o}hnlicher Text innerhalb von Formeln / 105
                 \\
                 5.4.3 Matrizen und Felder / 105 \\
                 5.4.4 Uber- und Unterstreichen von Teilformeln / 108
                 \\
                 5.4.5 Gestockte Symbole / 108 \\
                 5.4.6 Zus{\"a}tzliche mathematische T{\ss}X-Befehle /
                 109 \\
                 5.4.7 Mehrzellige Formeln / 110 \\
                 5.4.8 Gerahmte oder nebeneinander stehende Formeln /
                 113 \\
                 5.4.9 Chemische Formeln - Fettdruck in Formeln / 114
                 \\
                 5.5 Mathematische Formatierungshilfen / 115 \\
                 5.5.1 Horizontale Abst{\"a}nde / 115 \\
                 5.5.2 Die Wahl der Schriftgr{\"o}{\ss}en in Formeln /
                 116 \\
                 5.5.3 Manuelle Gr{\"o}{\ss}enwahl der Klammersymbole /
                 118 \\
                 5.5.4 Mathematische Stilparameter / 118 \\
                 5.5.5 Einige Zusatzempfehlungen / 119 \\
                 5.5.6 Gerahmte abgesetzte Formeln / 121 \\
                 5.5.7 Was ist sonst noch m{\"o}glich? / 122 \\
                 6 Bilder / 123 \\
                 6.1 Ma{\ss}- und Positionierungsangaben / 123 \\
                 6.2 Die Bildumgebung - picture / 124 \\
                 6.3 Die Positionierungsbefehle / 125 \\
                 6.4 Die Bildobjekt-Befehle / 126 \\
                 6.4.1 Text im Bild / 126 \\
                 6.4.2 Bildboxen - Rechtecke / 126 \\
                 6.4.3 Gerade Linien / 129 \\
                 6.4.4 Pfeile / 130 \\
                 6.4.5 Kreise / 131 \\
                 6.4.6 Ovale und gerundete Ecken / 131 \\
                 6.4.7 Vertikal gestockte Texte / 133 \\
                 6.4.8 Textangepa{\ss}te Rahmen / 133 \\
                 6.5 Weitere Bildbefehle und Beispiele / 134 \\
                 6.5.1 Strichst{\"a}xken / 134 \\
                 6.5.2 Verschachtelte Bilder / 135 \\
                 6.5.3 Speicherung von Bildteilen / 136 \\
                 6.5.4 Erweiterte picture-Umgebung / 139 \\
                 6.5.5 Weitere Beispiele / 139 \\
                 6.5.6 Allgemeine Empfehlungen / 141 \\
                 6.6 Gleitende Tabellen und Bilder / 142 \\
                 6.6.1 Die Plazierung von Gleitobjekten / 142 \\
                 6.6.2 Stilparameter f{\"u}r gleitende Objekte / 143 \\
                 6.6.3 Uber- und Unterschriften f{\"u}r gleitende
                 Objekte / 145 \\
                 6.6.4 Beispiele f{\"u}r Gleitobjekte / 146 \\
                 6.6.5 Bild- und Tabellenreferenzen im Text / 148 \\
                 7 Benutzereigene Strukturen / 149 \\
                 7.1 Z{\"a}hler / 149 \\
                 7.1.1 M?{\ss}X-eigene Z{\"a}hler / 149 \\
                 7.1.2 Benutzereigene Z{\"a}hler / 150 \\
                 7.1.3 Ver{\"a}nderung der Z{\"a}hlerwerte / 150 \\
                 7.1.4 Der Ausdruck von Z{\"a}hlerst{\"a}nden / 151 \\
                 7.2 L{\"a}ngen / 152 \\
                 7.3 Benutzereigene Befehle / 153 \\
                 7.3.1 Befehle ohne Parameter / 153 \\
                 7.3.2 Befehle mit Parametern / 155 \\
                 7.3.3 Weitere Beispiele / 156 \\
                 7.4 Benutzereigene Umgebungen / 159 \\
                 7.4.1 Umgebungen ohne Parameter / 159 \\
                 7.4.2 Umgebungen mit Parametern / 161 \\
                 7.5 Allgemeine Bemerkungen zu Benutzerstrukturen / 163
                 \\
                 7.5.1 Abspeichern von benutzereigenen Strukturen / 163
                 \\
                 7.5.2 Strukturen zur Abk{\"u}rzung / 163 \\
                 7.5.3 Gleiche Befehls- und Z{\"a}hlernamen / 164 \\
                 7.5.4 Die Reichweite benutzereigener Definitionen / 164
                 \\
                 7.5.5 Die Reihenfolge von Strukturdefinitionen / 164
                 \\
                 7.5.6 Weitergereichte Parameter / 165 \\
                 7.5.7 Verschachtelte Definitionen / 165 \\
                 7.5.8 Unerw{\"u}nschte Zwischenr{\"a}ume / 166 \\
                 7.5.9 Zwei abschlie{\ss}ende Beispiele / 167 \\
                 7.6 Benutzerspezifische LaTeX-Anpassungen / 169 \\
                 7.6.1 LaTeX-Strukturbeschreibung / 170 \\
                 7.6.2 LaTeX-Anpassungen f{\"u}r deutsche Texte / 171
                 \\
                 7.6.3 Weitere Dokumentstil-Optionen / 173 \\
                 7.6.4 Einige Zusatzhinweise / 174 \\
                 7.6.5 PC-LaTeX Anpassungen / 175 \\
                 7.6.6 Anmerkungen zum WEB-Programmsystem / 176 \\
                 8 Miszellaneen / 177 \\
                 8.1 Behandlung von Teildokumenten / 177 \\
                 8.1.1 Der ``input'' Befehl / 177 \\
                 8.1.2 Der ``include'' Befehl / 178 \\
                 8.1.3 Terminal Ein- und Ausgabe / 180 \\
                 8.2 Textbez{\"u}ge / 182 \\
                 8.2.1 Kreuzreferenzen / 182 \\
                 8.2.2 Bez{\"u}ge zum Literaturverzeichnis / 183 \\
                 8.2.3 Indexregister / 185 \\
                 8.2.4 Glossaxy / 186 \\
                 8.3 Die verschiedenen LaTeX-Files / 187 \\
                 8.4 Geladene und nachladbare Zeichens{\"a}tze / 189 \\
                 9 Fehlerbehandlung / 101 \\
                 9.1 Grundstruktur der Fehlermeldungen / 191 \\
                 9.1.1 TeX-Fehlermeldungen / 191 \\
                 9.1.2 LaTeX-Fehlermeldungen / 194 \\
                 9.1.3 Fehlermeldungen aus TeX-Makros / 198 \\
                 9.2 Fehler durch Fehler / 199 \\
                 9.2.1 Typische Fehler mit Folgewirkung / 201 \\
                 9.2.2 Mathematische Fehlermeldungen / 203 \\
                 9.2.3 Fehlermeldungen bei Mehrfiletexten / 205 \\
                 9.3 Verzeichnis aller LaTeX-Fehler / 206 \\
                 9.4 TeX-Fehlermeldungen / 209 \\
                 9.5 Warnungen / 215 \\
                 9.5.1 LaTeX-Warnungen / 215 \\
                 9.5.2 TeX-Warnungen / 216 \\
                 9.6 Suche nach versteckten Fehlern / 217 \\
                 A Briefe / 219 \\
                 A.1 Der LaTeX-letter Stil / 219 \\
                 A.2 Ein hauseigener letter Stil / 223 \\
                 A.3 Hinweise zur firmenspezifischen Anpassung / 226 \\
                 A.3.1 Benutzereigene Briefbefehle / 227 \\
                 A.3.2 Benutzereigene Briefformulare / 228 \\
                 B Literaturdatenbanken / 231 \\
                 B.1 Das BiBTeX-Programm / 231 \\
                 B.2 Die Erstellung einer Literaturdatenbank / 233 \\
                 B.2.1 Die verschiedenen Eingabetypen / 234 \\
                 B.2.2 Felder / 236 \\
                 B.2.3 Spezielle Feldformate / 237 \\
                 B.2.4 Abk{\"u}rzungen / 239 \\
                 C Zeichens{\"a}tze / 241 \\
                 C.1 Vorbemerkungen / 241 \\
                 C.2 Klassifizierung der TeX-Grundzeichens{\"a}tze / 242
                 \\
                 C.3 Proportionalschriften / 244 \\
                 C.3.1 Serifenschriften / 244 \\
                 C.3.1.1 Die Zeichensatzfamilie ``Roman'' / 244 \\
                 C.3.1.2 Die Zeichensatzfamilie ``Slanted'' / 246 \\
                 C.3.1.3 Die Zeichensatzfamilie ``Italic'' / 246 \\
                 C.3.1.4 Die Zeichensatzfamilie ``Bold Face''
                 (Fettdruck) / 247 \\
                 C.3.2 Sans Serifenschriften / 248 \\
                 C.3.2.1 Die ``senkrechten Sans Serif'' Zeichens{\"a}tze
                 / 249 \\
                 C.3.2.2 Die ``geneigten Sans Serif'' Zeichens{\"a}tze /
                 250 \\
                 C.3.2.3 Die ``fetten Sans Serif'' Zeichens{\"a}tze /
                 251 \\
                 C.3.2.4 Der Zeichensatz cminch / 251 \\
                 C.3.3 Zier- und Sonderschriften / 253 \\
                 C.4 Fixschriften - Schreibmaschinenschriften / 254 \\
                 C.4.1 Senkrechte Schreibmaschinenschriften / 254 \\
                 C.4.2 Gro{\ss}schreibung / 255 \\
                 C.4.3 Geneigte Schreibmaschinenschriften / 255 \\
                 C.4.4 Mathematische Schreibmaschinenschrift / 255 \\
                 C.5 Mathematik- und Symbolzeichens{\"a}tze / 256 \\
                 C.5.1 Mathematische Textzeichens{\"a}tze / 256 \\
                 C.5.2 Mathematische Symbole / 257 \\
                 C.5.3 Variable Symbole / 258 \\
                 C.5.4 Zus{\"a}tzliche Zeichens{\"a}tze / 258 \\
                 C.5.4.1 Die LaTeX-lasy Zeichens{\"a}tze / 259 \\
                 C.5.4.2 Zeichens{\"a}tze zur Erzeugung von Bildern /
                 259 \\
                 C.5.4.3 Logo Zeichens{\"a}tze / 259 \\
                 C.6 Die Anordnung innerhalb der Zeichens{\"a}tze / 260
                 \\
                 C.7 Die Zeichensatzfiles / 265 \\
                 C.7.1 Die Grundnamen / 265 \\
                 C.7.2 Vergr{\"o}{\ss}erte Zeichens{\"a}tze / 265 \\
                 C.7.3 Pixel-Kodierung / 267 \\
                 C.7.4 Gepackte Kodierung / 269 \\
                 C.8 Anmerkungen zu METflFONT / 270 \\
                 D LaTeX-Erg{\"a}nzungen / 273 \\
                 D.1 Der deutsche TEX-Befehlszusatz / 273 \\
                 D.1.1 Die Umlaute und das {\ss} / 274 \\
                 D.1.2 Trennhilfen / 274 \\
                 D.1.3 Aufhebung von Ligaturen / 275 \\
                 D.1.4 Deutsche Anf{\"u}hrungszeichen / 275 \\
                 D.1.5 Franz{\"o}sische Anf{\"u}hrungszeichen / 275 \\
                 D.1.6 Sprachumschaltung / 276 \\
                 D.1.7 Umschaltung auf das TeX-Original / 276 \\
                 D.1.8 Der Aufruf des german.sty Files / 277 \\
                 D.2 Der german.sty File / 278 \\
                 D.2.1 Strukturbeschreibung des german.sty Files / 278
                 \\
                 D.2.2 Anpassung der LaTeX .sty Files an den german.sty
                 File / 281 \\
                 D.2.3 Die Kombination der letter.sty und german.sty
                 Files / 283 \\
                 D.3 Weitere LaTeX Erg{\"a}nzungen / 285 \\
                 Literaturverzeichnis / 287 \\
                 Befehlsindex / 289 \\
                 Kurzbeschreibung der LaTeX-Befehle / 289 \\
                 Zusammenfassende Tabellen und Diagramme / 332 \\
                 Verbotene TeX-Befehle / 339",
}


bibtype: book
filename: master.bib
label: Kopka:1993:GLD
author: Helmut Kopka and Patrick W. Daly
title: A Guide to LaTeX : Document Preparation for Beginners and Advanced Users
publisher: pub-AW
address: pub-AW:adr
pages: xvi + 436
year: 1993
ISBN: 0-201-56889-6 OR 0201568896
ISBN13: 978-0-201-56889-9 OR 9780201568899
LCCN: Z253.4.L38 K66 1993
bibdate: Wed Jul 6 14:19:35 1994
bibtimestamp: 1994.07.06 14:19:35 ???
acknowledgement: ack-nhfb
rawauthor: Helmut Kopka and Patrick W. Daly
rawtitle: A Guide to {\LaTeX}: Document Preparation for Beginners and Advanced Users
TOC:
1: Introduction 2: Commands and Environments 3: Document and Page Styles 4: Displayed Text 5: Mathematical Formulas 6: Pictures 7: User-Defined Structures 8: Advanced Features 9: Error Messages A: Letters B: Bibliographic Data Bases C: SliTeX D: LaTeX Extensions E: Character Fonts F: Command Summary

rawTOC:
1: Introduction \\ 2: Commands and Environments \\ 3: Document and Page Styles \\ 4: Displayed Text \\ 5: Mathematical Formulas \\ 6: Pictures \\ 7: User-Defined Structures \\ 8: Advanced Features \\ 9: Error Messages \\ A: Letters \\ B: Bibliographic Data Bases \\ C: \SliTeX{} \\ D: \LaTeX{} Extensions \\ E: Character Fonts \\ F: Command Summary

entry:
@Book{Kopka:1993:GLD,
  author =       "Helmut Kopka and Patrick W. Daly",
  title =        "A Guide to {\LaTeX}: Document Preparation for
                 Beginners and Advanced Users",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvi + 436",
  year =         "1993",
  ISBN =         "0-201-56889-6",
  ISBN-13 =      "978-0-201-56889-9",
  LCCN =         "Z253.4.L38 K66 1993",
  bibdate =      "Wed Jul 6 14:19:35 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$34.50",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: Commands and Environments \\
                 3: Document and Page Styles \\
                 4: Displayed Text \\
                 5: Mathematical Formulas \\
                 6: Pictures \\
                 7: User-Defined Structures \\
                 8: Advanced Features \\
                 9: Error Messages \\
                 A: Letters \\
                 B: Bibliographic Data Bases \\
                 C: \SliTeX{} \\
                 D: \LaTeX{} Extensions \\
                 E: Character Fonts \\
                 F: Command Summary",
}


bibtype: book
filename: master.bib
label: Kopka:1995:GDP
author: Helmut Kopka and Patrick W. Daly
title: A Guide to LaTeX 2e: Document Preparation for Beginners and Advanced Users
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: x + 554
year: 1995
ISBN: 0-201-42777-X OR 020142777X
ISBN13: 978-0-201-42777-6 OR 9780201427776
LCCN: Z253.4.L38 K66 1995
bibdate: Thu May 25 15:18:31 1995
bibtimestamp: 1995.05.25 15:18:31 ???
acknowledgement: ack-nhfb
rawauthor: Helmut Kopka and Patrick W. Daly
rawtitle: A Guide to {\LaTeX}2e: Document Preparation for Beginners and Advanced Users
abstract:
If you are a user with little or no experience of computers or text formatting and you want to master LaTeX to produce documents of high quality, this is the book for you. Fully revised to cover both LaTeX 2.09 and the latest version LaTeX $ 2_epsilon $, this tutorial contains an exciting new text design that makes it even more accessible than before.

rawabstract:
If you are a user with little or no experience of computers or text formatting and you want to master \LaTeX{} to produce documents of high quality, this is the book for you. Fully revised to cover both \LaTeX{} 2.09 and the latest version \LaTeX{} $ 2_\epsilon $, this tutorial contains an exciting new text design that makes it even more accessible than before.

entry:
@Book{Kopka:1995:GDP,
  author =       "Helmut Kopka and Patrick W. Daly",
  title =        "A Guide to {\LaTeX}2e: Document Preparation for
                 Beginners and Advanced Users",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "x + 554",
  year =         "1995",
  ISBN =         "0-201-42777-X",
  ISBN-13 =      "978-0-201-42777-6",
  LCCN =         "Z253.4.L38 K66 1995",
  bibdate =      "Thu May 25 15:18:31 1995",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  price =        "US\$37.61",
  abstract =     "If you are a user with little or no experience of
                 computers or text formatting and you want to master
                 \LaTeX{} to produce documents of high quality, this is
                 the book for you. Fully revised to cover both \LaTeX{}
                 2.09 and the latest version \LaTeX{} $ 2_\epsilon $,
                 this tutorial contains an exciting new text design that
                 makes it even more accessible than before.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Kopka:1999:GLD
author: Helmut Kopka and Patrick W. Daly
title: A Guide to LaTeXe : Document Preparation for Beginners and Advanced Users
publisher: pub-AW
address: pub-AW:adr
edition: Third
pages: xv + 600
year: 1999
ISBN: 0-201-39825-7 OR 0201398257
ISBN13: 978-0-201-39825-0 OR 9780201398250
LCCN: Z253.4.L38 K66 1999
bibdate: Thu Apr 12 11:15:10 2001
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2001.04.12 11:15:10 ???
acknowledgement: ack-nhfb
rawauthor: Helmut Kopka and Patrick W. Daly
rawtitle: A Guide to {\LaTeXe}: Document Preparation for Beginners and Advanced Users
abstract:
This updated guide to LaTeX document preparation. It covers the basics as well as advanced topics and recent LaTeX extensions. A section is included on 32-bit PCs and LaTeX on Windows and NT.

TOC:
Introduction Commands and environments Document layout and organization Displayed text Mathematical formulas Illustrations User Customization Advanced features Error messages

rawabstract:
This updated guide to LaTeX document preparation. It covers the basics as well as advanced topics and recent LaTeX extensions. A section is included on 32-bit PCs and LaTeX on Windows and NT.

rawTOC:
Introduction \\ Commands and environments \\ Document layout and organization \\ Displayed text \\ Mathematical formulas \\ Illustrations \\ User Customization \\ Advanced features \\ Error messages

entry:
@Book{Kopka:1999:GLD,
  author =       "Helmut Kopka and Patrick W. Daly",
  title =        "A Guide to {\LaTeXe}: Document Preparation for
                 Beginners and Advanced Users",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xv + 600",
  year =         "1999",
  ISBN =         "0-201-39825-7",
  ISBN-13 =      "978-0-201-39825-0",
  LCCN =         "Z253.4.L38 K66 1999",
  bibdate =      "Thu Apr 12 11:15:10 2001",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$44.95",
  abstract =     "This updated guide to LaTeX document preparation. It
                 covers the basics as well as advanced topics and recent
                 LaTeX extensions. A section is included on 32-bit PCs
                 and LaTeX on Windows and NT.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 Commands and environments \\
                 Document layout and organization \\
                 Displayed text \\
                 Mathematical formulas \\
                 Illustrations \\
                 User Customization \\
                 Advanced features \\
                 Error messages",
}


bibtype: book
filename: master.bib
label: Kopka:2004:GLT
author: Helmut Kopka and Patrick W. Daly
title: Guide to LaTeX : Tools and Techniques for Computer Typesetting
publisher: pub-AW
address: pub-AW:adr
edition: Fourth
pages: xii + 597
year: 2004
ISBN: 0-321-17385-6 (paperback) OR 0321173856 (paperback)
ISBN13: 978-0-321-17385-0 (paperback) OR 9780321173850 (paperback)
LCCN: Z253.4.L38 K66 2004
bibdate: Wed Jan 21 05:16:54 2004
bibtimestamp: 2004.01.21 05:16:54 ???
note: Includes CD-ROM.
acknowledgement: ack-nhfb
rawauthor: Helmut Kopka and Patrick W. Daly
rawnote: Includes CD-ROM.
rawtitle: Guide to {\LaTeX}: Tools and Techniques for Computer Typesetting
abstract:
LaTeX is the text-preparation system of choice for scientists and academics, and is especially useful for typesetting technical materials. This popular book shows you how to begin using LaTeX to create high-quality documents. The book also serves as a handy reference of all LaTeX users. In this completely revised edition, the authors cover the LaTeX $_2 epsilon $ standard and offer more details, examples, exercises, tips, and tricks. They go beyond the core installation to describe the key contributed packages that have become essential to LaTeX processing.

TOC:
Text, symbols, and commands Document layout and organization Displaying text Text in boxes Tables Mathematical formulas Graphics inclusion and color Floating tables and figures User customizations Document management Bibliographic databases and BibTeX PostScript and PDF Multilingual LaTeX Math extensions with AMS-LaTeX Drawing with LaTeX Presentation material Letters.

rawabstract:
\LaTeX{} is the text-preparation system of choice for scientists and academics, and is especially useful for typesetting technical materials. This popular book shows you how to begin using \LaTeX{} to create high-quality documents. The book also serves as a handy reference of all \LaTeX{} users. In this completely revised edition, the authors cover the \LaTeX$_{2 \epsilon }$ standard and offer more details, examples, exercises, tips, and tricks. They go beyond the core installation to describe the key contributed packages that have become essential to \LaTeX{} processing.

rawTOC:
Text, symbols, and commands \\ Document layout and organization \\ Displaying text \\ Text in boxes \\ Tables \\ Mathematical formulas \\ Graphics inclusion and color \\ Floating tables and figures \\ User customizations \\ Document management \\ Bibliographic databases and BibTeX \\ PostScript and PDF \\ Multilingual LaTeX \\ Math extensions with AMS-LaTeX \\ Drawing with LaTeX\\ Presentation material \\ Letters.

entry:
@Book{Kopka:2004:GLT,
  author =       "Helmut Kopka and Patrick W. Daly",
  title =        "Guide to {\LaTeX}: Tools and Techniques for Computer
                 Typesetting",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Fourth",
  pages =        "xii + 597",
  year =         "2004",
  ISBN =         "0-321-17385-6 (paperback)",
  ISBN-13 =      "978-0-321-17385-0 (paperback)",
  LCCN =         "Z253.4.L38 K66 2004",
  bibdate =      "Wed Jan 21 05:16:54 2004",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$49.99, CAN\$75.99",
  abstract =     "\LaTeX{} is the text-preparation system of choice for
                 scientists and academics, and is especially useful for
                 typesetting technical materials. This popular book
                 shows you how to begin using \LaTeX{} to create
                 high-quality documents. The book also serves as a handy
                 reference of all \LaTeX{} users. In this completely
                 revised edition, the authors cover the \LaTeX$_{2
                 \epsilon }$ standard and offer more details, examples,
                 exercises, tips, and tricks. They go beyond the core
                 installation to describe the key contributed packages
                 that have become essential to \LaTeX{} processing.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Text, symbols, and commands \\
                 Document layout and organization \\
                 Displaying text \\
                 Text in boxes \\
                 Tables \\
                 Mathematical formulas \\
                 Graphics inclusion and color \\
                 Floating tables and figures \\
                 User customizations \\
                 Document management \\
                 Bibliographic databases and BibTeX \\
                 PostScript and PDF \\
                 Multilingual LaTeX \\
                 Math extensions with AMS-LaTeX \\
                 Drawing with LaTeX\\
                 Presentation material \\
                 Letters.",
}


bibtype: book
filename: master.bib
label: Koren:2002:CAA
author: Israel Koren
title: Computer Arithmetic Algorithms
publisher: pub-A-K-PETERS
address: pub-A-K-PETERS:adr
edition: Second
pages: xv + 281
year: 2002
ISBN: 1-56881-160-8 (hardcover), 1-4398-6371-7 (e-book) OR 1568811608 (hardcover), 1439863717 (ebook)
LCCN: QA76.9.C62 K67
bibdate: Sat May 04 10:29:22 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.05.04 10:29:22 ???
acknowledgement: ack-nhfb
rawauthor: Israel Koren
rawtitle: Computer Arithmetic Algorithms
ISBN13:
978-1-56881-160-4 (hardcover), 978-1-4398-6371-8 (e-book) OR 9781568811604 (hardcover), 9781439863718 (ebook)

abstract:
Concentrating on the underlying principles, this book explains the algorithms used in arithmetic operations on digital computers. It identifies the similarities between the different algorithms and provides guidance for selecting the appropriate algorithms for a given technology. Chapters cover conventional number systems, unconventional fixed-radix number systems, sequential algorithms for multiplication and division, binary floating-point numbers, fast addition, high-speed multiplication, fast division, division through multiplication, the evaluations of elementary functions, logarithmic number systems, and the residue number system.

TOC:
1: Conventional Number Systems 2: Unconventional Fixed-Radix Number Systems 3: Sequential Algorithms for Multiplication and Division 4: Binary Floating-Point Numbers 5: Fast Addition 6: High-Speed Multiplication 7: Fast Division 8: Division Through Multiplication 9: Evaluation of Elementary Functions 10: Logarithmic Number Systems 11: The Residue Number System

rawabstract:
Concentrating on the underlying principles, this book explains the algorithms used in arithmetic operations on digital computers. It identifies the similarities between the different algorithms and provides guidance for selecting the appropriate algorithms for a given technology. Chapters cover conventional number systems, unconventional fixed-radix number systems, sequential algorithms for multiplication and division, binary floating-point numbers, fast addition, high-speed multiplication, fast division, division through multiplication, the evaluations of elementary functions, logarithmic number systems, and the residue number system.

rawTOC:
1: Conventional Number Systems \\ 2: Unconventional Fixed-Radix Number Systems \\ 3: Sequential Algorithms for Multiplication and Division \\ 4: Binary Floating-Point Numbers \\ 5: Fast Addition \\ 6: High-Speed Multiplication \\ 7: Fast Division \\ 8: Division Through Multiplication \\ 9: Evaluation of Elementary Functions \\ 10: Logarithmic Number Systems \\ 11: The Residue Number System

entry:
@Book{Koren:2002:CAA,
  author =       "Israel Koren",
  title =        "Computer Arithmetic Algorithms",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  edition =      "Second",
  pages =        "xv + 281",
  year =         "2002",
  ISBN =         "1-56881-160-8 (hardcover), 1-4398-6371-7 (e-book)",
  ISBN-13 =      "978-1-56881-160-4 (hardcover), 978-1-4398-6371-8
                 (e-book)",
  LCCN =         "QA76.9.C62 K67",
  bibdate =      "Sat May 04 10:29:22 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Concentrating on the underlying principles, this book
                 explains the algorithms used in arithmetic operations
                 on digital computers. It identifies the similarities
                 between the different algorithms and provides guidance
                 for selecting the appropriate algorithms for a given
                 technology. Chapters cover conventional number systems,
                 unconventional fixed-radix number systems, sequential
                 algorithms for multiplication and division, binary
                 floating-point numbers, fast addition, high-speed
                 multiplication, fast division, division through
                 multiplication, the evaluations of elementary
                 functions, logarithmic number systems, and the residue
                 number system.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Conventional Number Systems \\
                 2: Unconventional Fixed-Radix Number Systems \\
                 3: Sequential Algorithms for Multiplication and
                 Division \\
                 4: Binary Floating-Point Numbers \\
                 5: Fast Addition \\
                 6: High-Speed Multiplication \\
                 7: Fast Division \\
                 8: Division Through Multiplication \\
                 9: Evaluation of Elementary Functions \\
                 10: Logarithmic Number Systems \\
                 11: The Residue Number System",
}


bibtype: book
filename: master.bib
label: Kornrumpf:1998:LET
author: H.-J. Kornrumpf and Resuhi Abdekmen
title: Langenscheidt English--Turkish, Turkish--English Universal Dictionary
publisher: Altin Kitaplar
address: Istanbul, Turkey
pages: 444
year: 1998
ISBN: 975-405-683-8 OR 9754056838
ISBN13: 978-975-405-683-9 OR 9789754056839
LCCN: PL191.L36 1998
bibdate: Sat Dec 24 11:53:05 MST 2005
bibsource: Amazon; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.24 11:53:05 MST
acknowledgement: ack-nhfb
rawauthor: H.-J. Kornrumpf and Resuhi Abdekmen
rawtitle: {Langenscheidt} {English--Turkish}, {Turkish--English} Universal Dictionary
entry:
@Book{Kornrumpf:1998:LET,
  author =       "H.-J. Kornrumpf and Resuhi Abdekmen",
  title =        "{Langenscheidt} {English--Turkish}, {Turkish--English}
                 Universal Dictionary",
  publisher =    "Altin K{\i}taplar",
  address =      "Istanbul, Turkey",
  pages =        "444",
  year =         "1998",
  ISBN =         "975-405-683-8",
  ISBN-13 =      "978-975-405-683-9",
  LCCN =         "PL191.L36 1998",
  bibdate =      "Sat Dec 24 11:53:05 MST 2005",
  bibsource =    "Amazon;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  bookformat =   "Paperback",
  category =     "Reference; Dictionaries \& Thesauruses; Foreign
                 Language; Turkish",
  idnumber =     "515",
}


bibtype: book
filename: master.bib
label: Korpela:2006:UE
author: Jukka Korpela
title: Unicode Explained
publisher: pub-ORA
address: pub-ORA:adr
pages: xvii + 658
year: 2006
ISBN: 0-596-10121-X OR 059610121X
ISBN13: 978-0-596-10121-3 OR 9780596101213
LCCN: QA268 .K67 2006
bibdate: Mon Mar 20 05:43:48 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2006.03.20 05:43:48 ???
URL: http://www.oreilly.com/catalog/unicode/index.html
acknowledgement: ack-nhfb
rawauthor: Jukka Korpela
rawtitle: {Unicode} Explained
abstract:
Fundamentally, computers just deal with numbers. They store letters and other characters by assigning a number for each one. There are hundreds of different encoding systems for mapping characters to numbers, but Unicode promises a single mapping. Unicode enables a single software product or website to be targeted across multiple platforms, languages and countries without re-engineering. It's no wonder that industry giants like Apple, Hewlett-Packard, IBM and Microsoft have all adopted Unicode. Containing everything you need to understand Unicode, this comprehensive reference from O'Reilly ldots 

TOC:
Part I. Working with characters Characters as data Writing characters Character sets and encodings Part II. A systemic look at Unicode The structure of Unicode Properties of characters Unicode encodings Part III. Advanced Unicode topics Characters and languages Character usage The character level and above Characters in Internet protocols Characters in programming

rawabstract:
Fundamentally, computers just deal with numbers. They store letters and other characters by assigning a number for each one. There are hundreds of different encoding systems for mapping characters to numbers, but Unicode promises a single mapping. Unicode enables a single software product or website to be targeted across multiple platforms, languages and countries without re-engineering. It's no wonder that industry giants like Apple, Hewlett-Packard, IBM and Microsoft have all adopted Unicode. Containing everything you need to understand Unicode, this comprehensive reference from O'Reilly \ldots{}

rawTOC:
Part I. Working with characters \\ Characters as data \\ Writing characters \\ Character sets and encodings \\ Part II. A systemic look at Unicode \\ The structure of Unicode \\ Properties of characters \\ Unicode encodings \\ Part III. Advanced Unicode topics \\ Characters and languages \\ Character usage \\ The character level and above \\ Characters in Internet protocols \\ Characters in programming

entry:
@Book{Korpela:2006:UE,
  author =       "Jukka Korpela",
  title =        "{Unicode} Explained",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xvii + 658",
  year =         "2006",
  ISBN =         "0-596-10121-X",
  ISBN-13 =      "978-0-596-10121-3",
  LCCN =         "QA268 .K67 2006",
  bibdate =      "Mon Mar 20 05:43:48 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.99",
  URL =          "http://www.oreilly.com/catalog/unicode/index.html",
  abstract =     "Fundamentally, computers just deal with numbers. They
                 store letters and other characters by assigning a
                 number for each one. There are hundreds of different
                 encoding systems for mapping characters to numbers, but
                 Unicode promises a single mapping. Unicode enables a
                 single software product or website to be targeted
                 across multiple platforms, languages and countries
                 without re-engineering. It's no wonder that industry
                 giants like Apple, Hewlett-Packard, IBM and Microsoft
                 have all adopted Unicode. Containing everything you
                 need to understand Unicode, this comprehensive
                 reference from O'Reilly \ldots{}",
  acknowledgement = ack-nhfb,
  bookreview =   "http://www.unixreview.com/documents/s=10102/ur0611d/ur0610d.htm",
  tableofcontents = "Part I. Working with characters \\
                 Characters as data \\
                 Writing characters \\
                 Character sets and encodings \\
                 Part II. A systemic look at Unicode \\
                 The structure of Unicode \\
                 Properties of characters \\
                 Unicode encodings \\
                 Part III. Advanced Unicode topics \\
                 Characters and languages \\
                 Character usage \\
                 The character level and above \\
                 Characters in Internet protocols \\
                 Characters in programming",
}


bibtype: book
filename: master.bib
label: Krauss:2011:QMR
author: Lawrence Maxwell Krauss
title: Quantum Man: Richard Feynman's Life in Science
publisher: pub-NORTON
address: pub-NORTON:adr
pages: xvii + 350
year: 2011
ISBN: 0-393-06471-9 OR 0393064719
ISBN13: 978-0-393-06471-1 OR 9780393064711
LCCN: QC16.F49 K73 2011
bibdate: Wed Mar 23 12:02:36 MDT 2011
bibtimestamp: 2011.03.23 12:02:36 MDT
series: Great discoveries
subject: Feynman, Richard P; (Richard Phillips); physicists; United States; biography
acknowledgement: ack-nhfb
subjectdates: 1918--1988
rawauthor: Lawrence Maxwell Krauss
rawtitle: Quantum Man: {Richard Feynman}'s Life in Science
bibsource:
https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/physperspect.bib; z3950.loc.gov:7090/Voyager

URL:
http://www.scientificcomputing.com/news-DS-Illuminating-the-Life-and-Legacy-of-Richard-Feynman-032211.aspx

abstract:
Richard Feynman changed the way we think about quantum mechanics. In this gripping new scientific biography of the revered Nobel Prize-winning physicist (and curious character), Lawrence M. Krauss, himself a theoretical physicist, offers a rollicking narrative coupled with clear and novel expositions of science at the limits. An immensely colourful persona, Feynman revolutionised our understanding of nature amid a turbulent life. Krauss presents that life - from the death of Feynman's childhood sweetheart during the Manhattan Project to his reluctant rise as a scientific icon - as seen through the science; providing a new understanding of the legacy of a man who has fascinated millions. An accessible reflection on the issues that drive physics today, Quantum Man captures the story of a man who was willing to break all the rules to tame a theory that broke all the rules.

TOC:
The paths to greatness. Lights, camera, action The quantum universe A new way of thinking Alice in Quantumland Endings and beginnings Loss of innocence Paths to greatness From here to infinity Splitting an atom Through a glass darkly The rest of the universe. Matter of the heart and the heart of matter Rearranging the universe Hiding in the mirror Distractions and delights Twisting the tail of the cosmos From top to bottom Truth, beauty, and freedom Character is destiny

rawabstract:
Richard Feynman changed the way we think about quantum mechanics. In this gripping new scientific biography of the revered Nobel Prize-winning physicist (and curious character), Lawrence M. Krauss, himself a theoretical physicist, offers a rollicking narrative coupled with clear and novel expositions of science at the limits. An immensely colourful persona, Feynman revolutionised our understanding of nature amid a turbulent life. Krauss presents that life - from the death of Feynman's childhood sweetheart during the Manhattan Project to his reluctant rise as a scientific icon - as seen through the science; providing a new understanding of the legacy of a man who has fascinated millions. An accessible reflection on the issues that drive physics today, Quantum Man captures the story of a man who was willing to break all the rules to tame a theory that broke all the rules.

rawTOC:
The paths to greatness. Lights, camera, action \\ The quantum universe \\ A new way of thinking \\ Alice in Quantumland \\ Endings and beginnings \\ Loss of innocence \\ Paths to greatness \\ From here to infinity \\ Splitting an atom \\ Through a glass darkly \\ The rest of the universe. Matter of the heart and the heart of matter \\ Rearranging the universe \\ Hiding in the mirror \\ Distractions and delights \\ Twisting the tail of the cosmos \\ From top to bottom \\ Truth, beauty, and freedom \\ Character is destiny

entry:
@Book{Krauss:2011:QMR,
  author =       "Lawrence Maxwell Krauss",
  title =        "Quantum Man: {Richard Feynman}'s Life in Science",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xvii + 350",
  year =         "2011",
  ISBN =         "0-393-06471-9",
  ISBN-13 =      "978-0-393-06471-1",
  LCCN =         "QC16.F49 K73 2011",
  bibdate =      "Wed Mar 23 12:02:36 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Great discoveries",
  URL =          "http://www.scientificcomputing.com/news-DS-Illuminating-the-Life-and-Legacy-of-Richard-Feynman-032211.aspx",
  abstract =     "Richard Feynman changed the way we think about quantum
                 mechanics. In this gripping new scientific biography of
                 the revered Nobel Prize-winning physicist (and curious
                 character), Lawrence M. Krauss, himself a theoretical
                 physicist, offers a rollicking narrative coupled with
                 clear and novel expositions of science at the limits.
                 An immensely colourful persona, Feynman revolutionised
                 our understanding of nature amid a turbulent life.
                 Krauss presents that life - from the death of Feynman's
                 childhood sweetheart during the Manhattan Project to
                 his reluctant rise as a scientific icon - as seen
                 through the science; providing a new understanding of
                 the legacy of a man who has fascinated millions. An
                 accessible reflection on the issues that drive physics
                 today, Quantum Man captures the story of a man who was
                 willing to break all the rules to tame a theory that
                 broke all the rules.",
  acknowledgement = ack-nhfb,
  subject =      "Feynman, Richard P; (Richard Phillips); physicists;
                 United States; biography",
  subject-dates = "1918--1988",
  tableofcontents = "The paths to greatness. Lights, camera, action \\
                 The quantum universe \\
                 A new way of thinking \\
                 Alice in Quantumland \\
                 Endings and beginnings \\
                 Loss of innocence \\
                 Paths to greatness \\
                 From here to infinity \\
                 Splitting an atom \\
                 Through a glass darkly \\
                 The rest of the universe. Matter of the heart and the
                 heart of matter \\
                 Rearranging the universe \\
                 Hiding in the mirror \\
                 Distractions and delights \\
                 Twisting the tail of the cosmos \\
                 From top to bottom \\
                 Truth, beauty, and freedom \\
                 Character is destiny",
}


bibtype: book
filename: master.bib
label: Kreyszig:1993:AEM
author: Erwin Kreyszig
title: Advanced Engineering Mathematics
publisher: pub-WILEY
address: pub-WILEY:adr
edition: Seventh
pages: xviii + 1272 + 112 + 18
year: 1993
LCCN: QA401 .K7 1993
bibdate: Fri Sep 6 06:18:02 MDT 2013
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2013.09.06 06:18:02 MDT
subject: Mathematical physics; Engineering mathematics
acknowledgement: ack-nhfb
rawauthor: Erwin Kreyszig
rawtitle: Advanced Engineering Mathematics
ISBN:
0-471-55380-8 (hardcover), 0-471-59989-1 (paperback) OR 0471553808 (hardcover), 0471599891 (paperback)

ISBN13:
978-0-471-55380-9 (hardcover), 978-0-471-59989-0 (paperback) OR 9780471553809 (hardcover), 9780471599890 (paperback)

URL:
http://www.loc.gov/catdir/enhancements/fy0707/92006989-d.html; http://www.loc.gov/catdir/toc/onix05/92006989.html

TOC:
 Part A: Ordinary Differential Equations 1: First-Order Differential Equations 2: Second-Order Linear Differential Equations 3: Higher Order Linear Differential Equations 4: Systems of Differential Equations. Phase Plane, Stability 5: Series Solutions of Differential Equations. Special Functions 6: Laplace Transforms Part B: Linear Algebra, Vector Calculus 7: Linear Algebra: Matrices, Vectors, Determinants 8: Vector Differential Calculus. Grad, Div, Curl 9: Vector Integral Calculus. Integral Theorems Part C: Fourier Analysis and Partial Differential Equations 10: Fourier Series, Integrals, and Transforms 11: Partial Differential Equations Part D: Complex Analysis 12: Complex Numbers. Complex Analytic Functions 13: Complex Integration 14: Power Series, Taylor Series, Laurent Series 15: Residue Integration Method 16: Conformal Mapping 17: Complex Analysis Applied to Potential Theory Part E: Numerical Methods 18: Numerical Methods in General 19: Numerical Methods in Linear Algebra 20: Numerical Methods for Differential Equations Part F: Optimization, Graphs 21: Unconstrained Optimization, Linear Programming 22: Graphs and Combinatorial Optimization Part G: Probability and Statistics 23: Probability Theory 24: Mathematical Statistics

rawTOC:
\\ Part A: Ordinary Differential Equations \\ 1: First-Order Differential Equations \\ 2: Second-Order Linear Differential Equations \\ 3: Higher Order Linear Differential Equations \\ 4: Systems of Differential Equations. Phase Plane, Stability \\ 5: Series Solutions of Differential Equations. Special Functions \\ 6: Laplace Transforms \\ \\ Part B: Linear Algebra, Vector Calculus \\ 7: Linear Algebra: Matrices, Vectors, Determinants \\ 8: Vector Differential Calculus. Grad, Div, Curl \\ 9: Vector Integral Calculus. Integral Theorems \\ \\ Part C: Fourier Analysis and Partial Differential Equations \\ 10: Fourier Series, Integrals, and Transforms \\ 11: Partial Differential Equations \\ \\ Part D: Complex Analysis \\ 12: Complex Numbers. Complex Analytic Functions \\ 13: Complex Integration \\ 14: Power Series, Taylor Series, Laurent Series \\ 15: Residue Integration Method \\ 16: Conformal Mapping \\ 17: Complex Analysis Applied to Potential Theory \\ \\ Part E: Numerical Methods \\ 18: Numerical Methods in General \\ 19: Numerical Methods in Linear Algebra \\ 20: Numerical Methods for Differential Equations \\ \\ Part F: Optimization, Graphs \\ 21: Unconstrained Optimization, Linear Programming \\ 22: Graphs and Combinatorial Optimization \\ \\ Part G: Probability and Statistics \\ 23: Probability Theory \\ 24: Mathematical Statistics

entry:
@Book{Kreyszig:1993:AEM,
  author =       "Erwin Kreyszig",
  title =        "Advanced Engineering Mathematics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Seventh",
  pages =        "xviii + 1272 + 112 + 18",
  year =         "1993",
  ISBN =         "0-471-55380-8 (hardcover), 0-471-59989-1 (paperback)",
  ISBN-13 =      "978-0-471-55380-9 (hardcover), 978-0-471-59989-0
                 (paperback)",
  LCCN =         "QA401 .K7 1993",
  bibdate =      "Fri Sep 6 06:18:02 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0707/92006989-d.html;
                 http://www.loc.gov/catdir/toc/onix05/92006989.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical physics; Engineering mathematics",
  tableofcontents = "\\
                 Part A: Ordinary Differential Equations \\
                 1: First-Order Differential Equations \\
                 2: Second-Order Linear Differential Equations \\
                 3: Higher Order Linear Differential Equations \\
                 4: Systems of Differential Equations. Phase Plane,
                 Stability \\
                 5: Series Solutions of Differential Equations. Special
                 Functions \\
                 6: Laplace Transforms \\
                 \\
                 Part B: Linear Algebra, Vector Calculus \\
                 7: Linear Algebra: Matrices, Vectors, Determinants \\
                 8: Vector Differential Calculus. Grad, Div, Curl \\
                 9: Vector Integral Calculus. Integral Theorems \\
                 \\
                 Part C: Fourier Analysis and Partial Differential
                 Equations \\
                 10: Fourier Series, Integrals, and Transforms \\
                 11: Partial Differential Equations \\
                 \\
                 Part D: Complex Analysis \\
                 12: Complex Numbers. Complex Analytic Functions \\
                 13: Complex Integration \\
                 14: Power Series, Taylor Series, Laurent Series \\
                 15: Residue Integration Method \\
                 16: Conformal Mapping \\
                 17: Complex Analysis Applied to Potential Theory \\
                 \\
                 Part E: Numerical Methods \\
                 18: Numerical Methods in General \\
                 19: Numerical Methods in Linear Algebra \\
                 20: Numerical Methods for Differential Equations \\
                 \\
                 Part F: Optimization, Graphs \\
                 21: Unconstrained Optimization, Linear Programming \\
                 22: Graphs and Combinatorial Optimization \\
                 \\
                 Part G: Probability and Statistics \\
                 23: Probability Theory \\
                 24: Mathematical Statistics",
}


bibtype: book
filename: master.bib
label: Kreyszig:1994:MCM
author: E. Kreyszig and E. J. Normington
title: Maple Computer Manual for Seventh Edition Advanced Engineering Mathematics: Erwin Kreyszig
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xii + 506
year: 1994
ISBN: 0-471-31126-X OR 047131126X
ISBN13: 978-0-471-31126-3 OR 9780471311263
LCCN: QA401 K74 1993
bibdate: Thu Jul 7 07:55:36 1994
bibtimestamp: 1994.07.07 07:55:36 ???
acknowledgement: ack-nhfb
rawauthor: E. Kreyszig and E. J. Normington
rawtitle: {Maple} Computer Manual for Seventh Edition Advanced Engineering Mathematics: {Erwin Kreyszig}
bibsource:
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib

note:
There is a companion em Instructor's Maple Manual, but I have not yet found an exact citation for it.

TOC:
Introduction / 1 General Commands / 3 1 First Order Differential Equations / 10 Ex. 1.1 Radioactivity, exponential decay / 12 Ex. 1.2 Separation of variables. Plot of several curves / 14 Ex. 1.3 Checking solutions. Two ways of writing derivatives / 15 Ex. 1.4 Flow through an outlet. Torricelli's law / 16 Ex. 1.5 Mixing problem / 16 Ex. 1.6 Exact differential equation / 18 Ex. 1.7 Integrating factors / 18 Ex. 1.8 Linear differential equations / 19 Ex. 1.9 Bernoulli equation. Verhulst equation / 20 Ex. 1.10 RC-circuit / 21 Ex. 1.11 RL-circuit. TRIGONOMETRIC TRICK / 22 Ex. 1.12 Orthogonal trajectories / 23 Ex. 1.13 Plotting trajectories by the command seq / 24 Ex. 1.14 Direction field / 25 Ex. 1.15 Picard iteration / 26 Problems for Chapter 1 / 28 2 Second Order Differential Equations / 34 Ex. 2.1 General solution. Initial value problem / 35 Ex. 2.2 Double root (cf. Sec. 2.2) / 35 Ex. 2.3 Complex roots of the characteristic equation / 37 Ex. 2.4 Boundary value problem / 38 Ex. 2.5 Undamped free vibrations / 38 Ex. 2.6 Overdamped free motions / 40 Ex. 2.7 Critically damped free motion / 41 Ex. 2.8 Underdamped oscillations / 42 Ex. 2.9 Euler--Cauchy equation / 43 Ex. 2.10 Wronskian / 44 Ex. 2.11 Reduction of order / 45 Ex. 2.12 Nonhomogeneous differential equation / 45 Ex. 2.13 Solution by undetermined coefficients / 47 Ex. 2.14 Variation of parameters / 48 Ex. 2.15 Resonance in an undamped vibrating system / 49 Ex. 2.16 Forced undamped oscillations. Beats. / 50 Ex. 2.17 Forced damped oscillations in Sec. 2.11 / 51 Ex. 2.18 RLC-circuit / 52 Problems for Chapter 2 / 54 3 Higher Order Linear Differential Equations / 57 Ex. 3.1 Basis of solutions. Wronskian / 58 Ex. 3.2 Initial value problem / 59 Ex. 3.3 Verification of solutions / 60 Ex. 3.4 Differential equation for a given basis / 60 Ex. 3.5 Method of undetermined coefficients / 61 Ex. 3.6 Initial value problems for nonhomogeneous equations / 62 Ex. 3.7 Variation of parameters / 62 Problems for Chapter 3 / 65 4 Systems of Differential Equations Phase Plane, Stability / 67 Ex. 4.1 Improper node / 70 Ex. 4.2 Improper node. Use of matrices / 71 Ex. 4.3 Direction field of vectors in the phase plane / 73 Ex. 4.4 Saddle point / 74 Ex. 4.5 Center / 75 Ex. 4.6 Spiral point / 76 Ex. 4.7 System without basis of eigenvectors / 78 Ex. 4.8 Pendulum equation (Sec. 4.5) / 79 Ex. 4.9 Van der Pol equation. Limit cycle (Sec. 4.5) / 81 Ex. 4.10 Nonhomogeneous system / 82 Ex. 4.11 Method of undetermined coefficients / 83 Ex. 4.12 Variation of parameters / 84 Ex. 4.13 Diagonalization of systems of differential equations / 85 Problems for Chapter 4 / 88 5 Series Solutions of Differential Equations. Special Functions / 92 Ex. 5.1 Series solution. Plot from it / 94 Ex. 5.2 Legendre polynomials. The orthopoly package / 95 Ex. 5.3 Legendre polynomials. Simplification of results / 97 Ex. 5.4 Legendre polynomials from boundary value problems / 98 Ex. 5.5 Coefficient recursion for series solution / 98 Ex. 5.6 Coefficient recursion for the Legendre equation / 100 Ex. 5.7 Frobenius method / 100 Ex. 5.8 Bessel functions / 101 Ex. 5.9 Bessel functions of the second kind / 103 Ex. 5.10 Orthogonal expansions. Fourier--Legendre series / 104 Problems for Chapter 5 / 106 6 Laplace Transforms / 108 Ex. 6.1 Beginnings / 109 Ex. 6.2 Inverse Laplace transform / 110 Ex. 6.3 Differentiation and integration of functions / 111 Ex. 6.4 Differential equation / 111 Ex. 6.5 Initial value problem for a nonhomogeneous equation / 112 Ex. 6.6 Unit step function. Dirac's delta function / 113 Ex. 6.7 Discontinuous periodic driving force / 115 Ex. 6.8 General formulas / 116 Ex. 6.9 Forced oscillations. Resonance / 117 Ex. 6.10 System of differential equations. Spacecurve / 118 Problems for Chapter 6 / 121 7 Linear Algebra, Vector Calculus / 125 Ex. 7.1 Matrices and vectors: Addition and multiplication / 129 Ex. 7.2 Further operations on matrices / 131 Ex. 7.3 Special matrices / 133 Ex. 7.4 Solution of a linear system / 134 Ex. 7.5 Gauss elimination, further cases / 135 Ex. 7.6 Determinants / 135 Ex. 7.7 Inverse of a matrix / 136 Ex. 7.8 Rank of a matrix / 137 Ex. 7.9 Linear independence and dependence / 138 Ex. 7.10 Eigenvalues, eigenvectors / 139 Ex. 7.11 Complex eigenvalues / 140 Ex. 7.12 Orthogonal transformations / 141 Ex. 7.13 Complex matrices / 142 Ex. 7.14 Diagonalization of a matrix / 143 Ex. 7.15 Similar matrices / 144 Problems for Chapter 7 / 146 8 Vector Differential Calculus. Grad, Div, Curl / 149 Ex. 8.1 Vector with given endpoints. Length / 151 Ex. 8.2 Vector addition. Scalar multiplication / 152 Ex. 8.3 Inner product (dot product) / 152 Ex. 8.4 Vector product (cross product) / 154 Ex. 8.5 Differentiation of vectors. Tangent. Spaceplots / 155 Ex. 8.6 Arc length, curvature, torsion of a curve / 156 Ex. 8.7 Gradient, directional derivative / 157 Ex. 8.8 Gradient as surface normal vector. Vector substitution / 158 Ex. 8.9 Potential of a vector field / 159 Ex. 8.10 Divergence. Laplacian / 159 Ex. 8.11 Curl / 160 Problems for Chapter 8 / 162 9 Vector Integral Calculus. Integral Theorems / 167 Ex. 9.1 Line integral in the plane / 167 Ex. 9.2 Line integral in space / 168 Ex. 9.3 Dependence of integrals on path / 169 Ex. 9.4 Line integral of the form (7), p. 505 / 169 Ex. 9.5 Independence of path / 170 Ex. 9.6 Path independence; Use of potential / 170 Ex. 9.7 Exactness and independence of path / 171 Ex. 9.8 Double integrals / 171 Ex. 9.9 Green's theorem in the plane / 172 Ex. 9.10 Surface plot. Normal vector / 172 Ex. 9.11 Surface integral (flux) / 174 Ex. 9.12 Triple integral / 174 Ex. 9.13 Gauss's divergence theorem / 174 Ex. 9.14 Verification of the divergence theorem / 175 Ex. 9.15 Stokes's theorem / 176 Problems for Chapter 9 / 178 10 Fourier Series, Integrals, and Transforms / 181 Ex. 10.1 Periodic square wave / 181 Ex. 10.2 Piecewise linear function / 183 Ex. 10.3 Series with cosine and sine terms / 184 Ex. 10.4 Period different from 2?r / 184 Ex. 10.5 Saw tooth waves. Gibbs phenomenon / 185 Ex. 10.6 Even and odd functions / 186 Ex. 10.7 Half-range expansions / 186 Ex. 10.8 Rectifier / 187 Ex. 10.9 Forced oscillations / 189 Ex. 10.10 Square error / 191 Ex. 10.11 Fourier integral / 191 Ex. 10.12 Fourier transform / 192 Problems for Chapter 10 / 193 11 Partial Differential Equations / 198 Ex. 11.1 Basic equations in this chapter / 198 Ex. 11.2 Plot of level curves / 199 Ex. 11.3 Surface plots of solutions / 200 Ex. 11.4 Separation of variables / 200 Ex. 11.5 D'Alembert's solution / 201 Ex. 11.6 Vibrating beam / 202 Ex. 11.7 Heat equation / 203 Ex. 11.8 Heat flow: Adiabatic ends / 204 Ex. 11.9 Two-dimensional heat flow / 204 Ex. 11.10 Error function / 206 Ex. 11.11 Rectangular membrane / 208 Ex. 11.12 Square Membrane / 209 Problems for Chapter 11 / 211 12 Complex Numbers Complex Analytic Functions / 215 Ex. 12.1 Complex numbers / 217 Ex. 12.2 Polar form / 218 Ex. 12.3 Plotting complex numbers / 219 Ex. 12.4 Absolute value of a quotient / 221 Ex. 12.5 De Moivre's formula / 221 Ex. 12.6 Quadratic and cubic equations. Roots of complex numbers / 222 Ex. 12.7 Roots of unity and their plots / 222 Ex. 12.8 Unit circle, annulus / 224 Ex. 12.9 Circles. Completing squares / 224 Ex. 12.10 Inequalities / 225 Ex. 12.11 Function, derivative, surface plot / 225 Ex. 12.12 Cauchy--Riemann equations / 227 Ex. 12.13 Harmonic functions / 227 Ex. 12.14 Exponential, trigonometric and hyperbolic functions / 228 Ex. 12.15 Complex logarithm In* (cf. Sec. 12.8) / 229 Problems for Chapter 12 / 232 13 Complex Integration / 236 Ex. 13.1 Integration by using a formula for the path / 236 Ex. 13.2 A most important integral (Sec. 13.2) / 237 Ex. 13.3 Path consisting of two parts. Path dependence / 238 Ex. 13.4 Indefinite integration (Sec. 13.2) / 238 Ex. 13.5 Linearity of integration / 239 Ex. 13.6 WARNING: Contour integrals / 239 Ex. 13.7 Partial fractions in integration / 240 Ex. 13.8 Contour integral of integer powers / 241 Ex. 13.9 Integration by Cauchy's integral formula / 241 Ex. 13.10 Integration by derivative formulas (Sec. 13.6) / 242 Problems for Chapter 13 / 243 14 Power Series, Taylor Series, Laurent Series / 245 Ex. 14.1 Complex sequences and their plots / 246 Ex. 14.2 Ratio test for complex series / 248 Ex. 14.3 Radius of convergence. Cauchy--Hadamard formula / 249 Ex. 14.4 Taylor series / 250 Ex. 14.5 Differentiation and integration of Taylor series / 251 Ex. 14.6 Generating function / 252 Ex. 14.7 Use of complex series for computing function values / 254 Ex. 14.8 Uniform convergence / 254 Ex. 14.9 Laurent series / 255 Ex. 14.10 Laurent series by partial fractions / 255 Ex. 14.11 Zeros / 257 Ex. 14.12 Singularities / 258 Ex. 14.13 Analytic at infinity / 258 Problems for Chapter 14 / 260 15 Residue Integration Method / 262 Ex. 15.1 Residue integration / 262 Ex. 15.2 Location of singularities. Residues / 263 Ex. 15.3 Higher order pole. Partial fractions / 264 Ex. 15.4 Essential singularity / 264 Ex. 15.5 Integration by the residue theorem / 265 Ex. 15.6 The command residue / 266 Ex. 15.7 Real integrals / 266 Ex. 15.8 Complex transformation of real integrals / 267 Ex. 15.9 Caution with improper real integrals on the computer! / 268 Ex. 15.10 Fourier integrals, Sec. 15.4 / 269 Ex. 15.11 Cauchy principal value / 270 Problems for Chapter 15 / 271 16 Conformal Mapping / 273 Ex. 16.1 Plotting images of straight lines under w = z2 / 273 Conformal mapping / 274 Mapping w = l/z / 276 Mapping of the unit disk onto the unit disk / 277 Linear fractional transformation / 278 Linear fractional transformation for given points / 278 Mapping w = l/z / 279 Inverse linear fractional transformation / 280 Mappings of half-planes onto half-planes / 280 Ex. 16.10 Images of several rectangles on common axes / 281 Ex. 16.11 Joukowski airfoil (Sec. 16.5) / 282 Problems for Chapter 16 / 283 17 Complex Analysis Applied to Potential Theory / 291 Ex. 17.1 Finding and plotting equipotential lines / 291 Ex. 17.2 Plotting equipotential lines and lines of forces. / 293 Ex. 17.3 Equipotential lines / 293 Ex. 17.4 Equipotential surfaces of In z / 294 Ex. 17.5 Noncoaxial cylinders (p. 891) / 295 Ex. 17.6 Flow around a cylinder / 296 Ex. 17.7 Increase of the density of streamlines / 298 Ex. 17.8 Plotting equipotential lines by f i e l d p l o t / 298 Ex. 17.9 Series representation of potential (Sec. 17.5) / 300 Ex. 17.10 Mean value theorem for analytic functions / 301 Problems for Chapter 17 / 302 18 Numerical Methods in General / 305 Ex. 18.1 Numerical Errors - Quadratic Equation / 306 Ex. 18.2 Fixed-point iteration / 307 Ex. 18.3 Fixed point iteration / 308 Ex. 18.4 Fixed-point iteration (Sec. 18.2) / 309 Ex. 18.5 Newton's method. Square root / 310 Ex. 18.6 Iteration for a transcendental equation / 311 Ex. 18.7 Newton's method / 311 Ex. 18.8 Secant method / 313 Ex. 18.9 Bisection method (AEM, p. 935) / 313 Ex. 18.10 Lagrange interpolation (Sec. 18.3) / 314 Ex. 18.11 Newton's divided difference interpolation / 316 Ex. 18.12 Newton's forward difference interpolation / 318 Ex. 18.13 High-degree interpolation polynomials / 318 Ex. 18.14 Numerical integration / 319 Ex. 18.15 Gauss integration / 320 Problems for Chapter 18 / 322 Procedures / 325 19 Numerical Methods in Linear Algebra / 327 Ex. 19.1 Gauss elimination. Pivoting / 327 Ex. 19.2 Details of the Gauss elimination / 329 Ex. 19.3 Doolittle's method (p. 982) / 332 Ex. 19.4 Doolittle LU-factorization / 334 Ex. 19.5 Cholesky's method (p. 983) / 334 Ex. 19.6 Gauss--Jordan elimination / 336 Ex. 19.7 Gauss--Seidel iteration / 337 Ex. 19.8 Matrix norms, condition numbers (Sees. 19.3, 19.4) / 338 Ex. 19.9 Gauss--Seidel iteration. Test for convergence / 339 Ex. 19.10 Procedure for the Gauss--Seidel iteration / 340 Ex. 19.11 Least squares / 341 Ex. 19.12 Least squares / 342 Ex. 19.13 Example 19.12 revisited: Normal equations / 343 Ex. 19.14 Least squares: Quadratic polynomial / 344 Ex. 19.15 Eigenvalues, eigenvectors / 346 Ex. 19.16 Collatz's theorem for eigenvalues / 346 Ex. 19.17 Power method for eigenvalues (Sec. 19.8) / 348 Ex. 19.18 Wielandt's deflation / 350 Ex. 19.19 Householder tridiagonalization / 350 Ex. 19.20 QR Factorization method / 352 Ex. 19.21 Pivoting in Gaussian Elimination / 355 Problems for Chapter 19 / 357 20 Numerical Methods for Differential Equations / 360 Ex. 20.1 Two ways of writing a differential equation / 360 Ex. 20.2 Euler method (p. 1035) / 361 Ex. 20.3 Improved Euler method / 362 Ex. 20.4 Runge--Kutta method / 364 Ex. 20.5 Procedure for the Runge--Kutta method / 365 Ex. 20.6 Adams--Moulton two-step method / 366 Ex. 20.7 Adams--Moulton two-step method, with built-in Runge--Kutta / 367 Ex. 20.8 Second order differential equations, simplest method / 368 Ex. 20.9 Runge--Kutta--Nystrom method / 370 Ex. 20.10 Laplace equation in Example 1, p. 1059 / 372 Ex. 20.11 Program for the Laplace equation. Band matrices / 373 Ex. 20.12 Laplace equation: Refinement of grids / 375 Ex. 20.13 Laplace equation: Procedure / 376 Ex. 20.14 Poisson Equation: Mixed Boundary Values / 377 Ex. 20.15 Parabolic Equations: Crank--Nicolson Method / 378 Problems for Chapter 20 / 380 21 Chapter / 22 No examples, no problems. 23 Probability Theory / 385 Ex. 23.1 Stirling formula / 385 Ex. 23.2 Sum of binomial coefficients / 386 Ex. 23.3 Plotting distribution functions / 387 Ex. 23.4 Plotting distribution function and density / 387 Ex. 23.5 Distribution function, density, critical value / 387 Ex. 23.6 Uniform distribution / 388 Ex. 23.7 Binomial distribution / 389 Ex. 23.8 Binomial distribution / 389 Ex. 23.9 Poisson distribution with a large mean / 391 Ex. 23.10 Hypergeometric distribution / 391 Ex. 23.11 Normal distribution / 391 Problems for Chapter 23 / 394 24 Mathematical Statistics / 396 Ex. 24.1 Random numbers / 397 Ex. 24.2 Random numbers. Sample means / 398 Ex. 24.3 Frequency polygon / 400 Ex. 24.4, Sample mean, variance, and standard deviation / 400 Ex. 24.5 Confidence interval for the mean of the normal distribution with known variance / 401 Ex. 24.6 Confidence interval for the mean of the normal distribution with unknown variance, $t$-distribution / 402 Ex. 24.7 Confidence interval for the variance of the normal distribution / 402 Ex. 24.8 Test for the mean / 403 Ex. 24.9 Power function for different sample sizes. OC curves / 403 Ex. 24.10 Tests for the mean of the normal distribution with known variance / 404 Ex. 24.11 $t$-test for the mean of the normal distribution with unknown variance / 405 Ex. 24.12 Test for the variance of the normal distribution / 405 Ex. 24.13 Comparison of means by independent samples / 406 Ex. 24.14 Comparison of variances of normal distributions / 406 Ex. 24.15 Acceptance sampling / 407 Ex. 24.16 Linear regression / 408 Ex. 24.17 Nonlinear regression / 409 Problems for Chapter 24 / 411 Appendix 1 References / A1 Appendix 2 Solutions to Odd-Numbered Problems / A2 Index of Maple Commands and Keywords / J1 Index of Maple Commands Arranged by Chapters / J11

rawnote:
There is a companion {\em Instructor's Maple Manual}, but I have not yet found an exact citation for it.

rawTOC:
Introduction / 1 \\ General Commands / 3 \\ 1 First Order Differential Equations / 10 \\ Ex. 1.1 Radioactivity, exponential decay / 12 \\ Ex. 1.2 Separation of variables. Plot of several curves / 14 \\ Ex. 1.3 Checking solutions. Two ways of writing derivatives / 15 \\ Ex. 1.4 Flow through an outlet. Torricelli's law / 16 \\ Ex. 1.5 Mixing problem / 16 \\ Ex. 1.6 Exact differential equation / 18 \\ Ex. 1.7 Integrating factors / 18 \\ Ex. 1.8 Linear differential equations / 19 \\ Ex. 1.9 Bernoulli equation. Verhulst equation / 20 \\ Ex. 1.10 RC-circuit / 21 \\ Ex. 1.11 RL-circuit. TRIGONOMETRIC TRICK / 22 \\ Ex. 1.12 Orthogonal trajectories / 23 \\ Ex. 1.13 Plotting trajectories by the command seq / 24 \\ Ex. 1.14 Direction field / 25 \\ Ex. 1.15 Picard iteration / 26 \\ Problems for Chapter 1 / 28 \\ 2 Second Order Differential Equations / 34 \\ Ex. 2.1 General solution. Initial value problem / 35 \\ Ex. 2.2 Double root (cf. Sec. 2.2) / 35 \\ Ex. 2.3 Complex roots of the characteristic equation / 37 \\ Ex. 2.4 Boundary value problem / 38 \\ Ex. 2.5 Undamped free vibrations / 38 \\ Ex. 2.6 Overdamped free motions / 40 \\ Ex. 2.7 Critically damped free motion / 41 \\ Ex. 2.8 Underdamped oscillations / 42 \\ Ex. 2.9 Euler--Cauchy equation / 43 \\ Ex. 2.10 Wronskian / 44 \\ Ex. 2.11 Reduction of order / 45 \\ Ex. 2.12 Nonhomogeneous differential equation / 45 \\ Ex. 2.13 Solution by undetermined coefficients / 47 \\ Ex. 2.14 Variation of parameters / 48 \\ Ex. 2.15 Resonance in an undamped vibrating system / 49 \\ Ex. 2.16 Forced undamped oscillations. Beats. / 50 \\ Ex. 2.17 Forced damped oscillations in Sec. 2.11 / 51 \\ Ex. 2.18 RLC-circuit / 52 \\ Problems for Chapter 2 / 54 \\ 3 Higher Order Linear Differential Equations / 57 \\ Ex. 3.1 Basis of solutions. Wronskian / 58 \\ Ex. 3.2 Initial value problem / 59 \\ Ex. 3.3 Verification of solutions / 60 \\ Ex. 3.4 Differential equation for a given basis / 60 \\ Ex. 3.5 Method of undetermined coefficients / 61 \\ Ex. 3.6 Initial value problems for nonhomogeneous equations / 62 \\ Ex. 3.7 Variation of parameters / 62 \\ Problems for Chapter 3 / 65 \\ 4 Systems of Differential Equations Phase Plane, Stability / 67 \\ Ex. 4.1 Improper node / 70 \\ Ex. 4.2 Improper node. Use of matrices / 71 \\ Ex. 4.3 Direction field of vectors in the phase plane / 73 \\ Ex. 4.4 Saddle point / 74 \\ Ex. 4.5 Center / 75 \\ Ex. 4.6 Spiral point / 76 \\ Ex. 4.7 System without basis of eigenvectors / 78 \\ Ex. 4.8 Pendulum equation (Sec. 4.5) / 79 \\ Ex. 4.9 Van der Pol equation. Limit cycle (Sec. 4.5) / 81 \\ Ex. 4.10 Nonhomogeneous system / 82 \\ Ex. 4.11 Method of undetermined coefficients / 83 \\ Ex. 4.12 Variation of parameters / 84 \\ Ex. 4.13 Diagonalization of systems of differential equations / 85 \\ Problems for Chapter 4 / 88 \\ 5 Series Solutions of Differential Equations. Special Functions / 92 \\ Ex. 5.1 Series solution. Plot from it / 94 \\ Ex. 5.2 Legendre polynomials. The orthopoly package / 95 \\ Ex. 5.3 Legendre polynomials. Simplification of results / 97 \\ Ex. 5.4 Legendre polynomials from boundary value problems / 98 \\ Ex. 5.5 Coefficient recursion for series solution / 98 \\ Ex. 5.6 Coefficient recursion for the Legendre equation / 100 \\ Ex. 5.7 Frobenius method / 100 \\ Ex. 5.8 Bessel functions / 101 \\ Ex. 5.9 Bessel functions of the second kind / 103 \\ Ex. 5.10 Orthogonal expansions. Fourier--Legendre series / 104 \\ Problems for Chapter 5 / 106 \\ 6 Laplace Transforms / 108 \\ Ex. 6.1 Beginnings / 109 \\ Ex. 6.2 Inverse Laplace transform / 110 \\ Ex. 6.3 Differentiation and integration of functions / 111 \\ Ex. 6.4 Differential equation / 111 \\ Ex. 6.5 Initial value problem for a nonhomogeneous equation / 112 \\ Ex. 6.6 Unit step function. Dirac's delta function / 113 \\ Ex. 6.7 Discontinuous periodic driving force / 115 \\ Ex. 6.8 General formulas / 116 \\ Ex. 6.9 Forced oscillations. Resonance / 117 \\ Ex. 6.10 System of differential equations. Spacecurve / 118 \\ Problems for Chapter 6 / 121 \\ 7 Linear Algebra, Vector Calculus / 125 \\ Ex. 7.1 Matrices and vectors: Addition and multiplication / 129 \\ Ex. 7.2 Further operations on matrices / 131 \\ Ex. 7.3 Special matrices / 133 \\ Ex. 7.4 Solution of a linear system / 134 \\ Ex. 7.5 Gauss elimination, further cases / 135 \\ Ex. 7.6 Determinants / 135 \\ Ex. 7.7 Inverse of a matrix / 136 \\ Ex. 7.8 Rank of a matrix / 137 \\ Ex. 7.9 Linear independence and dependence / 138 \\ Ex. 7.10 Eigenvalues, eigenvectors / 139 \\ Ex. 7.11 Complex eigenvalues / 140 \\ Ex. 7.12 Orthogonal transformations / 141 \\ Ex. 7.13 Complex matrices / 142 \\ Ex. 7.14 Diagonalization of a matrix / 143 \\ Ex. 7.15 Similar matrices / 144 \\ Problems for Chapter 7 / 146 \\ 8 Vector Differential Calculus. Grad, Div, Curl / 149 \\ Ex. 8.1 Vector with given endpoints. Length / 151 \\ Ex. 8.2 Vector addition. Scalar multiplication / 152 \\ Ex. 8.3 Inner product (dot product) / 152 \\ Ex. 8.4 Vector product (cross product) / 154 \\ Ex. 8.5 Differentiation of vectors. Tangent. Spaceplots / 155 \\ Ex. 8.6 Arc length, curvature, torsion of a curve / 156 \\ Ex. 8.7 Gradient, directional derivative / 157 \\ Ex. 8.8 Gradient as surface normal vector. Vector substitution / 158 \\ Ex. 8.9 Potential of a vector field / 159 \\ Ex. 8.10 Divergence. Laplacian / 159 \\ Ex. 8.11 Curl / 160 \\ Problems for Chapter 8 / 162 \\ 9 Vector Integral Calculus. Integral Theorems / 167 \\ Ex. 9.1 Line integral in the plane / 167 \\ Ex. 9.2 Line integral in space / 168 \\ Ex. 9.3 Dependence of integrals on path / 169 \\ Ex. 9.4 Line integral of the form (7), p. 505 / 169 \\ Ex. 9.5 Independence of path / 170 \\ Ex. 9.6 Path independence; Use of potential / 170 \\ Ex. 9.7 Exactness and independence of path / 171 \\ Ex. 9.8 Double integrals / 171 \\ Ex. 9.9 Green's theorem in the plane / 172 \\ Ex. 9.10 Surface plot. Normal vector / 172 \\ Ex. 9.11 Surface integral (flux) / 174 \\ Ex. 9.12 Triple integral / 174 \\ Ex. 9.13 Gauss's divergence theorem / 174 \\ Ex. 9.14 Verification of the divergence theorem / 175 \\ Ex. 9.15 Stokes's theorem / 176 \\ Problems for Chapter 9 / 178 \\ 10 Fourier Series, Integrals, and Transforms / 181 \\ Ex. 10.1 Periodic square wave / 181 \\ Ex. 10.2 Piecewise linear function / 183 \\ Ex. 10.3 Series with cosine and sine terms / 184 \\ Ex. 10.4 Period different from 2?r / 184 \\ Ex. 10.5 Saw tooth waves. Gibbs phenomenon / 185 \\ Ex. 10.6 Even and odd functions / 186 \\ Ex. 10.7 Half-range expansions / 186 \\ Ex. 10.8 Rectifier / 187 \\ Ex. 10.9 Forced oscillations / 189 \\ Ex. 10.10 Square error / 191 \\ Ex. 10.11 Fourier integral / 191 \\ Ex. 10.12 Fourier transform / 192 \\ Problems for Chapter 10 / 193 \\ 11 Partial Differential Equations / 198 \\ Ex. 11.1 Basic equations in this chapter / 198 \\ Ex. 11.2 Plot of level curves / 199 \\ Ex. 11.3 Surface plots of solutions / 200 \\ Ex. 11.4 Separation of variables / 200 \\ Ex. 11.5 D'Alembert's solution / 201 \\ Ex. 11.6 Vibrating beam / 202 \\ Ex. 11.7 Heat equation / 203 \\ Ex. 11.8 Heat flow: Adiabatic ends / 204 \\ Ex. 11.9 Two-dimensional heat flow / 204 \\ Ex. 11.10 Error function / 206 \\ Ex. 11.11 Rectangular membrane / 208 \\ Ex. 11.12 Square Membrane / 209 \\ Problems for Chapter 11 / 211 \\ 12 Complex Numbers Complex Analytic Functions / 215 \\ Ex. 12.1 Complex numbers / 217 \\ Ex. 12.2 Polar form / 218 \\ Ex. 12.3 Plotting complex numbers / 219 \\ Ex. 12.4 Absolute value of a quotient / 221 \\ Ex. 12.5 De Moivre's formula / 221 \\ Ex. 12.6 Quadratic and cubic equations. Roots of complex numbers / 222 \\ Ex. 12.7 Roots of unity and their plots / 222 \\ Ex. 12.8 Unit circle, annulus / 224 \\ Ex. 12.9 Circles. Completing squares / 224 \\ Ex. 12.10 Inequalities / 225 \\ Ex. 12.11 Function, derivative, surface plot / 225 \\ Ex. 12.12 Cauchy--Riemann equations / 227 \\ Ex. 12.13 Harmonic functions / 227 \\ Ex. 12.14 Exponential, trigonometric and hyperbolic functions / 228 \\ Ex. 12.15 Complex logarithm In* (cf. Sec. 12.8) / 229 \\ Problems for Chapter 12 / 232 \\ 13 Complex Integration / 236 \\ Ex. 13.1 Integration by using a formula for the path / 236 \\ Ex. 13.2 A most important integral (Sec. 13.2) / 237 \\ Ex. 13.3 Path consisting of two parts. Path dependence / 238 \\ Ex. 13.4 Indefinite integration (Sec. 13.2) / 238 \\ Ex. 13.5 Linearity of integration / 239 \\ Ex. 13.6 WARNING: Contour integrals / 239 \\ Ex. 13.7 Partial fractions in integration / 240 \\ Ex. 13.8 Contour integral of integer powers / 241 \\ Ex. 13.9 Integration by Cauchy's integral formula / 241 \\ Ex. 13.10 Integration by derivative formulas (Sec. 13.6) / 242 \\ Problems for Chapter 13 / 243 \\ 14 Power Series, Taylor Series, Laurent Series / 245 \\ Ex. 14.1 Complex sequences and their plots / 246 \\ Ex. 14.2 Ratio test for complex series / 248 \\ Ex. 14.3 Radius of convergence. Cauchy--Hadamard formula / 249 \\ Ex. 14.4 Taylor series / 250 \\ Ex. 14.5 Differentiation and integration of Taylor series / 251 \\ Ex. 14.6 Generating function / 252 \\ Ex. 14.7 Use of complex series for computing function values / 254 \\ Ex. 14.8 Uniform convergence / 254 \\ Ex. 14.9 Laurent series / 255 \\ Ex. 14.10 Laurent series by partial fractions / 255 \\ Ex. 14.11 Zeros / 257 \\ Ex. 14.12 Singularities / 258 \\ Ex. 14.13 Analytic at infinity / 258 \\ Problems for Chapter 14 / 260 \\ 15 Residue Integration Method / 262 \\ Ex. 15.1 Residue integration / 262 \\ Ex. 15.2 Location of singularities. Residues / 263 \\ Ex. 15.3 Higher order pole. Partial fractions / 264 \\ Ex. 15.4 Essential singularity / 264 \\ Ex. 15.5 Integration by the residue theorem / 265 \\ Ex. 15.6 The command residue / 266 \\ Ex. 15.7 Real integrals / 266 \\ Ex. 15.8 Complex transformation of real integrals / 267 \\ Ex. 15.9 Caution with improper real integrals on the computer! / 268 \\ Ex. 15.10 Fourier integrals, Sec. 15.4 / 269 \\ Ex. 15.11 Cauchy principal value / 270 \\ Problems for Chapter 15 / 271 \\ 16 Conformal Mapping / 273 \\ Ex. 16.1 Plotting images of straight lines under w = z2 / 273 \\ Conformal mapping / 274 \\ Mapping w = l/z / 276 \\ Mapping of the unit disk onto the unit disk / 277 \\ Linear fractional transformation / 278 \\ Linear fractional transformation for given points / 278 \\ Mapping w = l/z / 279 \\ Inverse linear fractional transformation / 280 \\ Mappings of half-planes onto half-planes / 280 \\ Ex. 16.10 Images of several rectangles on common axes / 281 \\ Ex. 16.11 Joukowski airfoil (Sec. 16.5) / 282 \\ Problems for Chapter 16 / 283 \\ 17 Complex Analysis Applied to Potential Theory / 291 \\ Ex. 17.1 Finding and plotting equipotential lines / 291 \\ Ex. 17.2 Plotting equipotential lines and lines of forces. / 293 \\ Ex. 17.3 Equipotential lines / 293 \\ Ex. 17.4 Equipotential surfaces of In z / 294 \\ Ex. 17.5 Noncoaxial cylinders (p. 891) / 295 \\ Ex. 17.6 Flow around a cylinder / 296 \\ Ex. 17.7 Increase of the density of streamlines / 298 \\ Ex. 17.8 Plotting equipotential lines by f i e l d p l o t / 298 \\ Ex. 17.9 Series representation of potential (Sec. 17.5) / 300 \\ Ex. 17.10 Mean value theorem for analytic functions / 301 \\ Problems for Chapter 17 / 302 \\ 18 Numerical Methods in General / 305 \\ Ex. 18.1 Numerical Errors - Quadratic Equation / 306 \\ Ex. 18.2 Fixed-point iteration / 307 \\ Ex. 18.3 Fixed point iteration / 308 \\ Ex. 18.4 Fixed-point iteration (Sec. 18.2) / 309 \\ Ex. 18.5 Newton's method. Square root / 310 \\ Ex. 18.6 Iteration for a transcendental equation / 311 \\ Ex. 18.7 Newton's method / 311 \\ Ex. 18.8 Secant method / 313 \\ Ex. 18.9 Bisection method (AEM, p. 935) / 313 \\ Ex. 18.10 Lagrange interpolation (Sec. 18.3) / 314 \\ Ex. 18.11 Newton's divided difference interpolation / 316 \\ Ex. 18.12 Newton's forward difference interpolation / 318 \\ Ex. 18.13 High-degree interpolation polynomials / 318 \\ Ex. 18.14 Numerical integration / 319 \\ Ex. 18.15 Gauss integration / 320 \\ Problems for Chapter 18 / 322 \\ Procedures / 325 \\ 19 Numerical Methods in Linear Algebra / 327 \\ Ex. 19.1 Gauss elimination. Pivoting / 327 \\ Ex. 19.2 Details of the Gauss elimination / 329 \\ Ex. 19.3 Doolittle's method (p. 982) / 332 \\ Ex. 19.4 Doolittle LU-factorization / 334 \\ Ex. 19.5 Cholesky's method (p. 983) / 334 \\ Ex. 19.6 Gauss--Jordan elimination / 336 \\ Ex. 19.7 Gauss--Seidel iteration / 337 \\ Ex. 19.8 Matrix norms, condition numbers (Sees. 19.3, 19.4) / 338 \\ Ex. 19.9 Gauss--Seidel iteration. Test for convergence / 339 \\ Ex. 19.10 Procedure for the Gauss--Seidel iteration / 340 \\ Ex. 19.11 Least squares / 341 \\ Ex. 19.12 Least squares / 342 \\ Ex. 19.13 Example 19.12 revisited: Normal equations / 343 \\ Ex. 19.14 Least squares: Quadratic polynomial / 344 \\ Ex. 19.15 Eigenvalues, eigenvectors / 346 \\ Ex. 19.16 Collatz's theorem for eigenvalues / 346 \\ Ex. 19.17 Power method for eigenvalues (Sec. 19.8) / 348 \\ Ex. 19.18 Wielandt's deflation / 350 \\ Ex. 19.19 Householder tridiagonalization / 350 \\ Ex. 19.20 QR Factorization method / 352 \\ Ex. 19.21 Pivoting in Gaussian Elimination / 355 \\ Problems for Chapter 19 / 357 \\ 20 Numerical Methods for Differential Equations / 360 \\ Ex. 20.1 Two ways of writing a differential equation / 360 \\ Ex. 20.2 Euler method (p. 1035) / 361 \\ Ex. 20.3 Improved Euler method / 362 \\ Ex. 20.4 Runge--Kutta method / 364 \\ Ex. 20.5 Procedure for the Runge--Kutta method / 365 \\ Ex. 20.6 Adams--Moulton two-step method / 366 \\ Ex. 20.7 Adams--Moulton two-step method, with built-in Runge--Kutta / 367 \\ Ex. 20.8 Second order differential equations, simplest method / 368 \\ Ex. 20.9 Runge--Kutta--Nystr{\"o}m method / 370 \\ Ex. 20.10 Laplace equation in Example 1, p. 1059 / 372 \\ Ex. 20.11 Program for the Laplace equation. Band matrices / 373 \\ Ex. 20.12 Laplace equation: Refinement of grids / 375 \\ Ex. 20.13 Laplace equation: Procedure / 376 \\ Ex. 20.14 Poisson Equation: Mixed Boundary Values / 377 \\ Ex. 20.15 Parabolic Equations: Crank--Nicolson Method / 378 \\ Problems for Chapter 20 / 380 \\ 21 Chapter / 22 \\ No examples, no problems. 23 Probability Theory / 385 \\ Ex. 23.1 Stirling formula / 385 \\ Ex. 23.2 Sum of binomial coefficients / 386 \\ Ex. 23.3 Plotting distribution functions / 387 \\ Ex. 23.4 Plotting distribution function and density / 387 \\ Ex. 23.5 Distribution function, density, critical value / 387 \\ Ex. 23.6 Uniform distribution / 388 \\ Ex. 23.7 Binomial distribution / 389 \\ Ex. 23.8 Binomial distribution / 389 \\ Ex. 23.9 Poisson distribution with a large mean / 391 \\ Ex. 23.10 Hypergeometric distribution / 391 \\ Ex. 23.11 Normal distribution / 391 \\ Problems for Chapter 23 / 394 \\ 24 Mathematical Statistics / 396 \\ Ex. 24.1 Random numbers / 397 \\ Ex. 24.2 Random numbers. Sample means / 398 \\ Ex. 24.3 Frequency polygon / 400 \\ Ex. 24.4, Sample mean, variance, and standard deviation / 400 \\ Ex. 24.5 Confidence interval for the mean of the normal distribution with known variance / 401 \\ Ex. 24.6 Confidence interval for the mean of the normal distribution with unknown variance, $t$-distribution / 402 \\ Ex. 24.7 Confidence interval for the variance of the normal distribution / 402 \\ Ex. 24.8 Test for the mean / 403 \\ Ex. 24.9 Power function for different sample sizes. OC curves / 403 \\ Ex. 24.10 Tests for the mean of the normal distribution with known variance / 404 \\ Ex. 24.11 $t$-test for the mean of the normal distribution with unknown variance / 405 \\ Ex. 24.12 Test for the variance of the normal distribution / 405 \\ Ex. 24.13 Comparison of means by independent samples / 406 \\ Ex. 24.14 Comparison of variances of normal distributions / 406 \\ Ex. 24.15 Acceptance sampling / 407 \\ Ex. 24.16 Linear regression / 408 \\ Ex. 24.17 Nonlinear regression / 409 \\ Problems for Chapter 24 / 411 \\ Appendix 1 References / A1 \\ Appendix 2 Solutions to Odd-Numbered Problems / A2 \\ Index of Maple Commands and Keywords / J1 Index of Maple Commands Arranged by Chapters / J11

entry:
@Book{Kreyszig:1994:MCM,
  author =       "E. Kreyszig and E. J. Normington",
  title =        "{Maple} Computer Manual for Seventh Edition Advanced
                 Engineering Mathematics: {Erwin Kreyszig}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xii + 506",
  year =         "1994",
  ISBN =         "0-471-31126-X",
  ISBN-13 =      "978-0-471-31126-3",
  LCCN =         "QA401 K74 1993",
  bibdate =      "Thu Jul 7 07:55:36 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib",
  note =         "There is a companion {\em Instructor's Maple Manual},
                 but I have not yet found an exact citation for it.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction / 1 \\
                 General Commands / 3 \\
                 1 First Order Differential Equations / 10 \\
                 Ex. 1.1 Radioactivity, exponential decay / 12 \\
                 Ex. 1.2 Separation of variables. Plot of several curves
                 / 14 \\
                 Ex. 1.3 Checking solutions. Two ways of writing
                 derivatives / 15 \\
                 Ex. 1.4 Flow through an outlet. Torricelli's law / 16
                 \\
                 Ex. 1.5 Mixing problem / 16 \\
                 Ex. 1.6 Exact differential equation / 18 \\
                 Ex. 1.7 Integrating factors / 18 \\
                 Ex. 1.8 Linear differential equations / 19 \\
                 Ex. 1.9 Bernoulli equation. Verhulst equation / 20 \\
                 Ex. 1.10 RC-circuit / 21 \\
                 Ex. 1.11 RL-circuit. TRIGONOMETRIC TRICK / 22 \\
                 Ex. 1.12 Orthogonal trajectories / 23 \\
                 Ex. 1.13 Plotting trajectories by the command seq / 24
                 \\
                 Ex. 1.14 Direction field / 25 \\
                 Ex. 1.15 Picard iteration / 26 \\
                 Problems for Chapter 1 / 28 \\
                 2 Second Order Differential Equations / 34 \\
                 Ex. 2.1 General solution. Initial value problem / 35
                 \\
                 Ex. 2.2 Double root (cf. Sec. 2.2) / 35 \\
                 Ex. 2.3 Complex roots of the characteristic equation /
                 37 \\
                 Ex. 2.4 Boundary value problem / 38 \\
                 Ex. 2.5 Undamped free vibrations / 38 \\
                 Ex. 2.6 Overdamped free motions / 40 \\
                 Ex. 2.7 Critically damped free motion / 41 \\
                 Ex. 2.8 Underdamped oscillations / 42 \\
                 Ex. 2.9 Euler--Cauchy equation / 43 \\
                 Ex. 2.10 Wronskian / 44 \\
                 Ex. 2.11 Reduction of order / 45 \\
                 Ex. 2.12 Nonhomogeneous differential equation / 45 \\
                 Ex. 2.13 Solution by undetermined coefficients / 47 \\
                 Ex. 2.14 Variation of parameters / 48 \\
                 Ex. 2.15 Resonance in an undamped vibrating system / 49
                 \\
                 Ex. 2.16 Forced undamped oscillations. Beats. / 50 \\
                 Ex. 2.17 Forced damped oscillations in Sec. 2.11 / 51
                 \\
                 Ex. 2.18 RLC-circuit / 52 \\
                 Problems for Chapter 2 / 54 \\
                 3 Higher Order Linear Differential Equations / 57 \\
                 Ex. 3.1 Basis of solutions. Wronskian / 58 \\
                 Ex. 3.2 Initial value problem / 59 \\
                 Ex. 3.3 Verification of solutions / 60 \\
                 Ex. 3.4 Differential equation for a given basis / 60
                 \\
                 Ex. 3.5 Method of undetermined coefficients / 61 \\
                 Ex. 3.6 Initial value problems for nonhomogeneous
                 equations / 62 \\
                 Ex. 3.7 Variation of parameters / 62 \\
                 Problems for Chapter 3 / 65 \\
                 4 Systems of Differential Equations Phase Plane,
                 Stability / 67 \\
                 Ex. 4.1 Improper node / 70 \\
                 Ex. 4.2 Improper node. Use of matrices / 71 \\
                 Ex. 4.3 Direction field of vectors in the phase plane /
                 73 \\
                 Ex. 4.4 Saddle point / 74 \\
                 Ex. 4.5 Center / 75 \\
                 Ex. 4.6 Spiral point / 76 \\
                 Ex. 4.7 System without basis of eigenvectors / 78 \\
                 Ex. 4.8 Pendulum equation (Sec. 4.5) / 79 \\
                 Ex. 4.9 Van der Pol equation. Limit cycle (Sec. 4.5) /
                 81 \\
                 Ex. 4.10 Nonhomogeneous system / 82 \\
                 Ex. 4.11 Method of undetermined coefficients / 83 \\
                 Ex. 4.12 Variation of parameters / 84 \\
                 Ex. 4.13 Diagonalization of systems of differential
                 equations / 85 \\
                 Problems for Chapter 4 / 88 \\
                 5 Series Solutions of Differential Equations. Special
                 Functions / 92 \\
                 Ex. 5.1 Series solution. Plot from it / 94 \\
                 Ex. 5.2 Legendre polynomials. The orthopoly package /
                 95 \\
                 Ex. 5.3 Legendre polynomials. Simplification of results
                 / 97 \\
                 Ex. 5.4 Legendre polynomials from boundary value
                 problems / 98 \\
                 Ex. 5.5 Coefficient recursion for series solution / 98
                 \\
                 Ex. 5.6 Coefficient recursion for the Legendre equation
                 / 100 \\
                 Ex. 5.7 Frobenius method / 100 \\
                 Ex. 5.8 Bessel functions / 101 \\
                 Ex. 5.9 Bessel functions of the second kind / 103 \\
                 Ex. 5.10 Orthogonal expansions. Fourier--Legendre
                 series / 104 \\
                 Problems for Chapter 5 / 106 \\
                 6 Laplace Transforms / 108 \\
                 Ex. 6.1 Beginnings / 109 \\
                 Ex. 6.2 Inverse Laplace transform / 110 \\
                 Ex. 6.3 Differentiation and integration of functions /
                 111 \\
                 Ex. 6.4 Differential equation / 111 \\
                 Ex. 6.5 Initial value problem for a nonhomogeneous
                 equation / 112 \\
                 Ex. 6.6 Unit step function. Dirac's delta function /
                 113 \\
                 Ex. 6.7 Discontinuous periodic driving force / 115 \\
                 Ex. 6.8 General formulas / 116 \\
                 Ex. 6.9 Forced oscillations. Resonance / 117 \\
                 Ex. 6.10 System of differential equations. Spacecurve /
                 118 \\
                 Problems for Chapter 6 / 121 \\
                 7 Linear Algebra, Vector Calculus / 125 \\
                 Ex. 7.1 Matrices and vectors: Addition and
                 multiplication / 129 \\
                 Ex. 7.2 Further operations on matrices / 131 \\
                 Ex. 7.3 Special matrices / 133 \\
                 Ex. 7.4 Solution of a linear system / 134 \\
                 Ex. 7.5 Gauss elimination, further cases / 135 \\
                 Ex. 7.6 Determinants / 135 \\
                 Ex. 7.7 Inverse of a matrix / 136 \\
                 Ex. 7.8 Rank of a matrix / 137 \\
                 Ex. 7.9 Linear independence and dependence / 138 \\
                 Ex. 7.10 Eigenvalues, eigenvectors / 139 \\
                 Ex. 7.11 Complex eigenvalues / 140 \\
                 Ex. 7.12 Orthogonal transformations / 141 \\
                 Ex. 7.13 Complex matrices / 142 \\
                 Ex. 7.14 Diagonalization of a matrix / 143 \\
                 Ex. 7.15 Similar matrices / 144 \\
                 Problems for Chapter 7 / 146 \\
                 8 Vector Differential Calculus. Grad, Div, Curl / 149
                 \\
                 Ex. 8.1 Vector with given endpoints. Length / 151 \\
                 Ex. 8.2 Vector addition. Scalar multiplication / 152
                 \\
                 Ex. 8.3 Inner product (dot product) / 152 \\
                 Ex. 8.4 Vector product (cross product) / 154 \\
                 Ex. 8.5 Differentiation of vectors. Tangent. Spaceplots
                 / 155 \\
                 Ex. 8.6 Arc length, curvature, torsion of a curve / 156
                 \\
                 Ex. 8.7 Gradient, directional derivative / 157 \\
                 Ex. 8.8 Gradient as surface normal vector. Vector
                 substitution / 158 \\
                 Ex. 8.9 Potential of a vector field / 159 \\
                 Ex. 8.10 Divergence. Laplacian / 159 \\
                 Ex. 8.11 Curl / 160 \\
                 Problems for Chapter 8 / 162 \\
                 9 Vector Integral Calculus. Integral Theorems / 167 \\
                 Ex. 9.1 Line integral in the plane / 167 \\
                 Ex. 9.2 Line integral in space / 168 \\
                 Ex. 9.3 Dependence of integrals on path / 169 \\
                 Ex. 9.4 Line integral of the form (7), p. 505 / 169 \\
                 Ex. 9.5 Independence of path / 170 \\
                 Ex. 9.6 Path independence; Use of potential / 170 \\
                 Ex. 9.7 Exactness and independence of path / 171 \\
                 Ex. 9.8 Double integrals / 171 \\
                 Ex. 9.9 Green's theorem in the plane / 172 \\
                 Ex. 9.10 Surface plot. Normal vector / 172 \\
                 Ex. 9.11 Surface integral (flux) / 174 \\
                 Ex. 9.12 Triple integral / 174 \\
                 Ex. 9.13 Gauss's divergence theorem / 174 \\
                 Ex. 9.14 Verification of the divergence theorem / 175
                 \\
                 Ex. 9.15 Stokes's theorem / 176 \\
                 Problems for Chapter 9 / 178 \\
                 10 Fourier Series, Integrals, and Transforms / 181 \\
                 Ex. 10.1 Periodic square wave / 181 \\
                 Ex. 10.2 Piecewise linear function / 183 \\
                 Ex. 10.3 Series with cosine and sine terms / 184 \\
                 Ex. 10.4 Period different from 2?r / 184 \\
                 Ex. 10.5 Saw tooth waves. Gibbs phenomenon / 185 \\
                 Ex. 10.6 Even and odd functions / 186 \\
                 Ex. 10.7 Half-range expansions / 186 \\
                 Ex. 10.8 Rectifier / 187 \\
                 Ex. 10.9 Forced oscillations / 189 \\
                 Ex. 10.10 Square error / 191 \\
                 Ex. 10.11 Fourier integral / 191 \\
                 Ex. 10.12 Fourier transform / 192 \\
                 Problems for Chapter 10 / 193 \\
                 11 Partial Differential Equations / 198 \\
                 Ex. 11.1 Basic equations in this chapter / 198 \\
                 Ex. 11.2 Plot of level curves / 199 \\
                 Ex. 11.3 Surface plots of solutions / 200 \\
                 Ex. 11.4 Separation of variables / 200 \\
                 Ex. 11.5 D'Alembert's solution / 201 \\
                 Ex. 11.6 Vibrating beam / 202 \\
                 Ex. 11.7 Heat equation / 203 \\
                 Ex. 11.8 Heat flow: Adiabatic ends / 204 \\
                 Ex. 11.9 Two-dimensional heat flow / 204 \\
                 Ex. 11.10 Error function / 206 \\
                 Ex. 11.11 Rectangular membrane / 208 \\
                 Ex. 11.12 Square Membrane / 209 \\
                 Problems for Chapter 11 / 211 \\
                 12 Complex Numbers Complex Analytic Functions / 215 \\
                 Ex. 12.1 Complex numbers / 217 \\
                 Ex. 12.2 Polar form / 218 \\
                 Ex. 12.3 Plotting complex numbers / 219 \\
                 Ex. 12.4 Absolute value of a quotient / 221 \\
                 Ex. 12.5 De Moivre's formula / 221 \\
                 Ex. 12.6 Quadratic and cubic equations. Roots of
                 complex numbers / 222 \\
                 Ex. 12.7 Roots of unity and their plots / 222 \\
                 Ex. 12.8 Unit circle, annulus / 224 \\
                 Ex. 12.9 Circles. Completing squares / 224 \\
                 Ex. 12.10 Inequalities / 225 \\
                 Ex. 12.11 Function, derivative, surface plot / 225 \\
                 Ex. 12.12 Cauchy--Riemann equations / 227 \\
                 Ex. 12.13 Harmonic functions / 227 \\
                 Ex. 12.14 Exponential, trigonometric and hyperbolic
                 functions / 228 \\
                 Ex. 12.15 Complex logarithm In* (cf. Sec. 12.8) / 229
                 \\
                 Problems for Chapter 12 / 232 \\
                 13 Complex Integration / 236 \\
                 Ex. 13.1 Integration by using a formula for the path /
                 236 \\
                 Ex. 13.2 A most important integral (Sec. 13.2) / 237
                 \\
                 Ex. 13.3 Path consisting of two parts. Path dependence
                 / 238 \\
                 Ex. 13.4 Indefinite integration (Sec. 13.2) / 238 \\
                 Ex. 13.5 Linearity of integration / 239 \\
                 Ex. 13.6 WARNING: Contour integrals / 239 \\
                 Ex. 13.7 Partial fractions in integration / 240 \\
                 Ex. 13.8 Contour integral of integer powers / 241 \\
                 Ex. 13.9 Integration by Cauchy's integral formula / 241
                 \\
                 Ex. 13.10 Integration by derivative formulas (Sec.
                 13.6) / 242 \\
                 Problems for Chapter 13 / 243 \\
                 14 Power Series, Taylor Series, Laurent Series / 245
                 \\
                 Ex. 14.1 Complex sequences and their plots / 246 \\
                 Ex. 14.2 Ratio test for complex series / 248 \\
                 Ex. 14.3 Radius of convergence. Cauchy--Hadamard
                 formula / 249 \\
                 Ex. 14.4 Taylor series / 250 \\
                 Ex. 14.5 Differentiation and integration of Taylor
                 series / 251 \\
                 Ex. 14.6 Generating function / 252 \\
                 Ex. 14.7 Use of complex series for computing function
                 values / 254 \\
                 Ex. 14.8 Uniform convergence / 254 \\
                 Ex. 14.9 Laurent series / 255 \\
                 Ex. 14.10 Laurent series by partial fractions / 255 \\
                 Ex. 14.11 Zeros / 257 \\
                 Ex. 14.12 Singularities / 258 \\
                 Ex. 14.13 Analytic at infinity / 258 \\
                 Problems for Chapter 14 / 260 \\
                 15 Residue Integration Method / 262 \\
                 Ex. 15.1 Residue integration / 262 \\
                 Ex. 15.2 Location of singularities. Residues / 263 \\
                 Ex. 15.3 Higher order pole. Partial fractions / 264 \\
                 Ex. 15.4 Essential singularity / 264 \\
                 Ex. 15.5 Integration by the residue theorem / 265 \\
                 Ex. 15.6 The command residue / 266 \\
                 Ex. 15.7 Real integrals / 266 \\
                 Ex. 15.8 Complex transformation of real integrals / 267
                 \\
                 Ex. 15.9 Caution with improper real integrals on the
                 computer! / 268 \\
                 Ex. 15.10 Fourier integrals, Sec. 15.4 / 269 \\
                 Ex. 15.11 Cauchy principal value / 270 \\
                 Problems for Chapter 15 / 271 \\
                 16 Conformal Mapping / 273 \\
                 Ex. 16.1 Plotting images of straight lines under w = z2
                 / 273 \\
                 Conformal mapping / 274 \\
                 Mapping w = l/z / 276 \\
                 Mapping of the unit disk onto the unit disk / 277 \\
                 Linear fractional transformation / 278 \\
                 Linear fractional transformation for given points / 278
                 \\
                 Mapping w = l/z / 279 \\
                 Inverse linear fractional transformation / 280 \\
                 Mappings of half-planes onto half-planes / 280 \\
                 Ex. 16.10 Images of several rectangles on common axes /
                 281 \\
                 Ex. 16.11 Joukowski airfoil (Sec. 16.5) / 282 \\
                 Problems for Chapter 16 / 283 \\
                 17 Complex Analysis Applied to Potential Theory / 291
                 \\
                 Ex. 17.1 Finding and plotting equipotential lines / 291
                 \\
                 Ex. 17.2 Plotting equipotential lines and lines of
                 forces. / 293 \\
                 Ex. 17.3 Equipotential lines / 293 \\
                 Ex. 17.4 Equipotential surfaces of In z / 294 \\
                 Ex. 17.5 Noncoaxial cylinders (p. 891) / 295 \\
                 Ex. 17.6 Flow around a cylinder / 296 \\
                 Ex. 17.7 Increase of the density of streamlines / 298
                 \\
                 Ex. 17.8 Plotting equipotential lines by f i e l d p l
                 o t / 298 \\
                 Ex. 17.9 Series representation of potential (Sec. 17.5)
                 / 300 \\
                 Ex. 17.10 Mean value theorem for analytic functions /
                 301 \\
                 Problems for Chapter 17 / 302 \\
                 18 Numerical Methods in General / 305 \\
                 Ex. 18.1 Numerical Errors - Quadratic Equation / 306
                 \\
                 Ex. 18.2 Fixed-point iteration / 307 \\
                 Ex. 18.3 Fixed point iteration / 308 \\
                 Ex. 18.4 Fixed-point iteration (Sec. 18.2) / 309 \\
                 Ex. 18.5 Newton's method. Square root / 310 \\
                 Ex. 18.6 Iteration for a transcendental equation / 311
                 \\
                 Ex. 18.7 Newton's method / 311 \\
                 Ex. 18.8 Secant method / 313 \\
                 Ex. 18.9 Bisection method (AEM, p. 935) / 313 \\
                 Ex. 18.10 Lagrange interpolation (Sec. 18.3) / 314 \\
                 Ex. 18.11 Newton's divided difference interpolation /
                 316 \\
                 Ex. 18.12 Newton's forward difference interpolation /
                 318 \\
                 Ex. 18.13 High-degree interpolation polynomials / 318
                 \\
                 Ex. 18.14 Numerical integration / 319 \\
                 Ex. 18.15 Gauss integration / 320 \\
                 Problems for Chapter 18 / 322 \\
                 Procedures / 325 \\
                 19 Numerical Methods in Linear Algebra / 327 \\
                 Ex. 19.1 Gauss elimination. Pivoting / 327 \\
                 Ex. 19.2 Details of the Gauss elimination / 329 \\
                 Ex. 19.3 Doolittle's method (p. 982) / 332 \\
                 Ex. 19.4 Doolittle LU-factorization / 334 \\
                 Ex. 19.5 Cholesky's method (p. 983) / 334 \\
                 Ex. 19.6 Gauss--Jordan elimination / 336 \\
                 Ex. 19.7 Gauss--Seidel iteration / 337 \\
                 Ex. 19.8 Matrix norms, condition numbers (Sees. 19.3,
                 19.4) / 338 \\
                 Ex. 19.9 Gauss--Seidel iteration. Test for convergence
                 / 339 \\
                 Ex. 19.10 Procedure for the Gauss--Seidel iteration /
                 340 \\
                 Ex. 19.11 Least squares / 341 \\
                 Ex. 19.12 Least squares / 342 \\
                 Ex. 19.13 Example 19.12 revisited: Normal equations /
                 343 \\
                 Ex. 19.14 Least squares: Quadratic polynomial / 344 \\
                 Ex. 19.15 Eigenvalues, eigenvectors / 346 \\
                 Ex. 19.16 Collatz's theorem for eigenvalues / 346 \\
                 Ex. 19.17 Power method for eigenvalues (Sec. 19.8) /
                 348 \\
                 Ex. 19.18 Wielandt's deflation / 350 \\
                 Ex. 19.19 Householder tridiagonalization / 350 \\
                 Ex. 19.20 QR Factorization method / 352 \\
                 Ex. 19.21 Pivoting in Gaussian Elimination / 355 \\
                 Problems for Chapter 19 / 357 \\
                 20 Numerical Methods for Differential Equations / 360
                 \\
                 Ex. 20.1 Two ways of writing a differential equation /
                 360 \\
                 Ex. 20.2 Euler method (p. 1035) / 361 \\
                 Ex. 20.3 Improved Euler method / 362 \\
                 Ex. 20.4 Runge--Kutta method / 364 \\
                 Ex. 20.5 Procedure for the Runge--Kutta method / 365
                 \\
                 Ex. 20.6 Adams--Moulton two-step method / 366 \\
                 Ex. 20.7 Adams--Moulton two-step method, with built-in
                 Runge--Kutta / 367 \\
                 Ex. 20.8 Second order differential equations, simplest
                 method / 368 \\
                 Ex. 20.9 Runge--Kutta--Nystr{\"o}m method / 370 \\
                 Ex. 20.10 Laplace equation in Example 1, p. 1059 / 372
                 \\
                 Ex. 20.11 Program for the Laplace equation. Band
                 matrices / 373 \\
                 Ex. 20.12 Laplace equation: Refinement of grids / 375
                 \\
                 Ex. 20.13 Laplace equation: Procedure / 376 \\
                 Ex. 20.14 Poisson Equation: Mixed Boundary Values / 377
                 \\
                 Ex. 20.15 Parabolic Equations: Crank--Nicolson Method /
                 378 \\
                 Problems for Chapter 20 / 380 \\
                 21 Chapter / 22 \\
                 No examples, no problems. 23 Probability Theory / 385
                 \\
                 Ex. 23.1 Stirling formula / 385 \\
                 Ex. 23.2 Sum of binomial coefficients / 386 \\
                 Ex. 23.3 Plotting distribution functions / 387 \\
                 Ex. 23.4 Plotting distribution function and density /
                 387 \\
                 Ex. 23.5 Distribution function, density, critical value
                 / 387 \\
                 Ex. 23.6 Uniform distribution / 388 \\
                 Ex. 23.7 Binomial distribution / 389 \\
                 Ex. 23.8 Binomial distribution / 389 \\
                 Ex. 23.9 Poisson distribution with a large mean / 391
                 \\
                 Ex. 23.10 Hypergeometric distribution / 391 \\
                 Ex. 23.11 Normal distribution / 391 \\
                 Problems for Chapter 23 / 394 \\
                 24 Mathematical Statistics / 396 \\
                 Ex. 24.1 Random numbers / 397 \\
                 Ex. 24.2 Random numbers. Sample means / 398 \\
                 Ex. 24.3 Frequency polygon / 400 \\
                 Ex. 24.4, Sample mean, variance, and standard deviation
                 / 400 \\
                 Ex. 24.5 Confidence interval for the mean of the normal
                 distribution with known variance / 401 \\
                 Ex. 24.6 Confidence interval for the mean of the normal
                 distribution with unknown variance, $t$-distribution /
                 402 \\
                 Ex. 24.7 Confidence interval for the variance of the
                 normal distribution / 402 \\
                 Ex. 24.8 Test for the mean / 403 \\
                 Ex. 24.9 Power function for different sample sizes. OC
                 curves / 403 \\
                 Ex. 24.10 Tests for the mean of the normal distribution
                 with known variance / 404 \\
                 Ex. 24.11 $t$-test for the mean of the normal
                 distribution with unknown variance / 405 \\
                 Ex. 24.12 Test for the variance of the normal
                 distribution / 405 \\
                 Ex. 24.13 Comparison of means by independent samples /
                 406 \\
                 Ex. 24.14 Comparison of variances of normal
                 distributions / 406 \\
                 Ex. 24.15 Acceptance sampling / 407 \\
                 Ex. 24.16 Linear regression / 408 \\
                 Ex. 24.17 Nonlinear regression / 409 \\
                 Problems for Chapter 24 / 411 \\
                 Appendix 1 References / A1 \\
                 Appendix 2 Solutions to Odd-Numbered Problems / A2 \\
                 Index of Maple Commands and Keywords / J1 Index of
                 Maple Commands Arranged by Chapters / J11",
}


bibtype: book
filename: master.bib
label: Krieger:1990:IT
author: Jost Krieger and Norbert Schwarz
title: Introduction to TeX
publisher: pub-AWE
address: pub-AWE:adr
pages: 278
year: 1990
ISBN: 0-201-51141-X OR 020151141X
ISBN13: 978-0-201-51141-3 OR 9780201511413
LCCN: Z253.4.T47 K75 1990
acknowledgement: ack-nhfb
rawauthor: Jost Krieger and Norbert Schwarz
rawtitle: Introduction to {\TeX}
entry:
@Book{Krieger:1990:IT,
  author =       "Jost Krieger and Norbert Schwarz",
  title =        "Introduction to {\TeX}",
  publisher =    pub-AWE,
  address =      pub-AWE:adr,
  pages =        "278",
  year =         "1990",
  ISBN =         "0-201-51141-X",
  ISBN-13 =      "978-0-201-51141-3",
  LCCN =         "Z253.4.T47 K75 1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
  xxnote =       "English translation of \cite{Schwarz:1988:ET}. See
                 also the Dutch translation, \cite{Schwarz:1990:IT}.",
}


bibtype: book
filename: master.bib
label: Krol:1993:WIU
author: Ed Krol
title: The Whole Internet: User's Guide and Catalog
publisher: pub-ORA
address: pub-ORA:adr
pages: xxiv + 376
year: 1993
ISBN: 1-56592-025-2 OR 1565920252
ISBN13: 978-1-56592-025-5 OR 9781565920255
LCCN: TK5105.875.I57 K86 1992
bibdate: Wed Dec 15 10:37:48 1993
bibtimestamp: 1993.12.15 10:37:48 ???
series: Nutshell handbook
acknowledgement: ack-nhfb
rawauthor: Ed Krol
rawtitle: The Whole {Internet}: User's Guide and Catalog
bibsource:
https://www.math.utah.edu/pub/tex/bib/internet.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib

TOC:
What is this book about What is the internet How the internet works What's allowed on the internet Remote login Moving files: FTP Electronic mail Network news Finding software Finding someone Tunneling through the internet: gopher Searching indexed databases: WAIS Hypertext spanning the internet: WWW Other applications Dealing with problems Resources on the internet

rawTOC:
What is this book about \\ What is the internet \\ How the internet works \\ What's allowed on the internet \\ Remote login \\ Moving files: FTP \\ Electronic mail \\ Network news \\ Finding software \\ Finding someone \\ Tunneling through the internet: gopher \\ Searching indexed databases: WAIS \\ Hypertext spanning the internet: WWW \\ Other applications \\ Dealing with problems \\ Resources on the internet

entry:
@Book{Krol:1993:WIU,
  author =       "Ed Krol",
  title =        "The Whole {Internet}: User's Guide and Catalog",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxiv + 376",
  year =         "1993",
  ISBN =         "1-56592-025-2",
  ISBN-13 =      "978-1-56592-025-5",
  LCCN =         "TK5105.875.I57 K86 1992",
  bibdate =      "Wed Dec 15 10:37:48 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/ora.bib",
  price =        "US\$24.95",
  series =       "Nutshell handbook",
  acknowledgement = ack-nhfb,
  tableofcontents = "What is this book about \\
                 What is the internet \\
                 How the internet works \\
                 What's allowed on the internet \\
                 Remote login \\
                 Moving files: FTP \\
                 Electronic mail \\
                 Network news \\
                 Finding software \\
                 Finding someone \\
                 Tunneling through the internet: gopher \\
                 Searching indexed databases: WAIS \\
                 Hypertext spanning the internet: WWW \\
                 Other applications \\
                 Dealing with problems \\
                 Resources on the internet",
}


bibtype: article
filename: master.bib
label: Krommes:fortran-web
author: John Krommes
title: FWEB (Krommes) vs. FWEB (Avenarius and Oppermann)
journal: j-TEXHAX
volume: 90
number: 19
pages: xxiv + 376
month: feb
monthnumber: 2
year: 1990
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: John Krommes
rawtitle: {\FWEB} ({Krommes}) vs. {\FWEB} ({Avenarius} and {Oppermann})
entry:
@Article{Krommes:fortran-web,
  author =       "John Krommes",
  title =        "{\FWEB} ({Krommes}) vs. {\FWEB} ({Avenarius} and
                 {Oppermann})",
  journal =      j-TEXHAX,
  volume =       "90",
  number =       "19",
  month =        feb,
  year =         "1990",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Kronrod:1965:NWQ
author: Aleksandr Semenovich Kronrod
title: Nodes and weights of quadrature formulas: sixteen-place tables
publisher: Consultants Bureau
address: New York, NY, USA
pages: vii + 143
year: 1965
LCCN: QA310 .K7613
bibdate: Sat Dec 24 16:43:03 MST 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.12.24 16:43:03 MST
subject: Integrals
acknowledgement: ack-nhfb
rawauthor: Aleksandr Semenovich Kronrod
rawtitle: Nodes and weights of quadrature formulas: sixteen-place tables
entry:
@Book{Kronrod:1965:NWQ,
  author =       "Aleksandr Semenovich Kronrod",
  title =        "Nodes and weights of quadrature formulas:
                 sixteen-place tables",
  publisher =    "Consultants Bureau",
  address =      "New York, NY, USA",
  pages =        "vii + 143",
  year =         "1965",
  LCCN =         "QA310 .K7613",
  bibdate =      "Sat Dec 24 16:43:03 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Integrals",
}


bibtype: book
filename: master.bib
label: Kronsjo:1985:CCS
author: L. Kronsjo
title: Computational Complexity of Sequential and Parallel Algorithms
publisher: pub-WILEY-INTERSCIENCE
address: pub-WILEY-INTERSCIENCE:adr
pages: x + 224
year: 1985
ISBN: 0-471-90814-2 OR 0471908142
ISBN13: 978-0-471-90814-2 OR 9780471908142
LCCN: QA76.6 .K7631 1985
bibdate: Wed Dec 15 10:37:49 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:37:49 ???
acknowledgement: ack-nhfb
rawauthor: L. Kronsj{\"o}
rawtitle: Computational Complexity of Sequential and Parallel Algorithms
entry:
@Book{Kronsjo:1985:CCS,
  author =       "L. Kronsj{\"o}",
  title =        "Computational Complexity of Sequential and Parallel
                 Algorithms",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "x + 224",
  year =         "1985",
  ISBN =         "0-471-90814-2",
  ISBN-13 =      "978-0-471-90814-2",
  LCCN =         "QA76.6 .K7631 1985",
  bibdate =      "Wed Dec 15 10:37:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$50.00",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Kruglinski:1994:IVC
author: David J. Kruglinski
title: Inside Visual C++: Version 1.5
publisher: pub-MICROSOFT
address: pub-MICROSOFT:adr
edition: Second
pages: xxx + 732
year: 1994
ISBN: 1-55616-661-8 OR 1556166618
ISBN13: 978-1-55616-661-7 OR 9781556166617
LCCN: QA76.73.C153K78 1994
bibdate: Mon Sep 21 17:23:45 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.09.21 17:23:45 ???
acknowledgement: ack-nhfb
rawauthor: David J. Kruglinski
rawtitle: Inside {Visual C++}: Version 1.5
entry:
@Book{Kruglinski:1994:IVC,
  author =       "David J. Kruglinski",
  title =        "Inside {Visual C++}: Version 1.5",
  publisher =    pub-MICROSOFT,
  address =      pub-MICROSOFT:adr,
  edition =      "Second",
  pages =        "xxx + 732",
  year =         "1994",
  ISBN =         "1-55616-661-8",
  ISBN-13 =      "978-1-55616-661-7",
  LCCN =         "QA76.73.C153K78 1994",
  bibdate =      "Mon Sep 21 17:23:45 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Kruse:1984:DSP
author: Robert L. Kruse
title: Data Structures and Program Design
publisher: pub-PH
address: pub-PH:adr
pages: xxi + 486
year: 1984
ISBN: 0-13-196253-1 OR 0131962531
ISBN13: 978-0-13-196253-8 OR 9780131962538
LCCN: QA76.6 .K77 1984
bibdate: Wed Dec 15 10:37:49 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:37:49 ???
series: Prentice-Hall Software Series, Editor: Brian W. Kernighan
acknowledgement: ack-nhfb
rawauthor: Robert L. Kruse
rawtitle: Data Structures and Program Design
TOC:
Programming principles Lists Information retrieval Sorting Binary trees Case study: an index writer Recursion Case study: the polish notation Further topics on trees Mathematical methods Removal of recursion Pascal notes

rawTOC:
Programming principles \\ Lists \\ Information retrieval \\ Sorting \\ Binary trees \\ Case study: an index writer \\ Recursion \\ Case study: the polish notation \\ Further topics on trees \\ Mathematical methods \\ Removal of recursion \\ Pascal notes

entry:
@Book{Kruse:1984:DSP,
  author =       "Robert L. Kruse",
  title =        "Data Structures and Program Design",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xxi + 486",
  year =         "1984",
  ISBN =         "0-13-196253-1",
  ISBN-13 =      "978-0-13-196253-8",
  LCCN =         "QA76.6 .K77 1984",
  bibdate =      "Wed Dec 15 10:37:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$28.95",
  series =       "Prentice-Hall Software Series, Editor: Brian W.
                 Kernighan",
  acknowledgement = ack-nhfb,
  tableofcontents = "Programming principles \\
                 Lists \\
                 Information retrieval \\
                 Sorting \\
                 Binary trees \\
                 Case study: an index writer \\
                 Recursion \\
                 Case study: the polish notation \\
                 Further topics on trees \\
                 Mathematical methods \\
                 Removal of recursion \\
                 Pascal notes",
}


bibtype: book
filename: master.bib
label: Kumar:2010:QEB
author: Manjit Kumar
title: Quantum: Einstein, Bohr and the great debate about the nature of reality
publisher: pub-NORTON
address: pub-NORTON:adr
pages: xvi + 448 + 16
year: 2010
ISBN: 0-393-07829-9 (hardcover) OR 0393078299 (hardcover)
ISBN13: 978-0-393-07829-9 (hardcover) OR 9780393078299 (hardcover)
LCCN: QC173.98 .K86 2010; QC173.98.K86
bibdate: Wed Jul 28 08:34:27 MDT 2010
bibtimestamp: 2010.07.28 08:34:27 MDT
subject: Einstein, Albert; Bohr, Niels; Quantum theory; History; Popular works; Physicists
acknowledgement: ack-nhfb
subjectdates: Albert Einstein (1879--1955); Niels Bohr (1885--1962)
rawauthor: Manjit Kumar
rawtitle: Quantum: {Einstein}, {Bohr} and the great debate about the nature of reality
bibsource:
https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; library.mit.edu:9909/mit01

abstract:
Describes the conflict between Einstein and Bohr over the nature of reality and the soul of science as the author discusses quantum theory -- ``an idea that ignited the greatest intellectual debate of the twentieth century.''.

TOC:
The quantum. The reluctant revolutionary The patent slave The golden Dane The quantum atom When Einstein met Bohr The prince of duality Boy physics. Spin doctors The quantum magician ``A late erotic outburst'' Uncertainty in Copenhagen Titans clash over reality. Solvay 1927 Einstein forgets relativity Quantum reality Does God play dice? For whom Bell's theorem tolls The quantum demon Timeline Glossary

rawabstract:
Describes the conflict between Einstein and Bohr over the nature of reality and the soul of science as the author discusses quantum theory -- ``an idea that ignited the greatest intellectual debate of the twentieth century.''.

rawTOC:
The quantum. The reluctant revolutionary \\ The patent slave \\ The golden Dane \\ The quantum atom \\ When Einstein met Bohr \\ The prince of duality \\ Boy physics. Spin doctors \\ The quantum magician \\ ``A late erotic outburst'' \\ Uncertainty in Copenhagen \\ Titans clash over reality. Solvay 1927 \\ Einstein forgets relativity \\ Quantum reality \\ Does God play dice? For whom Bell's theorem tolls \\ The quantum demon \\ Timeline \\ Glossary

entry:
@Book{Kumar:2010:QEB,
  author =       "Manjit Kumar",
  title =        "Quantum: {Einstein}, {Bohr} and the great debate about
                 the nature of reality",
  publisher =    pub-NORTON,
  address =      pub-NORTON:adr,
  pages =        "xvi + 448 + 16",
  year =         "2010",
  ISBN =         "0-393-07829-9 (hardcover)",
  ISBN-13 =      "978-0-393-07829-9 (hardcover)",
  LCCN =         "QC173.98 .K86 2010; QC173.98.K86",
  bibdate =      "Wed Jul 28 08:34:27 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.mit.edu:9909/mit01",
  abstract =     "Describes the conflict between Einstein and Bohr over
                 the nature of reality and the soul of science as the
                 author discusses quantum theory -- ``an idea that
                 ignited the greatest intellectual debate of the
                 twentieth century.''.",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Bohr, Niels; Quantum theory;
                 History; Popular works; Physicists",
  subject-dates = "Albert Einstein (1879--1955); Niels Bohr
                 (1885--1962)",
  tableofcontents = "The quantum. The reluctant revolutionary \\
                 The patent slave \\
                 The golden Dane \\
                 The quantum atom \\
                 When Einstein met Bohr \\
                 The prince of duality \\
                 Boy physics. Spin doctors \\
                 The quantum magician \\
                 ``A late erotic outburst'' \\
                 Uncertainty in Copenhagen \\
                 Titans clash over reality. Solvay 1927 \\
                 Einstein forgets relativity \\
                 Quantum reality \\
                 Does God play dice? For whom Bell's theorem tolls \\
                 The quantum demon \\
                 Timeline \\
                 Glossary",
}


bibtype: book
filename: master.bib
label: Kunii:1983:CGT
editor: Tosiyasu L. Kunii
title: Computer Graphics: Theory and Applications
publisher: pub-SV
address: pub-SV:adr
pages: ix + 530
year: 1983
ISBN: 0-387-70001-3 OR 0387700013
ISBN13: 978-0-387-70001-4 OR 9780387700014
LCCN: T385 .I49 1983
bibdate: Wed Dec 15 10:37:51 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:37:51 ???
note: Proceedings of Intergraphics '83.
acknowledgement: ack-nhfb
raweditor: Tosiyasu L. Kunii
rawnote: Proceedings of Intergraphics '83.
rawtitle: Computer Graphics: Theory and Applications
entry:
@Book{Kunii:1983:CGT,
  editor =       "Tosiyasu L. Kunii",
  title =        "Computer Graphics: Theory and Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 530",
  year =         "1983",
  ISBN =         "0-387-70001-3",
  ISBN-13 =      "978-0-387-70001-4",
  LCCN =         "T385 .I49 1983",
  bibdate =      "Wed Dec 15 10:37:51 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of Intergraphics '83.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Kunii:1985:CGV
editor: Tosiyasu L. Kunii
title: Computer Graphics: Visual Technology and Art
publisher: pub-SV
address: pub-SV:adr
pages: ix + 382
year: 1985
ISBN: 0-387-70009-9, 3-540-70009-9, 4-431-70009-9 OR 0387700099, 3540700099, 4431700099
LCCN: T385.C5995 1985
bibdate: Wed Dec 15 10:37:51 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:37:51 ???
note: Proceedings of Computer Graphics Tokyo '85.
acknowledgement: ack-nhfb
raweditor: Tosiyasu L. Kunii
rawnote: Proceedings of Computer Graphics Tokyo '85.
rawtitle: Computer Graphics: Visual Technology and Art
ISBN13:
978-0-387-70009-0, 978-3-540-70009-8, 978-4-431-70009-8 OR 9780387700090, 9783540700098, 9784431700098

entry:
@Book{Kunii:1985:CGV,
  editor =       "Tosiyasu L. Kunii",
  title =        "Computer Graphics: Visual Technology and Art",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 382",
  year =         "1985",
  ISBN =         "0-387-70009-9, 3-540-70009-9, 4-431-70009-9",
  ISBN-13 =      "978-0-387-70009-0, 978-3-540-70009-8,
                 978-4-431-70009-8",
  LCCN =         "T385.C5995 1985",
  bibdate =      "Wed Dec 15 10:37:51 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of Computer Graphics Tokyo '85.",
  price =        "US\$45.00",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Kunii:1985:FCG
editor: Tosiyasu L. Kunii
title: Frontiers in Computer Graphics
publisher: pub-SV
address: pub-SV:adr
pages: ix + 443
year: 1985
ISBN: 0-387-70004-8, 3-540-70004-8, 4-431-70004-8 OR 0387700048, 3540700048, 4431700048
LCCN: T385 .C593 1984
bibdate: Wed Dec 15 10:37:54 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:37:54 ???
note: Proceedings of Computer Graphics Tokyo '84.
acknowledgement: ack-nhfb
raweditor: Tosiyasu L. Kunii
rawnote: Proceedings of Computer Graphics Tokyo '84.
rawtitle: Frontiers in Computer Graphics
ISBN13:
978-0-387-70004-5, 978-3-540-70004-3, 978-4-431-70004-3 OR 9780387700045, 9783540700043, 9784431700043

entry:
@Book{Kunii:1985:FCG,
  editor =       "Tosiyasu L. Kunii",
  title =        "Frontiers in Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 443",
  year =         "1985",
  ISBN =         "0-387-70004-8, 3-540-70004-8, 4-431-70004-8",
  ISBN-13 =      "978-0-387-70004-5, 978-3-540-70004-3,
                 978-4-431-70004-3",
  LCCN =         "T385 .C593 1984",
  bibdate =      "Wed Dec 15 10:37:54 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of Computer Graphics Tokyo '84.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Kunii:1986:ACG
editor: Tosiyasu L. Kunii
title: Advanced Computer Graphics
publisher: pub-SV
address: pub-SV:adr
pages: ix + 504
year: 1986
ISBN: 0-387-70011-0 OR 0387700110
ISBN13: 978-0-387-70011-3 OR 9780387700113
LCCN: T385 .C5931 1986
bibdate: Wed Dec 15 10:37:50 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:37:50 ???
note: Proceedings of Computer Graphics Tokyo '86.
acknowledgement: ack-nhfb
raweditor: Tosiyasu L. Kunii
rawnote: Proceedings of Computer Graphics Tokyo '86.
rawtitle: Advanced Computer Graphics
TOC:
1 Computational Geometry Localized Surface Interpolation Method for Irregular Meshes Environment for Fast Elaboration of Constructive Solid Geometry Interactive Solid Modeling in HutDesign Polygonal Subdivision of Parametric Surfaces Algorithms for Automatic Mould Division Design Geometry in Prolog On the Boundary of Digital Straight Line Segments 2 Rendering Soft Objects The Simulation of Natural Features Using Cone Tracing Shadows for Bump-Mapped Surfaces 3 Visual Interface and Languages Interaction with IBS: An Icon-Based System GEO: Graphics System with Editable Objects A Pixelated Design Medium A New Graphics User Interface for Accessing a Database 4 Visual Data Bases Solid Modeler with Assembly Representation Tables Visual Business Graphics Query Interface The Geo-Graph Simulation System: Towards Dynamic Use of a Geomatic Data Base 5 Computer Animation Integrating Key-Frame Animation and Algorithmic Animation of Articulated Bodies Molecular Shape Embedding in a Grid Stage: Modelling and Animation 6 Graphics Software/Hardware Architecture Dynamic Display of Heart Potential Images with Parallel Processing The Single Array Approach to Engineering and Maintenance of CAD Software The Integration of Computer Graphics and Image Processing Techniques for the Display and Manipulation of Geophysical Data Applications of the $4 times 4$ Determinant Method and the Triangle Processor to Various Interference Problems 7 Mechanical and General Purpose CAD/CAM On Design of a Robot with Three Legs by Computer Graphics High Performance CAD System with Full Automatic Dimensioning and Multi-Modeling Features Based on Engineering Workstation VIRGO: A Computer-Aided Apparel Pattern-Making System 8 VLSI CAD/CAM Efficient Algorithms for Validating VLSI Design Database Format-Independent CAD Software for VLSI Mask Data Preparation NISC: Non-Iterative Silicon Compiler 9 Marketing and Business/Technical Trends Computer Animation around the World: A Marketing Oriented Overview of Industry Development and Direction Business Computer Graphics: Usage and Effectiveness Computer Graphics for Office Automation: A Case Study The Influence of CADD of Teaching Traditional Descriptive Geometry and Orthographic Projection Trends in Microcomputer-Based CAD in the USA Author Index Keywords Index

rawTOC:
1 Computational Geometry \\ Localized Surface Interpolation Method for Irregular Meshes \\ Environment for Fast Elaboration of Constructive Solid Geometry \\ Interactive Solid Modeling in HutDesign \\ Polygonal Subdivision of Parametric Surfaces \\ Algorithms for Automatic Mould Division Design \\ Geometry in Prolog \\ On the Boundary of Digital Straight Line Segments \\ 2 Rendering \\ Soft Objects \\ The Simulation of Natural Features Using Cone Tracing \\ Shadows for Bump-Mapped Surfaces \\ 3 Visual Interface and Languages \\ Interaction with IBS: An Icon-Based System \\ GEO: Graphics System with Editable Objects \\ A Pixelated Design Medium \\ A New Graphics User Interface for Accessing a Database \\ 4 Visual Data Bases \\ Solid Modeler with Assembly Representation Tables \\ Visual Business Graphics Query Interface \\ The Geo-Graph Simulation System: Towards Dynamic Use of a Geomatic Data Base \\ 5 Computer Animation \\ Integrating Key-Frame Animation and Algorithmic Animation of Articulated Bodies \\ Molecular Shape Embedding in a Grid Stage: Modelling and Animation \\ 6 Graphics Software/Hardware Architecture \\ Dynamic Display of Heart Potential Images with Parallel Processing \\ The Single Array Approach to Engineering and Maintenance of CAD Software \\ The Integration of Computer Graphics and Image Processing Techniques for the Display and Manipulation of Geophysical Data \\ Applications of the $4 \times 4$ Determinant Method and the Triangle Processor to Various Interference Problems \\ 7 Mechanical and General Purpose CAD/CAM \\ On Design of a Robot with Three Legs by Computer Graphics \\ High Performance CAD System with Full Automatic Dimensioning and Multi-Modeling Features Based on Engineering Workstation \\ VIRGO: A Computer-Aided Apparel Pattern-Making System \\ 8 VLSI CAD/CAM \\ Efficient Algorithms for Validating VLSI Design Database \\ Format-Independent CAD Software for VLSI Mask Data Preparation \\ NISC: Non-Iterative Silicon Compiler \\ 9 Marketing and Business/Technical Trends \\ Computer Animation around the World: A Marketing Oriented Overview of Industry Development and Direction \\ Business Computer Graphics: Usage and Effectiveness \\ Computer Graphics for Office Automation: A Case Study \\ The Influence of CADD of Teaching Traditional Descriptive Geometry and Orthographic Projection \\ Trends in Microcomputer-Based CAD in the USA \\ Author Index \\ Keywords Index

entry:
@Book{Kunii:1986:ACG,
  editor =       "Tosiyasu L. Kunii",
  title =        "Advanced Computer Graphics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 504",
  year =         "1986",
  ISBN =         "0-387-70011-0",
  ISBN-13 =      "978-0-387-70011-3",
  LCCN =         "T385 .C5931 1986",
  bibdate =      "Wed Dec 15 10:37:50 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Proceedings of Computer Graphics Tokyo '86.",
  price =        "US\$45.00",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 Computational Geometry \\
                 Localized Surface Interpolation Method for Irregular
                 Meshes \\
                 Environment for Fast Elaboration of Constructive Solid
                 Geometry \\
                 Interactive Solid Modeling in HutDesign \\
                 Polygonal Subdivision of Parametric Surfaces \\
                 Algorithms for Automatic Mould Division Design \\
                 Geometry in Prolog \\
                 On the Boundary of Digital Straight Line Segments \\
                 2 Rendering \\
                 Soft Objects \\
                 The Simulation of Natural Features Using Cone Tracing
                 \\
                 Shadows for Bump-Mapped Surfaces \\
                 3 Visual Interface and Languages \\
                 Interaction with IBS: An Icon-Based System \\
                 GEO: Graphics System with Editable Objects \\
                 A Pixelated Design Medium \\
                 A New Graphics User Interface for Accessing a Database
                 \\
                 4 Visual Data Bases \\
                 Solid Modeler with Assembly Representation Tables \\
                 Visual Business Graphics Query Interface \\
                 The Geo-Graph Simulation System: Towards Dynamic Use of
                 a Geomatic Data Base \\
                 5 Computer Animation \\
                 Integrating Key-Frame Animation and Algorithmic
                 Animation of Articulated Bodies \\
                 Molecular Shape Embedding in a Grid Stage: Modelling
                 and Animation \\
                 6 Graphics Software/Hardware Architecture \\
                 Dynamic Display of Heart Potential Images with Parallel
                 Processing \\
                 The Single Array Approach to Engineering and
                 Maintenance of CAD Software \\
                 The Integration of Computer Graphics and Image
                 Processing Techniques for the Display and Manipulation
                 of Geophysical Data \\
                 Applications of the $4 \times 4$ Determinant Method and
                 the Triangle Processor to Various Interference Problems
                 \\
                 7 Mechanical and General Purpose CAD/CAM \\
                 On Design of a Robot with Three Legs by Computer
                 Graphics \\
                 High Performance CAD System with Full Automatic
                 Dimensioning and Multi-Modeling Features Based on
                 Engineering Workstation \\
                 VIRGO: A Computer-Aided Apparel Pattern-Making System
                 \\
                 8 VLSI CAD/CAM \\
                 Efficient Algorithms for Validating VLSI Design
                 Database \\
                 Format-Independent CAD Software for VLSI Mask Data
                 Preparation \\
                 NISC: Non-Iterative Silicon Compiler \\
                 9 Marketing and Business/Technical Trends \\
                 Computer Animation around the World: A Marketing
                 Oriented Overview of Industry Development and Direction
                 \\
                 Business Computer Graphics: Usage and Effectiveness \\
                 Computer Graphics for Office Automation: A Case Study
                 \\
                 The Influence of CADD of Teaching Traditional
                 Descriptive Geometry and Orthographic Projection \\
                 Trends in Microcomputer-Based CAD in the USA \\
                 Author Index \\
                 Keywords Index",
}


bibtype: book
filename: master.bib
label: Kuran:2006:HPA
author: Peter Kuran
title: How to Photograph an Atomic Bomb
publisher: VCE
address: Santa Clarita, CA, USA
pages: 141
year: 2006
ISBN: 1-889054-19-4 (paperback), 1-889054-11-9 OR 1889054194 (paperback), 1889054119
ISBN13: 978-1-889054-19-3 (paperback), 978-1-889054-11-7 OR 9781889054193 (paperback), 9781889054117
LCCN: UG476 .K87 2006
bibdate: Mon Oct 10 11:50:38 MDT 2011
bibtimestamp: 2011.10.10 11:50:38 MDT
acknowledgement: ack-nhfb
rawauthor: Peter Kuran
rawtitle: How to Photograph an Atomic Bomb
subject:
Military cinematography; Photography, Military; Photography; Scientific applications; Atomic bomb; United States; Testing; History; Nuclear weapons; Hydrogen bomb

TOC:
Introduction History of Atomic Bomb Photography After the War Operation Crossroads Lookout Mountain Studios EG and G Technical Difficulties of Atomic Bomb Photography Photo Gallery Structural Effects Tests High Altitude Tests Nuclear Testing Timeline

rawTOC:
Introduction \\ History of Atomic Bomb Photography \\ After the War \\ Operation Crossroads \\ Lookout Mountain Studios \\ EG and G \\ Technical Difficulties of Atomic Bomb Photography \\ Photo Gallery \\ Structural Effects Tests \\ High Altitude Tests \\ Nuclear Testing Timeline

entry:
@Book{Kuran:2006:HPA,
  author =       "Peter Kuran",
  title =        "How to Photograph an Atomic Bomb",
  publisher =    "VCE",
  address =      "Santa Clarita, CA, USA",
  pages =        "141",
  year =         "2006",
  ISBN =         "1-889054-19-4 (paperback), 1-889054-11-9",
  ISBN-13 =      "978-1-889054-19-3 (paperback), 978-1-889054-11-7",
  LCCN =         "UG476 .K87 2006",
  bibdate =      "Mon Oct 10 11:50:38 MDT 2011",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
  subject =      "Military cinematography; Photography, Military;
                 Photography; Scientific applications; Atomic bomb;
                 United States; Testing; History; Nuclear weapons;
                 Hydrogen bomb",
  tableofcontents = "Introduction \\
                 History of Atomic Bomb Photography \\
                 After the War \\
                 Operation Crossroads \\
                 Lookout Mountain Studios \\
                 EG and G \\
                 Technical Difficulties of Atomic Bomb Photography \\
                 Photo Gallery \\
                 Structural Effects Tests \\
                 High Altitude Tests \\
                 Nuclear Testing Timeline",
}


bibtype: book
filename: master.bib
label: Kurani:1994:AUP
author: Bharat Kurani
title: Applied Unix programming
volume: 2
publisher: pub-PHPTR
address: pub-PHPTR:adr
pages: xviii + 1250
year: 1994
ISBN: 0-13-304338-X (vol. 1), 0-13-304346-0 (vol. 2) OR 013304338X (vol. 1), 0133043460 (vol. 2)
LCCN: QA76.76.O63 K86 1994
bibdate: Thu Sep 19 09:23:41 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.09.19 09:23:41 ???
note: Two volumes.
keywords: X/Open
acknowledgement: ack-nhfb
rawauthor: Bharat Kurani
rawnote: Two volumes.
rawtitle: Applied {Unix} programming
ISBN13:
978-0-13-304338-9 (vol. 1), 978-0-13-304346-4 (vol. 2) OR 9780133043389 (vol. 1), 9780133043464 (vol. 2)

TOC:
Open Systems The UNIX Model and Terminology Software Design and Testing Internationalization The C Language The C++ Language

rawTOC:
Open Systems \\ The UNIX Model and Terminology \\ Software Design and Testing \\ Internationalization \\ The C Language \\ The C++ Language

entry:
@Book{Kurani:1994:AUP,
  author =       "Bharat Kurani",
  title =        "Applied {Unix} programming",
  volume =       "2",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xviii + 1250",
  year =         "1994",
  ISBN =         "0-13-304338-X (vol. 1), 0-13-304346-0 (vol. 2)",
  ISBN-13 =      "978-0-13-304338-9 (vol. 1), 978-0-13-304346-4 (vol.
                 2)",
  LCCN =         "QA76.76.O63 K86 1994",
  bibdate =      "Thu Sep 19 09:23:41 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Two volumes.",
  acknowledgement = ack-nhfb,
  keywords =     "X/Open",
  libnote =      "Not yet in my library.",
  tableofcontents = "Open Systems \\
                 The UNIX Model and Terminology \\
                 Software Design and Testing \\
                 Internationalization \\
                 The C Language \\
                 The C++ Language",
}


bibtype: book
filename: master.bib
label: Kurlansky:1998:CBF
author: Mark Kurlansky
title: Cod: a biography of the fish that changed the world
publisher: pub-PENGUIN
address: pub-PENGUIN:adr
pages: viii + 294
year: 1998
LCCN: SH351.C5 K87 1998
bibdate: Sat Dec 23 09:16:57 MST 2017
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2017.12.23 09:16:57 MST
subject: Cod fisheries; History; Cooking (Codfish); Cod fisheries; Cooking (Codfish)
acknowledgement: ack-nhfb
rawauthor: Mark Kurlansky
rawtitle: Cod: a biography of the fish that changed the world
ISBN:
0-8027-1326-2 (hardcover), 0-14-027501-0 (paperback), 1-4406-7287-3 (e-book) OR 0802713262 (hardcover), 0140275010 (paperback), 1440672873 (ebook)

ISBN13:
978-0-8027-1326-1 (hardcover), 978-0-14-027501-8 (paperback), 978-1-4406-7287-3 (e-book) OR 9780802713261 (hardcover), 9780140275018 (paperback), 9781440672873 (ebook)

abstract:
booktitle Cod spans a thousand years and four continents. From the Vikings, who pursued the codfish across the Atlantic, and the enigmatic Basques, who first commercialized it in medieval times, to Bartholomew Gosnold, who named Cape Cod in 1602, and Clarence Birdseye, who founded an industry on frozen cod in the 1930s, Mark Kurlansky introduces the explorers, merchants, writers, chefs, and of course the fishermen, whose lives have interwoven with this prolific fish. He chronicles the fifteenth-century politics of the Hanseatic League and the cod wars of the sixteenth and twentieth centuries. He embellishes his story with gastronomic detail, blending in recipes and lore from the Middle Ages to the present. And he brings to life the cod itself: its personality, habits, extended family, and ultimately the tragedy of how the most profitable fish in history is today faced with extinction. From fishing ports in New England and Newfoundland to coastal skiffs, schooners, and factory ships across the Atlantic; from Iceland and Scandinavia to the coasts of England, Brazil, and West Africa, Mark Kurlansky tells a story that brings world history and human passions into captivating focus. The codfish. Wars have been fought over it, revolutions have been spurred by it, national diets have been based on it, economies and livelihoods have depended on it, and the settlement of North America was driven by it. To the millions it has sustained, it has been a treasure more precious than gold. Indeed, the codfish has played a fascinating and crucial role in world history.

TOC:
1: Race to Codlandia 2: With mouth wide open 3: Cod rush 4: 1620: the rock and the cod 5: Certain inalienable rights 6: Cod war heard 'round the world 7: Few new ideas versus nine million eggs 8: Last two ideas 9: Iceland discovers the finite universe 10: Three wars to close the open sea 11: Requiem for the Grand Banks 12: Dangerous waters of nature's resilience 13: Bracing for the Spanish Armada 14: Bracing for the Canadian Armada Cook's tale: six centuries of cod recipes

rawabstract:
{{\booktitle{Cod}}} spans a thousand years and four continents. From the Vikings, who pursued the codfish across the Atlantic, and the enigmatic Basques, who first commercialized it in medieval times, to Bartholomew Gosnold, who named Cape Cod in 1602, and Clarence Birdseye, who founded an industry on frozen cod in the 1930s, Mark Kurlansky introduces the explorers, merchants, writers, chefs, and of course the fishermen, whose lives have interwoven with this prolific fish. He chronicles the fifteenth-century politics of the Hanseatic League and the cod wars of the sixteenth and twentieth centuries. He embellishes his story with gastronomic detail, blending in recipes and lore from the Middle Ages to the present. And he brings to life the cod itself: its personality, habits, extended family, and ultimately the tragedy of how the most profitable fish in history is today faced with extinction. From fishing ports in New England and Newfoundland to coastal skiffs, schooners, and factory ships across the Atlantic; from Iceland and Scandinavia to the coasts of England, Brazil, and West Africa, Mark Kurlansky tells a story that brings world history and human passions into captivating focus. The codfish. Wars have been fought over it, revolutions have been spurred by it, national diets have been based on it, economies and livelihoods have depended on it, and the settlement of North America was driven by it. To the millions it has sustained, it has been a treasure more precious than gold. Indeed, the codfish has played a fascinating and crucial role in world history.

rawTOC:
1: Race to Codlandia \\ 2: With mouth wide open \\ 3: Cod rush \\ 4: 1620: the rock and the cod \\ 5: Certain inalienable rights \\ 6: Cod war heard 'round the world \\ 7: Few new ideas versus nine million eggs \\ 8: Last two ideas \\ 9: Iceland discovers the finite universe \\ 10: Three wars to close the open sea \\ 11: Requiem for the Grand Banks \\ 12: Dangerous waters of nature's resilience \\ 13: Bracing for the Spanish Armada \\ 14: Bracing for the Canadian Armada \\ Cook's tale: six centuries of cod recipes

entry:
@Book{Kurlansky:1998:CBF,
  author =       "Mark Kurlansky",
  title =        "Cod: a biography of the fish that changed the world",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "viii + 294",
  year =         "1998",
  ISBN =         "0-8027-1326-2 (hardcover), 0-14-027501-0 (paperback),
                 1-4406-7287-3 (e-book)",
  ISBN-13 =      "978-0-8027-1326-1 (hardcover), 978-0-14-027501-8
                 (paperback), 978-1-4406-7287-3 (e-book)",
  LCCN =         "SH351.C5 K87 1998",
  bibdate =      "Sat Dec 23 09:16:57 MST 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "{{\booktitle{Cod}}} spans a thousand years and four
                 continents. From the Vikings, who pursued the codfish
                 across the Atlantic, and the enigmatic Basques, who
                 first commercialized it in medieval times, to
                 Bartholomew Gosnold, who named Cape Cod in 1602, and
                 Clarence Birdseye, who founded an industry on frozen
                 cod in the 1930s, Mark Kurlansky introduces the
                 explorers, merchants, writers, chefs, and of course the
                 fishermen, whose lives have interwoven with this
                 prolific fish. He chronicles the fifteenth-century
                 politics of the Hanseatic League and the cod wars of
                 the sixteenth and twentieth centuries. He embellishes
                 his story with gastronomic detail, blending in recipes
                 and lore from the Middle Ages to the present. And he
                 brings to life the cod itself: its personality, habits,
                 extended family, and ultimately the tragedy of how the
                 most profitable fish in history is today faced with
                 extinction. From fishing ports in New England and
                 Newfoundland to coastal skiffs, schooners, and factory
                 ships across the Atlantic; from Iceland and Scandinavia
                 to the coasts of England, Brazil, and West Africa, Mark
                 Kurlansky tells a story that brings world history and
                 human passions into captivating focus. The codfish.
                 Wars have been fought over it, revolutions have been
                 spurred by it, national diets have been based on it,
                 economies and livelihoods have depended on it, and the
                 settlement of North America was driven by it. To the
                 millions it has sustained, it has been a treasure more
                 precious than gold. Indeed, the codfish has played a
                 fascinating and crucial role in world history.",
  acknowledgement = ack-nhfb,
  subject =      "Cod fisheries; History; Cooking (Codfish); Cod
                 fisheries; Cooking (Codfish)",
  tableofcontents = "1: Race to Codlandia \\
                 2: With mouth wide open \\
                 3: Cod rush \\
                 4: 1620: the rock and the cod \\
                 5: Certain inalienable rights \\
                 6: Cod war heard 'round the world \\
                 7: Few new ideas versus nine million eggs \\
                 8: Last two ideas \\
                 9: Iceland discovers the finite universe \\
                 10: Three wars to close the open sea \\
                 11: Requiem for the Grand Banks \\
                 12: Dangerous waters of nature's resilience \\
                 13: Bracing for the Spanish Armada \\
                 14: Bracing for the Canadian Armada \\
                 Cook's tale: six centuries of cod recipes",
}


bibtype: book
filename: master.bib
label: Kurlansky:1999:BHW
author: Mark Kurlansky
title: The Basque history of the world
publisher: pub-WALKER
address: pub-WALKER:adr
pages: xii + 387
year: 1999
ISBN: 0-8027-1349-1 OR 0802713491
ISBN13: 978-0-8027-1349-0 OR 9780802713490
LCCN: DP302.B46 K87 1999
bibdate: Sat Dec 23 09:12:51 MST 2017
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2017.12.23 09:12:51 MST
subject: Pais Vasco (Spain); Pays Basque (France); Basques
acknowledgement: ack-nhfb
rawauthor: Mark Kurlansky
rawtitle: The {Basque} history of the world
URL:
http://lcweb.loc.gov/catdir/toc/99026808.html; http://www.loc.gov/catdir/enhancements/fy0601/99026808-b.html; http://www.loc.gov/catdir/enhancements/fy0601/99026808-d.html

TOC:
Maps / ix Introduction: The Island and the World / 1 Part One: The Survival of Euskal Herria The Basque Cake / 13 1: The Basque Myth / 18 2: The Basque Problem / 27 3: The Basque Whale / 43 4: The Basque Saint / 65 5: The Basque Billy Goat / 80 6: The Wealth of Non-Nations / 103 Part Two: The Dawn of Euskadi The Basque Onomatopoeia / 129 7: The Basque Beret / 134 8: The Basque Ear / 153 9: Gernika / 177 10: The Potato Time / 206 11: Speaking Christian / 224 12: Eventually Night Falls / 242 Part Three: Euskadi Askatuta Slippery Maketos / 259 13: The Great Opportunity / 267 14: Checks and Balances / 285 15: Surviving Democracy / 308 16: The Nation / 326 Postscript: The Death of a Basque Pig / 352 The Basque Thank You / 360 Bibliography / 362 Index of Proper Nouns / 373

rawTOC:
Maps / ix \\ Introduction: The Island and the World / 1 \\ Part One: The Survival of Euskal Herria \\ The Basque Cake / 13 \\ 1: The Basque Myth / 18 \\ 2: The Basque Problem / 27 \\ 3: The Basque Whale / 43 \\ 4: The Basque Saint / 65 \\ 5: The Basque Billy Goat / 80 \\ 6: The Wealth of Non-Nations / 103 \\ Part Two: The Dawn of Euskadi \\ The Basque Onomatopoeia / 129 \\ 7: The Basque Beret / 134 \\ 8: The Basque Ear / 153 \\ 9: Gernika / 177 \\ 10: The Potato Time / 206 \\ 11: Speaking Christian / 224 \\ 12: Eventually Night Falls / 242 \\ Part Three: Euskadi Askatuta \\ Slippery Maketos / 259 \\ 13: The Great Opportunity / 267 \\ 14: Checks and Balances / 285 \\ 15: Surviving Democracy / 308 \\ 16: The Nation / 326 \\ Postscript: The Death of a Basque Pig / 352 \\ The Basque Thank You / 360 \\ Bibliography / 362 \\ Index of Proper Nouns / 373

entry:
@Book{Kurlansky:1999:BHW,
  author =       "Mark Kurlansky",
  title =        "The {Basque} history of the world",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "xii + 387",
  year =         "1999",
  ISBN =         "0-8027-1349-1",
  ISBN-13 =      "978-0-8027-1349-0",
  LCCN =         "DP302.B46 K87 1999",
  bibdate =      "Sat Dec 23 09:12:51 MST 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://lcweb.loc.gov/catdir/toc/99026808.html;
                 http://www.loc.gov/catdir/enhancements/fy0601/99026808-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0601/99026808-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Pa\'is Vasco (Spain); Pays Basque (France); Basques",
  tableofcontents = "Maps / ix \\
                 Introduction: The Island and the World / 1 \\
                 Part One: The Survival of Euskal Herria \\
                 The Basque Cake / 13 \\
                 1: The Basque Myth / 18 \\
                 2: The Basque Problem / 27 \\
                 3: The Basque Whale / 43 \\
                 4: The Basque Saint / 65 \\
                 5: The Basque Billy Goat / 80 \\
                 6: The Wealth of Non-Nations / 103 \\
                 Part Two: The Dawn of Euskadi \\
                 The Basque Onomatopoeia / 129 \\
                 7: The Basque Beret / 134 \\
                 8: The Basque Ear / 153 \\
                 9: Gernika / 177 \\
                 10: The Potato Time / 206 \\
                 11: Speaking Christian / 224 \\
                 12: Eventually Night Falls / 242 \\
                 Part Three: Euskadi Askatuta \\
                 Slippery Maketos / 259 \\
                 13: The Great Opportunity / 267 \\
                 14: Checks and Balances / 285 \\
                 15: Surviving Democracy / 308 \\
                 16: The Nation / 326 \\
                 Postscript: The Death of a Basque Pig / 352 \\
                 The Basque Thank You / 360 \\
                 Bibliography / 362 \\
                 Index of Proper Nouns / 373",
}


bibtype: book
filename: master.bib
label: Kurlansky:2003:SWH
author: Mark Kurlansky
title: Salt: a world history
publisher: pub-PENGUIN
address: pub-PENGUIN:adr
pages: x + 484
year: 2003
ISBN: 0-14-200161-9 (paperback) OR 0142001619 (paperback)
ISBN13: 978-0-14-200161-5 (paperback) OR 9780142001615 (paperback)
LCCN: TN900 .K865 2003
bibdate: Sat Jun 17 09:17:49 MDT 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2006.06.17 09:17:49 MDT
subject: Salt; History; Salt industry and trade
acknowledgement: ack-nhfb
rawauthor: Mark Kurlansky
rawtitle: Salt: a world history
abstract:
Mark Kurlansky, the bestselling author of Cod and The Basque History of the World, here turns his attention to a common household item with a long and intriguing history: salt. The only rock we eat, salt has shaped civilization from the very beginning, and its story is a glittering, often surprising part of the history of humankind. A substance so valuable it served as currency, salt has influenced the establishment of trade routes and cities, provoked and financed wars, secured empires, and inspired revolutions. Populated by colorful characters and filled with an unending series of fascinating details, Kurlansky's kaleidoscopic history is a supremely entertaining, multi-layered masterpiece.

TOC:
A discourse on salt, cadavers, and pungent sources. A mandate of salt Fish, fowl, and pharaohs Saltmen hard as codfish Salt's salad days Salting it away in the Adriatic Two ports and the prosciutto in between The glow of herring and the scent of conquest. Friday's salt A Nordic dream A well-salted hexagon The Hapsburg pickle The leaving of Liverpool American salt wars Salt and independence Liberte, egalite, tax breaks Preserving independence The war between the salts Red salt Sodium's perfect marriage. The odium of sodium The mythology of geology The soil never sets on Salt and the great soul Not looking back The last salt days of Zigong Ma, la, and Mao More salt than fish Big salt, little salt

rawabstract:
Mark Kurlansky, the bestselling author of Cod and The Basque History of the World, here turns his attention to a common household item with a long and intriguing history: salt. The only rock we eat, salt has shaped civilization from the very beginning, and its story is a glittering, often surprising part of the history of humankind. A substance so valuable it served as currency, salt has influenced the establishment of trade routes and cities, provoked and financed wars, secured empires, and inspired revolutions. Populated by colorful characters and filled with an unending series of fascinating details, Kurlansky's kaleidoscopic history is a supremely entertaining, multi-layered masterpiece.

rawTOC:
A discourse on salt, cadavers, and pungent sources. A mandate of salt \\ Fish, fowl, and pharaohs \\ Saltmen hard as codfish \\ Salt's salad days \\ Salting it away in the Adriatic \\ Two ports and the prosciutto in between \\ The glow of herring and the scent of conquest. Friday's salt \\ A Nordic dream \\ A well-salted hexagon \\ The Hapsburg pickle \\ The leaving of Liverpool \\ American salt wars \\ Salt and independence \\ Libert{\'e}, egalit{\'e}, tax breaks \\ Preserving independence \\ The war between the salts \\ Red salt \\ Sodium's perfect marriage. The odium of sodium \\ The mythology of geology \\ The soil never sets on \\ Salt and the great soul \\ Not looking back \\ The last salt days of Zigong \\ Ma, la, and Mao \\ More salt than fish \\ Big salt, little salt

entry:
@Book{Kurlansky:2003:SWH,
  author =       "Mark Kurlansky",
  title =        "Salt: a world history",
  publisher =    pub-PENGUIN,
  address =      pub-PENGUIN:adr,
  pages =        "x + 484",
  year =         "2003",
  ISBN =         "0-14-200161-9 (paperback)",
  ISBN-13 =      "978-0-14-200161-5 (paperback)",
  LCCN =         "TN900 .K865 2003",
  bibdate =      "Sat Jun 17 09:17:49 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$16",
  abstract =     "Mark Kurlansky, the bestselling author of Cod and The
                 Basque History of the World, here turns his attention
                 to a common household item with a long and intriguing
                 history: salt. The only rock we eat, salt has shaped
                 civilization from the very beginning, and its story is
                 a glittering, often surprising part of the history of
                 humankind. A substance so valuable it served as
                 currency, salt has influenced the establishment of
                 trade routes and cities, provoked and financed wars,
                 secured empires, and inspired revolutions. Populated by
                 colorful characters and filled with an unending series
                 of fascinating details, Kurlansky's kaleidoscopic
                 history is a supremely entertaining, multi-layered
                 masterpiece.",
  acknowledgement = ack-nhfb,
  subject =      "Salt; History; Salt industry and trade",
  tableofcontents = "A discourse on salt, cadavers, and pungent sources.
                 A mandate of salt \\
                 Fish, fowl, and pharaohs \\
                 Saltmen hard as codfish \\
                 Salt's salad days \\
                 Salting it away in the Adriatic \\
                 Two ports and the prosciutto in between \\
                 The glow of herring and the scent of conquest. Friday's
                 salt \\
                 A Nordic dream \\
                 A well-salted hexagon \\
                 The Hapsburg pickle \\
                 The leaving of Liverpool \\
                 American salt wars \\
                 Salt and independence \\
                 Libert{\'e}, egalit{\'e}, tax breaks \\
                 Preserving independence \\
                 The war between the salts \\
                 Red salt \\
                 Sodium's perfect marriage. The odium of sodium \\
                 The mythology of geology \\
                 The soil never sets on \\
                 Salt and the great soul \\
                 Not looking back \\
                 The last salt days of Zigong \\
                 Ma, la, and Mao \\
                 More salt than fish \\
                 Big salt, little salt",
}


