# bibtab

bibtype: book
filename: master.bib
label: Sayood:2005:IDC
author: Khalid Sayood
title: Introduction to Data Compression
publisher: pub-ELSEVIER
address: pub-ELSEVIER:adr
edition: Third
pages: xxii + 680
year: 2005
ISBN: 0-12-620862-X (hardcover), 0-08-050925-8 (e-book) OR 012620862X (hardcover), 0080509258 (ebook)
LCCN: TK5102.92 .S39 2005
bibdate: Wed Oct 26 16:49:48 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.10.26 16:49:48 MDT
subject: Data compression (Telecommunication); Coding theory
acknowledgement: ack-nhfb
rawauthor: Khalid Sayood
rawtitle: Introduction to Data Compression
ISBN13:
978-0-12-620862-7 (hardcover), 978-0-08-050925-9 (e-book) OR 9780126208627 (hardcover), 9780080509259 (ebook)

TOC:
1: Introduction 2: Lossless Compression 3: Huffman Coding 4: Arithmetic Coding 5: Dictionary Techniques 6: Context Based Compression 7: Lossless Image Compression 8: Lossy Coding 9: Scalar Quantization 10: Vector Quantization 11: Differential Encoding 12: Transforms, Subbands, and Wavelets 13: Transform Coding 14: Subband Coding 15: Wavelet-Based Compression 16: Audio Coding 17: Analysis/Synthesis and Analysis by Synthesis Schemes 18: Video Compression Appendix A: Probability and Random Processes Appendix B: A Brief Review of Matrix Concepts Appendix C: The Root Lattices Bibliography

rawTOC:
1: Introduction \\ 2: Lossless Compression \\ 3: Huffman Coding \\ 4: Arithmetic Coding \\ 5: Dictionary Techniques \\ 6: Context Based Compression \\ 7: Lossless Image Compression \\ 8: Lossy Coding \\ 9: Scalar Quantization \\ 10: Vector Quantization \\ 11: Differential Encoding \\ 12: Transforms, Subbands, and Wavelets \\ 13: Transform Coding \\ 14: Subband Coding \\ 15: Wavelet-Based Compression \\ 16: Audio Coding \\ 17: Analysis/Synthesis and Analysis by Synthesis Schemes \\ 18: Video Compression \\ Appendix A: Probability and Random Processes \\ Appendix B: A Brief Review of Matrix Concepts \\ Appendix C: The Root Lattices \\ Bibliography

entry:
@Book{Sayood:2005:IDC,
  author =       "Khalid Sayood",
  title =        "Introduction to Data Compression",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  edition =      "Third",
  pages =        "xxii + 680",
  year =         "2005",
  ISBN =         "0-12-620862-X (hardcover), 0-08-050925-8 (e-book)",
  ISBN-13 =      "978-0-12-620862-7 (hardcover), 978-0-08-050925-9
                 (e-book)",
  LCCN =         "TK5102.92 .S39 2005",
  bibdate =      "Wed Oct 26 16:49:48 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Data compression (Telecommunication); Coding theory",
  tableofcontents = "1: Introduction \\
                 2: Lossless Compression \\
                 3: Huffman Coding \\
                 4: Arithmetic Coding \\
                 5: Dictionary Techniques \\
                 6: Context Based Compression \\
                 7: Lossless Image Compression \\
                 8: Lossy Coding \\
                 9: Scalar Quantization \\
                 10: Vector Quantization \\
                 11: Differential Encoding \\
                 12: Transforms, Subbands, and Wavelets \\
                 13: Transform Coding \\
                 14: Subband Coding \\
                 15: Wavelet-Based Compression \\
                 16: Audio Coding \\
                 17: Analysis/Synthesis and Analysis by Synthesis
                 Schemes \\
                 18: Video Compression \\
                 Appendix A: Probability and Random Processes \\
                 Appendix B: A Brief Review of Matrix Concepts \\
                 Appendix C: The Root Lattices \\
                 Bibliography",
}


bibtype: book
filename: master.bib
label: Scanlon:1984:ALP
author: Leo J. Scanlon
title: 8086 / 88 Assembly Language Programming
publisher: pub-BRADY
address: pub-BRADY:adr
pages: ix + 213
year: 1984
ISBN: 0-89303-424-X OR 089303424X
ISBN13: 978-0-89303-424-5 OR 9780893034245
LCCN: QA76.8.I292 S29 1984
bibdate: Wed Dec 15 18:14:57 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 18:14:57 ???
acknowledgement: ack-nhfb
rawauthor: Leo J. Scanlon
rawtitle: 8086\slash 88 Assembly Language Programming
note:
A rather short treatment of assembly language programming for the 8088 and 8086, with a short chapter on the 8087. Nothing specific to the IBM PC, and not detailed enough for a beginner. Two related books cite Bradley:1984:ALP,Lafore:1984:ALP contain much more detail.

rawnote:
A rather short treatment of assembly language programming for the 8088 and 8086, with a short chapter on the 8087. Nothing specific to the IBM PC, and not detailed enough for a beginner. Two related books \cite{Bradley:1984:ALP,Lafore:1984:ALP} contain much more detail.

entry:
@Book{Scanlon:1984:ALP,
  author =       "Leo J. Scanlon",
  title =        "8086\slash 88 Assembly Language Programming",
  publisher =    pub-BRADY,
  address =      pub-BRADY:adr,
  pages =        "ix + 213",
  year =         "1984",
  ISBN =         "0-89303-424-X",
  ISBN-13 =      "978-0-89303-424-5",
  LCCN =         "QA76.8.I292 S29 1984",
  bibdate =      "Wed Dec 15 18:14:57 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "A rather short treatment of assembly language
                 programming for the 8088 and 8086, with a short chapter
                 on the 8087. Nothing specific to the IBM PC, and not
                 detailed enough for a beginner. Two related books
                 \cite{Bradley:1984:ALP,Lafore:1984:ALP} contain much
                 more detail.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Schachter:1983:CIG
editor: Bruce J. Schachter
title: Computer Image Generation
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xx + 236
year: 1983
ISBN: 0-471-87287-3 OR 0471872873
ISBN13: 978-0-471-87287-0 OR 9780471872870
LCCN: T385 .C5934 1983
bibdate: Wed Dec 15 10:41:31 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:31 ???
acknowledgement: ack-nhfb
raweditor: Bruce J. Schachter
rawtitle: Computer Image Generation
entry:
@Book{Schachter:1983:CIG,
  editor =       "Bruce J. Schachter",
  title =        "Computer Image Generation",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xx + 236",
  year =         "1983",
  ISBN =         "0-471-87287-3",
  ISBN-13 =      "978-0-471-87287-0",
  LCCN =         "T385 .C5934 1983",
  bibdate =      "Wed Dec 15 10:41:31 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Schechter:1998:MBO
author: Bruce Schechter
title: My Brain is Open: the Mathematical Journeys of Paul Erdos
publisher: pub-SIMON-SCHUSTER
address: pub-SIMON-SCHUSTER:adr
pages: 224
year: 1998
ISBN: 0-684-84635-7 OR 0684846357
ISBN13: 978-0-684-84635-4 OR 9780684846354
LCCN: QA29.E86 S34 1998
bibdate: Mon Mar 06 08:50:51 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.03.06 08:50:51 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schechter
rawtitle: My Brain is Open: the Mathematical Journeys of {Paul Erd{\H{o}}s}
abstract:
Physicist and science writer Bruce Schechter's biography of legendary Hungarian mathematician Paul Erdos is an engaging portrait, warm and intimate, bringing this strange, happy man to life. Here, we get to see Erdos's brief childhood transform quickly into a carefree adolescence of solving difficult math problems with his circle of brilliant friends --- uniquely encouraged by a country that valued the contributions of mathematics in a way that has never been equaled. Fleeing the Holocaust, Erdos never settled down, instead traveling from place to place, showing up on the doorsteps of other mathematicians with his few possessions and an open mind. During his career, Erdos published more papers than any other mathematician in history. Most of the papers were collaborations.

TOC:
Proof The happy end problem Erdos and the fate of western civilization The joy of sets Six degrees of collaboration

rawabstract:
Physicist and science writer Bruce Schechter's biography of legendary Hungarian mathematician Paul Erd{\H{o}}s is an engaging portrait, warm and intimate, bringing this strange, happy man to life. Here, we get to see Erd{\H{o}}s's brief childhood transform quickly into a carefree adolescence of solving difficult math problems with his circle of brilliant friends --- uniquely encouraged by a country that valued the contributions of mathematics in a way that has never been equaled. Fleeing the Holocaust, Erd{\H{o}}s never settled down, instead traveling from place to place, showing up on the doorsteps of other mathematicians with his few possessions and an open mind. During his career, Erd{\H{o}}s published more papers than any other mathematician in history. Most of the papers were collaborations.

rawTOC:
Proof \\ The happy end problem \\ Erd{\H{o}}s and the fate of western civilization \\ The joy of sets \\ Six degrees of collaboration

entry:
@Book{Schechter:1998:MBO,
  author =       "Bruce Schechter",
  title =        "My Brain is Open: the Mathematical Journeys of {Paul
                 Erd{\H{o}}s}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "224",
  year =         "1998",
  ISBN =         "0-684-84635-7",
  ISBN-13 =      "978-0-684-84635-4",
  LCCN =         "QA29.E86 S34 1998",
  bibdate =      "Mon Mar 06 08:50:51 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$13.00",
  abstract =     "Physicist and science writer Bruce Schechter's
                 biography of legendary Hungarian mathematician Paul
                 Erd{\H{o}}s is an engaging portrait, warm and intimate,
                 bringing this strange, happy man to life. Here, we get
                 to see Erd{\H{o}}s's brief childhood transform quickly
                 into a carefree adolescence of solving difficult math
                 problems with his circle of brilliant friends ---
                 uniquely encouraged by a country that valued the
                 contributions of mathematics in a way that has never
                 been equaled. Fleeing the Holocaust, Erd{\H{o}}s never
                 settled down, instead traveling from place to place,
                 showing up on the doorsteps of other mathematicians
                 with his few possessions and an open mind. During his
                 career, Erd{\H{o}}s published more papers than any
                 other mathematician in history. Most of the papers were
                 collaborations.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Proof \\
                 The happy end problem \\
                 Erd{\H{o}}s and the fate of western civilization \\
                 The joy of sets \\
                 Six degrees of collaboration",
}


bibtype: book
filename: master.bib
label: Scheifler:1988:XWS
author: Robert W. Scheifler and James Gettys and Ron Newman
title: X Window System: C Library and Protocol Reference
publisher: pub-DP
address: pub-DP:adr
pages: xxix + 701
year: 1988
ISBN: 1-55558-012-2 OR 1555580122
ISBN13: 978-1-55558-012-4 OR 9781555580124
LCCN: QA76.76.W56 S34 1988
bibdate: Wed Dec 15 10:41:32 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:32 ???
acknowledgement: ack-nhfb
rawauthor: Robert W. Scheifler and James Gettys and Ron Newman
rawtitle: {X Window System}: {C} Library and Protocol Reference
entry:
@Book{Scheifler:1988:XWS,
  author =       "Robert W. Scheifler and James Gettys and Ron Newman",
  title =        "{X Window System}: {C} Library and Protocol
                 Reference",
  publisher =    pub-DP,
  address =      pub-DP:adr,
  pages =        "xxix + 701",
  year =         "1988",
  ISBN =         "1-55558-012-2",
  ISBN-13 =      "978-1-55558-012-4",
  LCCN =         "QA76.76.W56 S34 1988",
  bibdate =      "Wed Dec 15 10:41:32 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Scheifler:1989:XPR
author: Robert W. Scheifler
title: X Protocol Reference Manual
volume: 0
publisher: pub-ORA
address: pub-ORA:adr
pages: xv + 398
year: 1989
ISBN: 0-937175-40-4 OR 0937175404
ISBN13: 978-0-937175-40-8 OR 9780937175408
LCCN: QA76.76.W56 X5 1989
bibdate: Wed Jul 6 14:53:46 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.07.06 14:53:46 ???
acknowledgement: ack-nhfb
rawauthor: Robert W. Scheifler
rawtitle: {X} Protocol Reference Manual
entry:
@Book{Scheifler:1989:XPR,
  author =       "Robert W. Scheifler",
  title =        "{X} Protocol Reference Manual",
  volume =       "0",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xv + 398",
  year =         "1989",
  ISBN =         "0-937175-40-4",
  ISBN-13 =      "978-0-937175-40-8",
  LCCN =         "QA76.76.W56 X5 1989",
  bibdate =      "Wed Jul 6 14:53:46 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Scheinerman:2011:MN
author: Edward R. Scheinerman
title: Mathematical notation
publisher: CreateSpace
address: USA
pages: viii + 84
year: 2011
ISBN: 1-4662-3052-5 OR 1466230525
ISBN13: 978-1-4662-3052-1 OR 9781466230521
LCCN: QA41 .S34 2011
bibdate: Tue Aug 4 09:33:21 MDT 2020
bibtimestamp: 2020.08.04 09:33:21 MDT
remark: Includes chart on pages 69--72 of common LaTeX mathematical symbol names.
subject: Mathematical notation
acknowledgement: ack-nhfb
rawauthor: Edward R. Scheinerman
rawtitle: Mathematical notation
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib

TOC:
Preface / vii How to use this Guide / vii How not to use this Guide / viii Acknowledgments / viii Chapter 1. Letters / 1 1. The Latin alphabet / 1 2. The Greek alphabet / 2 3. Decorations / 2 4. Traditional uses / 3 Chapter 2. Collections / 5 1. Sets / 5 2. Lists / 8 3. Big sums, products, and so on / 8 Chapter 3. Logic / 11 1. Boolean operations and proof symbols / 11 2. Quantifiers / 12 Chapter 4. Numbers / 13 1. Real numbers / 13 2. Subsets of the reals / 15 3. ``Famous'' real numbers / 16 4. Complex numbers / 17 5. Basic operations / 18 6. Other number systems / 18 7. To infinity and beyond / 19 Chapter 5. Geometry / 21 1. Fundamentals / 21 2. Coordinates / 22 3. Differential geometry / 23 Chapter 6. Functions / 25 1. Fundamentals / 25 2. Standard functions / 27 3. Classes of functions / 33 4. Polynomials, power series, and rational functions / 34 5. Miscellany / 35 Chapter 7. Linear Algebra / 39 1. Vectors / 39 2. Matrices / 41 3. Tensors / 47 Chapter 8. Calculus / 49 1. Limits / 49 2. Derivatives (single independent variable, scalar- or vector-valued) / 49 3. Derivatives (multiple independent variables, scalar-valued) / 50 4. Derivatives (multiple independent variables, vector-valued) / 52 5. Integration / 54 6. Convolution and transforms / 55 Chapter 9. Probability and Statistics / 57 1. Probability / 57 2. Statistics / 61 Chapter 10. Approximation / 63 1. Approximate equality of numbers / 63 2. Asymptotic relations / 63 3. Big-oh notation and its relatives / 64 Bibliography / 67 Chart / 69 Alphabetical Notation Index / 73 Greek Notation Index / 77 Topic Index / 79

rawTOC:
Preface / vii \\ How to use this Guide / vii \\ How not to use this Guide / viii \\ Acknowledgments / viii \\ Chapter 1. Letters / 1 \\ 1. The Latin alphabet / 1 \\ 2. The Greek alphabet / 2 \\ 3. Decorations / 2 \\ 4. Traditional uses / 3 \\ Chapter 2. Collections / 5 \\ 1. Sets / 5 \\ 2. Lists / 8 \\ 3. Big sums, products, and so on / 8 \\ Chapter 3. Logic / 11 \\ 1. Boolean operations and proof symbols / 11 \\ 2. Quantifiers / 12 \\ Chapter 4. Numbers / 13 \\ 1. Real numbers / 13 \\ 2. Subsets of the reals / 15 \\ 3. ``Famous'' real numbers / 16 \\ 4. Complex numbers / 17 \\ 5. Basic operations / 18 \\ 6. Other number systems / 18 \\ 7. To infinity and beyond / 19 \\ Chapter 5. Geometry / 21 \\ 1. Fundamentals / 21 \\ 2. Coordinates / 22 \\ 3. Differential geometry / 23 \\ Chapter 6. Functions / 25 \\ 1. Fundamentals / 25 \\ 2. Standard functions / 27 \\ 3. Classes of functions / 33 \\ 4. Polynomials, power series, and rational functions / 34 \\ 5. Miscellany / 35 \\ Chapter 7. Linear Algebra / 39 \\ 1. Vectors / 39 \\ 2. Matrices / 41 \\ 3. Tensors / 47 \\ Chapter 8. Calculus / 49 \\ 1. Limits / 49 \\ 2. Derivatives (single independent variable, scalar- or vector-valued) / 49 \\ 3. Derivatives (multiple independent variables, scalar-valued) / 50 \\ 4. Derivatives (multiple independent variables, vector-valued) / 52 \\ 5. Integration / 54 \\ 6. Convolution and transforms / 55 \\ Chapter 9. Probability and Statistics / 57 \\ 1. Probability / 57 \\ 2. Statistics / 61 \\ Chapter 10. Approximation / 63 \\ 1. Approximate equality of numbers / 63 \\ 2. Asymptotic relations / 63 \\ 3. Big-oh notation and its relatives / 64 \\ Bibliography / 67 \\ Chart / 69 \\ Alphabetical Notation Index / 73 \\ Greek Notation Index / 77 \\ Topic Index / 79

entry:
@Book{Scheinerman:2011:MN,
  author =       "Edward R. Scheinerman",
  title =        "Mathematical notation",
  publisher =    "CreateSpace",
  address =      "USA",
  pages =        "viii + 84",
  year =         "2011",
  ISBN =         "1-4662-3052-5",
  ISBN-13 =      "978-1-4662-3052-1",
  LCCN =         "QA41 .S34 2011",
  bibdate =      "Tue Aug 4 09:33:21 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  acknowledgement = ack-nhfb,
  remark =       "Includes chart on pages 69--72 of common LaTeX
                 mathematical symbol names.",
  subject =      "Mathematical notation",
  tableofcontents = "Preface / vii \\
                 How to use this Guide / vii \\
                 How not to use this Guide / viii \\
                 Acknowledgments / viii \\
                 Chapter 1. Letters / 1 \\
                 1. The Latin alphabet / 1 \\
                 2. The Greek alphabet / 2 \\
                 3. Decorations / 2 \\
                 4. Traditional uses / 3 \\
                 Chapter 2. Collections / 5 \\
                 1. Sets / 5 \\
                 2. Lists / 8 \\
                 3. Big sums, products, and so on / 8 \\
                 Chapter 3. Logic / 11 \\
                 1. Boolean operations and proof symbols / 11 \\
                 2. Quantifiers / 12 \\
                 Chapter 4. Numbers / 13 \\
                 1. Real numbers / 13 \\
                 2. Subsets of the reals / 15 \\
                 3. ``Famous'' real numbers / 16 \\
                 4. Complex numbers / 17 \\
                 5. Basic operations / 18 \\
                 6. Other number systems / 18 \\
                 7. To infinity and beyond / 19 \\
                 Chapter 5. Geometry / 21 \\
                 1. Fundamentals / 21 \\
                 2. Coordinates / 22 \\
                 3. Differential geometry / 23 \\
                 Chapter 6. Functions / 25 \\
                 1. Fundamentals / 25 \\
                 2. Standard functions / 27 \\
                 3. Classes of functions / 33 \\
                 4. Polynomials, power series, and rational functions /
                 34 \\
                 5. Miscellany / 35 \\
                 Chapter 7. Linear Algebra / 39 \\
                 1. Vectors / 39 \\
                 2. Matrices / 41 \\
                 3. Tensors / 47 \\
                 Chapter 8. Calculus / 49 \\
                 1. Limits / 49 \\
                 2. Derivatives (single independent variable, scalar- or
                 vector-valued) / 49 \\
                 3. Derivatives (multiple independent variables,
                 scalar-valued) / 50 \\
                 4. Derivatives (multiple independent variables,
                 vector-valued) / 52 \\
                 5. Integration / 54 \\
                 6. Convolution and transforms / 55 \\
                 Chapter 9. Probability and Statistics / 57 \\
                 1. Probability / 57 \\
                 2. Statistics / 61 \\
                 Chapter 10. Approximation / 63 \\
                 1. Approximate equality of numbers / 63 \\
                 2. Asymptotic relations / 63 \\
                 3. Big-oh notation and its relatives / 64 \\
                 Bibliography / 67 \\
                 Chart / 69 \\
                 Alphabetical Notation Index / 73 \\
                 Greek Notation Index / 77 \\
                 Topic Index / 79",
}


bibtype: book
filename: master.bib
label: Schendel:1984:INM
author: U. Schendel
title: Introduction to Numerical Methods for Parallel Computers
publisher: pub-ELLIS-HORWOOD
address: pub-ELLIS-HORWOOD:adr
pages: 151
year: 1984
ISBN: 0-470-20091-X, 0-85312-597-X OR 047020091X, 085312597X
ISBN13: 978-0-470-20091-9, 978-0-85312-597-6 OR 9780470200919, 9780853125976
LCCN: QA297 .S3813 1984
bibdate: Wed Dec 15 10:41:33 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:33 ???
series: Ellis Horwood Series in Mathematics and its Applications, Editor: G. M. Bell
acknowledgement: ack-nhfb
rawauthor: U. Schendel
rawtitle: Introduction to Numerical Methods for Parallel Computers
entry:
@Book{Schendel:1984:INM,
  author =       "U. Schendel",
  title =        "Introduction to Numerical Methods for Parallel
                 Computers",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "151",
  year =         "1984",
  ISBN =         "0-470-20091-X, 0-85312-597-X",
  ISBN-13 =      "978-0-470-20091-9, 978-0-85312-597-6",
  LCCN =         "QA297 .S3813 1984",
  bibdate =      "Wed Dec 15 10:41:33 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 15.00",
  series =       "Ellis Horwood Series in Mathematics and its
                 Applications, Editor: G. M. Bell",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Schengili-Roberts:2000:CC
author: Keith Schengili-Roberts
title: Core CSS
publisher: pub-PHPTR
address: pub-PHPTR:adr
pages: xxxvii + 635 + 4
year: 2000
ISBN: 0-13-083456-4 (paperback) OR 0130834564 (paperback)
ISBN13: 978-0-13-083456-0 (paperback) OR 9780130834560 (paperback)
LCCN: TK5105.888. S32 2000
bibdate: Mon Oct 26 18:00:35 MDT 2009
bibtimestamp: 2009.10.26 18:00:35 MDT
series: Prentice Hall PTR core series
subject: Cascading Style Sheets; Web sites; design; computer graphics; Web publishing
acknowledgement: ack-nhfb
rawauthor: Keith Schengili-Roberts
rawtitle: Core {CSS}
bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/sgml2000.bib; z3950.loc.gov:7090/Voyager

TOC:
Acknowledgments / xxix Preface / xxxi Who You Are / xxxii How This Book Is Organized / xxxiii Conventions Used in This Book / xxxv Further Information / xxxv Additional Material / xxxvi Feedback / xxxvii The Birth of CSS / 2 The World Wide Web Consortium Introduces Cascading Style Sheets / 5 XHTML, CSS2 and CSS3 / 7 Re-emergence of the Browser Wars? / 10 (X)Html and Its Relationship to CSS / 14 Adding Cascading Style Sheets to Web Pages / 17 The <style> Element / 18 The <span> and <div> Elements / 21 The <link> Element / 24 Browser Adoption of CSS / 28 Internet Explorer 3.x / 30 Internet Explorer 4.x / 31 Internet Explorer 4.5 (Macintosh) and 5.x (Windows and Macintosh) / 32 Internet Explorer 5.5 / 34 Internet Explorer 6.0 / 35 Opera 3.5 / 37 Opera 4.x--6.x / 38 Netscape Navigator 4.x / 39 Mozilla and Netscape Navigator 6.x and 7.x / 40 Other Browsers / 47 Implementation of Basic CSS Concepts / 52 Grouping / 53 Inheritance / 56 Class and id as Selectors / 58 Contextual Selectors / 62 Comments / 66 CSS2 Selectors / 67 CSS3 Selectors / 76 The Cascade / 82 Cascading Order / 83 Important / 88 Cascade-Order Sources / 90 CSS Units / 94 Length Units / 95 Percentage Units / 101 URLs / 103 Strings / 106 Time Units / 108 Angle Units / 108 Frequency Units / 110 Pseudo-Classes and Pseudo-Elements / 112 Anchor Pseudo-Element / 114 First-line Pseudo-Element / 117 First-letter Pseudo-Element / 119 Lang Pseudo-Class / 122 Left, right and first Pseudo-Classes / 123 Focus and hover Pseudo-Classes / 123 First-child Pseudo-Class / 125 Pseudo-Elements in Selectors and Combining Multiple Pseudo-Elements / 128 Media Types and Media Queries / 130 Browser Compatibility / 134 Media Queries / 135 Width and height Media Queries / 136 Device-width and device-height Media Queries / 136 Device-aspect-ratio Media Query / 137 Color Media Query / 137 Color-index Media Query / 138 Monochrome Media Query / 138 Resolution Media Query / 139 Scan Media Query / 139 Grid Media Query / 140 Font Properties / 142 Font-family Property / 144 Font-size Property / 150 Font-style Property / 158 Font-variant Property / 160 Font-weight Property / 162 Font Property / 167 Font-stretch Property / 170 Font-size-adjust Property / 173 The <at>font-face Pseudo-Element / 175 CSS3 Font Decoration Properties / 182 Text Properties / 186 Letter-spacing Property / 187 Word-spacing Property / 190 Line-height Property / 193 Vertical-align Property / 196 Text-align Property / 198 Text-decoration Property / 201 Text-indent Property / 204 Text-transform Property / 207 Text-shadow Property / 209 Glyph-orientation-horizontal and glyph-orientation-vertical Properties / 211 Text-script Property / 214 Min-font-size and max-font-size Properties / 215 Text-justify-trim Property / 216 Line-break Property / 216 Word-break-cjk Property / 216 Word-break-inside Property / 217 Word-break Property / 217 Wrap-option Property / 218 Linefeed-treatment Property / 219 White-space-treatment Property / 219 All-space-treatment Property / 220 White-space Property / 220 Text-overflow-mode Property / 222 Text-overflow-ellipsis Property / 222 Text-overflow Property / 223 Kerning-mode Property / 223 Kerning-pair-threshold Property / 224 Punctuation-trim Property / 224 Text-line-through Set of Properties / 225 Text-overline Set of Properties / 228 Text-underline Set of Properties / 232 Text-blink Property / 236 Text Property Extensions / 238 Internet Explorer Text-Formatting CSS Extensions / 239 Layout-flow Property / 239 Writing-mode Property / 244 Layout-grid Sub-Family of Properties / 247 Text-autospace Property / 258 Text-justify Property / 261 Text-kashida-space Property / 264 Text-underline-position Property / 266 Word-break Property / 268 Text-align-last Property / 271 Box Properties / 274 Border-`style' Properties / 276 Border-style Property / 277 Border-color Property / 280 Border-width Property / 283 Border-bottom Property / 286 Border-left Property / 289 Border-right Property / 292 Border-top Property / 294 Border-bottom-width Property / 297 Border-left-width Property / 299 Border-right-width Property / 302 Border-top-width Property / 304 Border Property / 307 Border-radius Set of Properties / 310 Border-image Set of Properties / 312 Border-fit Set of Properties / 314 Border-image-transform Set of Properties / 317 Border-break Property / 319 Box-shadow Property / 319 Clear Property / 321 Clear-after Property / 324 Float Property / 325 Float-displace Property / 331 Indent-edge-reset Property / 332 Height Property / 332 Width Property / 335 Padding-bottom Property / 337 Padding-left Property / 339 Padding-right Property / 341 Padding-top Property / 343 Padding Property / 345 Margin-bottom Property / 349 Margin-left Property / 352 Margin-right Property / 354 Margin-top Property / 357 Margin Property / 360 Min-width, max-width, min-height and max-height Properties / 362 Fit and fit-position Properties / 363 Marquee Properties / 365 Color / 368 Color Property / 370 Gamma Correction under CSS3 / 375 Opacity Property / 376 Rendering-intent Property / 377 Color-profile Property / 378 Color-profile / 379 XII Color Keywords / 379 Background Properties / 386 Background-color Property / 387 Background-image Property / 391 Background-repeat Property / 394 Background-attachment Property / 397 Background-position Property / 401 Background Property / 407 Background-position-x and background-position-y Properties / 410 CSS3 Properties / 415 Background-clip Property / 415 Background-origin / 416 Background-size / 418 Background-quantity / 419 Background-spacing / 420 Classification Properties and Generated/Automatic Content / 422 White-space Property / 423 List-style-type Property / 426 List-style-image Property / 435 List-style-position Property / 437 List-style Property / 440 The content Property plus the before and after Pseudo-Elements / 443 Quotes Property / 446 Counter-increment and counter-reset Properties / 449 Marker-offset Property / 452 Visual Formatting and Detailed Visual Formatting / 456 Display Property / 457 Positioning Properties: position, top, left, right and bottom / 465 Z-index Property / 473 Direction and unicode-bidi Properties / 476 Min-width, max-width, min-height and max-height Properties / 479 Visual Effects / 486 Overflow Property / 487 Overflow-x and overflow-y Properties / 490 Clip Property / 492 Visibility Property / 495 Zoom Property / 500 Ime-mode Property / 503 Paged Media / 506 Size Property / 507 Marks Property / 510 Page-Break Properties / 512 Page Property / 515 Windows and orphans Properties / 517 Tables / 520 Caption-side Property / 521 Table-layout Property / 524 Border-collapse, border-spacing and empty-cells / 527 Speak-header Property / 536 Table-like Layout Using CSS / 537 User Interface / 542 Cursor Property / 544 Outline Sub-Family of Properties / 549 Outline-width Property / 550 Outline-style Property / 553 Outline-color Property / 554 Outline Property / 556 Accelerator Property / 557 CSS3 Properties / 559 Resizer Property / 559 Key-equivalent Property / 560 Tab-index Property / 561 User-input Property / 562 User-modify Property / 562 User-select Property / 563 User-focus, user-focus-key and user-focus-pointer Properties / 564 Toggle-group and group-reset Properties / 564 Mozilla User-Interface-Related Extensions / 565 CSS3 Additions to Existing User-Interface Properties / 567 Aural Cascading Style Sheets / 568 Speak Property / 570 Volume Property / 571 Pause Sub-Set of Properties / 573 Cue Sub-Set of Properties / 576 Play-during Property / 577 zimuth Property / 579 Elevation Property / 582 Speech-rate Property / 584 Voice-family Property / 586 Pitch Property / 587 Pitch-range Property / 589 Stress Property / 590 Richness Property / 591 Speech Sub-Group of Properties / 592 Ruby / 596 What Is Ruby? / 597 The <ruby> Tag Set / 598 Ruby-align Property / 602 Ruby-overhang Property / 605 Ruby-position Property / 608 Multi-Column Layout / 612 Introduction / 613 Column-count Property / 616 Column-width Property / 616 Column-gap Property / 617 Column-width-policy Property / 617 Column-space-distribution Property / 618 Column Rule Properties / 620 Column-span Property / 622 Scrollbars / 624 The Parts of a Scrollbar / 625 Scrollbar Properties / 626 Browser Compatibility / 634 Filters and Transitions / 636 Visual Filters in Internet Explorer / 637 Static Filters / 638 Transition Filter Overview / 672 CSS1 and CSS2 Compatibility Charts / 692 Alphabetical Listing of CSS Properties and Values / 706 Accelerator / 707 Azimuth / 708 Background / 709 Background-attachment / 710

rawTOC:
Acknowledgments / xxix \\ Preface / xxxi \\ Who You Are / xxxii \\ How This Book Is Organized / xxxiii \\ Conventions Used in This Book / xxxv \\ Further Information / xxxv \\ Additional Material / xxxvi \\ Feedback / xxxvii \\ The Birth of CSS / 2 \\ The World Wide Web Consortium Introduces Cascading Style Sheets / 5 \\ XHTML, CSS2 and CSS3 / 7 \\ Re-emergence of the Browser Wars? / 10 \\ (X)Html and Its Relationship to CSS / 14 \\ Adding Cascading Style Sheets to Web Pages / 17 \\ The <style> Element / 18 \\ The <span> and <div> Elements / 21 \\ The <link> Element / 24 \\ Browser Adoption of CSS / 28 \\ Internet Explorer 3.x / 30 \\ Internet Explorer 4.x / 31 \\ Internet Explorer 4.5 (Macintosh) and 5.x (Windows and Macintosh) / 32 \\ Internet Explorer 5.5 / 34 \\ Internet Explorer 6.0 / 35 \\ Opera 3.5 / 37 \\ Opera 4.x--6.x / 38 \\ Netscape Navigator 4.x / 39 \\ Mozilla and Netscape Navigator 6.x and 7.x / 40 \\ Other Browsers / 47 \\ Implementation of Basic CSS Concepts / 52 \\ Grouping / 53 \\ Inheritance / 56 \\ Class and id as Selectors / 58 \\ Contextual Selectors / 62 \\ Comments / 66 \\ CSS2 Selectors / 67 \\ CSS3 Selectors / 76 \\ The Cascade / 82 \\ Cascading Order / 83 \\ Important / 88 \\ Cascade-Order Sources / 90 \\ CSS Units / 94 \\ Length Units / 95 \\ Percentage Units / 101 \\ URLs / 103 \\ Strings / 106 \\ Time Units / 108 \\ Angle Units / 108 \\ Frequency Units / 110 \\ Pseudo-Classes and Pseudo-Elements / 112 \\ Anchor Pseudo-Element / 114 \\ First-line Pseudo-Element / 117 \\ First-letter Pseudo-Element / 119 \\ Lang Pseudo-Class / 122 \\ Left, right and first Pseudo-Classes / 123 \\ Focus and hover Pseudo-Classes / 123 \\ First-child Pseudo-Class / 125 \\ Pseudo-Elements in Selectors and Combining Multiple Pseudo-Elements / 128 \\ Media Types and Media Queries / 130 \\ Browser Compatibility / 134 \\ Media Queries / 135 \\ Width and height Media Queries / 136 \\ Device-width and device-height Media Queries / 136 \\ Device-aspect-ratio Media Query / 137 \\ Color Media Query / 137 \\ Color-index Media Query / 138 \\ Monochrome Media Query / 138 \\ Resolution Media Query / 139 \\ Scan Media Query / 139 \\ Grid Media Query / 140 \\ Font Properties / 142 \\ Font-family Property / 144 \\ Font-size Property / 150 \\ Font-style Property / 158 \\ Font-variant Property / 160 \\ Font-weight Property / 162 \\ Font Property / 167 \\ Font-stretch Property / 170 \\ Font-size-adjust Property / 173 \\ The <at>font-face Pseudo-Element / 175 \\ CSS3 Font Decoration Properties / 182 \\ Text Properties / 186 \\ Letter-spacing Property / 187 \\ Word-spacing Property / 190 \\ Line-height Property / 193 \\ Vertical-align Property / 196 \\ Text-align Property / 198 \\ Text-decoration Property / 201 \\ Text-indent Property / 204 \\ Text-transform Property / 207 \\ Text-shadow Property / 209 \\ Glyph-orientation-horizontal and glyph-orientation-vertical Properties / 211 \\ Text-script Property / 214 \\ Min-font-size and max-font-size Properties / 215 \\ Text-justify-trim Property / 216 \\ Line-break Property / 216 \\ Word-break-cjk Property / 216 \\ Word-break-inside Property / 217 \\ Word-break Property / 217 \\ Wrap-option Property / 218 \\ Linefeed-treatment Property / 219 \\ White-space-treatment Property / 219 \\ All-space-treatment Property / 220 \\ White-space Property / 220 \\ Text-overflow-mode Property / 222 \\ Text-overflow-ellipsis Property / 222 \\ Text-overflow Property / 223 \\ Kerning-mode Property / 223 \\ Kerning-pair-threshold Property / 224 \\ Punctuation-trim Property / 224 \\ Text-line-through Set of Properties / 225 \\ Text-overline Set of Properties / 228 \\ Text-underline Set of Properties / 232 \\ Text-blink Property / 236 \\ Text Property Extensions / 238 \\ Internet Explorer Text-Formatting CSS Extensions / 239 \\ Layout-flow Property / 239 \\ Writing-mode Property / 244 \\ Layout-grid Sub-Family of Properties / 247 \\ Text-autospace Property / 258 \\ Text-justify Property / 261 \\ Text-kashida-space Property / 264 \\ Text-underline-position Property / 266 \\ Word-break Property / 268 \\ Text-align-last Property / 271 \\ Box Properties / 274 \\ Border-`style' Properties / 276 \\ Border-style Property / 277 \\ Border-color Property / 280 \\ Border-width Property / 283 \\ Border-bottom Property / 286 \\ Border-left Property / 289 \\ Border-right Property / 292 \\ Border-top Property / 294 \\ Border-bottom-width Property / 297 \\ Border-left-width Property / 299 \\ Border-right-width Property / 302 \\ Border-top-width Property / 304 \\ Border Property / 307 \\ Border-radius Set of Properties / 310 \\ Border-image Set of Properties / 312 \\ Border-fit Set of Properties / 314 \\ Border-image-transform Set of Properties / 317 \\ Border-break Property / 319 \\ Box-shadow Property / 319 \\ Clear Property / 321 \\ Clear-after Property / 324 \\ Float Property / 325 \\ Float-displace Property / 331 \\ Indent-edge-reset Property / 332 \\ Height Property / 332 \\ Width Property / 335 \\ Padding-bottom Property / 337 \\ Padding-left Property / 339 \\ Padding-right Property / 341 \\ Padding-top Property / 343 \\ Padding Property / 345 \\ Margin-bottom Property / 349 \\ Margin-left Property / 352 \\ Margin-right Property / 354 \\ Margin-top Property / 357 \\ Margin Property / 360 \\ Min-width, max-width, min-height and max-height Properties / 362 \\ Fit and fit-position Properties / 363 \\ Marquee Properties / 365 \\ Color / 368 \\ Color Property / 370 \\ Gamma Correction under CSS3 / 375 \\ Opacity Property / 376 \\ Rendering-intent Property / 377 \\ Color-profile Property / 378 \\ Color-profile / 379 \\ XII Color Keywords / 379 \\ Background Properties / 386 \\ Background-color Property / 387 \\ Background-image Property / 391 \\ Background-repeat Property / 394 \\ Background-attachment Property / 397 \\ Background-position Property / 401 \\ Background Property / 407 \\ Background-position-x and background-position-y Properties / 410 \\ CSS3 Properties / 415 \\ Background-clip Property / 415 \\ Background-origin / 416 \\ Background-size / 418 \\ Background-quantity / 419 \\ Background-spacing / 420 \\ Classification Properties and Generated/Automatic Content / 422 \\ White-space Property / 423 \\ List-style-type Property / 426 \\ List-style-image Property / 435 \\ List-style-position Property / 437 \\ List-style Property / 440 \\ The content Property plus the before and after Pseudo-Elements / 443 \\ Quotes Property / 446 \\ Counter-increment and counter-reset Properties / 449 \\ Marker-offset Property / 452 \\ Visual Formatting and Detailed Visual Formatting / 456 \\ Display Property / 457 \\ Positioning Properties: position, top, left, right and bottom / 465 \\ Z-index Property / 473 \\ Direction and unicode-bidi Properties / 476 \\ Min-width, max-width, min-height and max-height Properties / 479 \\ Visual Effects / 486 \\ Overflow Property / 487 \\ Overflow-x and overflow-y Properties / 490 \\ Clip Property / 492 \\ Visibility Property / 495 \\ Zoom Property / 500 \\ Ime-mode Property / 503 \\ Paged Media / 506 \\ Size Property / 507 \\ Marks Property / 510 \\ Page-Break Properties / 512 \\ Page Property / 515 \\ Windows and orphans Properties / 517 \\ Tables / 520 \\ Caption-side Property / 521 \\ Table-layout Property / 524 \\ Border-collapse, border-spacing and empty-cells / 527 \\ Speak-header Property / 536 \\ Table-like Layout Using CSS / 537 \\ User Interface / 542 \\ Cursor Property / 544 \\ Outline Sub-Family of Properties / 549 \\ Outline-width Property / 550 \\ Outline-style Property / 553 \\ Outline-color Property / 554 \\ Outline Property / 556 \\ Accelerator Property / 557 \\ CSS3 Properties / 559 \\ Resizer Property / 559 \\ Key-equivalent Property / 560 \\ Tab-index Property / 561 \\ User-input Property / 562 \\ User-modify Property / 562 \\ User-select Property / 563 \\ User-focus, user-focus-key and user-focus-pointer Properties / 564 \\ Toggle-group and group-reset Properties / 564 \\ Mozilla User-Interface-Related Extensions / 565 \\ CSS3 Additions to Existing User-Interface Properties / 567 \\ Aural Cascading Style Sheets / 568 \\ Speak Property / 570 \\ Volume Property / 571 \\ Pause Sub-Set of Properties / 573 \\ Cue Sub-Set of Properties / 576 \\ Play-during Property / 577 \\ zimuth Property / 579 \\ Elevation Property / 582 \\ Speech-rate Property / 584 \\ Voice-family Property / 586 \\ Pitch Property / 587 \\ Pitch-range Property / 589 \\ Stress Property / 590 \\ Richness Property / 591 \\ Speech Sub-Group of Properties / 592 \\ Ruby / 596 \\ What Is Ruby? / 597 \\ The <ruby> Tag Set / 598 \\ Ruby-align Property / 602 \\ Ruby-overhang Property / 605 \\ Ruby-position Property / 608 \\ Multi-Column Layout / 612 \\ Introduction / 613 \\ Column-count Property / 616 \\ Column-width Property / 616 \\ Column-gap Property / 617 \\ Column-width-policy Property / 617 \\ Column-space-distribution Property / 618 \\ Column Rule Properties / 620 \\ Column-span Property / 622 \\ Scrollbars / 624 \\ The Parts of a Scrollbar / 625 \\ Scrollbar Properties / 626 \\ Browser Compatibility / 634 \\ Filters and Transitions / 636 \\ Visual Filters in Internet Explorer / 637 \\ Static Filters / 638 \\ Transition Filter Overview / 672 \\ CSS1 and CSS2 Compatibility Charts / 692 \\ Alphabetical Listing of CSS Properties and Values / 706 \\ Accelerator / 707 \\ Azimuth / 708 \\ Background / 709 \\ Background-attachment / 710

entry:
@Book{Schengili-Roberts:2000:CC,
  author =       "Keith Schengili-Roberts",
  title =        "Core {CSS}",
  publisher =    pub-PHPTR,
  address =      pub-PHPTR:adr,
  pages =        "xxxvii + 635 + 4",
  year =         "2000",
  ISBN =         "0-13-083456-4 (paperback)",
  ISBN-13 =      "978-0-13-083456-0 (paperback)",
  LCCN =         "TK5105.888. S32 2000",
  bibdate =      "Mon Oct 26 18:00:35 MDT 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/sgml2000.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Prentice Hall PTR core series",
  acknowledgement = ack-nhfb,
  subject =      "Cascading Style Sheets; Web sites; design; computer
                 graphics; Web publishing",
  tableofcontents = "Acknowledgments / xxix \\
                 Preface / xxxi \\
                 Who You Are / xxxii \\
                 How This Book Is Organized / xxxiii \\
                 Conventions Used in This Book / xxxv \\
                 Further Information / xxxv \\
                 Additional Material / xxxvi \\
                 Feedback / xxxvii \\
                 The Birth of CSS / 2 \\
                 The World Wide Web Consortium Introduces Cascading
                 Style Sheets / 5 \\
                 XHTML, CSS2 and CSS3 / 7 \\
                 Re-emergence of the Browser Wars? / 10 \\
                 (X)Html and Its Relationship to CSS / 14 \\
                 Adding Cascading Style Sheets to Web Pages / 17 \\
                 The <style> Element / 18 \\
                 The <span> and <div> Elements / 21 \\
                 The <link> Element / 24 \\
                 Browser Adoption of CSS / 28 \\
                 Internet Explorer 3.x / 30 \\
                 Internet Explorer 4.x / 31 \\
                 Internet Explorer 4.5 (Macintosh) and 5.x (Windows and
                 Macintosh) / 32 \\
                 Internet Explorer 5.5 / 34 \\
                 Internet Explorer 6.0 / 35 \\
                 Opera 3.5 / 37 \\
                 Opera 4.x--6.x / 38 \\
                 Netscape Navigator 4.x / 39 \\
                 Mozilla and Netscape Navigator 6.x and 7.x / 40 \\
                 Other Browsers / 47 \\
                 Implementation of Basic CSS Concepts / 52 \\
                 Grouping / 53 \\
                 Inheritance / 56 \\
                 Class and id as Selectors / 58 \\
                 Contextual Selectors / 62 \\
                 Comments / 66 \\
                 CSS2 Selectors / 67 \\
                 CSS3 Selectors / 76 \\
                 The Cascade / 82 \\
                 Cascading Order / 83 \\
                 Important / 88 \\
                 Cascade-Order Sources / 90 \\
                 CSS Units / 94 \\
                 Length Units / 95 \\
                 Percentage Units / 101 \\
                 URLs / 103 \\
                 Strings / 106 \\
                 Time Units / 108 \\
                 Angle Units / 108 \\
                 Frequency Units / 110 \\
                 Pseudo-Classes and Pseudo-Elements / 112 \\
                 Anchor Pseudo-Element / 114 \\
                 First-line Pseudo-Element / 117 \\
                 First-letter Pseudo-Element / 119 \\
                 Lang Pseudo-Class / 122 \\
                 Left, right and first Pseudo-Classes / 123 \\
                 Focus and hover Pseudo-Classes / 123 \\
                 First-child Pseudo-Class / 125 \\
                 Pseudo-Elements in Selectors and Combining Multiple
                 Pseudo-Elements / 128 \\
                 Media Types and Media Queries / 130 \\
                 Browser Compatibility / 134 \\
                 Media Queries / 135 \\
                 Width and height Media Queries / 136 \\
                 Device-width and device-height Media Queries / 136 \\
                 Device-aspect-ratio Media Query / 137 \\
                 Color Media Query / 137 \\
                 Color-index Media Query / 138 \\
                 Monochrome Media Query / 138 \\
                 Resolution Media Query / 139 \\
                 Scan Media Query / 139 \\
                 Grid Media Query / 140 \\
                 Font Properties / 142 \\
                 Font-family Property / 144 \\
                 Font-size Property / 150 \\
                 Font-style Property / 158 \\
                 Font-variant Property / 160 \\
                 Font-weight Property / 162 \\
                 Font Property / 167 \\
                 Font-stretch Property / 170 \\
                 Font-size-adjust Property / 173 \\
                 The <at>font-face Pseudo-Element / 175 \\
                 CSS3 Font Decoration Properties / 182 \\
                 Text Properties / 186 \\
                 Letter-spacing Property / 187 \\
                 Word-spacing Property / 190 \\
                 Line-height Property / 193 \\
                 Vertical-align Property / 196 \\
                 Text-align Property / 198 \\
                 Text-decoration Property / 201 \\
                 Text-indent Property / 204 \\
                 Text-transform Property / 207 \\
                 Text-shadow Property / 209 \\
                 Glyph-orientation-horizontal and
                 glyph-orientation-vertical Properties / 211 \\
                 Text-script Property / 214 \\
                 Min-font-size and max-font-size Properties / 215 \\
                 Text-justify-trim Property / 216 \\
                 Line-break Property / 216 \\
                 Word-break-cjk Property / 216 \\
                 Word-break-inside Property / 217 \\
                 Word-break Property / 217 \\
                 Wrap-option Property / 218 \\
                 Linefeed-treatment Property / 219 \\
                 White-space-treatment Property / 219 \\
                 All-space-treatment Property / 220 \\
                 White-space Property / 220 \\
                 Text-overflow-mode Property / 222 \\
                 Text-overflow-ellipsis Property / 222 \\
                 Text-overflow Property / 223 \\
                 Kerning-mode Property / 223 \\
                 Kerning-pair-threshold Property / 224 \\
                 Punctuation-trim Property / 224 \\
                 Text-line-through Set of Properties / 225 \\
                 Text-overline Set of Properties / 228 \\
                 Text-underline Set of Properties / 232 \\
                 Text-blink Property / 236 \\
                 Text Property Extensions / 238 \\
                 Internet Explorer Text-Formatting CSS Extensions / 239
                 \\
                 Layout-flow Property / 239 \\
                 Writing-mode Property / 244 \\
                 Layout-grid Sub-Family of Properties / 247 \\
                 Text-autospace Property / 258 \\
                 Text-justify Property / 261 \\
                 Text-kashida-space Property / 264 \\
                 Text-underline-position Property / 266 \\
                 Word-break Property / 268 \\
                 Text-align-last Property / 271 \\
                 Box Properties / 274 \\
                 Border-`style' Properties / 276 \\
                 Border-style Property / 277 \\
                 Border-color Property / 280 \\
                 Border-width Property / 283 \\
                 Border-bottom Property / 286 \\
                 Border-left Property / 289 \\
                 Border-right Property / 292 \\
                 Border-top Property / 294 \\
                 Border-bottom-width Property / 297 \\
                 Border-left-width Property / 299 \\
                 Border-right-width Property / 302 \\
                 Border-top-width Property / 304 \\
                 Border Property / 307 \\
                 Border-radius Set of Properties / 310 \\
                 Border-image Set of Properties / 312 \\
                 Border-fit Set of Properties / 314 \\
                 Border-image-transform Set of Properties / 317 \\
                 Border-break Property / 319 \\
                 Box-shadow Property / 319 \\
                 Clear Property / 321 \\
                 Clear-after Property / 324 \\
                 Float Property / 325 \\
                 Float-displace Property / 331 \\
                 Indent-edge-reset Property / 332 \\
                 Height Property / 332 \\
                 Width Property / 335 \\
                 Padding-bottom Property / 337 \\
                 Padding-left Property / 339 \\
                 Padding-right Property / 341 \\
                 Padding-top Property / 343 \\
                 Padding Property / 345 \\
                 Margin-bottom Property / 349 \\
                 Margin-left Property / 352 \\
                 Margin-right Property / 354 \\
                 Margin-top Property / 357 \\
                 Margin Property / 360 \\
                 Min-width, max-width, min-height and max-height
                 Properties / 362 \\
                 Fit and fit-position Properties / 363 \\
                 Marquee Properties / 365 \\
                 Color / 368 \\
                 Color Property / 370 \\
                 Gamma Correction under CSS3 / 375 \\
                 Opacity Property / 376 \\
                 Rendering-intent Property / 377 \\
                 Color-profile Property / 378 \\
                 Color-profile / 379 \\
                 XII Color Keywords / 379 \\
                 Background Properties / 386 \\
                 Background-color Property / 387 \\
                 Background-image Property / 391 \\
                 Background-repeat Property / 394 \\
                 Background-attachment Property / 397 \\
                 Background-position Property / 401 \\
                 Background Property / 407 \\
                 Background-position-x and background-position-y
                 Properties / 410 \\
                 CSS3 Properties / 415 \\
                 Background-clip Property / 415 \\
                 Background-origin / 416 \\
                 Background-size / 418 \\
                 Background-quantity / 419 \\
                 Background-spacing / 420 \\
                 Classification Properties and Generated/Automatic
                 Content / 422 \\
                 White-space Property / 423 \\
                 List-style-type Property / 426 \\
                 List-style-image Property / 435 \\
                 List-style-position Property / 437 \\
                 List-style Property / 440 \\
                 The content Property plus the before and after
                 Pseudo-Elements / 443 \\
                 Quotes Property / 446 \\
                 Counter-increment and counter-reset Properties / 449
                 \\
                 Marker-offset Property / 452 \\
                 Visual Formatting and Detailed Visual Formatting / 456
                 \\
                 Display Property / 457 \\
                 Positioning Properties: position, top, left, right and
                 bottom / 465 \\
                 Z-index Property / 473 \\
                 Direction and unicode-bidi Properties / 476 \\
                 Min-width, max-width, min-height and max-height
                 Properties / 479 \\
                 Visual Effects / 486 \\
                 Overflow Property / 487 \\
                 Overflow-x and overflow-y Properties / 490 \\
                 Clip Property / 492 \\
                 Visibility Property / 495 \\
                 Zoom Property / 500 \\
                 Ime-mode Property / 503 \\
                 Paged Media / 506 \\
                 Size Property / 507 \\
                 Marks Property / 510 \\
                 Page-Break Properties / 512 \\
                 Page Property / 515 \\
                 Windows and orphans Properties / 517 \\
                 Tables / 520 \\
                 Caption-side Property / 521 \\
                 Table-layout Property / 524 \\
                 Border-collapse, border-spacing and empty-cells / 527
                 \\
                 Speak-header Property / 536 \\
                 Table-like Layout Using CSS / 537 \\
                 User Interface / 542 \\
                 Cursor Property / 544 \\
                 Outline Sub-Family of Properties / 549 \\
                 Outline-width Property / 550 \\
                 Outline-style Property / 553 \\
                 Outline-color Property / 554 \\
                 Outline Property / 556 \\
                 Accelerator Property / 557 \\
                 CSS3 Properties / 559 \\
                 Resizer Property / 559 \\
                 Key-equivalent Property / 560 \\
                 Tab-index Property / 561 \\
                 User-input Property / 562 \\
                 User-modify Property / 562 \\
                 User-select Property / 563 \\
                 User-focus, user-focus-key and user-focus-pointer
                 Properties / 564 \\
                 Toggle-group and group-reset Properties / 564 \\
                 Mozilla User-Interface-Related Extensions / 565 \\
                 CSS3 Additions to Existing User-Interface Properties /
                 567 \\
                 Aural Cascading Style Sheets / 568 \\
                 Speak Property / 570 \\
                 Volume Property / 571 \\
                 Pause Sub-Set of Properties / 573 \\
                 Cue Sub-Set of Properties / 576 \\
                 Play-during Property / 577 \\
                 zimuth Property / 579 \\
                 Elevation Property / 582 \\
                 Speech-rate Property / 584 \\
                 Voice-family Property / 586 \\
                 Pitch Property / 587 \\
                 Pitch-range Property / 589 \\
                 Stress Property / 590 \\
                 Richness Property / 591 \\
                 Speech Sub-Group of Properties / 592 \\
                 Ruby / 596 \\
                 What Is Ruby? / 597 \\
                 The <ruby> Tag Set / 598 \\
                 Ruby-align Property / 602 \\
                 Ruby-overhang Property / 605 \\
                 Ruby-position Property / 608 \\
                 Multi-Column Layout / 612 \\
                 Introduction / 613 \\
                 Column-count Property / 616 \\
                 Column-width Property / 616 \\
                 Column-gap Property / 617 \\
                 Column-width-policy Property / 617 \\
                 Column-space-distribution Property / 618 \\
                 Column Rule Properties / 620 \\
                 Column-span Property / 622 \\
                 Scrollbars / 624 \\
                 The Parts of a Scrollbar / 625 \\
                 Scrollbar Properties / 626 \\
                 Browser Compatibility / 634 \\
                 Filters and Transitions / 636 \\
                 Visual Filters in Internet Explorer / 637 \\
                 Static Filters / 638 \\
                 Transition Filter Overview / 672 \\
                 CSS1 and CSS2 Compatibility Charts / 692 \\
                 Alphabetical Listing of CSS Properties and Values / 706
                 \\
                 Accelerator / 707 \\
                 Azimuth / 708 \\
                 Background / 709 \\
                 Background-attachment / 710",
}


bibtype: book
filename: master.bib
label: Schewe:2013:MGP
author: Phillip F. Schewe
title: Maverick Genius: the Pioneering Odyssey of Freeman Dyson
publisher: Thomas Dunn Books, St. Martin's Press
address: New York, NY, USA
pages: x + 339
year: 2013
ISBN: 0-312-64235-0 (hardcover), 1-250-02101-4 (e-book) OR 0312642350 (hardcover), 1250021014 (ebook)
LCCN: QC16.D95 S34 2013
bibdate: Mon Aug 19 15:29:10 MDT 2013
bibtimestamp: 2013.08.19 15:29:10 MDT
remark: This is claimed to be the first biography of Freeman Dyson.
acknowledgement: ack-nhfb
rawauthor: Phillip F. Schewe
rawtitle: Maverick Genius: the Pioneering Odyssey of {Freeman Dyson}
ISBN13:
978-0-312-64235-8 (hardcover), 978-1-250-02101-4 (e-book) OR 9780312642358 (hardcover), 9781250021014 (ebook)

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

abstract:
Freeman Dyson has been influential in many fields over his long and legendary career, including quantum physics, national defense, space, and religion. In this definitive biography, author Phillip F. Schewe examines the life of one of the most innovative thinkers of our time, whose accomplishments include: Designing a nuclear rocket ship, em The Orion, for NASA; Helping write the booktitle Nuclear Test Ban Treaty; Consulting for Stanley Kubrick on the film booktitle 2001: A Space Odyssey; Winning the coveted million dollar booktitle Templeton Prize for Progress in Religion. A colleague of Albert Einstein at Princeton and friends with leading thinkers including Robert Oppenheimer, George F. Kennan, and Richard Feynman, Freeman Dyson is a larger-than-life figure in the world of science, and he has recently made headlines for his controversial views on global warming. Written with the cooperation of Dyson's children, entrepreneur Esther Dyson (an early investor in Flickr, Google, and Orbitz, who has often been called `The First Lady of the Internet') and tech writer George Dyson, this is the first complete biography of the man who changed the way we think about science today.

subject:
Dyson, Freeman J; Physicists; United States; Biography; Mathematicians; Biography and Autobiography / Science and Technology

TOC:
Introduction Killing time: Dyson bombs Berlin (1923--1945) Life is a blur: Dyson as mathematician (1945--1947) Ecumenical councils: Dyson as seminarian (1947--1948) The secret signature of things: Dyson as artist (1948--1949) Recessional: Dyson as professor (1949--1953) Nuclear opera: Dyson and the Cold War (1954--1956) Intrinsically safe: Dyson as engineer (1956--1957) Space traveler's manifesto: Dyson as rocketeer (1957--1959) Civilized behavior: Dyson searches for extraterrestrial intelligence (early 1960s) Nuclear manifesto: Dyson as diplomat (early 1960s) On the Oregon Trail: Dyson as Pentagon consultant (1960s--1970s) Success in life: Dyson as astronomer (mid 1960s to mid 1970s) Science and sublime: Dyson as essayist (1976--1985) Nuclear slavery: Dyson as abolitionist (1980s) The arc of life: Dyson as biologist (1980s and 1990s) God and man at Princeton: Dyson as preacher (1985--2000) Splintering the species: Dyson as heretic (1990--2010) Long-term thinking: Dyson as storyteller (recent years)

rawabstract:
Freeman Dyson has been influential in many fields over his long and legendary career, including quantum physics, national defense, space, and religion. In this definitive biography, author Phillip F. Schewe examines the life of one of the most innovative thinkers of our time, whose accomplishments include: Designing a nuclear rocket ship, {\em The Orion}, for NASA; Helping write the \booktitle{Nuclear Test Ban Treaty}; Consulting for Stanley Kubrick on the film \booktitle{2001: A Space Odyssey}; Winning the coveted million dollar \booktitle{Templeton Prize for Progress in Religion}. A colleague of Albert Einstein at Princeton and friends with leading thinkers including Robert Oppenheimer, George F. Kennan, and Richard Feynman, Freeman Dyson is a larger-than-life figure in the world of science, and he has recently made headlines for his controversial views on global warming. Written with the cooperation of Dyson's children, entrepreneur Esther Dyson (an early investor in Flickr, Google, and Orbitz, who has often been called `The First Lady of the Internet') and tech writer George Dyson, this is the first complete biography of the man who changed the way we think about science today.

rawTOC:
Introduction \\ Killing time: Dyson bombs Berlin (1923--1945) \\ Life is a blur: Dyson as mathematician (1945--1947) \\ Ecumenical councils: Dyson as seminarian (1947--1948) \\ The secret signature of things: Dyson as artist (1948--1949) \\ Recessional: Dyson as professor (1949--1953) \\ Nuclear opera: Dyson and the Cold War (1954--1956) \\ Intrinsically safe: Dyson as engineer (1956--1957) \\ Space traveler's manifesto: Dyson as rocketeer (1957--1959) \\ Civilized behavior: Dyson searches for extraterrestrial intelligence (early 1960s) \\ Nuclear manifesto: Dyson as diplomat (early 1960s) \\ On the Oregon Trail: Dyson as Pentagon consultant (1960s--1970s) \\ Success in life: Dyson as astronomer (mid 1960s to mid 1970s) \\ Science and sublime: Dyson as essayist (1976--1985) \\ Nuclear slavery: Dyson as abolitionist (1980s) \\ The arc of life: Dyson as biologist (1980s and 1990s) \\ God and man at Princeton: Dyson as preacher (1985--2000) \\ Splintering the species: Dyson as heretic (1990--2010) \\ Long-term thinking: Dyson as storyteller (recent years)

entry:
@Book{Schewe:2013:MGP,
  author =       "Phillip F. Schewe",
  title =        "Maverick Genius: the Pioneering Odyssey of {Freeman
                 Dyson}",
  publisher =    "Thomas Dunn Books, St. Martin's Press",
  address =      "New York, NY, USA",
  pages =        "x + 339",
  year =         "2013",
  ISBN =         "0-312-64235-0 (hardcover), 1-250-02101-4 (e-book)",
  ISBN-13 =      "978-0-312-64235-8 (hardcover), 978-1-250-02101-4
                 (e-book)",
  LCCN =         "QC16.D95 S34 2013",
  bibdate =      "Mon Aug 19 15:29:10 MDT 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/d/dyson-freeman-j.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Freeman Dyson has been influential in many fields over
                 his long and legendary career, including quantum
                 physics, national defense, space, and religion. In this
                 definitive biography, author Phillip F. Schewe examines
                 the life of one of the most innovative thinkers of our
                 time, whose accomplishments include: Designing a
                 nuclear rocket ship, {\em The Orion}, for NASA; Helping
                 write the \booktitle{Nuclear Test Ban Treaty};
                 Consulting for Stanley Kubrick on the film
                 \booktitle{2001: A Space Odyssey}; Winning the coveted
                 million dollar \booktitle{Templeton Prize for Progress
                 in Religion}. A colleague of Albert Einstein at
                 Princeton and friends with leading thinkers including
                 Robert Oppenheimer, George F. Kennan, and Richard
                 Feynman, Freeman Dyson is a larger-than-life figure in
                 the world of science, and he has recently made
                 headlines for his controversial views on global
                 warming. Written with the cooperation of Dyson's
                 children, entrepreneur Esther Dyson (an early investor
                 in Flickr, Google, and Orbitz, who has often been
                 called `The First Lady of the Internet') and tech
                 writer George Dyson, this is the first complete
                 biography of the man who changed the way we think about
                 science today.",
  acknowledgement = ack-nhfb,
  remark =       "This is claimed to be the first biography of Freeman
                 Dyson.",
  subject =      "Dyson, Freeman J; Physicists; United States;
                 Biography; Mathematicians; Biography and Autobiography
                 / Science and Technology",
  tableofcontents = "Introduction \\
                 Killing time: Dyson bombs Berlin (1923--1945) \\
                 Life is a blur: Dyson as mathematician (1945--1947) \\
                 Ecumenical councils: Dyson as seminarian (1947--1948)
                 \\
                 The secret signature of things: Dyson as artist
                 (1948--1949) \\
                 Recessional: Dyson as professor (1949--1953) \\
                 Nuclear opera: Dyson and the Cold War (1954--1956) \\
                 Intrinsically safe: Dyson as engineer (1956--1957) \\
                 Space traveler's manifesto: Dyson as rocketeer
                 (1957--1959) \\
                 Civilized behavior: Dyson searches for extraterrestrial
                 intelligence (early 1960s) \\
                 Nuclear manifesto: Dyson as diplomat (early 1960s) \\
                 On the Oregon Trail: Dyson as Pentagon consultant
                 (1960s--1970s) \\
                 Success in life: Dyson as astronomer (mid 1960s to mid
                 1970s) \\
                 Science and sublime: Dyson as essayist (1976--1985) \\
                 Nuclear slavery: Dyson as abolitionist (1980s) \\
                 The arc of life: Dyson as biologist (1980s and 1990s)
                 \\
                 God and man at Princeton: Dyson as preacher
                 (1985--2000) \\
                 Splintering the species: Dyson as heretic (1990--2010)
                 \\
                 Long-term thinking: Dyson as storyteller (recent
                 years)",
}


bibtype: book
filename: master.bib
label: Schildt:1990:AAC
author: Herbert Schildt
title: The Annotated ANSI C Standard: American National Standard for Programming Languages: C
publisher: pub-OSBORNE-MCGRAW-HILL
address: pub-OSBORNE-MCGRAW-HILL:adr
pages: xvi + 219
year: 1990
ISBN: 0-07-881952-0 OR 0078819520
ISBN13: 978-0-07-881952-0 OR 9780078819520
LCCN: QA76.73.C15S356 1990
bibdate: Mon Dec 27 09:38:20 1993
bibtimestamp: 1993.12.27 09:38:20 ???
acknowledgement: ack-nhfb
rawauthor: Herbert Schildt
rawtitle: The Annotated {ANSI C} Standard: {American National Standard for Programming Languages: C}
bibsource:
https://www.math.utah.edu/pub/tex/bib/ansistd.bib; https://www.math.utah.edu/pub/tex/bib/cccuj.bib; https://www.math.utah.edu/pub/tex/bib/isostd.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/standard.bib

keywords:
C (Computer program language); Programming languages; Programming languages (Electronic computers) --- Standards; Standards.

remark:
Contains the full text of the ANSI/ISO Standard for the C programming language, which is commonly called the ANSI C Standard. ldots To make the text of the standard more generally accessible and easier to understand, I have provided explanations, comments, and examples on the pages that face the pages of the standard.

TOC:
Acknowledgments Introduction Scope / 1 Normative references / 1 Definitions and conventions / 2 Compliance / 3 Environment / 5 Language / 18 Library / 96 Annex A: Bibliography / 177 Annex B: Language syntax summary / 178 Annex C: Sequence points / 189 Annex D: Library summary / 190 Annex E: Implementation limits / 196 Annex F: Common warnings / 198 Annex G: Portability issues / 199 Index / 210

rawTOC:
Acknowledgments \\ Introduction \\ Scope / 1 \\ Normative references / 1 \\ Definitions and conventions / 2 \\ Compliance / 3 \\ Environment / 5 \\ Language / 18 \\ Library / 96 \\ Annex A: Bibliography / 177 \\ Annex B: Language syntax summary / 178 \\ Annex C: Sequence points / 189 \\ Annex D: Library summary / 190 \\ Annex E: Implementation limits / 196 \\ Annex F: Common warnings / 198 \\ Annex G: Portability issues / 199 \\ Index / 210

entry:
@Book{Schildt:1990:AAC,
  author =       "Herbert Schildt",
  title =        "The Annotated {ANSI C} Standard: {American National
                 Standard for Programming Languages: C}",
  publisher =    pub-OSBORNE-MCGRAW-HILL,
  address =      pub-OSBORNE-MCGRAW-HILL:adr,
  pages =        "xvi + 219",
  year =         "1990",
  ISBN =         "0-07-881952-0",
  ISBN-13 =      "978-0-07-881952-0",
  LCCN =         "QA76.73.C15S356 1990",
  bibdate =      "Mon Dec 27 09:38:20 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ansistd.bib;
                 https://www.math.utah.edu/pub/tex/bib/cccuj.bib;
                 https://www.math.utah.edu/pub/tex/bib/isostd.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/standard.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  keywords =     "C (Computer program language); Programming languages;
                 Programming languages (Electronic computers) ---
                 Standards; Standards.",
  remark =       "Contains the full text of the ANSI/ISO Standard for
                 the C programming language, which is commonly called
                 the ANSI C Standard. \ldots{} To make the text of the
                 standard more generally accessible and easier to
                 understand, I have provided explanations, comments, and
                 examples on the pages that face the pages of the
                 standard.",
  tableofcontents = "Acknowledgments \\
                 Introduction \\
                 Scope / 1 \\
                 Normative references / 1 \\
                 Definitions and conventions / 2 \\
                 Compliance / 3 \\
                 Environment / 5 \\
                 Language / 18 \\
                 Library / 96 \\
                 Annex A: Bibliography / 177 \\
                 Annex B: Language syntax summary / 178 \\
                 Annex C: Sequence points / 189 \\
                 Annex D: Library summary / 190 \\
                 Annex E: Implementation limits / 196 \\
                 Annex F: Common warnings / 198 \\
                 Annex G: Portability issues / 199 \\
                 Index / 210",
}


bibtype: book
filename: master.bib
label: Schneier:1994:ACP
author: Bruce Schneier
title: Applied Cryptography: Protocols, Algorithms, and Source Code in C
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xviii + 618
year: 1994
ISBN: 0-471-59756-2 (paperback) OR 0471597562 (paperback)
ISBN13: 978-0-471-59756-8 (paperback) OR 9780471597568 (paperback)
LCCN: QA76.9.A25S35 1993
bibdate: Sun Dec 04 13:11:37 1994
bibtimestamp: 1994.12.04 13:11:37 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Applied Cryptography: Protocols, Algorithms, and Source Code in {C}
bibsource:
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

abstract:
The explosive growth of public and private computer networks has resulted in a tremendous increase in the volume of sensitive and valuable data that is routinely stored and transmitted digitally. From computer messages speeding through global networks to vast sums of money transferred electronically, the greatest challenge in this new `digital world' is keeping this information out of the hands of unauthorized users who prey on vulnerable computer systems. In booktitle Applied Cryptography, data security expert Bruce Schneier details how programmers can use cryptography --- the technique of enciphering and deciphering messages --- to maintain the privacy of computer data. Covering the latest developments in practical cryptographic techniques, the book shows programmers who design computer applications, networks, and storage systems how security can be built into the computer software and systems we use every day. Along with more than 100 pages of actual C source code of working cryptographic algorithms, this practical handbook explains data encryption protocols and techniques currently in use and likely to be used in the future; offers numerous present-day applications from secure correspondence to anonymous messaging; includes numerous source code fragments and shows how to incorporate them into larger programs; and discusses related issues like patents, export law, and legal rulings.

TOC:
Foreword / Whitfield Diffie 1. Foundations Part 1. Cryptographic Protocols 2. Protocol Building Blocks 3. Basic Protocols 4. Intermediate Protocols 5. Advanced Protocols 6. Esoteric Protocols Part 2. Cryptographic Techniques 7. Keys 8. Using Algorithms Part 3. Cryptographic Algorithms 9. Mathematical Background 10. Data Encryption Standard (DES) 11. Other Block Algorithms 12. Public-Key Algorithms 13. More Public-Key Algorithms 14. One-Way Hash Functions 15. Random Sequence Generators and Stream Ciphers 16. Special Algorithms for Protocols Part 4. The Real World 17. Example Implementations 18. Politics Part 5. Source Code VIGENERE, BEAUFORD, VARIANT BEAUFORD ENIGMA DES LUCIFER NEWDES FEAL-8 FEAL-NX REDOC III LOKI 91 IDEA N-HASH MD5 SECURE HASH ALGORITHM SECRET SHARING

rawabstract:
The explosive growth of public and private computer networks has resulted in a tremendous increase in the volume of sensitive and valuable data that is routinely stored and transmitted digitally. From computer messages speeding through global networks to vast sums of money transferred electronically, the greatest challenge in this new `digital world' is keeping this information out of the hands of unauthorized users who prey on vulnerable computer systems. In \booktitle{Applied Cryptography}, data security expert Bruce Schneier details how programmers can use cryptography --- the technique of enciphering and deciphering messages --- to maintain the privacy of computer data. Covering the latest developments in practical cryptographic techniques, the book shows programmers who design computer applications, networks, and storage systems how security can be built into the computer software and systems we use every day. Along with more than 100 pages of actual C source code of working cryptographic algorithms, this practical handbook explains data encryption protocols and techniques currently in use and likely to be used in the future; offers numerous present-day applications from secure correspondence to anonymous messaging; includes numerous source code fragments and shows how to incorporate them into larger programs; and discusses related issues like patents, export law, and legal rulings.

rawTOC:
Foreword / Whitfield Diffie \\ 1. Foundations \\ Part 1. Cryptographic Protocols \\ 2. Protocol Building Blocks \\ 3. Basic Protocols \\ 4. Intermediate Protocols \\ 5. Advanced Protocols \\ 6. Esoteric Protocols \\ Part 2. Cryptographic Techniques \\ 7. Keys \\ 8. Using Algorithms \\ Part 3. Cryptographic Algorithms \\ 9. Mathematical Background \\ 10. Data Encryption Standard (DES) \\ 11. Other Block Algorithms \\ 12. Public-Key Algorithms \\ 13. More Public-Key Algorithms \\ 14. One-Way Hash Functions \\ 15. Random Sequence Generators and Stream Ciphers \\ 16. Special Algorithms for Protocols \\ Part 4. The Real World \\ 17. Example Implementations \\ 18. Politics \\ Part 5. Source Code \\ VIGENERE, BEAUFORD, VARIANT BEAUFORD \\ ENIGMA \\ DES \\ LUCIFER \\ NEWDES \\ FEAL-8 \\ FEAL-NX \\ REDOC III \\ LOKI 91 \\ IDEA \\ N-HASH \\ MD5 \\ SECURE HASH ALGORITHM \\ SECRET SHARING

entry:
@Book{Schneier:1994:ACP,
  author =       "Bruce Schneier",
  title =        "Applied Cryptography: Protocols, Algorithms, and
                 Source Code in {C}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xviii + 618",
  year =         "1994",
  ISBN =         "0-471-59756-2 (paperback)",
  ISBN-13 =      "978-0-471-59756-8 (paperback)",
  LCCN =         "QA76.9.A25S35 1993",
  bibdate =      "Sun Dec 04 13:11:37 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$44.95",
  abstract =     "The explosive growth of public and private computer
                 networks has resulted in a tremendous increase in the
                 volume of sensitive and valuable data that is routinely
                 stored and transmitted digitally. From computer
                 messages speeding through global networks to vast sums
                 of money transferred electronically, the greatest
                 challenge in this new `digital world' is keeping this
                 information out of the hands of unauthorized users who
                 prey on vulnerable computer systems. In
                 \booktitle{Applied Cryptography}, data security expert
                 Bruce Schneier details how programmers can use
                 cryptography --- the technique of enciphering and
                 deciphering messages --- to maintain the privacy of
                 computer data. Covering the latest developments in
                 practical cryptographic techniques, the book shows
                 programmers who design computer applications, networks,
                 and storage systems how security can be built into the
                 computer software and systems we use every day. Along
                 with more than 100 pages of actual C source code of
                 working cryptographic algorithms, this practical
                 handbook explains data encryption protocols and
                 techniques currently in use and likely to be used in
                 the future; offers numerous present-day applications
                 from secure correspondence to anonymous messaging;
                 includes numerous source code fragments and shows how
                 to incorporate them into larger programs; and discusses
                 related issues like patents, export law, and legal
                 rulings.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / Whitfield Diffie \\
                 1. Foundations \\
                 Part 1. Cryptographic Protocols \\
                 2. Protocol Building Blocks \\
                 3. Basic Protocols \\
                 4. Intermediate Protocols \\
                 5. Advanced Protocols \\
                 6. Esoteric Protocols \\
                 Part 2. Cryptographic Techniques \\
                 7. Keys \\
                 8. Using Algorithms \\
                 Part 3. Cryptographic Algorithms \\
                 9. Mathematical Background \\
                 10. Data Encryption Standard (DES) \\
                 11. Other Block Algorithms \\
                 12. Public-Key Algorithms \\
                 13. More Public-Key Algorithms \\
                 14. One-Way Hash Functions \\
                 15. Random Sequence Generators and Stream Ciphers \\
                 16. Special Algorithms for Protocols \\
                 Part 4. The Real World \\
                 17. Example Implementations \\
                 18. Politics \\
                 Part 5. Source Code \\
                 VIGENERE, BEAUFORD, VARIANT BEAUFORD \\
                 ENIGMA \\
                 DES \\
                 LUCIFER \\
                 NEWDES \\
                 FEAL-8 \\
                 FEAL-NX \\
                 REDOC III \\
                 LOKI 91 \\
                 IDEA \\
                 N-HASH \\
                 MD5 \\
                 SECURE HASH ALGORITHM \\
                 SECRET SHARING",
}


bibtype: book
filename: master.bib
label: Schneier:1996:ACP
author: Bruce Schneier
title: Applied Cryptography: Protocols, Algorithms, and Source Code in C
publisher: pub-WILEY
address: pub-WILEY:adr
edition: Second
pages: xxiii + 758
year: 1996
LCCN: QA76.9.A25 S35 1996
MRclass: 94A60, 94-01
bibdate: Tue Oct 20 17:50:50 1998
bibtimestamp: 1998.10.20 17:50:50 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Applied Cryptography: Protocols, Algorithms, and Source Code in {C}
ISBN:
0-471-12845-7 (hardcover), 0-471-11709-9 (paperback) OR 0471128457 (hardcover), 0471117099 (paperback)

ISBN13:
978-0-471-12845-8 (hardcover), 978-0-471-11709-4 (paperback) OR 9780471128458 (hardcover), 9780471117094 (paperback)

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

TOC:
Foreword / Whitfield Diffie 1: Foundations 2: Protocol Building Blocks 3: Basic Protocols 4: Intermediate Protocols 5: Advanced Protocols 6: Esoteric Protocols 7: Key Length 8: Key Management 9: Algorithm Types and Modes 10: Using Algorithms 11: Mathematical Background 12: Data Encryption Standard (DES) 13: Other Block Ciphers 14: Still Other Block Ciphers 15: Combining Block Ciphers 16: Pseudo-Random-Sequence Generators and Stream Ciphers 17: Other Stream Ciphers and Real Random-Sequence Generators 18: One-Way Hash Functions 19: Public-Key Algorithms 20: Public-Key Digital Signature Algorithms 21: Identification Schemes 22: Key-Exchange Algorithms 23: Special Algorithms for Protocols 24: Example Implementations 25: Politics Afterword / Matt Blaze

rawTOC:
Foreword / Whitfield Diffie \\ 1: Foundations \\ 2: Protocol Building Blocks \\ 3: Basic Protocols \\ 4: Intermediate Protocols \\ 5: Advanced Protocols \\ 6: Esoteric Protocols \\ 7: Key Length \\ 8: Key Management \\ 9: Algorithm Types and Modes \\ 10: Using Algorithms \\ 11: Mathematical Background \\ 12: Data Encryption Standard (DES) \\ 13: Other Block Ciphers \\ 14: Still Other Block Ciphers \\ 15: Combining Block Ciphers \\ 16: Pseudo-Random-Sequence Generators and Stream Ciphers \\ 17: Other Stream Ciphers and Real Random-Sequence Generators \\ 18: One-Way Hash Functions \\ 19: Public-Key Algorithms \\ 20: Public-Key Digital Signature Algorithms \\ 21: Identification Schemes \\ 22: Key-Exchange Algorithms \\ 23: Special Algorithms for Protocols \\ 24: Example Implementations \\ 25: Politics \\ Afterword / Matt Blaze

entry:
@Book{Schneier:1996:ACP,
  author =       "Bruce Schneier",
  title =        "Applied Cryptography: Protocols, Algorithms, and
                 Source Code in {C}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "xxiii + 758",
  year =         "1996",
  ISBN =         "0-471-12845-7 (hardcover), 0-471-11709-9 (paperback)",
  ISBN-13 =      "978-0-471-12845-8 (hardcover), 978-0-471-11709-4
                 (paperback)",
  LCCN =         "QA76.9.A25 S35 1996",
  MRclass =      "94A60, 94-01",
  bibdate =      "Tue Oct 20 17:50:50 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / Whitfield Diffie \\
                 1: Foundations \\
                 2: Protocol Building Blocks \\
                 3: Basic Protocols \\
                 4: Intermediate Protocols \\
                 5: Advanced Protocols \\
                 6: Esoteric Protocols \\
                 7: Key Length \\
                 8: Key Management \\
                 9: Algorithm Types and Modes \\
                 10: Using Algorithms \\
                 11: Mathematical Background \\
                 12: Data Encryption Standard (DES) \\
                 13: Other Block Ciphers \\
                 14: Still Other Block Ciphers \\
                 15: Combining Block Ciphers \\
                 16: Pseudo-Random-Sequence Generators and Stream
                 Ciphers \\
                 17: Other Stream Ciphers and Real Random-Sequence
                 Generators \\
                 18: One-Way Hash Functions \\
                 19: Public-Key Algorithms \\
                 20: Public-Key Digital Signature Algorithms \\
                 21: Identification Schemes \\
                 22: Key-Exchange Algorithms \\
                 23: Special Algorithms for Protocols \\
                 24: Example Implementations \\
                 25: Politics \\
                 Afterword / Matt Blaze",
}


bibtype: book
filename: master.bib
label: Schneier:2000:SLD
author: Bruce Schneier
title: Secrets and Lies: Digital Security in a Networked World
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xv + 412
year: 2000
DOI: https://doi.org/10.1002/9781119183631
ISBN: 0-471-25311-1 OR 0471253111
ISBN13: 978-0-471-25311-2 OR 9780471253112
LCCN: QA76.9.A25 S352 2000
bibdate: Wed Sep 20 16:28:33 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.09.20 16:28:33 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Secrets and Lies: Digital Security in a Networked World
abstract:
Information security expert Bruce Schneier explains what everyone in business needs to know about security in order to survive and be competitive. Pragmatic, interesting, and humorous, Schneier exposes the digital world and the realities of our networked society. He examines the entire system, from the reasons for technical insecurities to the minds behind malicious attacks. You'll be guided through the security war zone, and learn how to understand and arm yourself against the threats of our connected world. booktitle Secrets and Lies offers the expert guidance you'll need to make the right choices about securing your digital self.

TOC:
1: Introduction Part 1: The landscape 2: Digital threats 3: Attacks 4: Adversaries 5: Security needs Part 2: Technologies 6: Cryptography 7: Cryptography in context 8: Computer security 9: Identification and authentication 10: Networked-computer security 11: Network security 12: Network defenses 13: Software reliability 14: Secure hardware 15: Certificates and credentials 16: Security tricks 17: The human factor Part 3: Strategies 18: Vulnerabilities and the vulnerability landscape 19: Threat modeling and risk assessment 20: Security policies and countermeasures 21: Attack trees 22: Product testing and verification 23: The future of products 24: Security processes 25: Conclusion Afterword Resources Index

rawabstract:
Information security expert Bruce Schneier explains what everyone in business needs to know about security in order to survive and be competitive. Pragmatic, interesting, and humorous, Schneier exposes the digital world and the realities of our networked society. He examines the entire system, from the reasons for technical insecurities to the minds behind malicious attacks. You'll be guided through the security war zone, and learn how to understand and arm yourself against the threats of our connected world. \booktitle{Secrets and Lies} offers the expert guidance you'll need to make the right choices about securing your digital self.

rawTOC:
1: Introduction \\ Part 1: The landscape \\ 2: Digital threats \\ 3: Attacks \\ 4: Adversaries \\ 5: Security needs \\ Part 2: Technologies \\ 6: Cryptography \\ 7: Cryptography in context \\ 8: Computer security \\ 9: Identification and authentication \\ 10: Networked-computer security \\ 11: Network security \\ 12: Network defenses \\ 13: Software reliability \\ 14: Secure hardware \\ 15: Certificates and credentials \\ 16: Security tricks \\ 17: The human factor \\ Part 3: Strategies \\ 18: Vulnerabilities and the vulnerability landscape \\ 19: Threat modeling and risk assessment \\ 20: Security policies and countermeasures \\ 21: Attack trees \\ 22: Product testing and verification \\ 23: The future of products \\ 24: Security processes \\ 25: Conclusion \\ Afterword \\ Resources \\ Index

entry:
@Book{Schneier:2000:SLD,
  author =       "Bruce Schneier",
  title =        "Secrets and Lies: Digital Security in a Networked
                 World",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 412",
  year =         "2000",
  DOI =          "https://doi.org/10.1002/9781119183631",
  ISBN =         "0-471-25311-1",
  ISBN-13 =      "978-0-471-25311-2",
  LCCN =         "QA76.9.A25 S352 2000",
  bibdate =      "Wed Sep 20 16:28:33 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$29.99",
  abstract =     "Information security expert Bruce Schneier explains
                 what everyone in business needs to know about security
                 in order to survive and be competitive. Pragmatic,
                 interesting, and humorous, Schneier exposes the digital
                 world and the realities of our networked society. He
                 examines the entire system, from the reasons for
                 technical insecurities to the minds behind malicious
                 attacks. You'll be guided through the security war
                 zone, and learn how to understand and arm yourself
                 against the threats of our connected world.
                 \booktitle{Secrets and Lies} offers the expert guidance
                 you'll need to make the right choices about securing
                 your digital self.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 Part 1: The landscape \\
                 2: Digital threats \\
                 3: Attacks \\
                 4: Adversaries \\
                 5: Security needs \\
                 Part 2: Technologies \\
                 6: Cryptography \\
                 7: Cryptography in context \\
                 8: Computer security \\
                 9: Identification and authentication \\
                 10: Networked-computer security \\
                 11: Network security \\
                 12: Network defenses \\
                 13: Software reliability \\
                 14: Secure hardware \\
                 15: Certificates and credentials \\
                 16: Security tricks \\
                 17: The human factor \\
                 Part 3: Strategies \\
                 18: Vulnerabilities and the vulnerability landscape \\
                 19: Threat modeling and risk assessment \\
                 20: Security policies and countermeasures \\
                 21: Attack trees \\
                 22: Product testing and verification \\
                 23: The future of products \\
                 24: Security processes \\
                 25: Conclusion \\
                 Afterword \\
                 Resources \\
                 Index",
}


bibtype: book
filename: master.bib
label: Schneier:2003:BFT
author: Bruce Schneier
title: Beyond Fear: Thinking Sensibly About Security in an Uncertain World
publisher: Copernicus Books
address: New York, NY, USA
pages: viii + 295
year: 2003
ISBN: 0-387-02620-7 (hardcover), 0-387-21712-6 (e-book) OR 0387026207 (hardcover), 0387217126 (ebook)
LCCN: HV6432 .S36 2003
bibdate: Thu Aug 21 08:38:41 2003
bibtimestamp: 2003.08.21 08:38:41 ???
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Beyond Fear: Thinking Sensibly About Security in an Uncertain World
ISBN13:
978-0-387-02620-6 (hardcover), 978-0-387-21712-3 (e-book) OR 9780387026206 (hardcover), 9780387217123 (ebook)

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

abstract:
Many of us, especially since 9/11, have become personally concerned about issues of security, and this is no surprise. Security is near the top of government and corporate agendas around the globe. Security-related stories appear on the front page everyday. How well though, do any of us truly understand what achieving real security involves? In booktitle Beyond Fear, Bruce Schneier invites us to take a critical look at not just the threats to our security, but the ways in which we're encouraged to think about security by law enforcement agencies, businesses of all shapes and sizes, and our national governments and militaries. Schneier believes we all can and should be better security consumers, and that the trade-offs we make in the name of security --- in terms of cash outlays, taxes, inconvenience, and diminished freedoms --- should be part of an ongoing negotiation in our personal, professional, and civic lives, and the subject of an open and informed national discussion. With a well-deserved reputation for original and sometimes iconoclastic thought, Schneier has a lot to say that is provocative, counter-intuitive, and just plain good sense. He explains in detail, for example, why we need to design security systems that don't just work well, but fail well, and why secrecy on the part of government often undermines security. He also believes, for instance, that national ID cards are an exceptionally bad idea: technically unsound, and even destructive of security. And, contrary to a lot of current nay-sayers, he thinks online shopping is fundamentally safe, and that many of the new airline security measure (though by no means all) are actually quite effective. A skeptic of much that's promised by highly touted technologies like biometrics, Schneier is also a refreshingly positive, problem-solving force in the often self-dramatizing and fear-mongering world of security pundits. Schneier helps the reader to understand the issues at stake, and how to best come to one's own conclusions, including the vast infrastructure we already have in place, and the vaster systems--some useful, others useless or worse--that we're being asked to submit to and pay for. Bruce Schneier is the author of seven books, including booktitle Applied Cryptography (which Wired called ``the one book the National Security Agency wanted never to be published'') and booktitle Secrets and Lies (described in Fortune as ``startlingly lively ldots [a] jewel box of little surprises you can actually use.''). He is also Founder and Chief Technology Officer of Counterpane Internet Security, Inc., and publishes Crypto-Gram, one of the most widely read newsletters in the field of online security.

TOC:
1: All security involves trade-offs 2: Security trade-offs are subjective 3: Security trade-offs depend on power and agenda 4: Systems and how they fail 5: Knowing the attackers 6: Attackers never change their tunes, just their instruments 7: Technology creates security imbalances 8: Security is a weakest-link problem 9: Brittleness makes for bad security 10: Security revolves around people 11: Detection works where prevention fails 12: Detection is useless without response 13: Identification, authentication, and authorization 14: All countermeasures have some value 15: Fighting terrorism 16: Negotiating for security 17: Security demystified

rawabstract:
Many of us, especially since 9/11, have become personally concerned about issues of security, and this is no surprise. Security is near the top of government and corporate agendas around the globe. Security-related stories appear on the front page everyday. How well though, do any of us truly understand what achieving real security involves? In \booktitle{Beyond Fear}, Bruce Schneier invites us to take a critical look at not just the threats to our security, but the ways in which we're encouraged to think about security by law enforcement agencies, businesses of all shapes and sizes, and our national governments and militaries. Schneier believes we all can and should be better security consumers, and that the trade-offs we make in the name of security --- in terms of cash outlays, taxes, inconvenience, and diminished freedoms --- should be part of an ongoing negotiation in our personal, professional, and civic lives, and the subject of an open and informed national discussion. With a well-deserved reputation for original and sometimes iconoclastic thought, Schneier has a lot to say that is provocative, counter-intuitive, and just plain good sense. He explains in detail, for example, why we need to design security systems that don't just work well, but fail well, and why secrecy on the part of government often undermines security. He also believes, for instance, that national ID cards are an exceptionally bad idea: technically unsound, and even destructive of security. And, contrary to a lot of current nay-sayers, he thinks online shopping is fundamentally safe, and that many of the new airline security measure (though by no means all) are actually quite effective. A skeptic of much that's promised by highly touted technologies like biometrics, Schneier is also a refreshingly positive, problem-solving force in the often self-dramatizing and fear-mongering world of security pundits. Schneier helps the reader to understand the issues at stake, and how to best come to one's own conclusions, including the vast infrastructure we already have in place, and the vaster systems--some useful, others useless or worse--that we're being asked to submit to and pay for. Bruce Schneier is the author of seven books, including \booktitle{Applied Cryptography} (which Wired called ``the one book the National Security Agency wanted never to be published'') and \booktitle{Secrets and Lies} (described in Fortune as ``startlingly lively \ldots{} [a] jewel box of little surprises you can actually use.''). He is also Founder and Chief Technology Officer of Counterpane Internet Security, Inc., and publishes Crypto-Gram, one of the most widely read newsletters in the field of online security.

rawTOC:
1: All security involves trade-offs \\ 2: Security trade-offs are subjective \\ 3: Security trade-offs depend on power and agenda \\ 4: Systems and how they fail \\ 5: Knowing the attackers \\ 6: Attackers never change their tunes, just their instruments \\ 7: Technology creates security imbalances \\ 8: Security is a weakest-link problem \\ 9: Brittleness makes for bad security \\ 10: Security revolves around people \\ 11: Detection works where prevention fails \\ 12: Detection is useless without response \\ 13: Identification, authentication, and authorization \\ 14: All countermeasures have some value \\ 15: Fighting terrorism \\ 16: Negotiating for security \\ 17: Security demystified

entry:
@Book{Schneier:2003:BFT,
  author =       "Bruce Schneier",
  title =        "Beyond Fear: Thinking Sensibly About Security in an
                 Uncertain World",
  publisher =    "Copernicus Books",
  address =      "New York, NY, USA",
  pages =        "viii + 295",
  year =         "2003",
  ISBN =         "0-387-02620-7 (hardcover), 0-387-21712-6 (e-book)",
  ISBN-13 =      "978-0-387-02620-6 (hardcover), 978-0-387-21712-3
                 (e-book)",
  LCCN =         "HV6432 .S36 2003",
  bibdate =      "Thu Aug 21 08:38:41 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "Many of us, especially since 9/11, have become
                 personally concerned about issues of security, and this
                 is no surprise. Security is near the top of government
                 and corporate agendas around the globe.
                 Security-related stories appear on the front page
                 everyday. How well though, do any of us truly
                 understand what achieving real security involves? In
                 \booktitle{Beyond Fear}, Bruce Schneier invites us to
                 take a critical look at not just the threats to our
                 security, but the ways in which we're encouraged to
                 think about security by law enforcement agencies,
                 businesses of all shapes and sizes, and our national
                 governments and militaries. Schneier believes we all
                 can and should be better security consumers, and that
                 the trade-offs we make in the name of security --- in
                 terms of cash outlays, taxes, inconvenience, and
                 diminished freedoms --- should be part of an ongoing
                 negotiation in our personal, professional, and civic
                 lives, and the subject of an open and informed national
                 discussion. With a well-deserved reputation for
                 original and sometimes iconoclastic thought, Schneier
                 has a lot to say that is provocative,
                 counter-intuitive, and just plain good sense. He
                 explains in detail, for example, why we need to design
                 security systems that don't just work well, but fail
                 well, and why secrecy on the part of government often
                 undermines security. He also believes, for instance,
                 that national ID cards are an exceptionally bad idea:
                 technically unsound, and even destructive of security.
                 And, contrary to a lot of current nay-sayers, he thinks
                 online shopping is fundamentally safe, and that many of
                 the new airline security measure (though by no means
                 all) are actually quite effective. A skeptic of much
                 that's promised by highly touted technologies like
                 biometrics, Schneier is also a refreshingly positive,
                 problem-solving force in the often self-dramatizing and
                 fear-mongering world of security pundits. Schneier
                 helps the reader to understand the issues at stake, and
                 how to best come to one's own conclusions, including
                 the vast infrastructure we already have in place, and
                 the vaster systems--some useful, others useless or
                 worse--that we're being asked to submit to and pay for.
                 Bruce Schneier is the author of seven books, including
                 \booktitle{Applied Cryptography} (which Wired called
                 ``the one book the National Security Agency wanted
                 never to be published'') and \booktitle{Secrets and
                 Lies} (described in Fortune as ``startlingly lively
                 \ldots{} [a] jewel box of little surprises you can
                 actually use.''). He is also Founder and Chief
                 Technology Officer of Counterpane Internet Security,
                 Inc., and publishes Crypto-Gram, one of the most widely
                 read newsletters in the field of online security.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: All security involves trade-offs \\
                 2: Security trade-offs are subjective \\
                 3: Security trade-offs depend on power and agenda \\
                 4: Systems and how they fail \\
                 5: Knowing the attackers \\
                 6: Attackers never change their tunes, just their
                 instruments \\
                 7: Technology creates security imbalances \\
                 8: Security is a weakest-link problem \\
                 9: Brittleness makes for bad security \\
                 10: Security revolves around people \\
                 11: Detection works where prevention fails \\
                 12: Detection is useless without response \\
                 13: Identification, authentication, and authorization
                 \\
                 14: All countermeasures have some value \\
                 15: Fighting terrorism \\
                 16: Negotiating for security \\
                 17: Security demystified",
}


bibtype: book
filename: master.bib
label: Schneier:2012:LOE
author: Bruce Schneier
title: Liars and outliers: enabling the trust that society needs to thrive
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xiv + 366
year: 2012
ISBN: 1-118-14330-2 (hardcover) OR 1118143302 (hardcover)
ISBN13: 978-1-118-14330-8 (hardcover) OR 9781118143308 (hardcover)
LCCN: BJ1500.T78 S35 2012
bibdate: Thu Jun 7 16:31:21 MDT 2012
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2012.06.07 16:31:21 MDT
acknowledgement: ack-nhfb
rawauthor: Bruce Schneier
rawtitle: Liars and outliers: enabling the trust that society needs to thrive
abstract:
Schneier argues that society requires trust in order to function, describes how society creates and maintains that trust through societal pressures, and discusses what happens when those pressures fail.

subject:
trust; social aspects; truthfulness and falsehood; social interaction; social stability; social aspects; interpersonal relations; sociology

TOC:
Overview Part I. The science of trust. A natural history of security The evolution of cooperation A social history of trust Societal dilemmas Part II. A model of trust. Societal pressures Moral pressures Reputational pressures Institutional pressures Security systems Part III. The real world. Competing interests Organizations Corporations Institutions Part IV. Conclusions. How societal pressures fail Technological advances The future

rawabstract:
Schneier argues that society requires trust in order to function, describes how society creates and maintains that trust through societal pressures, and discusses what happens when those pressures fail.

rawTOC:
Overview \\ Part I. The science of trust. A natural history of security \\ The evolution of cooperation \\ A social history of trust \\ Societal dilemmas \\ Part II. A model of trust. Societal pressures \\ Moral pressures \\ Reputational pressures \\ Institutional pressures \\ Security systems \\ Part III. The real world. Competing interests \\ Organizations \\ Corporations \\ Institutions \\ Part IV. Conclusions. How societal pressures fail \\ Technological advances \\ The future

entry:
@Book{Schneier:2012:LOE,
  author =       "Bruce Schneier",
  title =        "Liars and outliers: enabling the trust that society
                 needs to thrive",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiv + 366",
  year =         "2012",
  ISBN =         "1-118-14330-2 (hardcover)",
  ISBN-13 =      "978-1-118-14330-8 (hardcover)",
  LCCN =         "BJ1500.T78 S35 2012",
  bibdate =      "Thu Jun 7 16:31:21 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Schneier argues that society requires trust in order
                 to function, describes how society creates and
                 maintains that trust through societal pressures, and
                 discusses what happens when those pressures fail.",
  acknowledgement = ack-nhfb,
  subject =      "trust; social aspects; truthfulness and falsehood;
                 social interaction; social stability; social aspects;
                 interpersonal relations; sociology",
  tableofcontents = "Overview \\
                 Part I. The science of trust. A natural history of
                 security \\
                 The evolution of cooperation \\
                 A social history of trust \\
                 Societal dilemmas \\
                 Part II. A model of trust. Societal pressures \\
                 Moral pressures \\
                 Reputational pressures \\
                 Institutional pressures \\
                 Security systems \\
                 Part III. The real world. Competing interests \\
                 Organizations \\
                 Corporations \\
                 Institutions \\
                 Part IV. Conclusions. How societal pressures fail \\
                 Technological advances \\
                 The future",
}


bibtype: book
filename: master.bib
label: Schofield:1989:OFPa
author: Clive F. (Clive F.) Schofield
title: Optimising Fortran programs
publisher: pub-ELLIS-HORWOOD
address: pub-ELLIS-HORWOOD:adr
pages: x + 309
month: jul
monthnumber: 7
year: 1989
ISBN: 0-7458-0654-6, 0-470-21533-X (Halsted Press) OR 0745806546, 047021533X (Halsted Press)
LCCN: QA76.73.F25 S334 1989 WITHDRAWN
bibdate: Sun Sep 28 10:42:07 MDT 1997
bibtimestamp: 1997.09.28 10:42:07 MDT
note: Cover title: Optimizing Fortran programs. Includes index. Bibliography: p. [293]-296.
series: Ellis Horwood series in computers and their applications
URL: http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=047021533X
acknowledgement: ack-nhfb
rawauthor: Clive F. (Clive F.) Schofield
rawnote: Cover title: Optimizing Fortran programs. Includes index. Bibliography: p. [293]-296.
rawtitle: Optimising {Fortran} programs
ISBN13:
978-0-7458-0654-9, 978-0-470-21533-3 (Halsted Press) OR 9780745806549, 9780470215333 (Halsted Press)

bibsource:
http://www.amazon.com/exec/obidos/ISBN=047021533X/wholesaleproductA/; http://www.amazon.com/exec/obidos/ISBN=0745806546/wholesaleproductA/; http://www.cbooks.com/; https://www.math.utah.edu/pub/tex/bib/fortran2.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

keywords:
Computer systems --- Programming languages: Fortran language; Fortran (computer program language); Fortran (Computer program language)

entry:
@Book{Schofield:1989:OFPa,
  author =       "Clive F. (Clive F.) Schofield",
  title =        "Optimising {Fortran} programs",
  publisher =    pub-ELLIS-HORWOOD # " and " # pub-HALSTED,
  address =      pub-ELLIS-HORWOOD:adr # " and " # pub-HALSTED:adr,
  pages =        "x + 309",
  month =        jul,
  year =         "1989",
  ISBN =         "0-7458-0654-6, 0-470-21533-X (Halsted Press)",
  ISBN-13 =      "978-0-7458-0654-9, 978-0-470-21533-3 (Halsted Press)",
  LCCN =         "QA76.73.F25 S334 1989 WITHDRAWN",
  bibdate =      "Sun Sep 28 10:42:07 MDT 1997",
  bibsource =    "http://www.amazon.com/exec/obidos/ISBN=047021533X/wholesaleproductA/;
                 http://www.amazon.com/exec/obidos/ISBN=0745806546/wholesaleproductA/;
                 http://www.cbooks.com/;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Cover title: Optimizing Fortran programs. Includes
                 index. Bibliography: p. [293]-296.",
  price =        "US\$40.95, US\$74.95",
  series =       "Ellis Horwood series in computers and their
                 applications",
  URL =          "http://www.cbooks.com/sqlnut/SP/search/gtsumt?source=&isbn=047021533X",
  acknowledgement = ack-nhfb,
  keywords =     "Computer systems --- Programming languages: Fortran
                 language; Fortran (computer program language);
                 {Fortran} (Computer program language)",
  libnote =      "Not in my library.",
}


bibtype: book
filename: master.bib
label: Scholze-Stubenrecht:1997:ODG
title: The Oxford--Duden German Dictionary: German--English / English--German
publisher: pub-CLARENDON
address: pub-CLARENDON:adr
pages: 1712
year: 1997
ISBN: 0-19-860130-1, 0-19-860132-8 OR 0198601301, 0198601328
ISBN13: 978-0-19-860130-2, 978-0-19-860132-6 OR 9780198601302, 9780198601326
LCCN: PF3640.O94 1997
bibdate: Sun Dec 28 22:38:30 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1997.12.28 22:38:30 ???
keywords: German language --- Dictionaries --- English, English language --- Dictionaries --- German
acknowledgement: ack-nhfb
rawtitle: The {Oxford--Duden German} Dictionary: {German--English\slash English--German}
editor:
W. Scholze-Stubenrecht and J. B. Sykes and the Dudenredaktion and the German Section of the Oxford University Press Dictionary Department

raweditor:
W. Scholze-Stubenrecht and J. B. Sykes and {the Dudenredaktion} and {the German Section of the Oxford University Press Dictionary Department}

entry:
@Book{Scholze-Stubenrecht:1997:ODG,
  editor =       "W. Scholze-Stubenrecht and J. B. Sykes and {the
                 Dudenredaktion} and {the German Section of the Oxford
                 University Press Dictionary Department}",
  title =        "The {Oxford--Duden German} Dictionary:
                 {German--English\slash English--German}",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "1712",
  year =         "1997",
  ISBN =         "0-19-860130-1, 0-19-860132-8",
  ISBN-13 =      "978-0-19-860130-2, 978-0-19-860132-6",
  LCCN =         "PF3640.O94 1997",
  bibdate =      "Sun Dec 28 22:38:30 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  idnumber =     "500",
  keywords =     "German language --- Dictionaries --- English, English
                 language --- Dictionaries --- German",
}


bibtype: book
filename: master.bib
label: Schonfeld:2003:JH
author: Roger C. Schonfeld
title: JSTOR: a history
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: xxxiv + 412
year: 2003
ISBN: 0-691-11531-1 OR 0691115311
ISBN13: 978-0-691-11531-3 OR 9780691115313
LCCN: PN4836 .S36 2003
bibdate: Mon Sep 14 11:35:15 MDT 2015
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2015.09.14 11:35:15 MDT
subject: JSTOR (Computer file); Periodicals; Databases
acknowledgement: ack-nhfb
authordates: 1977--
rawauthor: Roger C. Schonfeld
rawtitle: {JSTOR}: a history
URL:
http://www.loc.gov/catdir/description/prin031/2002035907.html; http://www.loc.gov/catdir/enhancements/fy0654/2002035907-b.html; http://www.loc.gov/catdir/samples/prin031/2002035907.html

TOC:
List of Illustrations / vii Foreword / Hal Varian / xi A Note on Publication / William G. Bowen / xiii Introduction / xv Acknowledgments / xxi List of Abbreviations / xxv A JSTOR Time Line / xxvii 1: The Idea at Denison, the Project at Mellon: December 1993--January 1994 / 1 2: In Search of a Partner, but Beginning Alone: February--May 1994 / 17 3: Securing an Institutional Partner: The University of Michigan: April--August 1994 / 46 4: The Pilot Project: September 1994--April 1995 / 69 5: Evolving Organizational Decisions and Independence: February--December 1995 / 95 6: Defining a Mission in Partnership with Publishers: September 1995--August 1996 / 119 7: Operational Changes at Michigan: September 1995--August 1996 / 149 8: Developing a Business Plan: January--December 1996 / 166 9: A More Thoroughly Professionalized Operation: September 1996--December 1997 / 198 10: Public Availability and Library Participation: September 1996--December 1997 / 230 11: Developing Two New Collections: May 1997--December 1999 / 264 12: Increasing Availability and Participation: January 1998--December 1999 / 281 13: Completing Arts and Sciences I and Strategizing for the Future: July 1998--December 1999 / 301 14: Challenges and Opportunities of Growth: January 2000--December 2001 / 318 Conclusion: A Self-Sustaining Organization / 355 Epilogue: Lessons Learned / 374 App. List of Journals / 387 Bibliography / 393 Index / 405

rawTOC:
List of Illustrations / vii \\ Foreword / Hal Varian / xi \\ A Note on Publication / William G. Bowen / xiii \\ Introduction / xv \\ Acknowledgments / xxi \\ List of Abbreviations / xxv \\ A JSTOR Time Line / xxvii \\ 1: The Idea at Denison, the Project at Mellon: December 1993--January 1994 / 1 \\ 2: In Search of a Partner, but Beginning Alone: February--May 1994 / 17 \\ 3: Securing an Institutional Partner: The University of Michigan: April--August 1994 / 46 \\ 4: The Pilot Project: September 1994--April 1995 / 69 \\ 5: Evolving Organizational Decisions and Independence: February--December 1995 / 95 \\ 6: Defining a Mission in Partnership with Publishers: September 1995--August 1996 / 119 \\ 7: Operational Changes at Michigan: September 1995--August 1996 / 149 \\ 8: Developing a Business Plan: January--December 1996 / 166 \\ 9: A More Thoroughly Professionalized Operation: September 1996--December 1997 / 198 \\ 10: Public Availability and Library Participation: September 1996--December 1997 / 230 \\ 11: Developing Two New Collections: May 1997--December 1999 / 264 \\ 12: Increasing Availability and Participation: January 1998--December 1999 / 281 \\ 13: Completing Arts and Sciences I and Strategizing for the Future: July 1998--December 1999 / 301 \\ 14: Challenges and Opportunities of Growth: January 2000--December 2001 / 318 \\ Conclusion: A Self-Sustaining Organization / 355 \\ Epilogue: Lessons Learned / 374 \\ App. List of Journals / 387 \\ Bibliography / 393 \\ Index / 405

entry:
@Book{Schonfeld:2003:JH,
  author =       "Roger C. Schonfeld",
  title =        "{JSTOR}: a history",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xxxiv + 412",
  year =         "2003",
  ISBN =         "0-691-11531-1",
  ISBN-13 =      "978-0-691-11531-3",
  LCCN =         "PN4836 .S36 2003",
  bibdate =      "Mon Sep 14 11:35:15 MDT 2015",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/prin031/2002035907.html;
                 http://www.loc.gov/catdir/enhancements/fy0654/2002035907-b.html;
                 http://www.loc.gov/catdir/samples/prin031/2002035907.html",
  acknowledgement = ack-nhfb,
  author-dates = "1977--",
  libnote =      "Not in my library.",
  subject =      "JSTOR (Computer file); Periodicals; Databases",
  tableofcontents = "List of Illustrations / vii \\
                 Foreword / Hal Varian / xi \\
                 A Note on Publication / William G. Bowen / xiii \\
                 Introduction / xv \\
                 Acknowledgments / xxi \\
                 List of Abbreviations / xxv \\
                 A JSTOR Time Line / xxvii \\
                 1: The Idea at Denison, the Project at Mellon: December
                 1993--January 1994 / 1 \\
                 2: In Search of a Partner, but Beginning Alone:
                 February--May 1994 / 17 \\
                 3: Securing an Institutional Partner: The University of
                 Michigan: April--August 1994 / 46 \\
                 4: The Pilot Project: September 1994--April 1995 / 69
                 \\
                 5: Evolving Organizational Decisions and Independence:
                 February--December 1995 / 95 \\
                 6: Defining a Mission in Partnership with Publishers:
                 September 1995--August 1996 / 119 \\
                 7: Operational Changes at Michigan: September
                 1995--August 1996 / 149 \\
                 8: Developing a Business Plan: January--December 1996 /
                 166 \\
                 9: A More Thoroughly Professionalized Operation:
                 September 1996--December 1997 / 198 \\
                 10: Public Availability and Library Participation:
                 September 1996--December 1997 / 230 \\
                 11: Developing Two New Collections: May 1997--December
                 1999 / 264 \\
                 12: Increasing Availability and Participation: January
                 1998--December 1999 / 281 \\
                 13: Completing Arts and Sciences I and Strategizing for
                 the Future: July 1998--December 1999 / 301 \\
                 14: Challenges and Opportunities of Growth: January
                 2000--December 2001 / 318 \\
                 Conclusion: A Self-Sustaining Organization / 355 \\
                 Epilogue: Lessons Learned / 374 \\
                 App. List of Journals / 387 \\
                 Bibliography / 393 \\
                 Index / 405",
}


bibtype: book
filename: master.bib
label: Schoonover:1992:GEU
author: Michael A. Schoonover and John S. Bowie and William R. Arnold
title: GNU Emacs: UNIX Text Editing and Programming
publisher: pub-AW
address: pub-AW:adr
pages: xxvii + 609
year: 1992
ISBN: 0-201-56345-2 OR 0201563452
ISBN13: 978-0-201-56345-0 OR 9780201563450
LCCN: QA76.76.T49S36
series: Hewlett-Packard Press series
subject: Text editors (Computer programs); GNU Emacs; UNIX (Computer file)
acknowledgement: ack-nhfb
rawauthor: Michael A. Schoonover and John S. Bowie and William R. Arnold
rawtitle: {GNU Emacs}: {UNIX} Text Editing and Programming
bibsource:
https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

TOC:
Preface Text Editing In Emacs A Quick Tour of Emacs Starting Emacs Exiting Emacs Understanding the Emacs Screen Tying Text Typing Commands Using a Basic Set of Editing Commands Getting Online Help Using Emacs to Process Electronic Mail Using Emacs to Manage Files Changing Emacs' Behavior with Variables Basic Editing Commands Visiting a File Saving a Buffer Listing Buffers Switching to a Different Buffer Killing A Buffer Setting the Mode for a Buffer Moving the Cursor Using Line Numbers Deleting Text Undoing Mistakes Using Regions Searching for Text Searching and Replacing Text Overwriting Text More Efficient Editing Running a Command Multiple Times Modifying Command Behavior with Arguments Inserting Control Characters into a Buffer Working with Words, Sentences, and Paragraphs Working with Pages Working with Blank Lines Getting Cursor, Line, and Page Information Transposing Text Filling Text Indenting Text Changing Letter Case Searching and Replacing Text Narrowing a Buffer Moving the Cursor to Previous Marks (the Mark Ring) Using the Kill Ring Completing Long Command Names Completing File Names Using Abbreviations (Text Expansions) Using Macros for Repeated Editing Tasks Scrolling Windows Wording with Multiple Windows Printing a Buffer Listing a Directory Advanced Editing Changing Emacs' Behavior with Commands Changing Emacs' Behavior with Command-Line Arguments Searching for Regular Expressions (Regexps) Searching and Replacing Regexps Editing Outlines Manipulating Buffers Advanced File Operations Managing Auto-Saving Managing Emacs Backup Files Reverting a Buffer to Its Original Contents Preventing Simultaneous Editing Advanced Window Operations Editing Your Responses in the Minibuffer Sorting Test Using Rectangles Using Registers Programming In Emacs Program Development in Emacs Supported Editing Modes Using Fundamental and Text Mode Commands in Programming Modes Moving by Function Marking Functions Indenting Programs Commenting Programs Matching Parentheses, Braces, and Brackets Forcing Balanced Parentheses Selectively Displaying Program Lines Getting Documentation on System Commands and Routines Editing Across Multiple Files with Tag Tables Keeping Track of Changes to source with a ChangeLog Compiling Programs Sexp Commands (Advanced Usage) Editing in C Mode Invoking C Mode Assumptions About C Source Moving Among Functions Marking Functions Indenting Programs Commenting Programs Working with Sexps and Lists (Advanced Usage) Customizing Indentation (Advanced Usage) Customizing Commenting (Advanced Usage) Editing in FORTRAN Mode Invoking FORTRAN Mode Assumptions About FORTRAN Source Moving Among Subprograms and Statements Marking Subprograms Indenting Programs Labeling Lines Commenting Programs Using FORTRAN Keyword Abbreviations Working with Sexps and Lists (Advanced Usage) What Are Sexps and Lists in FORTRAN Mode? Customizing Indentation (Advanced Usage) Customizing Commenting (Advanced Usage) Editing in Lisp Modes Lisp Major Modes Assumptions About Lisp Source Moving Among Defuns Moving Among Sexps and Lists List and Sexp Motion Commands Marking Text Transposing Sexps Killing Sexps Indenting Programs Commenting Programs Evaluating Lisp Code Customizing Indentation (Advanced Usage) Customizing Commenting (Advanced Usage) Additional Emacs Features Getting Online Help Running Help Commands Getting Instructions for Using Help Getting Command Information Using Emacs for Electronic Mail The RMAIL Facility and Other UNIX Mail Facilities Reading Mail Messages Exiting from the RMAIL Buffer Moving Around Your Mail Messages Saving Messages to Files Removing Messages Getting New Mail Using a Mail Summary to Scan Messages Composing and Sending Messages Using Mode Line Status Messages (Labels) Using Multiple Mailbox Files Reading Digest Messages Associating UNIX Mailbox Files with RMAIL Mailbox Files (Advanced Usage) Managing Files and Buffers Using the Dired Facility to Manage Files Managing Multiple Buffers with Buffer-Menus Miscellaneous Emacs Features Checking Your Spelling Rerunning Commands from the Command History Recovering Files After System Crashes Using UNIX Commands in Emacs Running a UNIX Shell in an Emacs Buffer Nroff Major Mode TeX Modes: LaTeX and Plain TeX Picture Mode Doctor Mode Customizing And Administering Emacs Customizing the Emacs Environment Using a .emacs Start-Up File Using Variables to Change Emacs' Behavior Changing Command Key Bindings Forcing Confirmation for a Function More About Variable (Advanced Usage) More About Key Bindings (Advanced Usage) Examples of .emacs Customizations Administering Emacs Finding Emacs and identifying Its Parts Using New (or Notes) to Get Emacs Information Installing Emacs Editing in Pascal Mode Obtaining a Pascal Mode Enabling Pascal Mode Assumptions About Pascal Source Moving the Cursor Indenting Programs Commands That Build Pascal Constructs Creating a New Program Commenting Programs Working with Sexps and Lists (Advanced Usage) Customizing Indentation Customizing Commenting (Advanced Usage) Summary Emacs-Lisp Programming An Overview of Emacs-Lisp Programming Getting Documentation on Emacs-Lisp Defuns and Variables Evaluating Lisp Code Loading Emacs-Lisp Libraries Compiling Emacs-Lisp Code Debugging Emacs-Lisp Code (Advanced Usage) Converting Mocklisp to Emacs-Lisp (for Mocklisp Users) Summary Switching from vi to Emacs The vi Emulation Mode in Emacs Starting the Editor Saving Text and Exiting Line Number Information Commands Inserting Text Undoing Commands Repeating Commands Rerunning Previous Commands Moving the Cursor Deleting Text Using Marks Searching for Text Search and Replace Text Indenting Text Copying and Moving Blocks of Text Changing (Overwriting) Text Scrolling Text Using Shell Commands Using Macros Using Abbreviations Miscellaneous Commands Emacs Command Reference Abbreviations Buffers Buffer-Menu Case Conversion C Mode Compilation Cursor Motion Debugger (Emacs-Lisp) Deletion and Killing Dired Display Management Editor Emulation (EDT, vi, Gosling Emacs) Emacs-Lisp Programming Exiting files Filling FORTRAN Mode Help Indentation Key Bindings Killing and Yanking (Moving and Copying) Lisp Modes Location and Date/Time Macros Mail Minibuffer Editing Modes Nroff Mode Numeric Prefix Outline Editing Pages Paragraphs Picture Mode Printing Rectangles Regions Registers Searching Searching and Replacing Sentences Sexps and Lists (Balanced Expressions) Shells Sorting Spell-Checking Tags TeX Mode Transposing Undo Variables Windows Words Index

shortTOC:
Preface Part 1: Text editing in Emacs 1: A quick tour of Emacs 2: Basic editing commands 3: More efficient editing 4: Advanced editing Part 2: Programming in Emacs 5: Program development in Emacs 6: Editing in C mode 7: Editing in FORTRAN mode 8: Editing in Lisp modes Part 3: Additional Emacs features 9: Getting online help 10: Using Emacs for electronic mail 11: Managing files and buffers 12: Miscellaneous Emacs features Part 4: Customizing and administering Emacs 13: Customizing the Emacs environment 14: Administering Emacs A: Editing in Pascal mode B: Emacs-Lisp Programming C: Switching from vi to Emacs D: Emacs command reference Index

rawshortTOC:
Preface \\ Part 1: Text editing in Emacs \\ 1: A quick tour of Emacs \\ 2: Basic editing commands \\ 3: More efficient editing \\ 4: Advanced editing \\ Part 2: Programming in Emacs \\ 5: Program development in Emacs \\ 6: Editing in C mode \\ 7: Editing in FORTRAN mode \\ 8: Editing in Lisp modes \\ Part 3: Additional Emacs features \\ 9: Getting online help \\ 10: Using Emacs for electronic mail \\ 11: Managing files and buffers \\ 12: Miscellaneous Emacs features \\ Part 4: Customizing and administering Emacs \\ 13: Customizing the Emacs environment \\ 14: Administering Emacs \\ A: Editing in Pascal mode \\ B: Emacs-Lisp Programming \\ C: Switching from vi to Emacs \\ D: Emacs command reference \\ Index

rawTOC:
Preface \\ Text Editing In Emacs \\ A Quick Tour of Emacs \\ Starting Emacs \\ Exiting Emacs \\ Understanding the Emacs Screen \\ Tying Text \\ Typing Commands \\ Using a Basic Set of Editing Commands \\ Getting Online Help \\ Using Emacs to Process Electronic Mail \\ Using Emacs to Manage Files \\ Changing Emacs' Behavior with Variables \\ Basic Editing Commands \\ Visiting a File \\ Saving a Buffer \\ Listing Buffers \\ Switching to a Different Buffer \\ Killing A Buffer \\ Setting the Mode for a Buffer \\ Moving the Cursor \\ Using Line Numbers \\ Deleting Text \\ Undoing Mistakes \\ Using Regions \\ Searching for Text \\ Searching and Replacing Text \\ Overwriting Text \\ More Efficient Editing \\ Running a Command Multiple Times \\ Modifying Command Behavior with Arguments \\ Inserting Control Characters into a Buffer \\ Working with Words, Sentences, and Paragraphs \\ Working with Pages \\ Working with Blank Lines \\ Getting Cursor, Line, and Page Information \\ Transposing Text \\ Filling Text \\ Indenting Text \\ Changing Letter Case \\ Searching and Replacing Text \\ Narrowing a Buffer \\ Moving the Cursor to Previous Marks (the Mark Ring) \\ Using the Kill Ring \\ Completing Long Command Names \\ Completing File Names \\ Using Abbreviations (Text Expansions) \\ Using Macros for Repeated Editing Tasks \\ Scrolling Windows \\ Wording with Multiple Windows \\ Printing a Buffer \\ Listing a Directory \\ Advanced Editing \\ Changing Emacs' Behavior with Commands \\ Changing Emacs' Behavior with Command-Line Arguments \\ Searching for Regular Expressions (Regexps) \\ Searching and Replacing Regexps \\ Editing Outlines \\ Manipulating Buffers \\ Advanced File Operations \\ Managing Auto-Saving \\ Managing Emacs Backup Files \\ Reverting a Buffer to Its Original Contents \\ Preventing Simultaneous Editing \\ Advanced Window Operations \\ Editing Your Responses in the Minibuffer \\ Sorting Test \\ Using Rectangles \\ Using Registers \\ Programming In Emacs \\ Program Development in Emacs \\ Supported Editing Modes \\ Using Fundamental and Text Mode Commands in Programming Modes \\ Moving by Function \\ Marking Functions \\ Indenting Programs Commenting Programs \\ Matching Parentheses, Braces, and Brackets \\ Forcing Balanced Parentheses \\ Selectively Displaying Program Lines \\ Getting Documentation on System Commands and Routines \\ Editing Across Multiple Files with Tag Tables \\ Keeping Track of Changes to source with a ChangeLog \\ Compiling Programs \\ Sexp Commands (Advanced Usage) \\ Editing in C Mode \\ Invoking C Mode \\ Assumptions About C Source \\ Moving Among Functions \\ Marking Functions \\ Indenting Programs \\ Commenting Programs \\ Working with Sexps and Lists (Advanced Usage) \\ Customizing Indentation (Advanced Usage) \\ Customizing Commenting (Advanced Usage) \\ Editing in FORTRAN Mode \\ Invoking FORTRAN Mode \\ Assumptions About FORTRAN Source \\ Moving Among Subprograms and Statements \\ Marking Subprograms \\ Indenting Programs \\ Labeling Lines \\ Commenting Programs \\ Using FORTRAN Keyword Abbreviations \\ Working with Sexps and Lists (Advanced Usage) \\ What Are Sexps and Lists in FORTRAN Mode? \\ Customizing Indentation (Advanced Usage) \\ Customizing Commenting (Advanced Usage) \\ Editing in Lisp Modes \\ Lisp Major Modes \\ Assumptions About Lisp Source \\ Moving Among Defuns \\ Moving Among Sexps and Lists \\ List and Sexp Motion Commands \\ Marking Text \\ Transposing Sexps \\ Killing Sexps \\ Indenting Programs \\ Commenting Programs \\ Evaluating Lisp Code \\ Customizing Indentation (Advanced Usage) \\ Customizing Commenting (Advanced Usage) \\ Additional Emacs Features \\ Getting Online Help \\ Running Help Commands \\ Getting Instructions for Using Help \\ Getting Command Information \\ Using Emacs for Electronic Mail \\ The RMAIL Facility and Other UNIX Mail Facilities \\ Reading Mail Messages \\ Exiting from the RMAIL Buffer Moving Around Your Mail Messages \\ Saving Messages to Files \\ Removing Messages \\ Getting New Mail \\ Using a Mail Summary to Scan Messages \\ Composing and Sending Messages \\ Using Mode Line Status Messages (Labels) \\ Using Multiple Mailbox Files \\ Reading Digest Messages \\ Associating UNIX Mailbox Files with RMAIL Mailbox Files (Advanced Usage) \\ Managing Files and Buffers \\ Using the Dired Facility to Manage Files \\ Managing Multiple Buffers with Buffer-Menus \\ Miscellaneous Emacs Features \\ Checking Your Spelling \\ Rerunning Commands from the Command History \\ Recovering Files After System Crashes \\ Using UNIX Commands in Emacs \\ Running a UNIX Shell in an Emacs Buffer \\ Nroff Major Mode \\ TeX Modes: LaTeX and Plain TeX \\ Picture Mode \\ Doctor Mode \\ Customizing And Administering Emacs \\ Customizing the Emacs Environment \\ Using a .emacs Start-Up File \\ Using Variables to Change Emacs' Behavior \\ Changing Command Key Bindings \\ Forcing Confirmation for a Function \\ More About Variable (Advanced Usage) \\ More About Key Bindings (Advanced Usage) \\ Examples of .emacs Customizations \\ Administering Emacs \\ Finding Emacs and identifying Its Parts \\ Using New (or Notes) to Get Emacs Information \\ Installing Emacs \\ Editing in Pascal Mode \\ Obtaining a Pascal Mode \\ Enabling Pascal Mode \\ Assumptions About Pascal Source \\ Moving the Cursor \\ Indenting Programs \\ Commands That Build Pascal Constructs \\ Creating a New Program \\ Commenting Programs \\ Working with Sexps and Lists (Advanced Usage) \\ Customizing Indentation \\ Customizing Commenting (Advanced Usage) \\ Summary \\ Emacs-Lisp Programming \\ An Overview of Emacs-Lisp Programming \\ Getting Documentation on Emacs-Lisp Defuns and Variables \\ Evaluating Lisp Code \\ Loading Emacs-Lisp Libraries \\ Compiling Emacs-Lisp Code \\ Debugging Emacs-Lisp Code (Advanced Usage) \\ Converting Mocklisp to Emacs-Lisp (for Mocklisp Users) \\ Summary \\ Switching from vi to Emacs \\ The vi Emulation Mode in Emacs \\ Starting the Editor \\ Saving Text and Exiting \\ Line Number Information Commands \\ Inserting Text \\ Undoing Commands \\ Repeating Commands \\ Rerunning Previous Commands \\ Moving the Cursor \\ Deleting Text \\ Using Marks \\ Searching for Text Search and Replace Text \\ Indenting Text \\ Copying and Moving Blocks of Text \\ Changing (Overwriting) Text \\ Scrolling Text \\ Using Shell Commands \\ Using Macros \\ Using Abbreviations \\ Miscellaneous Commands \\ Emacs Command Reference \\ Abbreviations \\ Buffers \\ Buffer-Menu \\ Case Conversion \\ C Mode \\ Compilation \\ Cursor Motion \\ Debugger (Emacs-Lisp) \\ Deletion and Killing \\ Dired \\ Display Management \\ Editor Emulation (EDT, vi, Gosling Emacs) \\ Emacs-Lisp Programming \\ Exiting \\ files \\ Filling \\ FORTRAN Mode \\ Help \\ Indentation \\ Key Bindings \\ Killing and Yanking (Moving and Copying) \\ Lisp Modes \\ Location and Date/Time \\ Macros \\ Mail \\ Minibuffer Editing \\ Modes \\ Nroff Mode \\ Numeric Prefix \\ Outline Editing \\ Pages \\ Paragraphs \\ Picture Mode \\ Printing \\ Rectangles \\ Regions \\ Registers \\ Searching \\ Searching and Replacing \\ Sentences \\ Sexps and Lists (Balanced Expressions) \\ Shells \\ Sorting \\ Spell-Checking \\ Tags \\ TeX Mode \\ Transposing \\ Undo \\ Variables \\ Windows \\ Words \\ Index

entry:
@Book{Schoonover:1992:GEU,
  author =       "Michael A. Schoonover and John S. Bowie and William R.
                 Arnold",
  title =        "{GNU Emacs}: {UNIX} Text Editing and Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 609",
  year =         "1992",
  ISBN =         "0-201-56345-2",
  ISBN-13 =      "978-0-201-56345-0",
  LCCN =         "QA76.76.T49S36",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "Hewlett-Packard Press series",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface \\
                 Part 1: Text editing in Emacs \\
                 1: A quick tour of Emacs \\
                 2: Basic editing commands \\
                 3: More efficient editing \\
                 4: Advanced editing \\
                 Part 2: Programming in Emacs \\
                 5: Program development in Emacs \\
                 6: Editing in C mode \\
                 7: Editing in FORTRAN mode \\
                 8: Editing in Lisp modes \\
                 Part 3: Additional Emacs features \\
                 9: Getting online help \\
                 10: Using Emacs for electronic mail \\
                 11: Managing files and buffers \\
                 12: Miscellaneous Emacs features \\
                 Part 4: Customizing and administering Emacs \\
                 13: Customizing the Emacs environment \\
                 14: Administering Emacs \\
                 A: Editing in Pascal mode \\
                 B: Emacs-Lisp Programming \\
                 C: Switching from vi to Emacs \\
                 D: Emacs command reference \\
                 Index",
  subject =      "Text editors (Computer programs); GNU Emacs; UNIX
                 (Computer file)",
  tableofcontents = "Preface \\
                 Text Editing In Emacs \\
                 A Quick Tour of Emacs \\
                 Starting Emacs \\
                 Exiting Emacs \\
                 Understanding the Emacs Screen \\
                 Tying Text \\
                 Typing Commands \\
                 Using a Basic Set of Editing Commands \\
                 Getting Online Help \\
                 Using Emacs to Process Electronic Mail \\
                 Using Emacs to Manage Files \\
                 Changing Emacs' Behavior with Variables \\
                 Basic Editing Commands \\
                 Visiting a File \\
                 Saving a Buffer \\
                 Listing Buffers \\
                 Switching to a Different Buffer \\
                 Killing A Buffer \\
                 Setting the Mode for a Buffer \\
                 Moving the Cursor \\
                 Using Line Numbers \\
                 Deleting Text \\
                 Undoing Mistakes \\
                 Using Regions \\
                 Searching for Text \\
                 Searching and Replacing Text \\
                 Overwriting Text \\
                 More Efficient Editing \\
                 Running a Command Multiple Times \\
                 Modifying Command Behavior with Arguments \\
                 Inserting Control Characters into a Buffer \\
                 Working with Words, Sentences, and Paragraphs \\
                 Working with Pages \\
                 Working with Blank Lines \\
                 Getting Cursor, Line, and Page Information \\
                 Transposing Text \\
                 Filling Text \\
                 Indenting Text \\
                 Changing Letter Case \\
                 Searching and Replacing Text \\
                 Narrowing a Buffer \\
                 Moving the Cursor to Previous Marks (the Mark Ring) \\
                 Using the Kill Ring \\
                 Completing Long Command Names \\
                 Completing File Names \\
                 Using Abbreviations (Text Expansions) \\
                 Using Macros for Repeated Editing Tasks \\
                 Scrolling Windows \\
                 Wording with Multiple Windows \\
                 Printing a Buffer \\
                 Listing a Directory \\
                 Advanced Editing \\
                 Changing Emacs' Behavior with Commands \\
                 Changing Emacs' Behavior with Command-Line Arguments
                 \\
                 Searching for Regular Expressions (Regexps) \\
                 Searching and Replacing Regexps \\
                 Editing Outlines \\
                 Manipulating Buffers \\
                 Advanced File Operations \\
                 Managing Auto-Saving \\
                 Managing Emacs Backup Files \\
                 Reverting a Buffer to Its Original Contents \\
                 Preventing Simultaneous Editing \\
                 Advanced Window Operations \\
                 Editing Your Responses in the Minibuffer \\
                 Sorting Test \\
                 Using Rectangles \\
                 Using Registers \\
                 Programming In Emacs \\
                 Program Development in Emacs \\
                 Supported Editing Modes \\
                 Using Fundamental and Text Mode Commands in Programming
                 Modes \\
                 Moving by Function \\
                 Marking Functions \\
                 Indenting Programs Commenting Programs \\
                 Matching Parentheses, Braces, and Brackets \\
                 Forcing Balanced Parentheses \\
                 Selectively Displaying Program Lines \\
                 Getting Documentation on System Commands and Routines
                 \\
                 Editing Across Multiple Files with Tag Tables \\
                 Keeping Track of Changes to source with a ChangeLog \\
                 Compiling Programs \\
                 Sexp Commands (Advanced Usage) \\
                 Editing in C Mode \\
                 Invoking C Mode \\
                 Assumptions About C Source \\
                 Moving Among Functions \\
                 Marking Functions \\
                 Indenting Programs \\
                 Commenting Programs \\
                 Working with Sexps and Lists (Advanced Usage) \\
                 Customizing Indentation (Advanced Usage) \\
                 Customizing Commenting (Advanced Usage) \\
                 Editing in FORTRAN Mode \\
                 Invoking FORTRAN Mode \\
                 Assumptions About FORTRAN Source \\
                 Moving Among Subprograms and Statements \\
                 Marking Subprograms \\
                 Indenting Programs \\
                 Labeling Lines \\
                 Commenting Programs \\
                 Using FORTRAN Keyword Abbreviations \\
                 Working with Sexps and Lists (Advanced Usage) \\
                 What Are Sexps and Lists in FORTRAN Mode? \\
                 Customizing Indentation (Advanced Usage) \\
                 Customizing Commenting (Advanced Usage) \\
                 Editing in Lisp Modes \\
                 Lisp Major Modes \\
                 Assumptions About Lisp Source \\
                 Moving Among Defuns \\
                 Moving Among Sexps and Lists \\
                 List and Sexp Motion Commands \\
                 Marking Text \\
                 Transposing Sexps \\
                 Killing Sexps \\
                 Indenting Programs \\
                 Commenting Programs \\
                 Evaluating Lisp Code \\
                 Customizing Indentation (Advanced Usage) \\
                 Customizing Commenting (Advanced Usage) \\
                 Additional Emacs Features \\
                 Getting Online Help \\
                 Running Help Commands \\
                 Getting Instructions for Using Help \\
                 Getting Command Information \\
                 Using Emacs for Electronic Mail \\
                 The RMAIL Facility and Other UNIX Mail Facilities \\
                 Reading Mail Messages \\
                 Exiting from the RMAIL Buffer Moving Around Your Mail
                 Messages \\
                 Saving Messages to Files \\
                 Removing Messages \\
                 Getting New Mail \\
                 Using a Mail Summary to Scan Messages \\
                 Composing and Sending Messages \\
                 Using Mode Line Status Messages (Labels) \\
                 Using Multiple Mailbox Files \\
                 Reading Digest Messages \\
                 Associating UNIX Mailbox Files with RMAIL Mailbox Files
                 (Advanced Usage) \\
                 Managing Files and Buffers \\
                 Using the Dired Facility to Manage Files \\
                 Managing Multiple Buffers with Buffer-Menus \\
                 Miscellaneous Emacs Features \\
                 Checking Your Spelling \\
                 Rerunning Commands from the Command History \\
                 Recovering Files After System Crashes \\
                 Using UNIX Commands in Emacs \\
                 Running a UNIX Shell in an Emacs Buffer \\
                 Nroff Major Mode \\
                 TeX Modes: LaTeX and Plain TeX \\
                 Picture Mode \\
                 Doctor Mode \\
                 Customizing And Administering Emacs \\
                 Customizing the Emacs Environment \\
                 Using a .emacs Start-Up File \\
                 Using Variables to Change Emacs' Behavior \\
                 Changing Command Key Bindings \\
                 Forcing Confirmation for a Function \\
                 More About Variable (Advanced Usage) \\
                 More About Key Bindings (Advanced Usage) \\
                 Examples of .emacs Customizations \\
                 Administering Emacs \\
                 Finding Emacs and identifying Its Parts \\
                 Using New (or Notes) to Get Emacs Information \\
                 Installing Emacs \\
                 Editing in Pascal Mode \\
                 Obtaining a Pascal Mode \\
                 Enabling Pascal Mode \\
                 Assumptions About Pascal Source \\
                 Moving the Cursor \\
                 Indenting Programs \\
                 Commands That Build Pascal Constructs \\
                 Creating a New Program \\
                 Commenting Programs \\
                 Working with Sexps and Lists (Advanced Usage) \\
                 Customizing Indentation \\
                 Customizing Commenting (Advanced Usage) \\
                 Summary \\
                 Emacs-Lisp Programming \\
                 An Overview of Emacs-Lisp Programming \\
                 Getting Documentation on Emacs-Lisp Defuns and
                 Variables \\
                 Evaluating Lisp Code \\
                 Loading Emacs-Lisp Libraries \\
                 Compiling Emacs-Lisp Code \\
                 Debugging Emacs-Lisp Code (Advanced Usage) \\
                 Converting Mocklisp to Emacs-Lisp (for Mocklisp Users)
                 \\
                 Summary \\
                 Switching from vi to Emacs \\
                 The vi Emulation Mode in Emacs \\
                 Starting the Editor \\
                 Saving Text and Exiting \\
                 Line Number Information Commands \\
                 Inserting Text \\
                 Undoing Commands \\
                 Repeating Commands \\
                 Rerunning Previous Commands \\
                 Moving the Cursor \\
                 Deleting Text \\
                 Using Marks \\
                 Searching for Text Search and Replace Text \\
                 Indenting Text \\
                 Copying and Moving Blocks of Text \\
                 Changing (Overwriting) Text \\
                 Scrolling Text \\
                 Using Shell Commands \\
                 Using Macros \\
                 Using Abbreviations \\
                 Miscellaneous Commands \\
                 Emacs Command Reference \\
                 Abbreviations \\
                 Buffers \\
                 Buffer-Menu \\
                 Case Conversion \\
                 C Mode \\
                 Compilation \\
                 Cursor Motion \\
                 Debugger (Emacs-Lisp) \\
                 Deletion and Killing \\
                 Dired \\
                 Display Management \\
                 Editor Emulation (EDT, vi, Gosling Emacs) \\
                 Emacs-Lisp Programming \\
                 Exiting \\
                 files \\
                 Filling \\
                 FORTRAN Mode \\
                 Help \\
                 Indentation \\
                 Key Bindings \\
                 Killing and Yanking (Moving and Copying) \\
                 Lisp Modes \\
                 Location and Date/Time \\
                 Macros \\
                 Mail \\
                 Minibuffer Editing \\
                 Modes \\
                 Nroff Mode \\
                 Numeric Prefix \\
                 Outline Editing \\
                 Pages \\
                 Paragraphs \\
                 Picture Mode \\
                 Printing \\
                 Rectangles \\
                 Regions \\
                 Registers \\
                 Searching \\
                 Searching and Replacing \\
                 Sentences \\
                 Sexps and Lists (Balanced Expressions) \\
                 Shells \\
                 Sorting \\
                 Spell-Checking \\
                 Tags \\
                 TeX Mode \\
                 Transposing \\
                 Undo \\
                 Variables \\
                 Windows \\
                 Words \\
                 Index",
}


bibtype: book
filename: master.bib
label: Schreiner:1985:ICC
author: Axel T. Schreiner and H. George Friedman, Jr.
title: Introduction to Compiler Construction Under UNIX
publisher: pub-PH
address: pub-PH:adr
pages: viii + 194
year: 1985
ISBN: 0-13-474396-2 OR 0134743962
ISBN13: 978-0-13-474396-7 OR 9780134743967
LCCN: QA76.76.C65 S37 1985
bibdate: Wed Dec 15 18:20:18 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 18:20:18 ???
URL: ftp://ftp.cs.uiuc.edu/pub/faculty/friedman/tar
acknowledgement: ack-nhfb
rawauthor: Axel T. Schreiner and H. George {Friedman, Jr.}
rawtitle: Introduction to Compiler Construction Under {UNIX}
TOC:
Language definition Word recognition Language recognition Error recovery Semantic restrictions Memory allocation Code generation A load-and-go system Sample C compiler listing

rawTOC:
Language definition \\ Word recognition \\ Language recognition \\ Error recovery \\ Semantic restrictions \\ Memory allocation \\ Code generation \\ A load-and-go system \\ Sample C compiler listing

entry:
@Book{Schreiner:1985:ICC,
  author =       "Axel T. Schreiner and H. George {Friedman, Jr.}",
  title =        "Introduction to Compiler Construction Under {UNIX}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "viii + 194",
  year =         "1985",
  ISBN =         "0-13-474396-2",
  ISBN-13 =      "978-0-13-474396-7",
  LCCN =         "QA76.76.C65 S37 1985",
  bibdate =      "Wed Dec 15 18:20:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "ftp://ftp.cs.uiuc.edu/pub/faculty/friedman/tar",
  acknowledgement = ack-nhfb,
  tableofcontents = "Language definition \\
                 Word recognition \\
                 Language recognition \\
                 Error recovery \\
                 Semantic restrictions \\
                 Memory allocation \\
                 Code generation \\
                 A load-and-go system \\
                 Sample C compiler listing",
}


bibtype: book
filename: master.bib
label: Schroeder:1991:FCP
author: Manfred Schroeder
title: Fractals, Chaos, Power Laws
publisher: pub-W-H-FREEMAN
address: pub-W-H-FREEMAN:adr
pages: xviii + 429
year: 1991
ISBN: 0-671-74217-5, 0-7167-2136-8, 0-7167-2357-3 OR 0671742175, 0716721368, 0716723573
LCCN: QD921 .S3 1990
bibdate: Wed Dec 15 10:41:35 1993
bibtimestamp: 1993.12.15 10:41:35 ???
acknowledgement: ack-nhfb
rawauthor: Manfred Schroeder
rawtitle: Fractals, Chaos, Power Laws
ISBN13:
978-0-671-74217-1, 978-0-7167-2136-9, 978-0-7167-2357-8 OR 9780671742171, 9780716721369, 9780716723578

bibsource:
https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib; https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib; https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib; https://www.math.utah.edu/pub/tex/bib/benfords-law.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/pi.bib

abstract:
Reveals the extraordinary dimensions of new mathematical insights about the nature of physical reality; explores the powerful applications of these symmetry concepts in physics, chemistry, music, and the visual arts. Includes such areas as deterministic chaos and strange attractors, iterated mappings, nonlinear dynamics, Cayley trees, cellular automata, random fractals and related topics.

TOC:
Preface / xiii 1: Introduction / 1 Einstein, Pythagoras, and Simple Similarity / 3 A Self-Similar Array of Self-Preserving Queens / 4 A Self-Similar Snowflake / 7 A New Dimension for Fractals / 9 A Self-Similar Tiling and a ``Non-Euclidean'' Paradox / 13 At the Gates of Cantor's Paradise / 15 The Sierpinski Gasket / 17 Sir Pinski's Game and Deterministic Chaos / 20 Three Bodies Cause Chaos / 25 Strange Attractors, Their Basins, and a Chaos Game 2 / 7 Percolating Random Fractals / 30 Power Laws: from Alvarez to Zipf / 33 Newton's Iteration and How to Abolish Two-Nation Boundaries / 38 Could Minkowski Hear the Shape of a Drum? / 40 Discrete Self-Similarity: Creases and Center Folds / 45 Golden and Silver Means and Hyperbolic Chaos / 49 Winning at Fibonacci Nim / 53 Self-Similar Sequences from Square Lattices / 55 John Horton Conway's ``Death Bet'' / 57 2: Similarity and Dissimilarity / 61 More Than One Scale / 61 To Scale or Not to Scale: A Bit of Biology and Astrophysics / 63 Similarity in Physics: Some Astounding Consequences / 66 Similarity in Concert Halls, Microwaves, and Hydrodynamics / 68 Scaling in Psychology / 70 Acousticians, Alchemy, and Concert Halls / 72 Preference and Dissimilarity: Concert Halls Revisited / 74 3: Self-Similarity --- Discrete, Continuous, Strict, and Otherwise / 81 The Logarithmic Spiral, Cutting Knives, and Wideband Antennas / 89 Some Simple Cases of Self-Similarity / 93 Weierstrass Functions and a Musical Paradox / 96 More Self-Similarity in Music: The Tempered Scales of Bach / 99 The Excellent Relations between the Primes 3, 5, and 7 / 102 4: Power Laws: Endless Sources of Self-Similarity / 103 The Sizes of Cities and Meteorites / 103 A Fifth Force of Attraction / 105 Free of Natural Scales / 107 Bach Composing on All Scales / 107 Birkhoff's Aesthetic Theory / 109 Heisenberg's Hyperbolic Uncertainty Principle / 112 Fractional Exponents / 115 The Peculiar Distribution of the First Digit / 116 The Diameter Exponents of Trees, Rivers, Arteries, and Lungs / 117 5: Noises: White, Pink, Brown, and Black / 121 Pink Noise / 122 Self-Similar Trends on the Stock Market / 126 Black Noises and Nile Floods / 129 Warning: World Warming / 131 Fractional Integration: A Modem Tool / 131 Brownian Mountains / 133 Radon Transform and Computer Tomography / 134 Fresh and Tired Mountains / 135 6: Brownian Motion, Gambling Losses, and Intergalactic Voids: Random Fractals Par Excellence / 139 The Brownian Beast Tamed / 140 Brownian Motion as a Fractal / 141 How Many Molecules? / 143 The Spectrum of Brownian Motion / 144 The Gambler's Ruin, Random Walks, and Information Theory / 145 Counterintuition Runs Rampant in Random Runs / 146 More Food for Fair Thought / 147 The St. Petersburg Paradox / 148 Shannon's Outguessing Machine / 149 The Classical Mechanics of Roulette and Shannon's Channel Capacity / 150 The Clustering of Poverty and Galaxies / 152 Levy Flights through the Universe / 155 Paradoxes from Probabilistic Power Laws / 155 Invariant Distributions: Gauss, Cauchy, and Beyond / 157 7: Cantor Sets: Self-Similarity and Arithmetic Dust / 161 A Comer of Cantor's Paradise / 161 Cantor Sets as Invariant Sets / 165 Symbolic Dynamics and Deterministic Chaos / 166 Devil's Staircases and a Pinball Machine / 167 Mode Locking in Swings and Clocks / 171 The Frustrated Manhattan Pedestrian / 172 Arnold Tongues 17 / 4 8: Fractals in Higher Dimensions and a Digital Sundial / 177 Cartesian Products of Cantor Sets / 177 A Leaky Gasket, Soft Sponges, and Swiss Cheeses / 178 A Cantor-Set Sundial / 181 Fat Fractals / 183 9: Multifractals: Intimately Intertwined Fractals / 187 The Distributions of People and Ore / 187 Self-Affine Fractals without Holes / 190 The Multifractal Spectrum: Turbulence and Diffusion-Limited Aggregation / 193 Viscous Fingering / 199 Multifractals on Fractals / 200 Fractal Dimensions from Generalized Entropies / 203 The Relation between the Multifractal Spectrum $f(alpha )$ and the Mass Exponents $(q)$ / 205 Strange Attractors as Multifractals / 206 A Greedy Algorithm for Unfavorable Odds / 207 10: Some Practical Fractals and Their Measurement / 211 Dimensions from Box Counting / 213 The Mass Dimension / 215 The Correlation Dimension / 220 Infinitely Many Dimensions / 220 The Determination of Fractal Dimensions from Time Series / 223 Abstract Concrete / 224 Fractal Interfaces Enforce Fractional Frequency Exponents / 225 The Fractal Dimensions of Fracture Surfaces / 230 The Fractal Shapes of Clouds and Rain Areas / 231 Cluster Agglomeration / 232 Diffraction from Fractals / 233 11: Iteration, Strange Mappings, and a Billion Digits for Pi / 237 Looking for Zeros and Encountering Chaos / 239 The Strange Sets of Julia / 243 A Multifractal Julia Set / 245 The Beauty of Broken Linear Relationships / 249 The Baker's Transformation and Digital Musical Chairs / 251 Arnol'd's Cat Map / 253 A Billion Digits for $pi $ / 257 Bushes and Flowers from Iterations / 259 12: A Self-Similar Sequence, the Logistic Parabola, and Symbolic Dynamics / 263 Self-Similarity from the Integers / 264 The Logistic Parabola and Period Doubling / 268 Self-Similarity in the Logistic Parabola / 272 The Scaling of the Growth Parameter / 274 Self-Similar Symbolic Dynamics / 277 Periodic Windows Embedded in Chaos / 279 The Parenting of New Orbits / 282 The Calculation of the Growth Parameters for Different Orbits / 286 Tangent Bifurcations, Intermittency, and I/f Noise / 289 A Case of Complete Chaos / 291 The Mandelbrot Set / 295 The Julia Sets of the Complex Quadratic Map / 297 13: A Forbidden Symmetry, Fibonacci's Rabbits, and a New State of Matter / 301 The Forbidden Fivefold Symmetry / 301 Long-Range Order from Neighborly Interactions / 304 Generation of the Rabbit Sequence from the Fibonacci Number System / 307 The Self-Similar Spectrum of the Rabbit Sequence / 308 Self-Similarity in the Rabbit Sequence / 310 A One-Dimensional Quasiperiodic Lattice / 310 Self-Similarity from Projections / 311 More Forbidden Symmetries / 315 14: Periodic and Quasiperiodic Structures in Space --- The route to Spatial Chaos / 319 Periodicity and Quasiperiodicity in Space / 320 The Devil's Staircase for Ising Spins / 321 Quasiperiodic Spatial Distributions / 322 Beatty Sequence Spins / 325 The Scaling Laws for Quasiperiodic Spins / 329 Self-Similar Winding Numbers / 330 Circle Maps and Arnold Tongues / 331 Mediants, Farey Sequences, and the Farey Tree / 334 The Golden-Mean Route to Chaos / 340 15: Percolation: From Forest Fires to Epidemics / 345 Critical Conflagration on a Square Lattice / 346 Universality / 350 The Critical Density / 353 The Fractal Perimeters of Percolation / 353 Finite-Size Scaling / 354 16: Phase Transitions and Renormalization / 357 A First-Order Markov Process / 357 Self-Similar and Non-Self-Similar Markov Processes / 358 The Scaling of Markov Output's / 360 Renormalization and Hierarchical Lattices / 362 The Percolation Threshold of the Bethe Lattice / 363 A Simple Renormalization / 367 17: Cellular Automata / 371 The Game of Life / 373 Cellular Growth and Decay / 375 Biological Pattern Formation / 382 Self-Similarity from a Cellular Automaton / 383 A Catalytic Converter as a Cellular Automaton / 386 Pascal's Triangle Modulo $N$ / 387 Bak's Self-Organized Critical Sandpiles / 389 Appendix / 391 References / 395 Author Index / 411 Subject Index / 417

rawabstract:
Reveals the extraordinary dimensions of new mathematical insights about the nature of physical reality; explores the powerful applications of these symmetry concepts in physics, chemistry, music, and the visual arts. Includes such areas as deterministic chaos and strange attractors, iterated mappings, nonlinear dynamics, Cayley trees, cellular automata, random fractals and related topics.

shortTOC:
Introduction Similarity and dissimilarity Self-similarity --- discrete, continuous, strict, and otherwise Power laws: endless sources of self-similarity Noises: white, pink, brown, and black Brownian motion, gambling losses, and intergalactic voids: random fractals par excellence Cantor sets: self-similarity and arithmetic dust Fractals in higher dimensions and a digital sundial Multifractals: intimately intertwined fractals Some practical fractals and their measurement Iteration, strange mappings, and a billion digits for $pi $ A self-similar sequence, the logistic parabola, and symbolic dynamics A forbidden symmetry, Fibonacci's rabbits, and a new state of matter Periodic and quasiperiodic structures in space --- the route to spatial chaos Percolation: from forest fires to epidemics Phase transitions and renormalization Cellular automata

rawshortTOC:
Introduction \\ Similarity and dissimilarity \\ Self-similarity --- discrete, continuous, strict, and otherwise \\ Power laws: endless sources of self-similarity \\ Noises: white, pink, brown, and black \\ Brownian motion, gambling losses, and intergalactic voids: random fractals par excellence \\ Cantor sets: self-similarity and arithmetic dust \\ Fractals in higher dimensions and a digital sundial \\ Multifractals: intimately intertwined fractals \\ Some practical fractals and their measurement \\ Iteration, strange mappings, and a billion digits for $\pi$ \\ A self-similar sequence, the logistic parabola, and symbolic dynamics \\ A forbidden symmetry, Fibonacci's rabbits, and a new state of matter \\ Periodic and quasiperiodic structures in space --- the route to spatial chaos \\ Percolation: from forest fires to epidemics \\ Phase transitions and renormalization \\ Cellular automata

rawTOC:
Preface / xiii \\ 1: Introduction / 1 \\ Einstein, Pythagoras, and Simple Similarity / 3 \\ A Self-Similar Array of Self-Preserving Queens / 4 \\ A Self-Similar Snowflake / 7 \\ A New Dimension for Fractals / 9 \\ A Self-Similar Tiling and a ``Non-Euclidean'' Paradox / 13 \\ At the Gates of Cantor's Paradise / 15 \\ The Sierpinski Gasket / 17 \\ Sir Pinski's Game and Deterministic Chaos / 20 \\ Three Bodies Cause Chaos / 25 \\ Strange Attractors, Their Basins, and a Chaos Game 2 / 7 \\ Percolating Random Fractals / 30 \\ Power Laws: from Alvarez to Zipf / 33 \\ Newton's Iteration and How to Abolish Two-Nation Boundaries / 38 \\ Could Minkowski Hear the Shape of a Drum? / 40 \\ Discrete Self-Similarity: Creases and Center Folds / 45 \\ Golden and Silver Means and Hyperbolic Chaos / 49 \\ Winning at Fibonacci Nim / 53 \\ Self-Similar Sequences from Square Lattices / 55 \\ John Horton Conway's ``Death Bet'' / 57 \\ 2: Similarity and Dissimilarity / 61 \\ More Than One Scale / 61 \\ To Scale or Not to Scale: A Bit of Biology and Astrophysics / 63 \\ Similarity in Physics: Some Astounding Consequences / 66 \\ Similarity in Concert Halls, Microwaves, and Hydrodynamics / 68 \\ Scaling in Psychology / 70 \\ Acousticians, Alchemy, and Concert Halls / 72 \\ Preference and Dissimilarity: Concert Halls Revisited / 74 \\ 3: Self-Similarity --- Discrete, Continuous, Strict, and Otherwise / 81 \\ The Logarithmic Spiral, Cutting Knives, and Wideband Antennas / 89 \\ Some Simple Cases of Self-Similarity / 93 \\ Weierstrass Functions and a Musical Paradox / 96 \\ More Self-Similarity in Music: The Tempered Scales of Bach / 99 \\ The Excellent Relations between the Primes 3, 5, and 7 / 102 \\ 4: Power Laws: Endless Sources of Self-Similarity / 103 \\ The Sizes of Cities and Meteorites / 103 \\ A Fifth Force of Attraction / 105 \\ Free of Natural Scales / 107 \\ Bach Composing on All Scales / 107 \\ Birkhoff's Aesthetic Theory / 109 \\ Heisenberg's Hyperbolic Uncertainty Principle / 112 \\ Fractional Exponents / 115 \\ The Peculiar Distribution of the First Digit / 116 \\ The Diameter Exponents of Trees, Rivers, Arteries, and Lungs / 117 \\ 5: Noises: White, Pink, Brown, and Black / 121 \\ Pink Noise / 122 \\ Self-Similar Trends on the Stock Market / 126 \\ Black Noises and Nile Floods / 129 \\ Warning: World Warming / 131 \\ Fractional Integration: A Modem Tool / 131 \\ Brownian Mountains / 133 \\ Radon Transform and Computer Tomography / 134 \\ Fresh and Tired Mountains / 135 \\ 6: Brownian Motion, Gambling Losses, and Intergalactic Voids: Random Fractals Par Excellence / 139 \\ The Brownian Beast Tamed / 140 \\ Brownian Motion as a Fractal / 141 \\ How Many Molecules? / 143 \\ The Spectrum of Brownian Motion / 144 \\ The Gambler's Ruin, Random Walks, and Information Theory / 145 \\ Counterintuition Runs Rampant in Random Runs / 146 \\ More Food for Fair Thought / 147 \\ The St. Petersburg Paradox / 148 \\ Shannon's Outguessing Machine / 149 \\ The Classical Mechanics of Roulette and Shannon's Channel Capacity / 150 \\ The Clustering of Poverty and Galaxies / 152 \\ Levy Flights through the Universe / 155 \\ Paradoxes from Probabilistic Power Laws / 155 \\ Invariant Distributions: Gauss, Cauchy, and Beyond / 157 \\ 7: Cantor Sets: Self-Similarity and Arithmetic Dust / 161 \\ A Comer of Cantor's Paradise / 161 \\ Cantor Sets as Invariant Sets / 165 \\ Symbolic Dynamics and Deterministic Chaos / 166 \\ Devil's Staircases and a Pinball Machine / 167 \\ Mode Locking in Swings and Clocks / 171 \\ The Frustrated Manhattan Pedestrian / 172 \\ Arnold Tongues 17 / 4 \\ 8: Fractals in Higher Dimensions and a Digital Sundial / 177 \\ Cartesian Products of Cantor Sets / 177 \\ A Leaky Gasket, Soft Sponges, and Swiss Cheeses / 178 \\ A Cantor-Set Sundial / 181 \\ Fat Fractals / 183 \\ 9: Multifractals: Intimately Intertwined Fractals / 187 \\ The Distributions of People and Ore / 187 \\ Self-Affine Fractals without Holes / 190 \\ The Multifractal Spectrum: Turbulence and Diffusion-Limited Aggregation / 193 \\ Viscous Fingering / 199 \\ Multifractals on Fractals / 200 \\ Fractal Dimensions from Generalized Entropies / 203 \\ The Relation between the Multifractal Spectrum $f(\alpha)$ and the Mass Exponents $(q)$ / 205 \\ Strange Attractors as Multifractals / 206 \\ A Greedy Algorithm for Unfavorable Odds / 207 \\ 10: Some Practical Fractals and Their Measurement / 211 \\ Dimensions from Box Counting / 213 \\ The Mass Dimension / 215 \\ The Correlation Dimension / 220 \\ Infinitely Many Dimensions / 220 \\ The Determination of Fractal Dimensions from Time Series / 223 \\ Abstract Concrete / 224 \\ Fractal Interfaces Enforce Fractional Frequency Exponents / 225 \\ The Fractal Dimensions of Fracture Surfaces / 230 \\ The Fractal Shapes of Clouds and Rain Areas / 231 \\ Cluster Agglomeration / 232 \\ Diffraction from Fractals / 233 \\ 11: Iteration, Strange Mappings, and a Billion Digits for Pi / 237 \\ Looking for Zeros and Encountering Chaos / 239 \\ The Strange Sets of Julia / 243 \\ A Multifractal Julia Set / 245 \\ The Beauty of Broken Linear Relationships / 249 \\ The Baker's Transformation and Digital Musical Chairs / 251 \\ Arnol'd's Cat Map / 253 \\ A Billion Digits for $\pi$ / 257 \\ Bushes and Flowers from Iterations / 259 \\ 12: A Self-Similar Sequence, the Logistic Parabola, and Symbolic Dynamics / 263 \\ Self-Similarity from the Integers / 264 \\ The Logistic Parabola and Period Doubling / 268 \\ Self-Similarity in the Logistic Parabola / 272 \\ The Scaling of the Growth Parameter / 274 \\ Self-Similar Symbolic Dynamics / 277 \\ Periodic Windows Embedded in Chaos / 279 \\ The Parenting of New Orbits / 282 \\ The Calculation of the Growth Parameters for Different Orbits / 286 \\ Tangent Bifurcations, Intermittency, and I/f Noise / 289 \\ A Case of Complete Chaos / 291 \\ The Mandelbrot Set / 295 \\ The Julia Sets of the Complex Quadratic Map / 297 \\ 13: A Forbidden Symmetry, Fibonacci's Rabbits, and a New State of Matter / 301 \\ The Forbidden Fivefold Symmetry / 301 \\ Long-Range Order from Neighborly Interactions / 304 \\ Generation of the Rabbit Sequence from the Fibonacci Number System / 307 \\ The Self-Similar Spectrum of the Rabbit Sequence / 308 \\ Self-Similarity in the Rabbit Sequence / 310 \\ A One-Dimensional Quasiperiodic Lattice / 310 \\ Self-Similarity from Projections / 311 \\ More Forbidden Symmetries / 315 \\ 14: Periodic and Quasiperiodic Structures in Space --- The route to Spatial Chaos / 319 \\ Periodicity and Quasiperiodicity in Space / 320 \\ The Devil's Staircase for Ising Spins / 321 \\ Quasiperiodic Spatial Distributions / 322 \\ Beatty Sequence Spins / 325 \\ The Scaling Laws for Quasiperiodic Spins / 329 \\ Self-Similar Winding Numbers / 330 \\ Circle Maps and Arnold Tongues / 331 \\ Mediants, Farey Sequences, and the Farey Tree / 334 \\ The Golden-Mean Route to Chaos / 340 \\ 15: Percolation: From Forest Fires to Epidemics / 345 \\ Critical Conflagration on a Square Lattice / 346 \\ Universality / 350 \\ The Critical Density / 353 \\ The Fractal Perimeters of Percolation / 353 \\ Finite-Size Scaling / 354 \\ 16: Phase Transitions and Renormalization / 357 \\ A First-Order Markov Process / 357 \\ Self-Similar and Non-Self-Similar Markov Processes / 358 \\ The Scaling of Markov Output's / 360 \\ Renormalization and Hierarchical Lattices / 362 \\ The Percolation Threshold of the Bethe Lattice / 363 \\ A Simple Renormalization / 367 \\ 17: Cellular Automata / 371 \\ The Game of Life / 373 \\ Cellular Growth and Decay / 375 \\ Biological Pattern Formation / 382 \\ Self-Similarity from a Cellular Automaton / 383 \\ A Catalytic Converter as a Cellular Automaton / 386 \\ Pascal's Triangle Modulo $N$ / 387 \\ Bak's Self-Organized Critical Sandpiles / 389 \\ Appendix / 391 \\ References / 395 \\ Author Index / 411 \\ Subject Index / 417

entry:
@Book{Schroeder:1991:FCP,
  author =       "Manfred Schroeder",
  title =        "Fractals, Chaos, Power Laws",
  publisher =    pub-W-H-FREEMAN,
  address =      pub-W-H-FREEMAN:adr,
  pages =        "xviii + 429",
  year =         "1991",
  ISBN =         "0-671-74217-5, 0-7167-2136-8, 0-7167-2357-3",
  ISBN-13 =      "978-0-671-74217-1, 978-0-7167-2136-9,
                 978-0-7167-2357-8",
  LCCN =         "QD921 .S3 1990",
  bibdate =      "Wed Dec 15 10:41:35 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/heisenberg-werner.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
                 https://www.math.utah.edu/pub/tex/bib/benfords-law.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/pi.bib",
  abstract =     "Reveals the extraordinary dimensions of new
                 mathematical insights about the nature of physical
                 reality; explores the powerful applications of these
                 symmetry concepts in physics, chemistry, music, and the
                 visual arts. Includes such areas as deterministic chaos
                 and strange attractors, iterated mappings, nonlinear
                 dynamics, Cayley trees, cellular automata, random
                 fractals and related topics.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Introduction \\
                 Similarity and dissimilarity \\
                 Self-similarity --- discrete, continuous, strict, and
                 otherwise \\
                 Power laws: endless sources of self-similarity \\
                 Noises: white, pink, brown, and black \\
                 Brownian motion, gambling losses, and intergalactic
                 voids: random fractals par excellence \\
                 Cantor sets: self-similarity and arithmetic dust \\
                 Fractals in higher dimensions and a digital sundial \\
                 Multifractals: intimately intertwined fractals \\
                 Some practical fractals and their measurement \\
                 Iteration, strange mappings, and a billion digits for
                 $\pi$ \\
                 A self-similar sequence, the logistic parabola, and
                 symbolic dynamics \\
                 A forbidden symmetry, Fibonacci's rabbits, and a new
                 state of matter \\
                 Periodic and quasiperiodic structures in space --- the
                 route to spatial chaos \\
                 Percolation: from forest fires to epidemics \\
                 Phase transitions and renormalization \\
                 Cellular automata",
  tableofcontents = "Preface / xiii \\
                 1: Introduction / 1 \\
                 Einstein, Pythagoras, and Simple Similarity / 3 \\
                 A Self-Similar Array of Self-Preserving Queens / 4 \\
                 A Self-Similar Snowflake / 7 \\
                 A New Dimension for Fractals / 9 \\
                 A Self-Similar Tiling and a ``Non-Euclidean'' Paradox /
                 13 \\
                 At the Gates of Cantor's Paradise / 15 \\
                 The Sierpinski Gasket / 17 \\
                 Sir Pinski's Game and Deterministic Chaos / 20 \\
                 Three Bodies Cause Chaos / 25 \\
                 Strange Attractors, Their Basins, and a Chaos Game 2 /
                 7 \\
                 Percolating Random Fractals / 30 \\
                 Power Laws: from Alvarez to Zipf / 33 \\
                 Newton's Iteration and How to Abolish Two-Nation
                 Boundaries / 38 \\
                 Could Minkowski Hear the Shape of a Drum? / 40 \\
                 Discrete Self-Similarity: Creases and Center Folds / 45
                 \\
                 Golden and Silver Means and Hyperbolic Chaos / 49 \\
                 Winning at Fibonacci Nim / 53 \\
                 Self-Similar Sequences from Square Lattices / 55 \\
                 John Horton Conway's ``Death Bet'' / 57 \\
                 2: Similarity and Dissimilarity / 61 \\
                 More Than One Scale / 61 \\
                 To Scale or Not to Scale: A Bit of Biology and
                 Astrophysics / 63 \\
                 Similarity in Physics: Some Astounding Consequences /
                 66 \\
                 Similarity in Concert Halls, Microwaves, and
                 Hydrodynamics / 68 \\
                 Scaling in Psychology / 70 \\
                 Acousticians, Alchemy, and Concert Halls / 72 \\
                 Preference and Dissimilarity: Concert Halls Revisited /
                 74 \\
                 3: Self-Similarity --- Discrete, Continuous, Strict,
                 and Otherwise / 81 \\
                 The Logarithmic Spiral, Cutting Knives, and Wideband
                 Antennas / 89 \\
                 Some Simple Cases of Self-Similarity / 93 \\
                 Weierstrass Functions and a Musical Paradox / 96 \\
                 More Self-Similarity in Music: The Tempered Scales of
                 Bach / 99 \\
                 The Excellent Relations between the Primes 3, 5, and 7
                 / 102 \\
                 4: Power Laws: Endless Sources of Self-Similarity / 103
                 \\
                 The Sizes of Cities and Meteorites / 103 \\
                 A Fifth Force of Attraction / 105 \\
                 Free of Natural Scales / 107 \\
                 Bach Composing on All Scales / 107 \\
                 Birkhoff's Aesthetic Theory / 109 \\
                 Heisenberg's Hyperbolic Uncertainty Principle / 112 \\
                 Fractional Exponents / 115 \\
                 The Peculiar Distribution of the First Digit / 116 \\
                 The Diameter Exponents of Trees, Rivers, Arteries, and
                 Lungs / 117 \\
                 5: Noises: White, Pink, Brown, and Black / 121 \\
                 Pink Noise / 122 \\
                 Self-Similar Trends on the Stock Market / 126 \\
                 Black Noises and Nile Floods / 129 \\
                 Warning: World Warming / 131 \\
                 Fractional Integration: A Modem Tool / 131 \\
                 Brownian Mountains / 133 \\
                 Radon Transform and Computer Tomography / 134 \\
                 Fresh and Tired Mountains / 135 \\
                 6: Brownian Motion, Gambling Losses, and Intergalactic
                 Voids: Random Fractals Par Excellence / 139 \\
                 The Brownian Beast Tamed / 140 \\
                 Brownian Motion as a Fractal / 141 \\
                 How Many Molecules? / 143 \\
                 The Spectrum of Brownian Motion / 144 \\
                 The Gambler's Ruin, Random Walks, and Information
                 Theory / 145 \\
                 Counterintuition Runs Rampant in Random Runs / 146 \\
                 More Food for Fair Thought / 147 \\
                 The St. Petersburg Paradox / 148 \\
                 Shannon's Outguessing Machine / 149 \\
                 The Classical Mechanics of Roulette and Shannon's
                 Channel Capacity / 150 \\
                 The Clustering of Poverty and Galaxies / 152 \\
                 Levy Flights through the Universe / 155 \\
                 Paradoxes from Probabilistic Power Laws / 155 \\
                 Invariant Distributions: Gauss, Cauchy, and Beyond /
                 157 \\
                 7: Cantor Sets: Self-Similarity and Arithmetic Dust /
                 161 \\
                 A Comer of Cantor's Paradise / 161 \\
                 Cantor Sets as Invariant Sets / 165 \\
                 Symbolic Dynamics and Deterministic Chaos / 166 \\
                 Devil's Staircases and a Pinball Machine / 167 \\
                 Mode Locking in Swings and Clocks / 171 \\
                 The Frustrated Manhattan Pedestrian / 172 \\
                 Arnold Tongues 17 / 4 \\
                 8: Fractals in Higher Dimensions and a Digital Sundial
                 / 177 \\
                 Cartesian Products of Cantor Sets / 177 \\
                 A Leaky Gasket, Soft Sponges, and Swiss Cheeses / 178
                 \\
                 A Cantor-Set Sundial / 181 \\
                 Fat Fractals / 183 \\
                 9: Multifractals: Intimately Intertwined Fractals / 187
                 \\
                 The Distributions of People and Ore / 187 \\
                 Self-Affine Fractals without Holes / 190 \\
                 The Multifractal Spectrum: Turbulence and
                 Diffusion-Limited Aggregation / 193 \\
                 Viscous Fingering / 199 \\
                 Multifractals on Fractals / 200 \\
                 Fractal Dimensions from Generalized Entropies / 203 \\
                 The Relation between the Multifractal Spectrum
                 $f(\alpha)$ and the Mass Exponents $(q)$ / 205 \\
                 Strange Attractors as Multifractals / 206 \\
                 A Greedy Algorithm for Unfavorable Odds / 207 \\
                 10: Some Practical Fractals and Their Measurement / 211
                 \\
                 Dimensions from Box Counting / 213 \\
                 The Mass Dimension / 215 \\
                 The Correlation Dimension / 220 \\
                 Infinitely Many Dimensions / 220 \\
                 The Determination of Fractal Dimensions from Time
                 Series / 223 \\
                 Abstract Concrete / 224 \\
                 Fractal Interfaces Enforce Fractional Frequency
                 Exponents / 225 \\
                 The Fractal Dimensions of Fracture Surfaces / 230 \\
                 The Fractal Shapes of Clouds and Rain Areas / 231 \\
                 Cluster Agglomeration / 232 \\
                 Diffraction from Fractals / 233 \\
                 11: Iteration, Strange Mappings, and a Billion Digits
                 for Pi / 237 \\
                 Looking for Zeros and Encountering Chaos / 239 \\
                 The Strange Sets of Julia / 243 \\
                 A Multifractal Julia Set / 245 \\
                 The Beauty of Broken Linear Relationships / 249 \\
                 The Baker's Transformation and Digital Musical Chairs /
                 251 \\
                 Arnol'd's Cat Map / 253 \\
                 A Billion Digits for $\pi$ / 257 \\
                 Bushes and Flowers from Iterations / 259 \\
                 12: A Self-Similar Sequence, the Logistic Parabola, and
                 Symbolic Dynamics / 263 \\
                 Self-Similarity from the Integers / 264 \\
                 The Logistic Parabola and Period Doubling / 268 \\
                 Self-Similarity in the Logistic Parabola / 272 \\
                 The Scaling of the Growth Parameter / 274 \\
                 Self-Similar Symbolic Dynamics / 277 \\
                 Periodic Windows Embedded in Chaos / 279 \\
                 The Parenting of New Orbits / 282 \\
                 The Calculation of the Growth Parameters for Different
                 Orbits / 286 \\
                 Tangent Bifurcations, Intermittency, and I/f Noise /
                 289 \\
                 A Case of Complete Chaos / 291 \\
                 The Mandelbrot Set / 295 \\
                 The Julia Sets of the Complex Quadratic Map / 297 \\
                 13: A Forbidden Symmetry, Fibonacci's Rabbits, and a
                 New State of Matter / 301 \\
                 The Forbidden Fivefold Symmetry / 301 \\
                 Long-Range Order from Neighborly Interactions / 304 \\
                 Generation of the Rabbit Sequence from the Fibonacci
                 Number System / 307 \\
                 The Self-Similar Spectrum of the Rabbit Sequence / 308
                 \\
                 Self-Similarity in the Rabbit Sequence / 310 \\
                 A One-Dimensional Quasiperiodic Lattice / 310 \\
                 Self-Similarity from Projections / 311 \\
                 More Forbidden Symmetries / 315 \\
                 14: Periodic and Quasiperiodic Structures in Space ---
                 The route to Spatial Chaos / 319 \\
                 Periodicity and Quasiperiodicity in Space / 320 \\
                 The Devil's Staircase for Ising Spins / 321 \\
                 Quasiperiodic Spatial Distributions / 322 \\
                 Beatty Sequence Spins / 325 \\
                 The Scaling Laws for Quasiperiodic Spins / 329 \\
                 Self-Similar Winding Numbers / 330 \\
                 Circle Maps and Arnold Tongues / 331 \\
                 Mediants, Farey Sequences, and the Farey Tree / 334 \\
                 The Golden-Mean Route to Chaos / 340 \\
                 15: Percolation: From Forest Fires to Epidemics / 345
                 \\
                 Critical Conflagration on a Square Lattice / 346 \\
                 Universality / 350 \\
                 The Critical Density / 353 \\
                 The Fractal Perimeters of Percolation / 353 \\
                 Finite-Size Scaling / 354 \\
                 16: Phase Transitions and Renormalization / 357 \\
                 A First-Order Markov Process / 357 \\
                 Self-Similar and Non-Self-Similar Markov Processes /
                 358 \\
                 The Scaling of Markov Output's / 360 \\
                 Renormalization and Hierarchical Lattices / 362 \\
                 The Percolation Threshold of the Bethe Lattice / 363
                 \\
                 A Simple Renormalization / 367 \\
                 17: Cellular Automata / 371 \\
                 The Game of Life / 373 \\
                 Cellular Growth and Decay / 375 \\
                 Biological Pattern Formation / 382 \\
                 Self-Similarity from a Cellular Automaton / 383 \\
                 A Catalytic Converter as a Cellular Automaton / 386 \\
                 Pascal's Triangle Modulo $N$ / 387 \\
                 Bak's Self-Organized Critical Sandpiles / 389 \\
                 Appendix / 391 \\
                 References / 395 \\
                 Author Index / 411 \\
                 Subject Index / 417",
}


bibtype: book
filename: master.bib
label: Schroeder:1998:VT
author: William J. Schroeder and Kenneth M. Martin and William E. Lorensen
title: The Visualization Toolkit
publisher: pub-PH
address: pub-PH:adr
edition: Second
pages: xx + 645
year: 1998
ISBN: 0-13-954694-4 OR 0139546944
ISBN13: 978-0-13-954694-5 OR 9780139546945
LCCN: QA76.64.S36 1997
bibdate: Mon Apr 13 10:46:55 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.04.13 10:46:55 ???
acknowledgement: ack-nhfb
rawauthor: William J. Schroeder and Kenneth M. Martin and William E. Lorensen
rawtitle: The Visualization Toolkit
note:
With special contributors Lisa Sobierajski Avila, Rick Avila, and C. Charles Law. Includes CD-ROM with vtk-2.0. The most recent release is available on the World-Wide Web at path =http://www.kitware.com/vtk.html=.

TOC:
Introduction Object-oriented design Computer graphics primer The visualization pipeline Basic data representation Fundamental algorithms Advanced computer graphics Color plates Advanced data representation Advanced algorithms Image processing Interpreters and Tcl/Tk Visualization on the web Applications Appendix A: Software guide Appendix B: CD-ROM organization Glossary

rawnote:
With special contributors Lisa Sobierajski Avila, Rick Avila, and C. Charles Law. Includes CD-ROM with vtk-2.0. The most recent release is available on the World-Wide Web at \path=http://www.kitware.com/vtk.html=.

rawTOC:
Introduction \\ Object-oriented design \\ Computer graphics primer \\ The visualization pipeline \\ Basic data representation \\ Fundamental algorithms \\ Advanced computer graphics \\ Color plates \\ Advanced data representation \\ Advanced algorithms \\ Image processing \\ Interpreters and Tcl/Tk \\ Visualization on the web \\ Applications \\ Appendix A: Software guide \\ Appendix B: CD-ROM organization \\ Glossary

entry:
@Book{Schroeder:1998:VT,
  author =       "William J. Schroeder and Kenneth M. Martin and William
                 E. Lorensen",
  title =        "The Visualization Toolkit",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xx + 645",
  year =         "1998",
  ISBN =         "0-13-954694-4",
  ISBN-13 =      "978-0-13-954694-5",
  LCCN =         "QA76.64.S36 1997",
  bibdate =      "Mon Apr 13 10:46:55 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "With special contributors Lisa Sobierajski Avila, Rick
                 Avila, and C. Charles Law. Includes CD-ROM with
                 vtk-2.0. The most recent release is available on the
                 World-Wide Web at
                 \path=http://www.kitware.com/vtk.html=.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Introduction \\
                 Object-oriented design \\
                 Computer graphics primer \\
                 The visualization pipeline \\
                 Basic data representation \\
                 Fundamental algorithms \\
                 Advanced computer graphics \\
                 Color plates \\
                 Advanced data representation \\
                 Advanced algorithms \\
                 Image processing \\
                 Interpreters and Tcl/Tk \\
                 Visualization on the web \\
                 Applications \\
                 Appendix A: Software guide \\
                 Appendix B: CD-ROM organization \\
                 Glossary",
}


bibtype: book
filename: master.bib
label: Schwarz:1988:ET
author: Norbert Schwarz
title: Einfuhrung in TeX
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: 272
year: 1988
ISBN: 3-925118-97-7 OR 3925118977
ISBN13: 978-3-925118-97-5 OR 9783925118975
bibdate: Wed Dec 15 18:20:05 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 18:20:05 ???
acknowledgement: ack-nhfb
rawauthor: Norbert Schwarz
rawtitle: Einf{\"u}hrung in {\TeX{}}
entry:
@Book{Schwarz:1988:ET,
  author =       "Norbert Schwarz",
  title =        "Einf{\"u}hrung in {\TeX{}}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "272",
  year =         "1988",
  ISBN =         "3-925118-97-7",
  ISBN-13 =      "978-3-925118-97-5",
  bibdate =      "Wed Dec 15 18:20:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "DM 68",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Schweber:2008:EOM
author: S. S. (Silvan S.) Schweber
title: Einstein and Oppenheimer: the meaning of genius
publisher: pub-HARVARD
address: pub-HARVARD:adr
pages: xiv + 412
year: 2008
ISBN: 0-674-02828-7 OR 0674028287
ISBN13: 978-0-674-02828-9 OR 9780674028289
LCCN: QC16.E5 S3285 2008
bibdate: Thu Sep 18 21:33:15 MDT 2008
bibtimestamp: 2008.09.18 21:33:15 MDT
URL: http://www.loc.gov/catdir/toc/ecip082/2007043108.html
acknowledgement: ack-nhfb
subjectdates: 1879--1955; 1904--1967
rawauthor: S. S. (Silvan S.) Schweber
rawtitle: {Einstein} and {Oppenheimer}: the meaning of genius
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib; https://www.math.utah.edu/pub/tex/bib/einstein.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

subject:
Einstein, Albert; Oppenheimer, J. Robert; physicists; intellectual Life; 20th Century; psychology; science; history

TOC:
Albert Einstein and nuclear weapons Albert Einstein and the founding of Brandeis University J. Robert Oppenheimer: proteus unbound J. Robert Oppenheimer and American pragmatism Einstein, Oppenheimer, and the extension of physics Einstein, Oppenheimer, and the meaning of community

rawTOC:
Albert Einstein and nuclear weapons \\ Albert Einstein and the founding of Brandeis University \\ J. Robert Oppenheimer: proteus unbound \\ J. Robert Oppenheimer and American pragmatism \\ Einstein, Oppenheimer, and the extension of physics \\ Einstein, Oppenheimer, and the meaning of community

entry:
@Book{Schweber:2008:EOM,
  author =       "S. S. (Silvan S.) Schweber",
  title =        "{Einstein} and {Oppenheimer}: the meaning of genius",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "xiv + 412",
  year =         "2008",
  ISBN =         "0-674-02828-7",
  ISBN-13 =      "978-0-674-02828-9",
  LCCN =         "QC16.E5 S3285 2008",
  bibdate =      "Thu Sep 18 21:33:15 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/o/oppenheimer-j-robert.bib;
                 https://www.math.utah.edu/pub/tex/bib/einstein.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip082/2007043108.html",
  acknowledgement = ack-nhfb,
  subject =      "Einstein, Albert; Oppenheimer, J. Robert; physicists;
                 intellectual Life; 20th Century; psychology; science;
                 history",
  subject-dates = "1879--1955; 1904--1967",
  tableofcontents = "Albert Einstein and nuclear weapons \\
                 Albert Einstein and the founding of Brandeis University
                 \\
                 J. Robert Oppenheimer: proteus unbound \\
                 J. Robert Oppenheimer and American pragmatism \\
                 Einstein, Oppenheimer, and the extension of physics \\
                 Einstein, Oppenheimer, and the meaning of community",
}


bibtype: book
filename: master.bib
label: Schweber:2012:NFM
author: S. S. (Silvan S.) Schweber
title: Nuclear forces: the making of the physicist Hans Bethe
publisher: pub-HARVARD
address: pub-HARVARD:adr
pages: viii + 579 + 12
year: 2012
ISBN: 0-674-06587-5 (hardcover) OR 0674065875 (hardcover)
ISBN13: 978-0-674-06587-1 (hardcover) OR 9780674065871 (hardcover)
LCCN: QC774.B4 S39 2012
bibdate: Mon Nov 19 13:35:16 MST 2012
bibtimestamp: 2012.11.19 13:35:16 MST
subject: Bethe, Hans A; (Hans Albrecht); Nuclear physicists; Biography
acknowledgement: ack-nhfb
subjectdates: 1906--2005
rawauthor: S. S. (Silvan S.) Schweber
rawtitle: Nuclear forces: the making of the physicist {Hans Bethe}
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib; https://www.math.utah.edu/pub/tex/bib/bjhs2010.bib; https://www.math.utah.edu/pub/tex/bib/hsns.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; jenson.stanford.edu:2210/unicorn; library.ox.ac.uk:210/ADVANCE

TOC:
Growing Up Maturing Becoming Bethe Beyond the Doctorate: 1928--1933 England, 1933--1935 Hilde Levi Cornell University The Happy Thirties Rose Ewald Bethe Conclusion: Past and Future Appendix A: The Bethe Family Genealogy Appendix B: Courses Taken at Frankfurt University Appendix C: A Brief History of the Genesis of Quantum Mechanics Appendix D: Courses Taken at Munich University Appendix E: Bethe's Doctoral Thesis Appendix F: The Habilitationsschrift Defense

rawTOC:
Growing Up \\ Maturing \\ Becoming Bethe \\ Beyond the Doctorate: 1928--1933 \\ England, 1933--1935 \\ Hilde Levi \\ Cornell University \\ The Happy Thirties \\ Rose Ewald Bethe \\ Conclusion: Past and Future \\ Appendix A: The Bethe Family Genealogy \\ Appendix B: Courses Taken at Frankfurt University \\ Appendix C: A Brief History of the Genesis of Quantum Mechanics \\ Appendix D: Courses Taken at Munich University \\ Appendix E: Bethe's Doctoral Thesis \\ Appendix F: The Habilitationsschrift Defense

entry:
@Book{Schweber:2012:NFM,
  author =       "S. S. (Silvan S.) Schweber",
  title =        "Nuclear forces: the making of the physicist {Hans
                 Bethe}",
  publisher =    pub-HARVARD,
  address =      pub-HARVARD:adr,
  pages =        "viii + 579 + 12",
  year =         "2012",
  ISBN =         "0-674-06587-5 (hardcover)",
  ISBN-13 =      "978-0-674-06587-1 (hardcover)",
  LCCN =         "QC774.B4 S39 2012",
  bibdate =      "Mon Nov 19 13:35:16 MST 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/b/bethe-hans.bib;
                 https://www.math.utah.edu/pub/tex/bib/bjhs2010.bib;
                 https://www.math.utah.edu/pub/tex/bib/hsns.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 jenson.stanford.edu:2210/unicorn;
                 library.ox.ac.uk:210/ADVANCE",
  price =        "\pounds 25.95",
  acknowledgement = ack-nhfb,
  subject =      "Bethe, Hans A; (Hans Albrecht); Nuclear physicists;
                 Biography",
  subject-dates = "1906--2005",
  tableofcontents = "Growing Up \\
                 Maturing \\
                 Becoming Bethe \\
                 Beyond the Doctorate: 1928--1933 \\
                 England, 1933--1935 \\
                 Hilde Levi \\
                 Cornell University \\
                 The Happy Thirties \\
                 Rose Ewald Bethe \\
                 Conclusion: Past and Future \\
                 Appendix A: The Bethe Family Genealogy \\
                 Appendix B: Courses Taken at Frankfurt University \\
                 Appendix C: A Brief History of the Genesis of Quantum
                 Mechanics \\
                 Appendix D: Courses Taken at Munich University \\
                 Appendix E: Bethe's Doctoral Thesis \\
                 Appendix F: The Habilitationsschrift Defense",
}


bibtype: book
filename: master.bib
label: Schwichtenberg:2015:PS
author: Jakob Schwichtenberg
title: Physics from Symmetry
publisher: pub-SV
address: pub-SV:adr
pages: xix + 279
year: 2015
ISBN: 3-319-19200-0, 3-319-66631-2 (e-book) OR 3319192000, 3319666312 (ebook)
ISBN13: 978-3-319-19200-0, 978-3-319-66631-0 (e-book) OR 9783319192000, 9783319666310 (ebook)
LCCN: QC174.17.S9 S4 2015eb
bibdate: Wed Jan 27 13:21:23 MST 2021
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2021.01.27 13:21:23 MST
series: Undergraduate lecture notes in physics
subject: Symmetry (Physics); Symmetrie; Physik
acknowledgement: ack-nhfb
rawauthor: Jakob Schwichtenberg
rawtitle: Physics from Symmetry
abstract:
This is a textbook that derives the fundamental theories of physics from symmetry. It starts by introducing, in a completely self-contained way, all mathematical tools needed to use symmetry ideas in physics. Thereafter, these tools are put into action and by using symmetry constraints, the fundamental equations of Quantum Mechanics, Quantum Field Theory, Electromagnetism, and Classical Mechanics are derived. As a result, the reader is able to understand the basic assumptions behind, and the connections between the modern theories of physics. The book concludes with first applications of the previously derived equations.

TOC:
Special Relativity Lie group theory The framework Measuring nature Free theory Interaction theory Quantum mechanics Quantum field theory Classical mechanics Electrodynamics Gravity Closing Words Appendices Vector calculus Calculus Linear algebra Additional mathematical notions

rawabstract:
This is a textbook that derives the fundamental theories of physics from symmetry. It starts by introducing, in a completely self-contained way, all mathematical tools needed to use symmetry ideas in physics. Thereafter, these tools are put into action and by using symmetry constraints, the fundamental equations of Quantum Mechanics, Quantum Field Theory, Electromagnetism, and Classical Mechanics are derived. As a result, the reader is able to understand the basic assumptions behind, and the connections between the modern theories of physics. The book concludes with first applications of the previously derived equations.

rawTOC:
Special Relativity \\ Lie group theory \\ The framework \\ Measuring nature \\ Free theory \\ Interaction theory \\ Quantum mechanics \\ Quantum field theory \\ Classical mechanics \\ Electrodynamics \\ Gravity \\ Closing Words \\ Appendices \\ Vector calculus \\ Calculus \\ Linear algebra \\ Additional mathematical notions

entry:
@Book{Schwichtenberg:2015:PS,
  author =       "Jakob Schwichtenberg",
  title =        "Physics from Symmetry",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xix + 279",
  year =         "2015",
  ISBN =         "3-319-19200-0, 3-319-66631-2 (e-book)",
  ISBN-13 =      "978-3-319-19200-0, 978-3-319-66631-0 (e-book)",
  LCCN =         "QC174.17.S9 S4 2015eb",
  bibdate =      "Wed Jan 27 13:21:23 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Undergraduate lecture notes in physics",
  abstract =     "This is a textbook that derives the fundamental
                 theories of physics from symmetry. It starts by
                 introducing, in a completely self-contained way, all
                 mathematical tools needed to use symmetry ideas in
                 physics. Thereafter, these tools are put into action
                 and by using symmetry constraints, the fundamental
                 equations of Quantum Mechanics, Quantum Field Theory,
                 Electromagnetism, and Classical Mechanics are derived.
                 As a result, the reader is able to understand the basic
                 assumptions behind, and the connections between the
                 modern theories of physics. The book concludes with
                 first applications of the previously derived
                 equations.",
  acknowledgement = ack-nhfb,
  subject =      "Symmetry (Physics); Symmetrie; Physik",
  tableofcontents = "Special Relativity \\
                 Lie group theory \\
                 The framework \\
                 Measuring nature \\
                 Free theory \\
                 Interaction theory \\
                 Quantum mechanics \\
                 Quantum field theory \\
                 Classical mechanics \\
                 Electrodynamics \\
                 Gravity \\
                 Closing Words \\
                 Appendices \\
                 Vector calculus \\
                 Calculus \\
                 Linear algebra \\
                 Additional mathematical notions",
}


bibtype: book
filename: master.bib
label: Schwinger:2015:AM
author: Julian Schwinger
title: On Angular Momentum
publisher: pub-DOVER
address: pub-DOVER:adr
pages: 51
year: 2015
ISBN: 0-486-78810-5 (paperback) OR 0486788105 (paperback)
ISBN13: 978-0-486-78810-4 (paperback) OR 9780486788104 (paperback)
LCCN: QC793.3.A5 S39 2015
bibdate: Sat Apr 7 18:17:43 MDT 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2018.04.07 18:17:43 MDT
subject: Angular momentum (Nuclear physics); Dynamics of a particle
acknowledgement: ack-nhfb
authordates: 1918--1994
rawauthor: Julian Schwinger
rawtitle: On Angular Momentum
URL:
http://www.loc.gov/catdir/enhancements/fy1503/2014036399-b.html; http://www.loc.gov/catdir/enhancements/fy1503/2014036399-d.html

abstract:
A concise treatment of angular momentum by an important American physicist, this major work was first published under the auspices of the United States Atomic Energy Commission in 1952 and is finally available to a general audience of students and professionals in the field. Advanced undergraduates and graduate students of physics will particularly benefit from its teachings. One of the most prominent American physicists of the twentieth century, Julian Schwinger (1918--94) taught at Harvard, MIT, and UCLA, among other institutions. In addition to his many other awards, Schwinger, jointly with Richard Feynman and Shinichiro Tomonaga, received the Nobel Prize in Physics in 1965 for his work in quantum electrodynamics.

remark:
Originally published: Oak Ridge, Tenn.: U.S. Atomic Energy Commission. Distributed by Technical Information Service, 1952. (U.S. Atomic Energy Commission report; NYO 3071).

TOC:
1. Introduction 2. Rotations 3. Addition of two angular momenta 4. Three and four angular momenta 5. Tensor operators

rawabstract:
A concise treatment of angular momentum by an important American physicist, this major work was first published under the auspices of the United States Atomic Energy Commission in 1952 and is finally available to a general audience of students and professionals in the field. Advanced undergraduates and graduate students of physics will particularly benefit from its teachings. One of the most prominent American physicists of the twentieth century, Julian Schwinger (1918--94) taught at Harvard, MIT, and UCLA, among other institutions. In addition to his many other awards, Schwinger, jointly with Richard Feynman and Shinichiro Tomonaga, received the Nobel Prize in Physics in 1965 for his work in quantum electrodynamics.

rawTOC:
1. Introduction \\ 2. Rotations \\ 3. Addition of two angular momenta \\ 4. Three and four angular momenta \\ 5. Tensor operators

entry:
@Book{Schwinger:2015:AM,
  author =       "Julian Schwinger",
  title =        "On Angular Momentum",
  publisher =    pub-DOVER,
  address =      pub-DOVER:adr,
  pages =        "51",
  year =         "2015",
  ISBN =         "0-486-78810-5 (paperback)",
  ISBN-13 =      "978-0-486-78810-4 (paperback)",
  LCCN =         "QC793.3.A5 S39 2015",
  bibdate =      "Sat Apr 7 18:17:43 MDT 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1503/2014036399-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1503/2014036399-d.html",
  abstract =     "A concise treatment of angular momentum by an
                 important American physicist, this major work was first
                 published under the auspices of the United States
                 Atomic Energy Commission in 1952 and is finally
                 available to a general audience of students and
                 professionals in the field. Advanced undergraduates and
                 graduate students of physics will particularly benefit
                 from its teachings. One of the most prominent American
                 physicists of the twentieth century, Julian Schwinger
                 (1918--94) taught at Harvard, MIT, and UCLA, among
                 other institutions. In addition to his many other
                 awards, Schwinger, jointly with Richard Feynman and
                 Shinichiro Tomonaga, received the Nobel Prize in
                 Physics in 1965 for his work in quantum
                 electrodynamics.",
  acknowledgement = ack-nhfb,
  author-dates = "1918--1994",
  libnote =      "Not in my library.",
  remark =       "Originally published: Oak Ridge, Tenn.: U.S. Atomic
                 Energy Commission. Distributed by Technical Information
                 Service, 1952. (U.S. Atomic Energy Commission report;
                 NYO 3071).",
  subject =      "Angular momentum (Nuclear physics); Dynamics of a
                 particle",
  tableofcontents = "1. Introduction \\
                 2. Rotations \\
                 3. Addition of two angular momenta \\
                 4. Three and four angular momenta \\
                 5. Tensor operators",
}


bibtype: book
filename: master.bib
label: Scott:1982:IIC
author: Joan E. Scott
title: Introduction to Interactive Computer Graphics
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xi + 255
year: 1982
LCCN: T385.S36
bibdate: Wed Dec 15 10:41:36 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 10:41:36 ???
acknowledgement: ack-nhfb
rawauthor: Joan E. Scott
rawtitle: Introduction to Interactive Computer Graphics
ISBN:
0-471-05773-8 (hardcover), 0-471-86623-7 (paperback) OR 0471057738 (hardcover), 0471866237 (paperback)

ISBN13:
978-0-471-05773-4 (hardcover), 978-0-471-86623-7 (paperback) OR 9780471057734 (hardcover), 9780471866237 (paperback)

entry:
@Book{Scott:1982:IIC,
  author =       "Joan E. Scott",
  title =        "Introduction to Interactive Computer Graphics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xi + 255",
  year =         "1982",
  ISBN =         "0-471-05773-8 (hardcover), 0-471-86623-7 (paperback)",
  ISBN-13 =      "978-0-471-05773-4 (hardcover), 978-0-471-86623-7
                 (paperback)",
  LCCN =         "T385.S36",
  bibdate =      "Wed Dec 15 10:41:36 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Scott:2000:PLP
author: Michael Lee Scott
title: Programming Language Pragmatics
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrsf
pages: xxi + 856
year: 2000
LCCN: QA76.7 .S38 2000
bibdate: Fri Sep 5 13:01:33 MDT 2008
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2008.09.05 13:01:33 MDT
subject: Programming languages (Electronic computers)
acknowledgement: ack-nhfb
rawauthor: Michael Lee Scott
rawtitle: Programming Language Pragmatics
ISBN:
1-55860-578-9 (paperback), 1-55860-442-1 (hardcover) OR 1558605789 (paperback), 1558604421 (hardcover)

ISBN13:
978-1-55860-578-7 (paperback), 978-1-55860-442-1 (hardcover) OR 9781558605787 (paperback), 9781558604421 (hardcover)

URL:
http://www.loc.gov/catdir/description/els033/99047125.html; http://www.loc.gov/catdir/toc/els033/99047125.html

abstract:
booktitle Programming Language Pragmatics addresses the fundamental principles at work in the most important contemporary languages, highlights the critical relationship between language design and language implementation, and devotes special attention to issues of importance to the expert programmer. Thanks to its rigorous but accessible teaching style, you'll emerge better prepared to choose the best language for particular projects, to make more effective use of languages you already know, and to learn new languages quickly and completely.

TOC:
1: Introduction 2: Programming Language Syntax 3: Names, Scopes, and Bindings 4: Semantic Analysis 5: Assembly-Level Computer Architecture 6: Control Flow 7: Data Types 8: Subroutines and Control Abstraction 9: Building a Runnable Program 10: Data Abstraction and Object Orientation 11: Nonimperative Programming Models: Functional and Logic Languages 12: Concurrency 13: Code Improvement Appendix A: Programming Languages Mentioned Appendix B: Language Design and Language Implementation

rawabstract:
\booktitle{Programming Language Pragmatics} addresses the fundamental principles at work in the most important contemporary languages, highlights the critical relationship between language design and language implementation, and devotes special attention to issues of importance to the expert programmer. Thanks to its rigorous but accessible teaching style, you'll emerge better prepared to choose the best language for particular projects, to make more effective use of languages you already know, and to learn new languages quickly and completely.

rawTOC:
1: Introduction \\ 2: Programming Language Syntax \\ 3: Names, Scopes, and Bindings \\ 4: Semantic Analysis \\ 5: Assembly-Level Computer Architecture \\ 6: Control Flow \\ 7: Data Types \\ 8: Subroutines and Control Abstraction \\ 9: Building a Runnable Program \\ 10: Data Abstraction and Object Orientation \\ 11: Nonimperative Programming Models: Functional and Logic Languages \\ 12: Concurrency \\ 13: Code Improvement \\ Appendix A: Programming Languages Mentioned \\ Appendix B: Language Design and Language Implementation

entry:
@Book{Scott:2000:PLP,
  author =       "Michael Lee Scott",
  title =        "Programming Language Pragmatics",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrsf,
  pages =        "xxi + 856",
  year =         "2000",
  ISBN =         "1-55860-578-9 (paperback), 1-55860-442-1 (hardcover)",
  ISBN-13 =      "978-1-55860-578-7 (paperback), 978-1-55860-442-1
                 (hardcover)",
  LCCN =         "QA76.7 .S38 2000",
  bibdate =      "Fri Sep 5 13:01:33 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/els033/99047125.html;
                 http://www.loc.gov/catdir/toc/els033/99047125.html",
  abstract =     "\booktitle{Programming Language Pragmatics} addresses
                 the fundamental principles at work in the most
                 important contemporary languages, highlights the
                 critical relationship between language design and
                 language implementation, and devotes special attention
                 to issues of importance to the expert programmer.
                 Thanks to its rigorous but accessible teaching style,
                 you'll emerge better prepared to choose the best
                 language for particular projects, to make more
                 effective use of languages you already know, and to
                 learn new languages quickly and completely.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Programming languages (Electronic computers)",
  tableofcontents = "1: Introduction \\
                 2: Programming Language Syntax \\
                 3: Names, Scopes, and Bindings \\
                 4: Semantic Analysis \\
                 5: Assembly-Level Computer Architecture \\
                 6: Control Flow \\
                 7: Data Types \\
                 8: Subroutines and Control Abstraction \\
                 9: Building a Runnable Program \\
                 10: Data Abstraction and Object Orientation \\
                 11: Nonimperative Programming Models: Functional and
                 Logic Languages \\
                 12: Concurrency \\
                 13: Code Improvement \\
                 Appendix A: Programming Languages Mentioned \\
                 Appendix B: Language Design and Language
                 Implementation",
}


bibtype: book
filename: master.bib
label: Scott:2006:PLP
author: Michael Lee Scott
title: Programming Language Pragmatics
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adrsf
edition: Second
pages: xxxi + 875
year: 2006
ISBN: 0-12-633951-1 OR 0126339511
ISBN13: 978-0-12-633951-2 OR 9780126339512
LCCN: QA76.7 .S38 2006
bibdate: Fri Sep 5 12:53:37 MDT 2008
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2008.09.05 12:53:37 MDT
URL: http://www.loc.gov/catdir/enhancements/fy0632/2006272697-d.html
subject: Programming languages (Electronic computers)
acknowledgement: ack-nhfb
rawauthor: Michael Lee Scott
rawtitle: Programming Language Pragmatics
TOC:
Part I. Foundations 1: Introduction 2: Programming language syntax 3: Names, scopes, and bindings 4: Semantic analysis 5: Target machine architecture Part II. Core issues in language design 6: Control flow 7: Data types 8: Subroutines and control abstraction 9: Data abstraction and object orientation Part III. Alternative programming models 10: Functional languages 11: Logic languages 12: Concurrency 13: Scripting languages Part IV. A closer look at implementation 14: Building a runnable program 15: Code improvement A: Programming languages mentioned B: Language design and language implementation

rawTOC:
Part I. Foundations \\ 1: Introduction \\ 2: Programming language syntax \\ 3: Names, scopes, and bindings \\ 4: Semantic analysis \\ 5: Target machine architecture \\ Part II. Core issues in language design \\ 6: Control flow \\ 7: Data types \\ 8: Subroutines and control abstraction \\ 9: Data abstraction and object orientation \\ Part III. Alternative programming models \\ 10: Functional languages \\ 11: Logic languages \\ 12: Concurrency \\ 13: Scripting languages \\ Part IV. A closer look at implementation \\ 14: Building a runnable program \\ 15: Code improvement \\ A: Programming languages mentioned \\ B: Language design and language implementation

entry:
@Book{Scott:2006:PLP,
  author =       "Michael Lee Scott",
  title =        "Programming Language Pragmatics",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adrsf,
  edition =      "Second",
  pages =        "xxxi + 875",
  year =         "2006",
  ISBN =         "0-12-633951-1",
  ISBN-13 =      "978-0-12-633951-2",
  LCCN =         "QA76.7 .S38 2006",
  bibdate =      "Fri Sep 5 12:53:37 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0632/2006272697-d.html",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Programming languages (Electronic computers)",
  tableofcontents = "Part I. Foundations \\
                 1: Introduction \\
                 2: Programming language syntax \\
                 3: Names, scopes, and bindings \\
                 4: Semantic analysis \\
                 5: Target machine architecture \\
                 Part II. Core issues in language design \\
                 6: Control flow \\
                 7: Data types \\
                 8: Subroutines and control abstraction \\
                 9: Data abstraction and object orientation \\
                 Part III. Alternative programming models \\
                 10: Functional languages \\
                 11: Logic languages \\
                 12: Concurrency \\
                 13: Scripting languages \\
                 Part IV. A closer look at implementation \\
                 14: Building a runnable program \\
                 15: Code improvement \\
                 A: Programming languages mentioned \\
                 B: Language design and language implementation",
}


bibtype: book
filename: master.bib
label: Seacord:2005:SCC
author: Robert C. Seacord
title: Secure coding in C and C++
publisher: pub-AW
address: pub-AW:adr
pages: xxiv + 341
year: 2005
ISBN: 0-321-33572-4 (paperback) OR 0321335724 (paperback)
ISBN13: 978-0-321-33572-2 (paperback) OR 9780321335722 (paperback)
LCCN: QA76.9.A25 S368 2005
bibdate: Thu Aug 31 10:52:01 MDT 2006
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2006.08.31 10:52:01 MDT
URL: http://www.cert.org/books/secure-coding/; http://www.loc.gov/catdir/toc/ecip0513/2005015012.html
subject: Computer security; C (Computer program language); C++ (Computer program language)
acknowledgement: ack-nhfb
rawauthor: Robert C. Seacord
rawtitle: Secure coding in {C} and {C++}
TOC:
Contents Preface ix 1 Running with Scissors 1 1.1 Gauging the Threat 4 1.2 Security Concepts 9 1.3 C and C++ 14 1.4 Development Platforms 17 1.5 Summary 21 1.6 For Further Reading 21 2 Strings 23 2.1 String Characteristics 23 2.2 Common String Manipulation Errors 24 2.3 String Vulnerabilities 30 2.4 Process Memory Organization 33 2.5 Stack Smashing 37 2.6 Code Injection 42 2.7 Arc Injection 45 2.8 Mitigation Strategies 48 2.9 Notable Vulnerabilities 66 2.10 Summary 68 2.11 For Further Reading 70 3 Pointer Subterfuge 71 3.1 Data Locations 72 3.2 Function Pointers 73 3.3 Data Pointers 74 3.4 Modifying the Instruction Pointer 75 3.5 Global Offset Table 76 3.6 The .dtors Section 78 3.7 Virtual Pointers 80 3.8 The atexit() and on_exit() Functions 82 3.9 The longjmp() Function 84 3.10 Exception Handling 85 3.11 Mitigation Strategies 89 3.12 Summary 89 3.13 For Further Reading 90 4 Dynamic Memory Management 91 4.1 Dynamic Memory Management 92 4.2 Common Dynamic Memory Management Errors 94 4.3 Doug Lea's Memory Allocator 100 4.4 RtlHeap 113 4.5 Mitigation Strategies 129 4.6 Notable Vulnerabilities 138 4.7 Summary 140 4.8 For Further Reading 141 5 Integer Security 143 5.1 Integers 144 5.2 Integer Conversions 151 5.3 Integer Error Conditions 156 5.4 Integer Operations 159 5.5 Vulnerabilities 172 5.6 Non-Exceptional Integer Logic Errors 177 5.7 Mitigation Strategies 178 5.8 Notable Vulnerabilities 187 5.9 Summary 190 5.10 For Further Reading 191 6 Formatted Output 193 6.1 Variadic Functions 194 6.2 Formatted Output Functions 198 6.3 Exploiting Formatted Output Functions 203 6.4 Stack Randomization 214 6.5 Mitigation Strategies 220 6.6 Notable Vulnerabilities 230 6.7 Summary 231 6.8 For Further Reading 233 7 File I/O 235 7.1 Concurrency 235 7.2 Time of Check, Time of Use 238 7.3 Files as Locks and File Locking 240 7.4 File System Exploits 242 7.5 Mitigation Strategies 249 7.6 Summary 259 8 Recommended Practices 261 8.1 Secure Software Development Principles 263 8.2 Systems Quality Requirements Engineering 267 8.3 Threat Modeling 269 8.4 Use/Misuse Cases 270 8.5 Architecture and Design 271 8.6 Off-the-Shelf Software 273 8.7 Compiler Checks 275 8.8 Input Validation 275 8.9 Data Sanitization 277 8.10 Static Analysis 280 8.11 Quality Assurance 283 8.12 Memory Permissions 286 8.13 Defense in Depth 288 8.14 TSP-Secure 289 8.15 Summary 292 8.16 Further Reading 292

rawTOC:
Contents \\ Preface ix \\ 1 Running with Scissors 1 \\ 1.1 Gauging the Threat 4 \\ 1.2 Security Concepts 9 \\ 1.3 C and C++ 14 \\ 1.4 Development Platforms 17 \\ 1.5 Summary 21 \\ 1.6 For Further Reading 21 \\ 2 Strings 23 \\ 2.1 String Characteristics 23 \\ 2.2 Common String Manipulation Errors 24 \\ 2.3 String Vulnerabilities 30 \\ 2.4 Process Memory Organization 33 \\ 2.5 Stack Smashing 37 \\ 2.6 Code Injection 42 \\ 2.7 Arc Injection 45 \\ 2.8 Mitigation Strategies 48 \\ 2.9 Notable Vulnerabilities 66 \\ 2.10 Summary 68 \\ 2.11 For Further Reading 70 \\ 3 Pointer Subterfuge 71 \\ 3.1 Data Locations 72 \\ 3.2 Function Pointers 73 \\ 3.3 Data Pointers 74 \\ 3.4 Modifying the Instruction Pointer 75 \\ 3.5 Global Offset Table 76 \\ 3.6 The .dtors Section 78 \\ 3.7 Virtual Pointers 80 \\ 3.8 The atexit() and on\_exit() Functions 82 \\ 3.9 The longjmp() Function 84 \\ 3.10 Exception Handling 85 \\ 3.11 Mitigation Strategies 89 \\ 3.12 Summary 89 \\ 3.13 For Further Reading 90 \\ 4 Dynamic Memory Management 91 \\ 4.1 Dynamic Memory Management 92 \\ 4.2 Common Dynamic Memory Management Errors 94 \\ 4.3 Doug Lea's Memory Allocator 100 \\ 4.4 RtlHeap 113 \\ 4.5 Mitigation Strategies 129 \\ 4.6 Notable Vulnerabilities 138 \\ 4.7 Summary 140 \\ 4.8 For Further Reading 141 \\ 5 Integer Security 143 \\ 5.1 Integers 144 \\ 5.2 Integer Conversions 151 \\ 5.3 Integer Error Conditions 156 \\ 5.4 Integer Operations 159 \\ 5.5 Vulnerabilities 172 \\ 5.6 Non-Exceptional Integer Logic Errors 177 \\ 5.7 Mitigation Strategies 178 \\ 5.8 Notable Vulnerabilities 187 \\ 5.9 Summary 190 \\ 5.10 For Further Reading 191 \\ 6 Formatted Output 193 \\ 6.1 Variadic Functions 194 \\ 6.2 Formatted Output Functions 198 \\ 6.3 Exploiting Formatted Output Functions 203 \\ 6.4 Stack Randomization 214 \\ 6.5 Mitigation Strategies 220 \\ 6.6 Notable Vulnerabilities 230 \\ 6.7 Summary 231 \\ 6.8 For Further Reading 233 \\ 7 File I/O 235 \\ 7.1 Concurrency 235 \\ 7.2 Time of Check, Time of Use 238 \\ 7.3 Files as Locks and File Locking 240 \\ 7.4 File System Exploits 242 \\ 7.5 Mitigation Strategies 249 \\ 7.6 Summary 259 \\ 8 Recommended Practices 261 \\ 8.1 Secure Software Development Principles 263 \\ 8.2 Systems Quality Requirements Engineering 267 \\ 8.3 Threat Modeling 269 \\ 8.4 Use/Misuse Cases 270 \\ 8.5 Architecture and Design 271 \\ 8.6 Off-the-Shelf Software 273 \\ 8.7 Compiler Checks 275 \\ 8.8 Input Validation 275 \\ 8.9 Data Sanitization 277 \\ 8.10 Static Analysis 280 \\ 8.11 Quality Assurance 283 \\ 8.12 Memory Permissions 286 \\ 8.13 Defense in Depth 288 \\ 8.14 TSP-Secure 289 \\ 8.15 Summary 292 \\ 8.16 Further Reading 292

entry:
@Book{Seacord:2005:SCC,
  author =       "Robert C. Seacord",
  title =        "Secure coding in {C} and {C++}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxiv + 341",
  year =         "2005",
  ISBN =         "0-321-33572-4 (paperback)",
  ISBN-13 =      "978-0-321-33572-2 (paperback)",
  LCCN =         "QA76.9.A25 S368 2005",
  bibdate =      "Thu Aug 31 10:52:01 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.cert.org/books/secure-coding/;
                 http://www.loc.gov/catdir/toc/ecip0513/2005015012.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; C (Computer program language); C++
                 (Computer program language)",
  tableofcontents = "Contents \\
                 Preface ix \\
                 1 Running with Scissors 1 \\
                 1.1 Gauging the Threat 4 \\
                 1.2 Security Concepts 9 \\
                 1.3 C and C++ 14 \\
                 1.4 Development Platforms 17 \\
                 1.5 Summary 21 \\
                 1.6 For Further Reading 21 \\
                 2 Strings 23 \\
                 2.1 String Characteristics 23 \\
                 2.2 Common String Manipulation Errors 24 \\
                 2.3 String Vulnerabilities 30 \\
                 2.4 Process Memory Organization 33 \\
                 2.5 Stack Smashing 37 \\
                 2.6 Code Injection 42 \\
                 2.7 Arc Injection 45 \\
                 2.8 Mitigation Strategies 48 \\
                 2.9 Notable Vulnerabilities 66 \\
                 2.10 Summary 68 \\
                 2.11 For Further Reading 70 \\
                 3 Pointer Subterfuge 71 \\
                 3.1 Data Locations 72 \\
                 3.2 Function Pointers 73 \\
                 3.3 Data Pointers 74 \\
                 3.4 Modifying the Instruction Pointer 75 \\
                 3.5 Global Offset Table 76 \\
                 3.6 The .dtors Section 78 \\
                 3.7 Virtual Pointers 80 \\
                 3.8 The atexit() and on\_exit() Functions 82 \\
                 3.9 The longjmp() Function 84 \\
                 3.10 Exception Handling 85 \\
                 3.11 Mitigation Strategies 89 \\
                 3.12 Summary 89 \\
                 3.13 For Further Reading 90 \\
                 4 Dynamic Memory Management 91 \\
                 4.1 Dynamic Memory Management 92 \\
                 4.2 Common Dynamic Memory Management Errors 94 \\
                 4.3 Doug Lea's Memory Allocator 100 \\
                 4.4 RtlHeap 113 \\
                 4.5 Mitigation Strategies 129 \\
                 4.6 Notable Vulnerabilities 138 \\
                 4.7 Summary 140 \\
                 4.8 For Further Reading 141 \\
                 5 Integer Security 143 \\
                 5.1 Integers 144 \\
                 5.2 Integer Conversions 151 \\
                 5.3 Integer Error Conditions 156 \\
                 5.4 Integer Operations 159 \\
                 5.5 Vulnerabilities 172 \\
                 5.6 Non-Exceptional Integer Logic Errors 177 \\
                 5.7 Mitigation Strategies 178 \\
                 5.8 Notable Vulnerabilities 187 \\
                 5.9 Summary 190 \\
                 5.10 For Further Reading 191 \\
                 6 Formatted Output 193 \\
                 6.1 Variadic Functions 194 \\
                 6.2 Formatted Output Functions 198 \\
                 6.3 Exploiting Formatted Output Functions 203 \\
                 6.4 Stack Randomization 214 \\
                 6.5 Mitigation Strategies 220 \\
                 6.6 Notable Vulnerabilities 230 \\
                 6.7 Summary 231 \\
                 6.8 For Further Reading 233 \\
                 7 File I/O 235 \\
                 7.1 Concurrency 235 \\
                 7.2 Time of Check, Time of Use 238 \\
                 7.3 Files as Locks and File Locking 240 \\
                 7.4 File System Exploits 242 \\
                 7.5 Mitigation Strategies 249 \\
                 7.6 Summary 259 \\
                 8 Recommended Practices 261 \\
                 8.1 Secure Software Development Principles 263 \\
                 8.2 Systems Quality Requirements Engineering 267 \\
                 8.3 Threat Modeling 269 \\
                 8.4 Use/Misuse Cases 270 \\
                 8.5 Architecture and Design 271 \\
                 8.6 Off-the-Shelf Software 273 \\
                 8.7 Compiler Checks 275 \\
                 8.8 Input Validation 275 \\
                 8.9 Data Sanitization 277 \\
                 8.10 Static Analysis 280 \\
                 8.11 Quality Assurance 283 \\
                 8.12 Memory Permissions 286 \\
                 8.13 Defense in Depth 288 \\
                 8.14 TSP-Secure 289 \\
                 8.15 Summary 292 \\
                 8.16 Further Reading 292",
}


bibtype: book
filename: master.bib
label: Seacord:2020:EC
author: Robert Seacord
title: Effective C
publisher: pub-NO-STARCH
address: pub-NO-STARCH:adr
pages: xxviii + 240
year: 2020
ISBN: 1-71850-104-8 (paperback), 1-0981-2567-3 (e-book) OR 1718501048 (paperback), 1098125673 (ebook)
LCCN: QA76.73.C15 .S433 2020
bibdate: Tue Feb 27 10:34:57 MST 2024
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2024.02.27 10:34:57 MST
URL: https://nostarch.com/download/samples/EffectiveC_ToC_sample.pdf; https://nostarch.com/Effective_C
acknowledgement: ack-nhfb
rawauthor: Robert Seacord
rawtitle: Effective {C}
ISBN13:
978-1-71850-104-1 (paperback), 978-1-0981-2567-7 (e-book) OR 9781718501041 (paperback), 9781098125677 (ebook)

abstract:
The world runs on code written in the C programming language, yet most schools begin the curriculum with Python or Java. Effective C bridges this gap and brings C into the modern era-covering the modern C17 Standard as well as potential C2x features. With the aid of this instant classic, you'll soon be writing professional, portable, and secure C programs to power robust systems and solve real-world problems. Robert C. Seacord introduces C and the C Standard Library while addressing best practices, common errors, and open debates in the C community. Developed together with other C Standards committee experts, Effective C will teach you how to debug, test, and analyze C programs. You'll benefit from Seacord's concise explanations of C language constructs and behaviors, and from his 40 years of coding experience. You'll learn: * how to identify and handle undefined behavior in a C program * the range and representations of integers and floating-point values; * how dynamic memory allocation works and how to use nonstandard functions; * how to use character encodings and types; * how to perform I/O with terminals and filesystems using C Standard streams and POSIX file descriptors; * how to understand the C compiler's translation phases and the role of the preprocessor; * how to test, debug, and analyze C programs. Effective C will teach you how to write professional, secure, and portable C code that will stand the test of time and help strengthen the foundation of the computing world.

TOC:
Introduction 1: Getting Started 2: Objects, Functions, and Types 3: Arithmetic Types 4: Expressions and Operators 5: Control Flow 6: Dynamically Allocated Memory 7: Characters and Strings 8: Input/Output 9: Preprocessor 10: Program Structure 11: Debugging, Testing, and Analysis Index

rawabstract:
The world runs on code written in the C programming language, yet most schools begin the curriculum with Python or Java. Effective C bridges this gap and brings C into the modern era-covering the modern C17 Standard as well as potential C2x features. With the aid of this instant classic, you'll soon be writing professional, portable, and secure C programs to power robust systems and solve real-world problems. Robert C. Seacord introduces C and the C Standard Library while addressing best practices, common errors, and open debates in the C community. Developed together with other C Standards committee experts, Effective C will teach you how to debug, test, and analyze C programs. You'll benefit from Seacord's concise explanations of C language constructs and behaviors, and from his 40 years of coding experience. You'll learn: * how to identify and handle undefined behavior in a C program * the range and representations of integers and floating-point values; * how dynamic memory allocation works and how to use nonstandard functions; * how to use character encodings and types; * how to perform I/O with terminals and filesystems using C Standard streams and POSIX file descriptors; * how to understand the C compiler's translation phases and the role of the preprocessor; * how to test, debug, and analyze C programs. Effective C will teach you how to write professional, secure, and portable C code that will stand the test of time and help strengthen the foundation of the computing world.

rawTOC:
Introduction \\ 1: Getting Started \\ 2: Objects, Functions, and Types \\ 3: Arithmetic Types \\ 4: Expressions and Operators \\ 5: Control Flow \\ 6: Dynamically Allocated Memory \\ 7: Characters and Strings \\ 8: Input/Output \\ 9: Preprocessor \\ 10: Program Structure \\ 11: Debugging, Testing, and Analysis \\ Index

entry:
@Book{Seacord:2020:EC,
  author =       "Robert Seacord",
  title =        "Effective {C}",
  publisher =    pub-NO-STARCH,
  address =      pub-NO-STARCH:adr,
  pages =        "xxviii + 240",
  year =         "2020",
  ISBN =         "1-71850-104-8 (paperback), 1-0981-2567-3 (e-book)",
  ISBN-13 =      "978-1-71850-104-1 (paperback), 978-1-0981-2567-7
                 (e-book)",
  LCCN =         "QA76.73.C15 .S433 2020",
  bibdate =      "Tue Feb 27 10:34:57 MST 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://nostarch.com/download/samples/EffectiveC_ToC_sample.pdf;
                 https://nostarch.com/Effective_C",
  abstract =     "The world runs on code written in the C programming
                 language, yet most schools begin the curriculum with
                 Python or Java. Effective C bridges this gap and brings
                 C into the modern era-covering the modern C17 Standard
                 as well as potential C2x features. With the aid of this
                 instant classic, you'll soon be writing professional,
                 portable, and secure C programs to power robust systems
                 and solve real-world problems. Robert C. Seacord
                 introduces C and the C Standard Library while
                 addressing best practices, common errors, and open
                 debates in the C community. Developed together with
                 other C Standards committee experts, Effective C will
                 teach you how to debug, test, and analyze C programs.
                 You'll benefit from Seacord's concise explanations of C
                 language constructs and behaviors, and from his 40
                 years of coding experience. You'll learn: * how to
                 identify and handle undefined behavior in a C program *
                 the range and representations of integers and
                 floating-point values; * how dynamic memory allocation
                 works and how to use nonstandard functions; * how to
                 use character encodings and types; * how to perform I/O
                 with terminals and filesystems using C Standard streams
                 and POSIX file descriptors; * how to understand the C
                 compiler's translation phases and the role of the
                 preprocessor; * how to test, debug, and analyze C
                 programs. Effective C will teach you how to write
                 professional, secure, and portable C code that will
                 stand the test of time and help strengthen the
                 foundation of the computing world.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Introduction \\
                 1: Getting Started \\
                 2: Objects, Functions, and Types \\
                 3: Arithmetic Types \\
                 4: Expressions and Operators \\
                 5: Control Flow \\
                 6: Dynamically Allocated Memory \\
                 7: Characters and Strings \\
                 8: Input/Output \\
                 9: Preprocessor \\
                 10: Program Structure \\
                 11: Debugging, Testing, and Analysis \\
                 Index",
}


bibtype: book
filename: master.bib
label: Searfoss:1994:JKC
author: Glenn Searfoss
title: JIS-Kanji Character Recognition: Featuring the Gaiji method
publisher: pub-VAN-NOSTRAND-REINHOLD
address: pub-VAN-NOSTRAND-REINHOLD:adr
pages: xxii + 419
year: 1994
ISBN: 0-442-01813-4 OR 0442018134
ISBN13: 978-0-442-01813-9 OR 9780442018139
LCCN: TA1640 .S43 1994
MRclass: *68U15, 68-01, 68T10
bibdate: Wed Aug 10 10:57:45 1994
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1994.08.10 10:57:45 ???
ZMnumber: 0821.68126
acknowledgement: ack-nhfb
rawauthor: Glenn Searfoss
rawtitle: {JIS-Kanji} Character Recognition: Featuring the {Gaiji} method
TOC:
Introduction About This Book Applications Book Organization Trademarks and Copyrights Understanding Kanji: A Background in Form, Function, and Utility / 1 JIS-Kanji Standards and Specifications / 15 JIS-Kanji Character Encoding Methods / 25 JIS-Kanji Character Identification Methods / 39 The Gaiji Method / 55 The Gaiji Method Character Recognition Charts / 69 International Trade, Investment Education, and Professional Organizations / 219 JIS-Kanji Product Listings / 239 Included Software / 259 Glossary of Terms / 359 Appendix A: Tables and Charts / 371 Appendix B: JIS x 0208-1990 Standard Character Chart with 8-Bit Hexadecimal and Ward-Point Code Ranges / 383 Bibliography / 405 Index / 415

rawTOC:
Introduction \\ About This Book \\ Applications \\ Book Organization \\ Trademarks and Copyrights \\ Understanding Kanji: A Background in Form, Function, and Utility / 1 \\ JIS-Kanji Standards and Specifications / 15 \\ JIS-Kanji Character Encoding Methods / 25 \\ JIS-Kanji Character Identification Methods / 39 \\ The Gaiji Method / 55 \\ The Gaiji Method Character Recognition Charts / 69 \\ International Trade, Investment Education, and Professional Organizations / 219 \\ JIS-Kanji Product Listings / 239 \\ Included Software / 259 \\ Glossary of Terms / 359 \\ Appendix A: Tables and Charts / 371 \\ Appendix B: JIS x 0208-1990 Standard Character Chart with 8-Bit Hexadecimal and Ward-Point Code Ranges / 383 \\ Bibliography / 405 \\ Index / 415

entry:
@Book{Searfoss:1994:JKC,
  author =       "Glenn Searfoss",
  title =        "{JIS-Kanji} Character Recognition: Featuring the
                 {Gaiji} method",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "xxii + 419",
  year =         "1994",
  ISBN =         "0-442-01813-4",
  ISBN-13 =      "978-0-442-01813-9",
  LCCN =         "TA1640 .S43 1994",
  MRclass =      "*68U15, 68-01, 68T10",
  bibdate =      "Wed Aug 10 10:57:45 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  ZMnumber =     "0821.68126",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction \\
                 About This Book \\
                 Applications \\
                 Book Organization \\
                 Trademarks and Copyrights \\
                 Understanding Kanji: A Background in Form, Function,
                 and Utility / 1 \\
                 JIS-Kanji Standards and Specifications / 15 \\
                 JIS-Kanji Character Encoding Methods / 25 \\
                 JIS-Kanji Character Identification Methods / 39 \\
                 The Gaiji Method / 55 \\
                 The Gaiji Method Character Recognition Charts / 69 \\
                 International Trade, Investment Education, and
                 Professional Organizations / 219 \\
                 JIS-Kanji Product Listings / 239 \\
                 Included Software / 259 \\
                 Glossary of Terms / 359 \\
                 Appendix A: Tables and Charts / 371 \\
                 Appendix B: JIS x 0208-1990 Standard Character Chart
                 with 8-Bit Hexadecimal and Ward-Point Code Ranges / 383
                 \\
                 Bibliography / 405 \\
                 Index / 415",
}


bibtype: book
filename: master.bib
label: Sedgewick:1983:A
author: Robert Sedgewick
title: Algorithms
publisher: pub-AW
address: pub-AW:adr
pages: viii + 551
year: 1983
ISBN: 0-201-06672-6 OR 0201066726
ISBN13: 978-0-201-06672-2 OR 9780201066722
LCCN: QA76.6 .S435 1983
bibdate: Wed Dec 15 18:23:21 1993
bibtimestamp: 1993.12.15 18:23:21 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms
TOC:
Introduction 1. Preview Mathematical Algorithms 2. Arithmetic 3. Random numbers 4. Polynomials 5. Gaussian Elimination 6. Curve fitting 7. Integration Sorting 8. Elementary sorting methods 9. Quicksort 10. Radix sorting 11. Priority Queues 12. Selection and merging 13. External sorting Searching 14. Elementary searching methods 15. Balanced trees 16. Hashing 17. Radix searching 18. External searching String Processing 19. String searching 20. Pattern matching 21. Parsing 22. File compression 23. Cryptology Geometric Algorithms 24. Elementary geometric methods 25. Finding the convex hull 26. Range searching 27. Geometric intersection 28. Closest point problems Graph Algorithms 29. Elementary graph algorithms 30. Connectivity 31. Weighted graphs 32. Directed graphs 33. Network flow 34. Matching Advanced Topics 35. Algorithm machines 36. The Fast Fourier Transform 37. Dynamic programming 38. Linear programming 39. Exhaustive search 40. NP-complete problems

rawTOC:
Introduction \\ 1. Preview \\ Mathematical Algorithms \\ 2. Arithmetic \\ 3. Random numbers \\ 4. Polynomials \\ 5. Gaussian Elimination \\ 6. Curve fitting \\ 7. Integration \\ Sorting \\ 8. Elementary sorting methods \\ 9. Quicksort \\ 10. Radix sorting \\ 11. Priority Queues \\ 12. Selection and merging \\ 13. External sorting \\ Searching \\ 14. Elementary searching methods \\ 15. Balanced trees \\ 16. Hashing \\ 17. Radix searching \\ 18. External searching \\ String Processing \\ 19. String searching \\ 20. Pattern matching \\ 21. Parsing \\ 22. File compression \\ 23. Cryptology \\ Geometric Algorithms \\ 24. Elementary geometric methods \\ 25. Finding the convex hull \\ 26. Range searching \\ 27. Geometric intersection \\ 28. Closest point problems \\ Graph Algorithms \\ 29. Elementary graph algorithms \\ 30. Connectivity \\ 31. Weighted graphs \\ 32. Directed graphs \\ 33. Network flow \\ 34. Matching \\ Advanced Topics \\ 35. Algorithm machines \\ 36. The Fast Fourier Transform \\ 37. Dynamic programming \\ 38. Linear programming \\ 39. Exhaustive search \\ 40. NP-complete problems

entry:
@Book{Sedgewick:1983:A,
  author =       "Robert Sedgewick",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "viii + 551",
  year =         "1983",
  ISBN =         "0-201-06672-6",
  ISBN-13 =      "978-0-201-06672-2",
  LCCN =         "QA76.6 .S435 1983",
  bibdate =      "Wed Dec 15 18:23:21 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction \\
                 1. Preview \\
                 Mathematical Algorithms \\
                 2. Arithmetic \\
                 3. Random numbers \\
                 4. Polynomials \\
                 5. Gaussian Elimination \\
                 6. Curve fitting \\
                 7. Integration \\
                 Sorting \\
                 8. Elementary sorting methods \\
                 9. Quicksort \\
                 10. Radix sorting \\
                 11. Priority Queues \\
                 12. Selection and merging \\
                 13. External sorting \\
                 Searching \\
                 14. Elementary searching methods \\
                 15. Balanced trees \\
                 16. Hashing \\
                 17. Radix searching \\
                 18. External searching \\
                 String Processing \\
                 19. String searching \\
                 20. Pattern matching \\
                 21. Parsing \\
                 22. File compression \\
                 23. Cryptology \\
                 Geometric Algorithms \\
                 24. Elementary geometric methods \\
                 25. Finding the convex hull \\
                 26. Range searching \\
                 27. Geometric intersection \\
                 28. Closest point problems \\
                 Graph Algorithms \\
                 29. Elementary graph algorithms \\
                 30. Connectivity \\
                 31. Weighted graphs \\
                 32. Directed graphs \\
                 33. Network flow \\
                 34. Matching \\
                 Advanced Topics \\
                 35. Algorithm machines \\
                 36. The Fast Fourier Transform \\
                 37. Dynamic programming \\
                 38. Linear programming \\
                 39. Exhaustive search \\
                 40. NP-complete problems",
}


bibtype: book
filename: master.bib
label: Sedgewick:1988:A
author: Robert Sedgewick
title: Algorithms
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xii + 657
year: 1988
ISBN: 0-201-06673-4 OR 0201066734
ISBN13: 978-0-201-06673-9 OR 9780201066739
LCCN: QA76.6 .S435 1988
MRclass: 68-01, 68N01, 68P05, 68P10, 68Q25, 68W10, 68W99
bibdate: Wed Dec 15 10:41:37 1993
bibtimestamp: 1993.12.15 10:41:37 ???
remark: prep-tex
ZMnumber: 0717.68005
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

entry:
@Book{Sedgewick:1988:A,
  author =       "Robert Sedgewick",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xii + 657",
  year =         "1988",
  ISBN =         "0-201-06673-4",
  ISBN-13 =      "978-0-201-06673-9",
  LCCN =         "QA76.6 .S435 1988",
  MRclass =      "68-01, 68N01, 68P05, 68P10, 68Q25, 68W10, 68W99",
  bibdate =      "Wed Dec 15 10:41:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$34.95",
  ZMnumber =     "0717.68005",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       prep-tex,
}


bibtype: book
filename: master.bib
label: Sedgewick:1990:AC
author: Robert Sedgewick
title: Algorithms in C
publisher: pub-AW
address: pub-AW:adr
pages: xii + 657
year: 1990
ISBN: 0-201-51425-7 OR 0201514257
ISBN13: 978-0-201-51425-4 OR 9780201514254
LCCN: QA76.73.C15 S43 1990
bibdate: Wed Dec 15 10:41:38 1993
bibtimestamp: 1993.12.15 10:41:38 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {C}
TOC:
Fundamentals 1. Introduction 2. C 3. Elementary data structures 4. Trees 5. Recursion 6. Analysis of algorithms 7. Implementation of algorithms Sorting algorithms 8. Elementary sorting methods 9. Quicksort 10. Radix sorting 11. Priority queues 12. Mergesort 13. External sorting Searching algorithms 14. Elementary searching methods 15. Balanced trees 16. Hashing 17. Radix searching 18. External searching String processing 19. String searching 20. Pattern matching 21. Parsing 22. File compression 23. Cryptology Geometry algorithms 24. Elementary geometric methods 25. Finding the convex hull 26. Range searching 27. Geometric intersection 28. Closet-point problems Graph algorithms 29. Elementary graph algorithms 30. Connectivity 31. Weighted graphs 32. Directed graphs 33. Network flow 34. Matching Mathematical algorithms 35. Random numbers 36. Arithmetic 37. Gaussian elimination 38. Curve fitting 39. Integration Advanced topics 40. Parallel algorithms 41. The Fast Fourier Transform 42. Dynamic programming 43. Linear programming 44. Exhaustive search 45. NP-complete problems Index

rawTOC:
Fundamentals \\ 1. Introduction \\ 2. C \\ 3. Elementary data structures \\ 4. Trees \\ 5. Recursion \\ 6. Analysis of algorithms \\ 7. Implementation of algorithms \\ Sorting algorithms \\ 8. Elementary sorting methods \\ 9. Quicksort \\ 10. Radix sorting \\ 11. Priority queues \\ 12. Mergesort \\ 13. External sorting \\ Searching algorithms \\ 14. Elementary searching methods \\ 15. Balanced trees \\ 16. Hashing \\ 17. Radix searching \\ 18. External searching \\ String processing \\ 19. String searching \\ 20. Pattern matching \\ 21. Parsing \\ 22. File compression \\ 23. Cryptology \\ Geometry algorithms \\ 24. Elementary geometric methods \\ 25. Finding the convex hull \\ 26. Range searching \\ 27. Geometric intersection \\ 28. Closet-point problems \\ Graph algorithms \\ 29. Elementary graph algorithms \\ 30. Connectivity \\ 31. Weighted graphs \\ 32. Directed graphs \\ 33. Network flow \\ 34. Matching \\ Mathematical algorithms \\ 35. Random numbers \\ 36. Arithmetic \\ 37. Gaussian elimination \\ 38. Curve fitting \\ 39. Integration \\ Advanced topics \\ 40. Parallel algorithms \\ 41. The Fast Fourier Transform \\ 42. Dynamic programming \\ 43. Linear programming \\ 44. Exhaustive search \\ 45. NP-complete problems \\ Index

entry:
@Book{Sedgewick:1990:AC,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xii + 657",
  year =         "1990",
  ISBN =         "0-201-51425-7",
  ISBN-13 =      "978-0-201-51425-4",
  LCCN =         "QA76.73.C15 S43 1990",
  bibdate =      "Wed Dec 15 10:41:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fundamentals \\
                 1. Introduction \\
                 2. C \\
                 3. Elementary data structures \\
                 4. Trees \\
                 5. Recursion \\
                 6. Analysis of algorithms \\
                 7. Implementation of algorithms \\
                 Sorting algorithms \\
                 8. Elementary sorting methods \\
                 9. Quicksort \\
                 10. Radix sorting \\
                 11. Priority queues \\
                 12. Mergesort \\
                 13. External sorting \\
                 Searching algorithms \\
                 14. Elementary searching methods \\
                 15. Balanced trees \\
                 16. Hashing \\
                 17. Radix searching \\
                 18. External searching \\
                 String processing \\
                 19. String searching \\
                 20. Pattern matching \\
                 21. Parsing \\
                 22. File compression \\
                 23. Cryptology \\
                 Geometry algorithms \\
                 24. Elementary geometric methods \\
                 25. Finding the convex hull \\
                 26. Range searching \\
                 27. Geometric intersection \\
                 28. Closet-point problems \\
                 Graph algorithms \\
                 29. Elementary graph algorithms \\
                 30. Connectivity \\
                 31. Weighted graphs \\
                 32. Directed graphs \\
                 33. Network flow \\
                 34. Matching \\
                 Mathematical algorithms \\
                 35. Random numbers \\
                 36. Arithmetic \\
                 37. Gaussian elimination \\
                 38. Curve fitting \\
                 39. Integration \\
                 Advanced topics \\
                 40. Parallel algorithms \\
                 41. The Fast Fourier Transform \\
                 42. Dynamic programming \\
                 43. Linear programming \\
                 44. Exhaustive search \\
                 45. NP-complete problems \\
                 Index",
}


bibtype: book
filename: master.bib
label: Sedgewick:1992:AC
author: Robert Sedgewick
title: Algorithms in C++
publisher: pub-AW
address: pub-AW:adr
pages: xiv + 656
year: 1992
ISBN: 0-201-36118-3, 0-201-51059-6 OR 0201361183, 0201510596
ISBN13: 978-0-201-36118-6, 978-0-201-51059-1 OR 9780201361186, 9780201510591
LCCN: QA76.73.C153 S38 1992
MRclass: 68N15, 68-01, 68-04, 68P10, 68W10, 68W15, 68N15
bibdate: Mon Jan 3 12:10:05 1994
bibtimestamp: 1994.01.03 12:10:05 ???
ZMnumber: 0826.68025
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {C++}
bibsource:
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/numana1990.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib

TOC:
Fundamentals 1: Introduction Algorithms Outline of Topics 2: C++ (and C) Example: Euclid's Algorithm Types of Data Input/Output Concluding Remarks 3: Elementary Data Structures Arrays Linked Lists Storage Allocation Pushdown Stacks Queues Linked List Implementation of Stacks Abstract and Concrete Data Types 4: Trees Glossary Properties Representing Binary Trees Representing Forests Traversing Trees 5: Recursion Recurrences Divide-and-Conquer Recursive Tree Traversal Removing Recursion Perspective 6: Analysis of Algorithms Framework Classification of Algorithms Computational Complexity Average-Case Analysis Approximate and Asymptotic Results Basic Recurrences Perspective 7: Implementation of Algorithms Selecting an Algorithm Empirical Analysis Program Optimization Algorithms and Systems Sorting Algorithms 8: Elementary Sorting Methods Rules of the Game Selection Sort Insertion Sort Digression: Bubble Sort Performance Characteristics of Elementary Sorts Sorting Files with Large Records Shellsort Distribution Counting 9: Quicksort The Basic Algorithm Performance Characteristics of Quicksort Removing Recursion Small Subfiles Median-of-Three Partitioning Selection 10: Radix Sorting Bits Radix Exchange Sort Straight Radix Sort Performance Characteristics of Radix Sorts A Linear Sort 11: Priority Queues Elementary Implementations Heap Data Structure Algorithms on Heaps Heapsort Indirect Heaps Advanced Implementations 12: Mergesort Merging Mergesort List Mergesort Bottom-Up Mergesort Performance Characteristics Optimized Implementations Recursion Revisited 13: External Sorting Sort-Merge Balanced Multiway Merging Replacement Selection Practical Considerations Polyphase Merging An Easier Way Searching Algorithms 14: Elementary Searching Methods Sequential Searching Binary Search Binary Tree Search Deletion Indirect Binary Search Trees 15: Balanced Trees Top-Down 2-3-4 Trees Red-Black Trees Other Algorithms 16: Hashing Hash Functions Separate Chaining Linear Probing Double Hashing Perspective 17: Radix Searching Digital Search Trees Radix Search Tries Multiway Radix Searching Patricia 18: External Searching Indexed Sequential Access B-Trees Extendible Hashing Virtual Memory String Processing 19: String Searching A Short History Brute-Force Algorithm Knuth--Morris--Pratt Algorithm Boyer--Moore Algorithm Rabin--Karp Algorithm Multiple Searches 20: Pattern Matching Describing Patterns Pattern Matching Machines Representing the Machine Simulating the Machine 21: Parsing Context-Free Grammars Top-Down Parsing Bottom-Up Parsing Compilers Compiler-Compilers 22: File Compression Run-Length Encoding Variable-Length Encoding Building the Huffman Code Implementation 23: Cryptology Rules of the Game Simple Methods Encryption/Decryption Machines Public-Key Cryptosystems Geometric Algorithms 24: Elementary Geometric Methods Points, Lines, and Polygons Line Segment Intersection Simple Closed Path Inclusion in a Polygon Perspective 25: Finding the Convex Hull Rules of the Game Package-Wrapping The Graham Scan Interior Elimination Performance Issues 26: Range Searching Elementary Methods Grid Method Two-Dimensional Trees Multidimensional Range Searching 27: Geometric Intersection Horizontal and Vertical Lines Implementation General Line Intersection 28: Closest-Point Problems Closest-Pair Problem Voronoi Diagrams Graph Algorithms 29: Elementary Graph Algorithms Glossary Representation Depth-First Search Nonrecursive Depth-First Search Breadth-First Search Mazes Perspective 30: Connectivity Connected Components Biconnectivity Union-Find Algorithms 31: Weighted Graphs Minimum Spanning Tree Priority-First Search Kruskal's Method Shortest Path Minimum Spanning Tree and Shortest Paths in Dense Graphs Geometric Problems 32: Directed Graphs Depth-First Search Transitive Closure All Shortest Paths Topological Sorting Strongly Connected Components 33: Network Flow The Network Flow Problem Ford--Fulkerson Method Network Searching 34: Matching Bipartite Graphs Stable Marriage Problem Advanced Algorithms Mathematical Algorithms 35: Random Numbers Applications Linear Congruential Method Additive Congruential Method Testing Randomness Implementation Notes 36: Arithmetic Polynomial Arithmetic Polynomial Evaluation and Interpolation Polynomial Multiplication Arithmetic Operations with Large Integers Matrix Arithmetic 37: Gaussian Elimination A Simple Example Outline of the Method Variations and Extensions 38: Curve Fitting Polynomial Interpolation Spline Interpolation Method of Least Squares 39: Integration Symbolic Integration Simple Quadrature Methods Compound Methods Adaptive Quadrature Advanced Topics 40: Parallel Algorithms General Approaches Perfect Shuffles Systolic Arrays Perspective 41: The Fast Fourier Transform Evaluate, Multiply, Interpolate Complex Roots of Unity Evaluation at the Roots of Unity Interpolation at the Roots of Unity Implementation 42: Dynamic Programming Knapsack Problem Matrix Chain Product Optimal Binary Search Trees Time and Space Requirements 43: Linear Programming Linear Programs Geometric Interpretation The Simplex Method Implementation 44: Exhaustive Search Exhaustive Search in Graphs Backtracking Digression: Permutation Generation Approximation Algorithms 45: NP-Complete Problems Deterministic and Nondeterministic Polynomial-Time Algorithms NP-Completeness Cook's Theorem Some NP-Complete Problems

rawTOC:
Fundamentals \\ 1: Introduction \\ Algorithms \\ Outline of Topics \\ 2: C++ (and C) \\ Example: Euclid's Algorithm \\ Types of Data \\ Input/Output \\ Concluding Remarks \\ 3: Elementary Data Structures \\ Arrays \\ Linked Lists \\ Storage Allocation \\ Pushdown Stacks \\ Queues \\ Linked List Implementation of Stacks \\ Abstract and Concrete Data Types \\ 4: Trees \\ Glossary \\ Properties \\ Representing Binary Trees \\ Representing Forests \\ Traversing Trees \\ 5: Recursion \\ Recurrences \\ Divide-and-Conquer \\ Recursive Tree Traversal \\ Removing Recursion \\ Perspective \\ 6: Analysis of Algorithms \\ Framework \\ Classification of Algorithms \\ Computational Complexity \\ Average-Case Analysis \\ Approximate and Asymptotic Results \\ Basic Recurrences \\ Perspective \\ 7: Implementation of Algorithms \\ Selecting an Algorithm \\ Empirical Analysis \\ Program Optimization \\ Algorithms and Systems \\ Sorting Algorithms \\ 8: Elementary Sorting Methods \\ Rules of the Game \\ Selection Sort \\ Insertion Sort \\ Digression: Bubble Sort \\ Performance Characteristics of Elementary Sorts \\ Sorting Files with Large Records \\ Shellsort \\ Distribution Counting \\ 9: Quicksort \\ The Basic Algorithm \\ Performance Characteristics of Quicksort \\ Removing Recursion \\ Small Subfiles \\ Median-of-Three Partitioning \\ Selection \\ 10: Radix Sorting \\ Bits \\ Radix Exchange Sort \\ Straight Radix Sort \\ Performance Characteristics of Radix Sorts \\ A Linear Sort \\ 11: Priority Queues \\ Elementary Implementations \\ Heap Data Structure \\ Algorithms on Heaps \\ Heapsort \\ Indirect Heaps \\ Advanced Implementations \\ 12: Mergesort \\ Merging \\ Mergesort \\ List Mergesort \\ Bottom-Up Mergesort \\ Performance Characteristics \\ Optimized Implementations \\ Recursion Revisited \\ 13: External Sorting \\ Sort-Merge \\ Balanced Multiway Merging \\ Replacement Selection \\ Practical Considerations \\ Polyphase Merging \\ An Easier Way \\ Searching Algorithms \\ 14: Elementary Searching Methods \\ Sequential Searching \\ Binary Search \\ Binary Tree Search \\ Deletion \\ Indirect Binary Search Trees \\ 15: Balanced Trees \\ Top-Down 2-3-4 Trees \\ Red-Black Trees \\ Other Algorithms \\ 16: Hashing \\ Hash Functions \\ Separate Chaining \\ Linear Probing \\ Double Hashing \\ Perspective \\ 17: Radix Searching \\ Digital Search Trees \\ Radix Search Tries \\ Multiway Radix Searching \\ Patricia \\ 18: External Searching \\ Indexed Sequential Access \\ B-Trees \\ Extendible Hashing \\ Virtual Memory \\ String Processing \\ 19: String Searching \\ A Short History \\ Brute-Force Algorithm \\ Knuth--Morris--Pratt Algorithm \\ Boyer--Moore Algorithm \\ Rabin--Karp Algorithm \\ Multiple Searches \\ 20: Pattern Matching \\ Describing Patterns \\ Pattern Matching Machines \\ Representing the Machine \\ Simulating the Machine \\ 21: Parsing \\ Context-Free Grammars \\ Top-Down Parsing \\ Bottom-Up Parsing \\ Compilers \\ Compiler-Compilers \\ 22: File Compression \\ Run-Length Encoding \\ Variable-Length Encoding \\ Building the Huffman Code \\ Implementation \\ 23: Cryptology \\ Rules of the Game \\ Simple Methods \\ Encryption/Decryption Machines \\ Public-Key Cryptosystems \\ Geometric Algorithms \\ 24: Elementary Geometric Methods \\ Points, Lines, and Polygons \\ Line Segment Intersection \\ Simple Closed Path \\ Inclusion in a Polygon \\ Perspective \\ 25: Finding the Convex Hull \\ Rules of the Game \\ Package-Wrapping \\ The Graham Scan \\ Interior Elimination \\ Performance Issues \\ 26: Range Searching \\ Elementary Methods \\ Grid Method \\ Two-Dimensional Trees \\ Multidimensional Range Searching \\ 27: Geometric Intersection \\ Horizontal and Vertical Lines \\ Implementation \\ General Line Intersection \\ 28: Closest-Point Problems \\ Closest-Pair Problem \\ Voronoi Diagrams \\ Graph Algorithms \\ 29: Elementary Graph Algorithms \\ Glossary \\ Representation \\ Depth-First Search \\ Nonrecursive Depth-First Search \\ Breadth-First Search \\ Mazes \\ Perspective \\ 30: Connectivity \\ Connected Components \\ Biconnectivity \\ Union-Find Algorithms \\ 31: Weighted Graphs \\ Minimum Spanning Tree \\ Priority-First Search \\ Kruskal's Method \\ Shortest Path \\ Minimum Spanning Tree and Shortest Paths in Dense Graphs \\ Geometric Problems \\ 32: Directed Graphs \\ Depth-First Search \\ Transitive Closure \\ All Shortest Paths \\ Topological Sorting \\ Strongly Connected Components \\ 33: Network Flow \\ The Network Flow Problem \\ Ford--Fulkerson Method \\ Network Searching \\ 34: Matching \\ Bipartite Graphs \\ Stable Marriage Problem \\ Advanced Algorithms \\ Mathematical Algorithms \\ 35: Random Numbers \\ Applications \\ Linear Congruential Method \\ Additive Congruential Method \\ Testing Randomness \\ Implementation Notes \\ 36: Arithmetic \\ Polynomial Arithmetic \\ Polynomial Evaluation and Interpolation \\ Polynomial Multiplication \\ Arithmetic Operations with Large Integers \\ Matrix Arithmetic \\ 37: Gaussian Elimination \\ A Simple Example \\ Outline of the Method \\ Variations and Extensions \\ 38: Curve Fitting \\ Polynomial Interpolation \\ Spline Interpolation \\ Method of Least Squares \\ 39: Integration \\ Symbolic Integration \\ Simple Quadrature Methods \\ Compound Methods \\ Adaptive Quadrature \\ Advanced Topics \\ 40: Parallel Algorithms \\ General Approaches \\ Perfect Shuffles \\ Systolic Arrays \\ Perspective \\ 41: The Fast Fourier Transform \\ Evaluate, Multiply, Interpolate \\ Complex Roots of Unity \\ Evaluation at the Roots of Unity \\ Interpolation at the Roots of Unity \\ Implementation \\ 42: Dynamic Programming \\ Knapsack Problem \\ Matrix Chain Product \\ Optimal Binary Search Trees \\ Time and Space Requirements \\ 43: Linear Programming \\ Linear Programs \\ Geometric Interpretation \\ The Simplex Method \\ Implementation \\ 44: Exhaustive Search \\ Exhaustive Search in Graphs \\ Backtracking \\ Digression: Permutation Generation \\ Approximation Algorithms \\ 45: NP-Complete Problems \\ Deterministic and Nondeterministic Polynomial-Time Algorithms \\ NP-Completeness \\ Cook's Theorem \\ Some NP-Complete Problems

entry:
@Book{Sedgewick:1992:AC,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C++}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 656",
  year =         "1992",
  ISBN =         "0-201-36118-3, 0-201-51059-6",
  ISBN-13 =      "978-0-201-36118-6, 978-0-201-51059-1",
  LCCN =         "QA76.73.C153 S38 1992",
  MRclass =      "68N15, 68-01, 68-04, 68P10, 68W10, 68W15, 68N15",
  bibdate =      "Mon Jan 3 12:10:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/hash.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/numana1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/prng.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  ZMnumber =     "0826.68025",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Fundamentals \\
                 1: Introduction \\
                 Algorithms \\
                 Outline of Topics \\
                 2: C++ (and C) \\
                 Example: Euclid's Algorithm \\
                 Types of Data \\
                 Input/Output \\
                 Concluding Remarks \\
                 3: Elementary Data Structures \\
                 Arrays \\
                 Linked Lists \\
                 Storage Allocation \\
                 Pushdown Stacks \\
                 Queues \\
                 Linked List Implementation of Stacks \\
                 Abstract and Concrete Data Types \\
                 4: Trees \\
                 Glossary \\
                 Properties \\
                 Representing Binary Trees \\
                 Representing Forests \\
                 Traversing Trees \\
                 5: Recursion \\
                 Recurrences \\
                 Divide-and-Conquer \\
                 Recursive Tree Traversal \\
                 Removing Recursion \\
                 Perspective \\
                 6: Analysis of Algorithms \\
                 Framework \\
                 Classification of Algorithms \\
                 Computational Complexity \\
                 Average-Case Analysis \\
                 Approximate and Asymptotic Results \\
                 Basic Recurrences \\
                 Perspective \\
                 7: Implementation of Algorithms \\
                 Selecting an Algorithm \\
                 Empirical Analysis \\
                 Program Optimization \\
                 Algorithms and Systems \\
                 Sorting Algorithms \\
                 8: Elementary Sorting Methods \\
                 Rules of the Game \\
                 Selection Sort \\
                 Insertion Sort \\
                 Digression: Bubble Sort \\
                 Performance Characteristics of Elementary Sorts \\
                 Sorting Files with Large Records \\
                 Shellsort \\
                 Distribution Counting \\
                 9: Quicksort \\
                 The Basic Algorithm \\
                 Performance Characteristics of Quicksort \\
                 Removing Recursion \\
                 Small Subfiles \\
                 Median-of-Three Partitioning \\
                 Selection \\
                 10: Radix Sorting \\
                 Bits \\
                 Radix Exchange Sort \\
                 Straight Radix Sort \\
                 Performance Characteristics of Radix Sorts \\
                 A Linear Sort \\
                 11: Priority Queues \\
                 Elementary Implementations \\
                 Heap Data Structure \\
                 Algorithms on Heaps \\
                 Heapsort \\
                 Indirect Heaps \\
                 Advanced Implementations \\
                 12: Mergesort \\
                 Merging \\
                 Mergesort \\
                 List Mergesort \\
                 Bottom-Up Mergesort \\
                 Performance Characteristics \\
                 Optimized Implementations \\
                 Recursion Revisited \\
                 13: External Sorting \\
                 Sort-Merge \\
                 Balanced Multiway Merging \\
                 Replacement Selection \\
                 Practical Considerations \\
                 Polyphase Merging \\
                 An Easier Way \\
                 Searching Algorithms \\
                 14: Elementary Searching Methods \\
                 Sequential Searching \\
                 Binary Search \\
                 Binary Tree Search \\
                 Deletion \\
                 Indirect Binary Search Trees \\
                 15: Balanced Trees \\
                 Top-Down 2-3-4 Trees \\
                 Red-Black Trees \\
                 Other Algorithms \\
                 16: Hashing \\
                 Hash Functions \\
                 Separate Chaining \\
                 Linear Probing \\
                 Double Hashing \\
                 Perspective \\
                 17: Radix Searching \\
                 Digital Search Trees \\
                 Radix Search Tries \\
                 Multiway Radix Searching \\
                 Patricia \\
                 18: External Searching \\
                 Indexed Sequential Access \\
                 B-Trees \\
                 Extendible Hashing \\
                 Virtual Memory \\
                 String Processing \\
                 19: String Searching \\
                 A Short History \\
                 Brute-Force Algorithm \\
                 Knuth--Morris--Pratt Algorithm \\
                 Boyer--Moore Algorithm \\
                 Rabin--Karp Algorithm \\
                 Multiple Searches \\
                 20: Pattern Matching \\
                 Describing Patterns \\
                 Pattern Matching Machines \\
                 Representing the Machine \\
                 Simulating the Machine \\
                 21: Parsing \\
                 Context-Free Grammars \\
                 Top-Down Parsing \\
                 Bottom-Up Parsing \\
                 Compilers \\
                 Compiler-Compilers \\
                 22: File Compression \\
                 Run-Length Encoding \\
                 Variable-Length Encoding \\
                 Building the Huffman Code \\
                 Implementation \\
                 23: Cryptology \\
                 Rules of the Game \\
                 Simple Methods \\
                 Encryption/Decryption Machines \\
                 Public-Key Cryptosystems \\
                 Geometric Algorithms \\
                 24: Elementary Geometric Methods \\
                 Points, Lines, and Polygons \\
                 Line Segment Intersection \\
                 Simple Closed Path \\
                 Inclusion in a Polygon \\
                 Perspective \\
                 25: Finding the Convex Hull \\
                 Rules of the Game \\
                 Package-Wrapping \\
                 The Graham Scan \\
                 Interior Elimination \\
                 Performance Issues \\
                 26: Range Searching \\
                 Elementary Methods \\
                 Grid Method \\
                 Two-Dimensional Trees \\
                 Multidimensional Range Searching \\
                 27: Geometric Intersection \\
                 Horizontal and Vertical Lines \\
                 Implementation \\
                 General Line Intersection \\
                 28: Closest-Point Problems \\
                 Closest-Pair Problem \\
                 Voronoi Diagrams \\
                 Graph Algorithms \\
                 29: Elementary Graph Algorithms \\
                 Glossary \\
                 Representation \\
                 Depth-First Search \\
                 Nonrecursive Depth-First Search \\
                 Breadth-First Search \\
                 Mazes \\
                 Perspective \\
                 30: Connectivity \\
                 Connected Components \\
                 Biconnectivity \\
                 Union-Find Algorithms \\
                 31: Weighted Graphs \\
                 Minimum Spanning Tree \\
                 Priority-First Search \\
                 Kruskal's Method \\
                 Shortest Path \\
                 Minimum Spanning Tree and Shortest Paths in Dense
                 Graphs \\
                 Geometric Problems \\
                 32: Directed Graphs \\
                 Depth-First Search \\
                 Transitive Closure \\
                 All Shortest Paths \\
                 Topological Sorting \\
                 Strongly Connected Components \\
                 33: Network Flow \\
                 The Network Flow Problem \\
                 Ford--Fulkerson Method \\
                 Network Searching \\
                 34: Matching \\
                 Bipartite Graphs \\
                 Stable Marriage Problem \\
                 Advanced Algorithms \\
                 Mathematical Algorithms \\
                 35: Random Numbers \\
                 Applications \\
                 Linear Congruential Method \\
                 Additive Congruential Method \\
                 Testing Randomness \\
                 Implementation Notes \\
                 36: Arithmetic \\
                 Polynomial Arithmetic \\
                 Polynomial Evaluation and Interpolation \\
                 Polynomial Multiplication \\
                 Arithmetic Operations with Large Integers \\
                 Matrix Arithmetic \\
                 37: Gaussian Elimination \\
                 A Simple Example \\
                 Outline of the Method \\
                 Variations and Extensions \\
                 38: Curve Fitting \\
                 Polynomial Interpolation \\
                 Spline Interpolation \\
                 Method of Least Squares \\
                 39: Integration \\
                 Symbolic Integration \\
                 Simple Quadrature Methods \\
                 Compound Methods \\
                 Adaptive Quadrature \\
                 Advanced Topics \\
                 40: Parallel Algorithms \\
                 General Approaches \\
                 Perfect Shuffles \\
                 Systolic Arrays \\
                 Perspective \\
                 41: The Fast Fourier Transform \\
                 Evaluate, Multiply, Interpolate \\
                 Complex Roots of Unity \\
                 Evaluation at the Roots of Unity \\
                 Interpolation at the Roots of Unity \\
                 Implementation \\
                 42: Dynamic Programming \\
                 Knapsack Problem \\
                 Matrix Chain Product \\
                 Optimal Binary Search Trees \\
                 Time and Space Requirements \\
                 43: Linear Programming \\
                 Linear Programs \\
                 Geometric Interpretation \\
                 The Simplex Method \\
                 Implementation \\
                 44: Exhaustive Search \\
                 Exhaustive Search in Graphs \\
                 Backtracking \\
                 Digression: Permutation Generation \\
                 Approximation Algorithms \\
                 45: NP-Complete Problems \\
                 Deterministic and Nondeterministic Polynomial-Time
                 Algorithms \\
                 NP-Completeness \\
                 Cook's Theorem \\
                 Some NP-Complete Problems",
}


bibtype: book
filename: master.bib
label: Sedgewick:1993:AM
author: Robert Sedgewick
title: Algorithms in Modula-3
publisher: pub-AW
address: pub-AW:adr
pages: xiv + 656
year: 1993
ISBN: 0-201-53351-0 OR 0201533510
ISBN13: 978-0-201-53351-4 OR 9780201533514
LCCN: QA76.73.M63 S43 1993
bibdate: Mon Jan 3 12:10:05 1994
bibtimestamp: 1994.01.03 12:10:05 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {Modula-3}
TOC:
1: Introduction 2: Modula-3 3: Elementary Data Structures 4: Trees 5: Recursion 6: Analysis of Algorithms 7: Implementation of Algorithms 8: Elementary Sorting Methods 9: Quicksort 10: Radix Sorting 11: Priority Queues 12: Mergesort 13: External Sorting 14: Elementary Searching Methods 15: Balanced Trees 16: Hashing 17: Radix Searching 18: External Searching 19: String Searching 20: Pattern Matching 21: Parsing 22: File Compression 23: Cryptology 24: Elementary Geometric Methods 25: Finding the Convex Hull 26: Range Searching 27: Geometric Intersection 28: Closest-Point Problems 29: Elementary Graph Algorithms 30: Connectivity 31: Weighted Graphs 32: Directed Graphs 33: Network Flow 34: Matching 35: Random Numbers 36: Arithmetic 37: Gaussian Elimination 38: Curve Fitting 39: Integration 40: Parallel Algorithms 41: The Fast Fourier Transform 42: Dynamic Programming 43: Linear Programming 44: Exhaustive Search 45: NP-Complete Problems

rawTOC:
1: Introduction \\ 2: Modula-3 \\ 3: Elementary Data Structures \\ 4: Trees \\ 5: Recursion \\ 6: Analysis of Algorithms \\ 7: Implementation of Algorithms \\ 8: Elementary Sorting Methods \\ 9: Quicksort \\ 10: Radix Sorting \\ 11: Priority Queues \\ 12: Mergesort \\ 13: External Sorting \\ 14: Elementary Searching Methods \\ 15: Balanced Trees \\ 16: Hashing \\ 17: Radix Searching \\ 18: External Searching \\ 19: String Searching \\ 20: Pattern Matching \\ 21: Parsing \\ 22: File Compression \\ 23: Cryptology \\ 24: Elementary Geometric Methods \\ 25: Finding the Convex Hull \\ 26: Range Searching \\ 27: Geometric Intersection \\ 28: Closest-Point Problems \\ 29: Elementary Graph Algorithms \\ 30: Connectivity \\ 31: Weighted Graphs \\ 32: Directed Graphs \\ 33: Network Flow \\ 34: Matching \\ 35: Random Numbers \\ 36: Arithmetic \\ 37: Gaussian Elimination \\ 38: Curve Fitting \\ 39: Integration \\ 40: Parallel Algorithms \\ 41: The Fast Fourier Transform \\ 42: Dynamic Programming \\ 43: Linear Programming \\ 44: Exhaustive Search \\ 45: NP-Complete Problems

entry:
@Book{Sedgewick:1993:AM,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {Modula-3}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 656",
  year =         "1993",
  ISBN =         "0-201-53351-0",
  ISBN-13 =      "978-0-201-53351-4",
  LCCN =         "QA76.73.M63 S43 1993",
  bibdate =      "Mon Jan 3 12:10:05 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "1: Introduction \\
                 2: Modula-3 \\
                 3: Elementary Data Structures \\
                 4: Trees \\
                 5: Recursion \\
                 6: Analysis of Algorithms \\
                 7: Implementation of Algorithms \\
                 8: Elementary Sorting Methods \\
                 9: Quicksort \\
                 10: Radix Sorting \\
                 11: Priority Queues \\
                 12: Mergesort \\
                 13: External Sorting \\
                 14: Elementary Searching Methods \\
                 15: Balanced Trees \\
                 16: Hashing \\
                 17: Radix Searching \\
                 18: External Searching \\
                 19: String Searching \\
                 20: Pattern Matching \\
                 21: Parsing \\
                 22: File Compression \\
                 23: Cryptology \\
                 24: Elementary Geometric Methods \\
                 25: Finding the Convex Hull \\
                 26: Range Searching \\
                 27: Geometric Intersection \\
                 28: Closest-Point Problems \\
                 29: Elementary Graph Algorithms \\
                 30: Connectivity \\
                 31: Weighted Graphs \\
                 32: Directed Graphs \\
                 33: Network Flow \\
                 34: Matching \\
                 35: Random Numbers \\
                 36: Arithmetic \\
                 37: Gaussian Elimination \\
                 38: Curve Fitting \\
                 39: Integration \\
                 40: Parallel Algorithms \\
                 41: The Fast Fourier Transform \\
                 42: Dynamic Programming \\
                 43: Linear Programming \\
                 44: Exhaustive Search \\
                 45: NP-Complete Problems",
}


bibtype: book
filename: master.bib
label: Sedgewick:1998:ACP
author: Robert Sedgewick
title: Algorithms in C: Parts 1--4: Fundamentals, data structures, sorting, searching
publisher: pub-AW
address: pub-AW:adr
pages: xvii + 702
year: 1998
ISBN: 0-201-31452-5 (paperback) OR 0201314525 (paperback)
ISBN13: 978-0-201-31452-6 (paperback) OR 9780201314526 (paperback)
LCCN: QA76.73.C15 S43 1998
bibdate: Tue Aug 25 17:20:35 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.08.25 17:20:35 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {C}: Parts 1--4: Fundamentals, data structures, sorting, searching
shortTOC: Part 1: Fundamentals Part 2: Data structures Part 3: Sorting Part 4: Searching
rawshortTOC: Part 1: Fundamentals \\ Part 2: Data structures \\ Part 3: Sorting \\ Part 4: Searching
abstract:
Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

TOC:
Fundamentals 1. Introduction / 3 1.1 Algorithms / 4 1.2 A Sample Problem--Connectivity / 6 1.3 Union-Find Algorithms / 11 1.4 Perspective / 22 1.5 Summary of Topics / 23 2. Principles of Algorithm Analysis / 27 2.1 Implementation and Empirical Analysis / 28 2.2 Analysis of Algorithms / 33 2.3 Growth of Functions / 36 2.4 Big-Oh notation / 44 2.5 Basic Recurrences / 49 2.6 Examples of Algorithm Analysis / 53 2.7 Guarantees, Predictions, and Limitations / 60 Data Structures 3. Elementary Data Structures / 69 3.1 Building Blocks / 70 3.2 Arrays / 83 3.3 Linked Lists / 90 3.4 Elementary List Processing / 96 3.5 Memory Allocation for Lists / 105 3.6 Strings / 108 3.7 Compound Data Structures / 115 4. Abstract Data Types / 127 4.1 Abstract Objects and Collections of Objects / 131 4.2 Pushdown Stack ADT / 135 4.3 Examples of Stack ADT Clients / 138 4.4 Stack ADT Implementations / 145 4.5 Creation of a New ADT / 149 4.6 FIFO Queues and Generalized Queues / 153 4.7 Duplicate and Index Items / 161 4.8 First-Class ADTs / 166 4.9 Application-Based ADT Example / 179 4.10 Perspective / 185 5. Recursion and Trees / 187 5.1 Recursive Algorithms / 188 5.2 Divide and Conquer / 196 5.3 Dynamic Programming / 209 5.4 Trees / 217 5.5 Mathematical Properties of Trees / 226 5.6 Tree Traversal / 230 5.7 Recursive Binary-Tree Algorithms / 236 5.8 Graph Traversal / 241 5.9 Perspective / 248 6. Elementary Sorting Methods / 253 6.1 Rules of the Game / 255 6.2 Selection Sort / 261 6.3 Insertion Sort / 262 6.4 Bubble Sort / 265 6.5 Performance Characteristics of Elementary Sorts / 267 6.6 Shellsort / 273 6.7 Sorting Other Types of Data / 282 6.8 Index and Pointer Sorting / 287 6.9 Sorting Linked Lists / 295 6.10 Key-Indexed Counting / 298 7. Quicksort / 303 7.1 The Basic Algorithm / 304 7.2 Performance Characteristics of Quicksort / 309 7.3 Stack Size / 313 7.4 Small Subfiles / 316 7.5 Median-of-Three Partitioning / 319 7.6 Duplicate Keys / 324 7.7 Strings and Vectors / 327 7.8 Selection / 329 8. Mergesort / 335 8.1 Two-Way Merging / 336 8.2 Abstract In-place Merge / 339 8.3 Top-Down Mergesort / 341 8.4 Improvements to the Basic Algorithm / 344 8.5 Bottom-Up Mergesort / 347 8.6 Performance Characteristics of Mergesort / 351 8.7 Linked-List Implementations of Mergesort / 354 8.8 Recursion Revisited / 357 9. Priority Queues and Heapsort / 361 9.1 Elementary Implementations / 365 9.2 Heap Data Structure / 369 9.3 Algorithms on Heaps / 371 9.4 Heapsort / 377 9.5 Priority-Queue ADT / 384 9.6 Priority Queues for Index Items / 389 9.7 Binomial Queues / 392 10. Radix Sorting / 403 10.1 Bits, Bytes, and Words / 405 10.2 Binary Quicksort / 409 10.3 MSD Radix Sort / 413 10.4 Three-Way Radix Quicksort / 421 10.5 LSD Radix Sort / 425 10.6 Performance Characteristics of Radix Sorts / 429 10.7 Sublinear-Time Sorts / 433 11. Special-Purpose Sorts / 439 11.1 Batcher's Odd-Even Mergesort / 441 11.2 Sorting Networks / 446 11.3 External Sorting / 454 11.4 Sort-Merge Implementations / 460 11.5 Parallel Sort/Merge / 467 Searching 12. Symbol Tables and BSTs / 477 12.1 Symbol-Table Abstract Data Type / 479 12.2 Key-Indexed Search / 485 12.3 Sequential Search / 489 12.4 Binary Search / 497 12.5 Binary Search Trees (BSTs) / 502 12.6 Performance Characteristics of BSTs / 508 12.7 Index Implementations with Symbol Tables / 511 12.8 Insertion at the Root in BSTs / 516 12.9 BST Implementations of Other ADT Functions / 520 13. Balanced Trees / 529 13.1 Randomized BSTs / 533 13.2 Splay BSTs / 540 13.3 Top-Down 2-3-4 Trees / 546 13.4 Red-Black Trees / 551 13.5 Skip Lists / 561 13.6 Performance Characteristics / 569 14. Hashing / 573 14.1 Hash Functions / 574 14.2 Separate Chaining / 583 14.3 Linear Probing / 588 14.4 Double Hashing / 594 14.5 Dynamic Hash Tables / 599 14.6 Perspective / 603 15. Radix Search / 609 15.1 Digital Search Trees / 610 15.2 Tries / 614 15.3 Patricia Tries / 623 15.4 Multiway Tries and TSTs / 632 15.5 Text String Index Applications / 649 16. External Searching / 655 16.1 Rules of the Game / 657 16.2 Indexed Sequential Access / 660 16.3 B Trees / 662 16.4 Extendible Hashing / 676 16.5 Perspective / 689 Index / 693

rawabstract:
Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

rawTOC:
Fundamentals \\ 1. Introduction / 3 \\ 1.1 Algorithms / 4 \\ 1.2 A Sample Problem--Connectivity / 6 \\ 1.3 Union-Find Algorithms / 11 \\ 1.4 Perspective / 22 \\ 1.5 Summary of Topics / 23 \\ 2. Principles of Algorithm Analysis / 27 \\ 2.1 Implementation and Empirical Analysis / 28 \\ 2.2 Analysis of Algorithms / 33 \\ 2.3 Growth of Functions / 36 \\ 2.4 Big-Oh notation / 44 \\ 2.5 Basic Recurrences / 49 \\ 2.6 Examples of Algorithm Analysis / 53 \\ 2.7 Guarantees, Predictions, and Limitations / 60 \\ Data Structures \\ 3. Elementary Data Structures / 69 \\ 3.1 Building Blocks / 70 \\ 3.2 Arrays / 83 \\ 3.3 Linked Lists / 90 \\ 3.4 Elementary List Processing / 96 \\ 3.5 Memory Allocation for Lists / 105 \\ 3.6 Strings / 108 \\ 3.7 Compound Data Structures / 115 \\ 4. Abstract Data Types / 127 \\ 4.1 Abstract Objects and Collections of Objects / 131 \\ 4.2 Pushdown Stack ADT / 135 \\ 4.3 Examples of Stack ADT Clients / 138 \\ 4.4 Stack ADT Implementations / 145 \\ 4.5 Creation of a New ADT / 149 \\ 4.6 FIFO Queues and Generalized Queues / 153 \\ 4.7 Duplicate and Index Items / 161 \\ 4.8 First-Class ADTs / 166 \\ 4.9 Application-Based ADT Example / 179 \\ 4.10 Perspective / 185 \\ 5. Recursion and Trees / 187 \\ 5.1 Recursive Algorithms / 188 \\ 5.2 Divide and Conquer / 196 \\ 5.3 Dynamic Programming / 209 \\ 5.4 Trees / 217 \\ 5.5 Mathematical Properties of Trees / 226 \\ 5.6 Tree Traversal / 230 \\ 5.7 Recursive Binary-Tree Algorithms / 236 \\ 5.8 Graph Traversal / 241 \\ 5.9 Perspective / 248 \\ 6. Elementary Sorting Methods / 253 \\ 6.1 Rules of the Game / 255 \\ 6.2 Selection Sort / 261 \\ 6.3 Insertion Sort / 262 \\ 6.4 Bubble Sort / 265 \\ 6.5 Performance Characteristics of Elementary Sorts / 267 \\ 6.6 Shellsort / 273 \\ 6.7 Sorting Other Types of Data / 282 \\ 6.8 Index and Pointer Sorting / 287 \\ 6.9 Sorting Linked Lists / 295 \\ 6.10 Key-Indexed Counting / 298 \\ 7. Quicksort / 303 \\ 7.1 The Basic Algorithm / 304 \\ 7.2 Performance Characteristics of Quicksort / 309 \\ 7.3 Stack Size / 313 \\ 7.4 Small Subfiles / 316 \\ 7.5 Median-of-Three Partitioning / 319 \\ 7.6 Duplicate Keys / 324 \\ 7.7 Strings and Vectors / 327 \\ 7.8 Selection / 329 \\ 8. Mergesort / 335 \\ 8.1 Two-Way Merging / 336 \\ 8.2 Abstract In-place Merge / 339 \\ 8.3 Top-Down Mergesort / 341 \\ 8.4 Improvements to the Basic Algorithm / 344 \\ 8.5 Bottom-Up Mergesort / 347 \\ 8.6 Performance Characteristics of Mergesort / 351 \\ 8.7 Linked-List Implementations of Mergesort / 354 \\ 8.8 Recursion Revisited / 357 \\ 9. Priority Queues and Heapsort / 361 \\ 9.1 Elementary Implementations / 365 \\ 9.2 Heap Data Structure / 369 \\ 9.3 Algorithms on Heaps / 371 \\ 9.4 Heapsort / 377 \\ 9.5 Priority-Queue ADT / 384 \\ 9.6 Priority Queues for Index Items / 389 \\ 9.7 Binomial Queues / 392 \\ 10. Radix Sorting / 403 \\ 10.1 Bits, Bytes, and Words / 405 \\ 10.2 Binary Quicksort / 409 \\ 10.3 MSD Radix Sort / 413 \\ 10.4 Three-Way Radix Quicksort / 421 \\ 10.5 LSD Radix Sort / 425 \\ 10.6 Performance Characteristics of Radix Sorts / 429 \\ 10.7 Sublinear-Time Sorts / 433 \\ 11. Special-Purpose Sorts / 439 \\ 11.1 Batcher's Odd-Even Mergesort / 441 \\ 11.2 Sorting Networks / 446 \\ 11.3 External Sorting / 454 \\ 11.4 Sort-Merge Implementations / 460 \\ 11.5 Parallel Sort/Merge / 467 \\ Searching \\ 12. Symbol Tables and BSTs / 477 \\ 12.1 Symbol-Table Abstract Data Type / 479 \\ 12.2 Key-Indexed Search / 485 \\ 12.3 Sequential Search / 489 \\ 12.4 Binary Search / 497 \\ 12.5 Binary Search Trees (BSTs) / 502 \\ 12.6 Performance Characteristics of BSTs / 508 \\ 12.7 Index Implementations with Symbol Tables / 511 \\ 12.8 Insertion at the Root in BSTs / 516 \\ 12.9 BST Implementations of Other ADT Functions / 520 \\ 13. Balanced Trees / 529 \\ 13.1 Randomized BSTs / 533 \\ 13.2 Splay BSTs / 540 \\ 13.3 Top-Down 2-3-4 Trees / 546 \\ 13.4 Red-Black Trees / 551 \\ 13.5 Skip Lists / 561 \\ 13.6 Performance Characteristics / 569 \\ 14. Hashing / 573 \\ 14.1 Hash Functions / 574 \\ 14.2 Separate Chaining / 583 \\ 14.3 Linear Probing / 588 \\ 14.4 Double Hashing / 594 \\ 14.5 Dynamic Hash Tables / 599 \\ 14.6 Perspective / 603 \\ 15. Radix Search / 609 \\ 15.1 Digital Search Trees / 610 \\ 15.2 Tries / 614 \\ 15.3 Patricia Tries / 623 \\ 15.4 Multiway Tries and TSTs / 632 \\ 15.5 Text String Index Applications / 649 \\ 16. External Searching / 655 \\ 16.1 Rules of the Game / 657 \\ 16.2 Indexed Sequential Access / 660 \\ 16.3 B Trees / 662 \\ 16.4 Extendible Hashing / 676 \\ 16.5 Perspective / 689 \\ Index / 693

entry:
@Book{Sedgewick:1998:ACP,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C}: Parts 1--4: Fundamentals, data
                 structures, sorting, searching",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvii + 702",
  year =         "1998",
  ISBN =         "0-201-31452-5 (paperback)",
  ISBN-13 =      "978-0-201-31452-6 (paperback)",
  LCCN =         "QA76.73.C15 S43 1998",
  bibdate =      "Tue Aug 25 17:20:35 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$33.50",
  abstract =     "Robert Sedgewick has thoroughly rewritten and
                 substantially expanded his popular work to provide
                 current and comprehensive coverage of important
                 algorithms and data structures. Many new algorithms are
                 presented, and the explanations of each algorithm are
                 much more detailed than in previous editions. A new
                 text design and detailed, innovative figures, with
                 accompanying commentary, greatly enhance the
                 presentation. The third edition retains the successful
                 blend of theory and practice that has made Sedgewick's
                 work an invaluable resource for more than 250,000
                 programmers! Whether you are a student learning the
                 algorithms for the first time or a professional
                 interested in having up-to-date reference material, you
                 will find a wealth of useful information in this
                 book.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Part 1: Fundamentals \\
                 Part 2: Data structures \\
                 Part 3: Sorting \\
                 Part 4: Searching",
  tableofcontents = "Fundamentals \\
                 1. Introduction / 3 \\
                 1.1 Algorithms / 4 \\
                 1.2 A Sample Problem--Connectivity / 6 \\
                 1.3 Union-Find Algorithms / 11 \\
                 1.4 Perspective / 22 \\
                 1.5 Summary of Topics / 23 \\
                 2. Principles of Algorithm Analysis / 27 \\
                 2.1 Implementation and Empirical Analysis / 28 \\
                 2.2 Analysis of Algorithms / 33 \\
                 2.3 Growth of Functions / 36 \\
                 2.4 Big-Oh notation / 44 \\
                 2.5 Basic Recurrences / 49 \\
                 2.6 Examples of Algorithm Analysis / 53 \\
                 2.7 Guarantees, Predictions, and Limitations / 60 \\
                 Data Structures \\
                 3. Elementary Data Structures / 69 \\
                 3.1 Building Blocks / 70 \\
                 3.2 Arrays / 83 \\
                 3.3 Linked Lists / 90 \\
                 3.4 Elementary List Processing / 96 \\
                 3.5 Memory Allocation for Lists / 105 \\
                 3.6 Strings / 108 \\
                 3.7 Compound Data Structures / 115 \\
                 4. Abstract Data Types / 127 \\
                 4.1 Abstract Objects and Collections of Objects / 131
                 \\
                 4.2 Pushdown Stack ADT / 135 \\
                 4.3 Examples of Stack ADT Clients / 138 \\
                 4.4 Stack ADT Implementations / 145 \\
                 4.5 Creation of a New ADT / 149 \\
                 4.6 FIFO Queues and Generalized Queues / 153 \\
                 4.7 Duplicate and Index Items / 161 \\
                 4.8 First-Class ADTs / 166 \\
                 4.9 Application-Based ADT Example / 179 \\
                 4.10 Perspective / 185 \\
                 5. Recursion and Trees / 187 \\
                 5.1 Recursive Algorithms / 188 \\
                 5.2 Divide and Conquer / 196 \\
                 5.3 Dynamic Programming / 209 \\
                 5.4 Trees / 217 \\
                 5.5 Mathematical Properties of Trees / 226 \\
                 5.6 Tree Traversal / 230 \\
                 5.7 Recursive Binary-Tree Algorithms / 236 \\
                 5.8 Graph Traversal / 241 \\
                 5.9 Perspective / 248 \\
                 6. Elementary Sorting Methods / 253 \\
                 6.1 Rules of the Game / 255 \\
                 6.2 Selection Sort / 261 \\
                 6.3 Insertion Sort / 262 \\
                 6.4 Bubble Sort / 265 \\
                 6.5 Performance Characteristics of Elementary Sorts /
                 267 \\
                 6.6 Shellsort / 273 \\
                 6.7 Sorting Other Types of Data / 282 \\
                 6.8 Index and Pointer Sorting / 287 \\
                 6.9 Sorting Linked Lists / 295 \\
                 6.10 Key-Indexed Counting / 298 \\
                 7. Quicksort / 303 \\
                 7.1 The Basic Algorithm / 304 \\
                 7.2 Performance Characteristics of Quicksort / 309 \\
                 7.3 Stack Size / 313 \\
                 7.4 Small Subfiles / 316 \\
                 7.5 Median-of-Three Partitioning / 319 \\
                 7.6 Duplicate Keys / 324 \\
                 7.7 Strings and Vectors / 327 \\
                 7.8 Selection / 329 \\
                 8. Mergesort / 335 \\
                 8.1 Two-Way Merging / 336 \\
                 8.2 Abstract In-place Merge / 339 \\
                 8.3 Top-Down Mergesort / 341 \\
                 8.4 Improvements to the Basic Algorithm / 344 \\
                 8.5 Bottom-Up Mergesort / 347 \\
                 8.6 Performance Characteristics of Mergesort / 351 \\
                 8.7 Linked-List Implementations of Mergesort / 354 \\
                 8.8 Recursion Revisited / 357 \\
                 9. Priority Queues and Heapsort / 361 \\
                 9.1 Elementary Implementations / 365 \\
                 9.2 Heap Data Structure / 369 \\
                 9.3 Algorithms on Heaps / 371 \\
                 9.4 Heapsort / 377 \\
                 9.5 Priority-Queue ADT / 384 \\
                 9.6 Priority Queues for Index Items / 389 \\
                 9.7 Binomial Queues / 392 \\
                 10. Radix Sorting / 403 \\
                 10.1 Bits, Bytes, and Words / 405 \\
                 10.2 Binary Quicksort / 409 \\
                 10.3 MSD Radix Sort / 413 \\
                 10.4 Three-Way Radix Quicksort / 421 \\
                 10.5 LSD Radix Sort / 425 \\
                 10.6 Performance Characteristics of Radix Sorts / 429
                 \\
                 10.7 Sublinear-Time Sorts / 433 \\
                 11. Special-Purpose Sorts / 439 \\
                 11.1 Batcher's Odd-Even Mergesort / 441 \\
                 11.2 Sorting Networks / 446 \\
                 11.3 External Sorting / 454 \\
                 11.4 Sort-Merge Implementations / 460 \\
                 11.5 Parallel Sort/Merge / 467 \\
                 Searching \\
                 12. Symbol Tables and BSTs / 477 \\
                 12.1 Symbol-Table Abstract Data Type / 479 \\
                 12.2 Key-Indexed Search / 485 \\
                 12.3 Sequential Search / 489 \\
                 12.4 Binary Search / 497 \\
                 12.5 Binary Search Trees (BSTs) / 502 \\
                 12.6 Performance Characteristics of BSTs / 508 \\
                 12.7 Index Implementations with Symbol Tables / 511 \\
                 12.8 Insertion at the Root in BSTs / 516 \\
                 12.9 BST Implementations of Other ADT Functions / 520
                 \\
                 13. Balanced Trees / 529 \\
                 13.1 Randomized BSTs / 533 \\
                 13.2 Splay BSTs / 540 \\
                 13.3 Top-Down 2-3-4 Trees / 546 \\
                 13.4 Red-Black Trees / 551 \\
                 13.5 Skip Lists / 561 \\
                 13.6 Performance Characteristics / 569 \\
                 14. Hashing / 573 \\
                 14.1 Hash Functions / 574 \\
                 14.2 Separate Chaining / 583 \\
                 14.3 Linear Probing / 588 \\
                 14.4 Double Hashing / 594 \\
                 14.5 Dynamic Hash Tables / 599 \\
                 14.6 Perspective / 603 \\
                 15. Radix Search / 609 \\
                 15.1 Digital Search Trees / 610 \\
                 15.2 Tries / 614 \\
                 15.3 Patricia Tries / 623 \\
                 15.4 Multiway Tries and TSTs / 632 \\
                 15.5 Text String Index Applications / 649 \\
                 16. External Searching / 655 \\
                 16.1 Rules of the Game / 657 \\
                 16.2 Indexed Sequential Access / 660 \\
                 16.3 B Trees / 662 \\
                 16.4 Extendible Hashing / 676 \\
                 16.5 Perspective / 689 \\
                 Index / 693",
}


bibtype: book
filename: master.bib
label: Sedgewick:2002:ACP
author: Robert Sedgewick
title: Algorithms in C: Part 5: Graph algorithms
publisher: pub-AW
address: pub-AW:adr
pages: xiii + 482
year: 2002
ISBN: 0-201-31663-3 (paperback) OR 0201316633 (paperback)
ISBN13: 978-0-201-31663-6 (paperback) OR 9780201316636 (paperback)
LCCN: QA76.73.C15 S43 2002
bibdate: Sat May 11 09:27:02 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.05.11 09:27:02 ???
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick
rawtitle: Algorithms in {C}: Part 5: Graph algorithms
abstract:
Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. booktitle Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1--4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators. A landmark revision, booktitle Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.

TOC:
17: Graph Properties and Types / 3 17.2: Graph ADT / 16 17.3: Adjacency-Matrix Representation / 21 17.4: Adjacency-Lists Representation / 27 17.5: Variations, Extensions, and Costs / 31 17.6: Graph Generators / 40 17.7: Simple, Euler, and Hamilton Paths / 50 17.8: Graph-Processing Problems / 64 18: Graph Search / 75 18.1: Exploring a Maze / 76 18.2: Depth-First Search / 81 18.3: Graph-Search ADT Functions / 86 18.4: Properties of DFS Forests / 91 18.5: DFS Algorithms / 99 18.6: Separability and Biconnectivity / 106 18.7: Breadth-First Search / 114 18.8: Generalized Graph Search / 124 18.9: Analysis of Graph Algorithms / 133 19: Digraphs and DAGs / 141 19.1: Glossary and Rules of the Game / 144 19.2: Anatomy of DFS in Digraphs / 152 19.3: Reachability and Transitive Closure / 161 19.4: Equivalence Relations and Partial Orders / 174 19.5: DAGs / 178 19.6: Topological Sorting / 183 19.7: Reachability in DAGs / 193 19.8: Strong Components in Digraphs / 196 19.9: Transitive Closure Revisited / 208 19.10: Perspective / 212 20: Minimum Spanning Trees / 219 20.1: Representations / 222 20.2: Underlying Principles of MST Algorithms / 228 20.3: Prim's Algorithm and Priority-First Search / 235 20.4: Kruskal's Algorithm / 246 20.5: Boruvka's Algorithm / 252 20.6: Comparisons and Improvements / 255 20.7: Euclidean MST / 261 21: Shortest Paths / 265 21.1: Underlying Principles / 273 21.2: Dijkstra's algorithm / 280 21.3: All-Pairs Shortest Paths / 290 21.4: Shortest Paths in Acyclic Networks / 300 21.5: Euclidean Networks / 308 21.6: Reduction / 314 21.7: Negative Weights / 331 21.8: Perspective / 350 22: Network Flows / 353 22.1: Flow Networks / 359 22.2: Augmenting-Path Maxflow Algorithms / 370 22.3: Preflow-Push Maxflow Algorithms / 396 22.4: Maxflow Reductions / 411 22.5: Mincost Flows / 429 22.6: Network Simplex Algorithm / 439 22.7: Mincost-Flow Reductions / 457 22.8: Perspective / 467 References for Part Five / 473 Index / 475

rawabstract:
Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. \booktitle{Algorithms in C}, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1--4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators. A landmark revision, \booktitle{Algorithms in C}, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.

rawTOC:
17: Graph Properties and Types / 3 \\ 17.2: Graph ADT / 16 \\ 17.3: Adjacency-Matrix Representation / 21 \\ 17.4: Adjacency-Lists Representation / 27 \\ 17.5: Variations, Extensions, and Costs / 31 \\ 17.6: Graph Generators / 40 \\ 17.7: Simple, Euler, and Hamilton Paths / 50 \\ 17.8: Graph-Processing Problems / 64 \\ 18: Graph Search / 75 \\ 18.1: Exploring a Maze / 76 \\ 18.2: Depth-First Search / 81 \\ 18.3: Graph-Search ADT Functions / 86 \\ 18.4: Properties of DFS Forests / 91 \\ 18.5: DFS Algorithms / 99 \\ 18.6: Separability and Biconnectivity / 106 \\ 18.7: Breadth-First Search / 114 \\ 18.8: Generalized Graph Search / 124 \\ 18.9: Analysis of Graph Algorithms / 133 \\ 19: Digraphs and DAGs / 141 \\ 19.1: Glossary and Rules of the Game / 144 \\ 19.2: Anatomy of DFS in Digraphs / 152 \\ 19.3: Reachability and Transitive Closure / 161 \\ 19.4: Equivalence Relations and Partial Orders / 174 \\ 19.5: DAGs / 178 \\ 19.6: Topological Sorting / 183 \\ 19.7: Reachability in DAGs / 193 \\ 19.8: Strong Components in Digraphs / 196 \\ 19.9: Transitive Closure Revisited / 208 \\ 19.10: Perspective / 212 \\ 20: Minimum Spanning Trees / 219 \\ 20.1: Representations / 222 \\ 20.2: Underlying Principles of MST Algorithms / 228 \\ 20.3: Prim's Algorithm and Priority-First Search / 235 \\ 20.4: Kruskal's Algorithm / 246 \\ 20.5: Boruvka's Algorithm / 252 \\ 20.6: Comparisons and Improvements / 255 \\ 20.7: Euclidean MST / 261 \\ 21: Shortest Paths / 265 \\ 21.1: Underlying Principles / 273 \\ 21.2: Dijkstra's algorithm / 280 \\ 21.3: All-Pairs Shortest Paths / 290 \\ 21.4: Shortest Paths in Acyclic Networks / 300 \\ 21.5: Euclidean Networks / 308 \\ 21.6: Reduction / 314 \\ 21.7: Negative Weights / 331 \\ 21.8: Perspective / 350 \\ 22: Network Flows / 353 \\ 22.1: Flow Networks / 359 \\ 22.2: Augmenting-Path Maxflow Algorithms / 370 \\ 22.3: Preflow-Push Maxflow Algorithms / 396 \\ 22.4: Maxflow Reductions / 411 \\ 22.5: Mincost Flows / 429 \\ 22.6: Network Simplex Algorithm / 439 \\ 22.7: Mincost-Flow Reductions / 457 \\ 22.8: Perspective / 467 \\ References for Part Five / 473 \\ Index / 475

entry:
@Book{Sedgewick:2002:ACP,
  author =       "Robert Sedgewick",
  title =        "Algorithms in {C}: Part 5: Graph algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiii + 482",
  year =         "2002",
  ISBN =         "0-201-31663-3 (paperback)",
  ISBN-13 =      "978-0-201-31663-6 (paperback)",
  LCCN =         "QA76.73.C15 S43 2002",
  bibdate =      "Sat May 11 09:27:02 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$34.99",
  abstract =     "Once again, Robert Sedgewick provides a current and
                 comprehensive introduction to important algorithms. The
                 focus this time is on graph algorithms, which are
                 increasingly critical for a wide range of applications,
                 such as network connectivity, circuit design,
                 scheduling, transaction processing, and resource
                 allocation. In this book, Sedgewick offers the same
                 successful blend of theory and practice with concise
                 implementations that can be tested on real
                 applications, which has made his work popular with
                 programmers for many years. \booktitle{Algorithms in
                 C}, Third Edition, Part 5: Graph Algorithms is the
                 second book in Sedgewick's thoroughly revised and
                 rewritten series. The first book, Parts 1--4, addresses
                 fundamental algorithms, data structures, sorting, and
                 searching. A forthcoming third book will focus on
                 strings, geometry, and a range of advanced algorithms.
                 Each book's expanded coverage features new algorithms
                 and implementations, enhanced descriptions and
                 diagrams, and a wealth of new exercises for polishing
                 skills. A focus on abstract data types makes the
                 programs more broadly useful and relevant for the
                 modern object-oriented programming environment.
                 Coverage includes: A complete overview of graph
                 properties and types Diagraphs and DAGs Minimum
                 spanning trees Shortest paths Network flows Diagrams,
                 sample C code, and detailed algorithm descriptions The
                 Web site for this book
                 (http://www.cs.princeton.edu/~rs/) provides additional
                 source code for programmers along with numerous support
                 materials for educators. A landmark revision,
                 \booktitle{Algorithms in C}, Third Edition, Part 5
                 provides a complete tool set for programmers to
                 implement, debug, and use graph algorithms across a
                 wide range of computer applications.",
  acknowledgement = ack-nhfb,
  tableofcontents = "17: Graph Properties and Types / 3 \\
                 17.2: Graph ADT / 16 \\
                 17.3: Adjacency-Matrix Representation / 21 \\
                 17.4: Adjacency-Lists Representation / 27 \\
                 17.5: Variations, Extensions, and Costs / 31 \\
                 17.6: Graph Generators / 40 \\
                 17.7: Simple, Euler, and Hamilton Paths / 50 \\
                 17.8: Graph-Processing Problems / 64 \\
                 18: Graph Search / 75 \\
                 18.1: Exploring a Maze / 76 \\
                 18.2: Depth-First Search / 81 \\
                 18.3: Graph-Search ADT Functions / 86 \\
                 18.4: Properties of DFS Forests / 91 \\
                 18.5: DFS Algorithms / 99 \\
                 18.6: Separability and Biconnectivity / 106 \\
                 18.7: Breadth-First Search / 114 \\
                 18.8: Generalized Graph Search / 124 \\
                 18.9: Analysis of Graph Algorithms / 133 \\
                 19: Digraphs and DAGs / 141 \\
                 19.1: Glossary and Rules of the Game / 144 \\
                 19.2: Anatomy of DFS in Digraphs / 152 \\
                 19.3: Reachability and Transitive Closure / 161 \\
                 19.4: Equivalence Relations and Partial Orders / 174
                 \\
                 19.5: DAGs / 178 \\
                 19.6: Topological Sorting / 183 \\
                 19.7: Reachability in DAGs / 193 \\
                 19.8: Strong Components in Digraphs / 196 \\
                 19.9: Transitive Closure Revisited / 208 \\
                 19.10: Perspective / 212 \\
                 20: Minimum Spanning Trees / 219 \\
                 20.1: Representations / 222 \\
                 20.2: Underlying Principles of MST Algorithms / 228 \\
                 20.3: Prim's Algorithm and Priority-First Search / 235
                 \\
                 20.4: Kruskal's Algorithm / 246 \\
                 20.5: Boruvka's Algorithm / 252 \\
                 20.6: Comparisons and Improvements / 255 \\
                 20.7: Euclidean MST / 261 \\
                 21: Shortest Paths / 265 \\
                 21.1: Underlying Principles / 273 \\
                 21.2: Dijkstra's algorithm / 280 \\
                 21.3: All-Pairs Shortest Paths / 290 \\
                 21.4: Shortest Paths in Acyclic Networks / 300 \\
                 21.5: Euclidean Networks / 308 \\
                 21.6: Reduction / 314 \\
                 21.7: Negative Weights / 331 \\
                 21.8: Perspective / 350 \\
                 22: Network Flows / 353 \\
                 22.1: Flow Networks / 359 \\
                 22.2: Augmenting-Path Maxflow Algorithms / 370 \\
                 22.3: Preflow-Push Maxflow Algorithms / 396 \\
                 22.4: Maxflow Reductions / 411 \\
                 22.5: Mincost Flows / 429 \\
                 22.6: Network Simplex Algorithm / 439 \\
                 22.7: Mincost-Flow Reductions / 457 \\
                 22.8: Perspective / 467 \\
                 References for Part Five / 473 \\
                 Index / 475",
}


bibtype: book
filename: master.bib
label: Sedgewick:2011:A
author: Robert Sedgewick and Kevin Daniel Wayne
title: Algorithms
publisher: pub-AW
address: pub-AW:adr
edition: Fourth
pages: xii + 955
year: 2011
LCCN: QA76.9.A43 S429 2011
bibdate: Sat Nov 30 16:59:04 MST 2013
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2013.11.30 16:59:04 MST
URL: https://www.pearson.com/en-us/subject-catalog/p/algorithms/P200000000597/9780137459575
subject: Computer algorithms; Textbooks
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick and Kevin Daniel Wayne
rawtitle: Algorithms
shortTOC: 1: Fundamentals 2: Sorting 3: Searching 4: Graphs 5: Strings Context
rawshortTOC: 1: Fundamentals \\ 2: Sorting \\ 3: Searching \\ 4: Graphs \\ 5: Strings \\ Context
ISBN:
0-13-276257-9, 0-321-57351-X (hardcover), 6-6130-0155-4 (e-book) OR 0132762579, 032157351X (hardcover), 6613001554 (ebook)

ISBN13:
978-0-13-276257-1, 978-0-321-57351-3 (hardcover), 978-6-6130-0155-9 (e-book) OR 9780132762571, 9780321573513 (hardcover), 9786613001559 (ebook)

TOC:
Preface / ix 1: Fundamentals / 3 1.1 Programming Model / 8 1.2 Data Abstraction / 64 1.3 Queues, Stacks, and Bags / 120 1.4 Analysis of Algorithms / 172 1.5 Case Study: Union-Find / 216 2: Sorting / 243 2.1 Elementary Sorts / 244 2.2 Mergesort / 270 2.3 Quicksort / 288 2.4 Priority Queues / 308 2.5 Applications / 336 3: Searching / 361 3.1 Symbol Tables / 362 3.2 Binary Search Trees / 385 3.3 Balanced Search Trees / 424 3.4 Hash Tables / 458 3.5 Applications / 486 4: Graphs / 515 4.1 Undirected graphs / 518 4.2 Directed graphs / 566 4.3 Minimum Spanning Trees / 604 4.4 Shortest Paths / 638 5: Strings / 695 5.1 String Sorts / 702 5.2 Tries / 730 5.3 Substring Search / 758 5.4 Regular Expressions / 788 5.5 Data Compression / 810 Context / 853 Event-Driven Simulation / 856 B-Trees / 866 Suffix Arrays / 875 Network Flow / 886 Reductions / 903 Intractability / 910 Index / 933 Algorithms and Clients / 954

rawTOC:
Preface / ix \\ 1: Fundamentals / 3 \\ 1.1 Programming Model / 8 \\ 1.2 Data Abstraction / 64 \\ 1.3 Queues, Stacks, and Bags / 120 \\ 1.4 Analysis of Algorithms / 172 \\ 1.5 Case Study: Union-Find / 216 \\ \\ 2: Sorting / 243 \\ 2.1 Elementary Sorts / 244 \\ 2.2 Mergesort / 270 \\ 2.3 Quicksort / 288 \\ 2.4 Priority Queues / 308 \\ 2.5 Applications / 336 \\ \\ 3: Searching / 361 \\ 3.1 Symbol Tables / 362 \\ 3.2 Binary Search Trees / 385 \\ 3.3 Balanced Search Trees / 424 \\ 3.4 Hash Tables / 458 \\ 3.5 Applications / 486 \\ \\ 4: Graphs / 515 \\ 4.1 Undirected graphs / 518 \\ 4.2 Directed graphs / 566 \\ 4.3 Minimum Spanning Trees / 604 \\ 4.4 Shortest Paths / 638 \\ \\ 5: Strings / 695 \\ 5.1 String Sorts / 702 \\ 5.2 Tries / 730 \\ 5.3 Substring Search / 758 \\ 5.4 Regular Expressions / 788 \\ 5.5 Data Compression / 810 \\ \\ Context / 853 \\ Event-Driven Simulation / 856 \\ B-Trees / 866 \\ Suffix Arrays / 875 \\ Network Flow / 886 \\ Reductions / 903 \\ Intractability / 910 \\ Index / 933 \\ Algorithms and Clients / 954

entry:
@Book{Sedgewick:2011:A,
  author =       "Robert Sedgewick and Kevin Daniel Wayne",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Fourth",
  pages =        "xii + 955",
  year =         "2011",
  ISBN =         "0-13-276257-9, 0-321-57351-X (hardcover),
                 6-6130-0155-4 (e-book)",
  ISBN-13 =      "978-0-13-276257-1, 978-0-321-57351-3 (hardcover),
                 978-6-6130-0155-9 (e-book)",
  LCCN =         "QA76.9.A43 S429 2011",
  bibdate =      "Sat Nov 30 16:59:04 MST 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "https://www.pearson.com/en-us/subject-catalog/p/algorithms/P200000000597/9780137459575",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "1: Fundamentals \\
                 2: Sorting \\
                 3: Searching \\
                 4: Graphs \\
                 5: Strings \\
                 Context",
  subject =      "Computer algorithms; Textbooks",
  tableofcontents = "Preface / ix \\
                 1: Fundamentals / 3 \\
                 1.1 Programming Model / 8 \\
                 1.2 Data Abstraction / 64 \\
                 1.3 Queues, Stacks, and Bags / 120 \\
                 1.4 Analysis of Algorithms / 172 \\
                 1.5 Case Study: Union-Find / 216 \\
                 \\
                 2: Sorting / 243 \\
                 2.1 Elementary Sorts / 244 \\
                 2.2 Mergesort / 270 \\
                 2.3 Quicksort / 288 \\
                 2.4 Priority Queues / 308 \\
                 2.5 Applications / 336 \\
                 \\
                 3: Searching / 361 \\
                 3.1 Symbol Tables / 362 \\
                 3.2 Binary Search Trees / 385 \\
                 3.3 Balanced Search Trees / 424 \\
                 3.4 Hash Tables / 458 \\
                 3.5 Applications / 486 \\
                 \\
                 4: Graphs / 515 \\
                 4.1 Undirected graphs / 518 \\
                 4.2 Directed graphs / 566 \\
                 4.3 Minimum Spanning Trees / 604 \\
                 4.4 Shortest Paths / 638 \\
                 \\
                 5: Strings / 695 \\
                 5.1 String Sorts / 702 \\
                 5.2 Tries / 730 \\
                 5.3 Substring Search / 758 \\
                 5.4 Regular Expressions / 788 \\
                 5.5 Data Compression / 810 \\
                 \\
                 Context / 853 \\
                 Event-Driven Simulation / 856 \\
                 B-Trees / 866 \\
                 Suffix Arrays / 875 \\
                 Network Flow / 886 \\
                 Reductions / 903 \\
                 Intractability / 910 \\
                 Index / 933 \\
                 Algorithms and Clients / 954",
}


bibtype: book
filename: master.bib
label: Sedgewick:2016:A
author: Robert Sedgewick and Kevin Daniel Wayne
title: Algorithms
publisher: pub-AW
address: pub-AW:adr
edition: Fourth deluxe
pages: xiii + 955
year: 2016
ISBN: 0-13-438468-7 (paperback) OR 0134384687 (paperback)
ISBN13: 978-0-13-438468-9 (paperback), OR 9780134384689 (paperback),
LCCN: QA76.9.A43 S429 2016
bibdate: Sat Feb 15 15:02:41 MST 2025
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2025.02.15 15:02:41 MST
acknowledgement: ack-nhfb
rawauthor: Robert Sedgewick and Kevin Daniel Wayne
rawtitle: Algorithms
shortTOC: Fundamentals Sorting Searching Graphs Strings Context
rawshortTOC: Fundamentals \\ Sorting \\ Searching \\ Graphs \\ Strings \\ Context
remark:
This is the deluxe version of the fourth edition cite Sedgewick:2011:A, with access to a 24-part video lecture series. ISBNs of German edition (2014): 3-86894-184-3, 978-3-86894-184-5.

entry:
@Book{Sedgewick:2016:A,
  author =       "Robert Sedgewick and Kevin Daniel Wayne",
  title =        "Algorithms",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Fourth deluxe",
  pages =        "xiii + 955",
  year =         "2016",
  ISBN =         "0-13-438468-7 (paperback)",
  ISBN-13 =      "978-0-13-438468-9 (paperback),",
  LCCN =         "QA76.9.A43 S429 2016",
  bibdate =      "Sat Feb 15 15:02:41 MST 2025",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  remark =       "This is the deluxe version of the fourth edition
                 \cite{Sedgewick:2011:A}, with access to a 24-part video
                 lecture series. ISBNs of German edition (2014):
                 3-86894-184-3, 978-3-86894-184-5.",
  shorttableofcontents = "Fundamentals \\
                 Sorting \\
                 Searching \\
                 Graphs \\
                 Strings \\
                 Context",
}


bibtype: book
filename: master.bib
label: Segre:2007:FCS
author: Gino Segre
title: Faust in Copenhagen: a struggle for the soul of physics
publisher: pub-VIKING
address: pub-VIKING:adr
pages: x + 310
year: 2007
ISBN: 0-670-03858-X OR 067003858X
ISBN13: 978-0-670-03858-9 OR 9780670038589
LCCN: QC15 .S427 2007
bibdate: Tue Feb 12 15:11:07 MST 2008
bibtimestamp: 2008.02.12 15:11:07 MST
subject: Physicists; Psychology; Intellectual life; 20th century; Quantum theory; History
acknowledgement: ack-nhfb
rawauthor: Gino Segr{\`e}
rawtitle: {Faust} in {Copenhagen}: a struggle for the soul of physics
URL:
http://www.loc.gov/catdir/enhancements/fy0743/2006052807-b.html; http://www.loc.gov/catdir/enhancements/fy0743/2006052807-d.html

abstract:
Known to physicists as the ``miracle year,'' 1932 saw the discovery of the neutron and the first artificially induced nuclear transmutation. However, while physicists celebrated these momentous discoveries --- which presaged the era of big science and nuclear bombs --- Europe was moving inexorably toward totalitarianism and war. In April of that year, about forty of the world's leading physicists --- including Werner Heisenberg, Lise Meitner, and Paul Dirac --- came to Niels Bohr's Copenhagen Institute for their annual informal meeting about the frontiers of physics. Physicist Gino Segre brings to life this historic gathering, which ended with a humorous skit based on Goethe's Faust --- little knowing the Faustian bargains they would face in the near future. Capturing the interplay between the great scientists as well as the discoveries they discussed and debated, Segre evokes the moment when physics --- and the world --- was about to lose its innocence.

TOC:
1. Munich now and then 2. The changing times: The 1920s; The birth of the quantum; Why Copenhagen?; The meetings begin; The 1932 meeting 3. Goethe and Faust: In the glow of Goethe; The ``Copenhagen Faust'' 4. The front row: the old guard: Niels Bohr; Paul Ehrenfest; Lise Meitner The front row: the revolutionaries: Old age is a cold fever; Werner Heisenberg; Wolfgang Pauli; Paul Dirac; Classical mechanics versus quantum mechanics 6. The front row: the young ones: The curse of the Knabenphysik; Max Delbruck 7. The coming storm: The periodic table; The new Kepler; Gottingen in 1922; Triumph and crisis; The new optimism 8. The revolution begins: Helgoland; Another sleepless night; Waves or particles; Heinsenberg versus Schrodinger; Uncertainty and complementarity 9. The king in decline: The crucial Solvay Conference; Einstein --- the king 10. The great synthesis: Dirac's equation; How Max Delbruck joined Knabenphysik; Physics begins to split; Delbruck's choices 11. Conservation of energy: The mysteries of the nucleus; The barrier is too high; Heaven and earth; The revolutionary proposals; The three young geniuses each write a book 12. The new generation comes of age: The apprenticeship; Copenhagen 1932; The ``Blegdamsvej Faust'' Delbruck's dilemma 13. The miracle year: The discovery of the neutron; Copenhagen and the neutron; The miracle year; Big science is born; The hammer and the needle 14. Ehrenfest's end Epilogue, Or what happened afterward to the Front Row's other six: How Meitner discovered nuclear fission; How Bohr lived happily ever after; How Dirac got married; How Heisenberg inspired his friend to paint like Titian; How Pauli's anima made him leave the United States; How Delbruck became a biologist

rawabstract:
Known to physicists as the ``miracle year,'' 1932 saw the discovery of the neutron and the first artificially induced nuclear transmutation. However, while physicists celebrated these momentous discoveries --- which presaged the era of big science and nuclear bombs --- Europe was moving inexorably toward totalitarianism and war. In April of that year, about forty of the world's leading physicists --- including Werner Heisenberg, Lise Meitner, and Paul Dirac --- came to Niels Bohr's Copenhagen Institute for their annual informal meeting about the frontiers of physics. Physicist Gino Segr{\`e} brings to life this historic gathering, which ended with a humorous skit based on Goethe's Faust --- little knowing the Faustian bargains they would face in the near future. Capturing the interplay between the great scientists as well as the discoveries they discussed and debated, Segr{\`e} evokes the moment when physics --- and the world --- was about to lose its innocence.

rawTOC:
1. Munich now and then \\ 2. The changing times: The 1920s; The birth of the quantum; Why Copenhagen?; The meetings begin; The 1932 meeting \\ 3. Goethe and Faust: In the glow of Goethe; The ``Copenhagen Faust'' \\ 4. The front row: the old guard: Niels Bohr; Paul Ehrenfest; Lise Meitner \\ The front row: the revolutionaries: Old age is a cold fever; Werner Heisenberg; Wolfgang Pauli; Paul Dirac; Classical mechanics versus quantum mechanics \\ 6. The front row: the young ones: The curse of the Knabenphysik; Max Delbr{\"u}ck \\ 7. The coming storm: The periodic table; The new Kepler; G{\"o}ttingen in 1922; Triumph and crisis; The new optimism \\ 8. The revolution begins: Helgoland; Another sleepless night; Waves or particles; Heinsenberg versus Schr{\"o}dinger; Uncertainty and complementarity \\ 9. The king in decline: The crucial Solvay Conference; Einstein --- the king \\ 10. The great synthesis: Dirac's equation; How Max Delbr{\"u}ck joined Knabenphysik; Physics begins to split; Delbr{\"u}ck's choices \\ 11. Conservation of energy: The mysteries of the nucleus; The barrier is too high; Heaven and earth; The revolutionary proposals; The three young geniuses each write a book \\ 12. The new generation comes of age: The apprenticeship; Copenhagen 1932; The ``Blegdamsvej Faust'' \\ Delbr{\"u}ck's dilemma \\ 13. The miracle year: The discovery of the neutron; Copenhagen and the neutron; The miracle year; Big science is born; The hammer and the needle \\ 14. Ehrenfest's end \\ Epilogue, Or what happened afterward to the Front Row's other six: How Meitner discovered nuclear fission; How Bohr lived happily ever after; How Dirac got married; How Heisenberg inspired his friend to paint like Titian; How Pauli's anima made him leave the United States; How Delbr{\"u}ck became a biologist

entry:
@Book{Segre:2007:FCS,
  author =       "Gino Segr{\`e}",
  title =        "{Faust} in {Copenhagen}: a struggle for the soul of
                 physics",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "x + 310",
  year =         "2007",
  ISBN =         "0-670-03858-X",
  ISBN-13 =      "978-0-670-03858-9",
  LCCN =         "QC15 .S427 2007",
  bibdate =      "Tue Feb 12 15:11:07 MST 2008",
  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.loc.gov/catdir/enhancements/fy0743/2006052807-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0743/2006052807-d.html",
  abstract =     "Known to physicists as the ``miracle year,'' 1932 saw
                 the discovery of the neutron and the first artificially
                 induced nuclear transmutation. However, while
                 physicists celebrated these momentous discoveries ---
                 which presaged the era of big science and nuclear bombs
                 --- Europe was moving inexorably toward totalitarianism
                 and war. In April of that year, about forty of the
                 world's leading physicists --- including Werner
                 Heisenberg, Lise Meitner, and Paul Dirac --- came to
                 Niels Bohr's Copenhagen Institute for their annual
                 informal meeting about the frontiers of physics.
                 Physicist Gino Segr{\`e} brings to life this historic
                 gathering, which ended with a humorous skit based on
                 Goethe's Faust --- little knowing the Faustian bargains
                 they would face in the near future. Capturing the
                 interplay between the great scientists as well as the
                 discoveries they discussed and debated, Segr{\`e}
                 evokes the moment when physics --- and the world ---
                 was about to lose its innocence.",
  acknowledgement = ack-nhfb,
  subject =      "Physicists; Psychology; Intellectual life; 20th
                 century; Quantum theory; History",
  tableofcontents = "1. Munich now and then \\
                 2. The changing times: The 1920s; The birth of the
                 quantum; Why Copenhagen?; The meetings begin; The 1932
                 meeting \\
                 3. Goethe and Faust: In the glow of Goethe; The
                 ``Copenhagen Faust'' \\
                 4. The front row: the old guard: Niels Bohr; Paul
                 Ehrenfest; Lise Meitner \\
                 The front row: the revolutionaries: Old age is a cold
                 fever; Werner Heisenberg; Wolfgang Pauli; Paul Dirac;
                 Classical mechanics versus quantum mechanics \\
                 6. The front row: the young ones: The curse of the
                 Knabenphysik; Max Delbr{\"u}ck \\
                 7. The coming storm: The periodic table; The new
                 Kepler; G{\"o}ttingen in 1922; Triumph and crisis; The
                 new optimism \\
                 8. The revolution begins: Helgoland; Another sleepless
                 night; Waves or particles; Heinsenberg versus
                 Schr{\"o}dinger; Uncertainty and complementarity \\
                 9. The king in decline: The crucial Solvay Conference;
                 Einstein --- the king \\
                 10. The great synthesis: Dirac's equation; How Max
                 Delbr{\"u}ck joined Knabenphysik; Physics begins to
                 split; Delbr{\"u}ck's choices \\
                 11. Conservation of energy: The mysteries of the
                 nucleus; The barrier is too high; Heaven and earth; The
                 revolutionary proposals; The three young geniuses each
                 write a book \\
                 12. The new generation comes of age: The
                 apprenticeship; Copenhagen 1932; The ``Blegdamsvej
                 Faust'' \\
                 Delbr{\"u}ck's dilemma \\
                 13. The miracle year: The discovery of the neutron;
                 Copenhagen and the neutron; The miracle year; Big
                 science is born; The hammer and the needle \\
                 14. Ehrenfest's end \\
                 Epilogue, Or what happened afterward to the Front Row's
                 other six: How Meitner discovered nuclear fission; How
                 Bohr lived happily ever after; How Dirac got married;
                 How Heisenberg inspired his friend to paint like
                 Titian; How Pauli's anima made him leave the United
                 States; How Delbr{\"u}ck became a biologist",
}


bibtype: book
filename: master.bib
label: Segre:2011:OGM
author: Gino Segre
title: Ordinary geniuses: Max Delbruck, George Gamow, and the origins of genomics and Big Bang cosmology
publisher: pub-VIKING
address: pub-VIKING:adr
pages: xxi + 330
year: 2011
ISBN: 0-670-02276-4 OR 0670022764
ISBN13: 978-0-670-02276-2 OR 9780670022762
LCCN: QH31.D434 S44 2011
bibdate: Sat Sep 17 16:39:42 MDT 2011
bibtimestamp: 2011.09.17 16:39:42 MDT
acknowledgement: ack-nhfb
subjectdates: 1904--1968
rawauthor: Gino Segr{\`e}
abstract:
A biography of two maverick scientists whose intellectual wanderlust kick-started modern genomics and cosmology. Max Delbruck and George Gamow, the so-called ordinary geniuses of Segre's third book, were not as famous or as decorated as some of their colleagues in mid-twentieth-century physics, yet these two friends had a profound influence on how we now see the world, both on its largest scale (the universe) and its smallest (genetic code). Their maverick approach to research resulted in truly pioneering science. Wherever these men ventured, they were catalysts for great discoveries. Here Segre honors them in his typically inviting and elegant style and shows readers how they were far from ``ordinary''. While portraying their personal lives Segre, a scientist himself, gives readers an inside look at how science is done--collaboration, competition, the influence of politics, the role of intuition and luck, and the sense of wonder and curiosity that fuels these extraordinary minds. Ordinary Geniuses will appeal to the readers of Simon Singh, Amir Aczel, and other writers exploring the history of scientific ideas and the people behind them.

subject:
Delbruck, Max; Molecular biologists; United States; Biography; Gamow, George; Physicists; SCIENCE / Physics; biography and autobiography / Science and Technology

TOC:
When Max and Geo first met Max grows up Geo grows up Gottingen and Copenhagen Particle or wave? Max's and Geo's early careers Copenhagen, 1931 Zurich, 1931 Max, Bohr, and biology Max, Berlin, and biology Geo escapes from Russia The Russia Geo left behind Geo comes to America The sun's mysteries revealed Max leaves Germany Max in the New World Fission Supernovae and neutron stars Max meets Manny and Sal Hitting the jackpot What is life? The phage grows up Geo and the universe Gamow's game Bohr, Geo, and Max Back to Germany The new Manchester Alpha, beta, gamma Big Bang versus steady state DNA The double helix Geo and DNA Geo begins again Max begins again The molecular biology that was The Phage Church Trinity goes to Stockholm The triumph of the Big Bang The cosmic microwave background radiation Cosmology's new age Einstein's biggest blunder Duckling or swan? After the Golden Age The unavoidable and the unfashionable Mr. Tompkins arrives Geo's and Max's final messages

rawabstract:
A biography of two maverick scientists whose intellectual wanderlust kick-started modern genomics and cosmology. Max Delbr{\"u}ck and George Gamow, the so-called ordinary geniuses of Segr{\`e}'s third book, were not as famous or as decorated as some of their colleagues in mid-twentieth-century physics, yet these two friends had a profound influence on how we now see the world, both on its largest scale (the universe) and its smallest (genetic code). Their maverick approach to research resulted in truly pioneering science. Wherever these men ventured, they were catalysts for great discoveries. Here Segr{\`e} honors them in his typically inviting and elegant style and shows readers how they were far from ``ordinary''. While portraying their personal lives Segr{\`e}, a scientist himself, gives readers an inside look at how science is done--collaboration, competition, the influence of politics, the role of intuition and luck, and the sense of wonder and curiosity that fuels these extraordinary minds. Ordinary Geniuses will appeal to the readers of Simon Singh, Amir Aczel, and other writers exploring the history of scientific ideas and the people behind them.

rawtitle:
Ordinary geniuses: {Max Delbr{\"u}ck}, {George Gamow}, and the origins of genomics and {Big Bang} cosmology

rawTOC:
When Max and Geo first met \\ Max grows up \\ Geo grows up \\ G{\"o}ttingen and Copenhagen \\ Particle or wave? \\ Max's and Geo's early careers \\ Copenhagen, 1931 \\ Zurich, 1931 \\ Max, Bohr, and biology \\ Max, Berlin, and biology \\ Geo escapes from Russia \\ The Russia Geo left behind \\ Geo comes to America \\ The sun's mysteries revealed \\ Max leaves Germany \\ Max in the New World \\ Fission \\ Supernovae and neutron stars \\ Max meets Manny and Sal \\ Hitting the jackpot \\ What is life? \\ The phage grows up \\ Geo and the universe \\ Gamow's game \\ Bohr, Geo, and Max \\ Back to Germany \\ The new Manchester \\ Alpha, beta, gamma \\ Big Bang versus steady state \\ DNA \\ The double helix \\ Geo and DNA \\ Geo begins again \\ Max begins again \\ The molecular biology that was \\ The Phage Church Trinity goes to Stockholm \\ The triumph of the Big Bang \\ The cosmic microwave background radiation \\ Cosmology's new age \\ Einstein's biggest blunder \\ Duckling or swan? \\ After the Golden Age \\ The unavoidable and the unfashionable \\ Mr. Tompkins arrives \\ Geo's and Max's final messages

entry:
@Book{Segre:2011:OGM,
  author =       "Gino Segr{\`e}",
  title =        "Ordinary geniuses: {Max Delbr{\"u}ck}, {George Gamow},
                 and the origins of genomics and {Big Bang} cosmology",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "xxi + 330",
  year =         "2011",
  ISBN =         "0-670-02276-4",
  ISBN-13 =      "978-0-670-02276-2",
  LCCN =         "QH31.D434 S44 2011",
  bibdate =      "Sat Sep 17 16:39:42 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",
  abstract =     "A biography of two maverick scientists whose
                 intellectual wanderlust kick-started modern genomics
                 and cosmology. Max Delbr{\"u}ck and George Gamow, the
                 so-called ordinary geniuses of Segr{\`e}'s third book,
                 were not as famous or as decorated as some of their
                 colleagues in mid-twentieth-century physics, yet these
                 two friends had a profound influence on how we now see
                 the world, both on its largest scale (the universe) and
                 its smallest (genetic code). Their maverick approach to
                 research resulted in truly pioneering science. Wherever
                 these men ventured, they were catalysts for great
                 discoveries. Here Segr{\`e} honors them in his
                 typically inviting and elegant style and shows readers
                 how they were far from ``ordinary''. While portraying
                 their personal lives Segr{\`e}, a scientist himself,
                 gives readers an inside look at how science is
                 done--collaboration, competition, the influence of
                 politics, the role of intuition and luck, and the sense
                 of wonder and curiosity that fuels these extraordinary
                 minds. Ordinary Geniuses will appeal to the readers of
                 Simon Singh, Amir Aczel, and other writers exploring
                 the history of scientific ideas and the people behind
                 them.",
  acknowledgement = ack-nhfb,
  subject =      "Delbr{\"u}ck, Max; Molecular biologists; United
                 States; Biography; Gamow, George; Physicists; SCIENCE /
                 Physics; biography and autobiography / Science and
                 Technology",
  subject-dates = "1904--1968",
  tableofcontents = "When Max and Geo first met \\
                 Max grows up \\
                 Geo grows up \\
                 G{\"o}ttingen and Copenhagen \\
                 Particle or wave? \\
                 Max's and Geo's early careers \\
                 Copenhagen, 1931 \\
                 Zurich, 1931 \\
                 Max, Bohr, and biology \\
                 Max, Berlin, and biology \\
                 Geo escapes from Russia \\
                 The Russia Geo left behind \\
                 Geo comes to America \\
                 The sun's mysteries revealed \\
                 Max leaves Germany \\
                 Max in the New World \\
                 Fission \\
                 Supernovae and neutron stars \\
                 Max meets Manny and Sal \\
                 Hitting the jackpot \\
                 What is life? \\
                 The phage grows up \\
                 Geo and the universe \\
                 Gamow's game \\
                 Bohr, Geo, and Max \\
                 Back to Germany \\
                 The new Manchester \\
                 Alpha, beta, gamma \\
                 Big Bang versus steady state \\
                 DNA \\
                 The double helix \\
                 Geo and DNA \\
                 Geo begins again \\
                 Max begins again \\
                 The molecular biology that was \\
                 The Phage Church Trinity goes to Stockholm \\
                 The triumph of the Big Bang \\
                 The cosmic microwave background radiation \\
                 Cosmology's new age \\
                 Einstein's biggest blunder \\
                 Duckling or swan? \\
                 After the Golden Age \\
                 The unavoidable and the unfashionable \\
                 Mr. Tompkins arrives \\
                 Geo's and Max's final messages",
}


bibtype: book
filename: master.bib
label: Segre:2016:PPE
author: Gino Segre and Bettina Hoerlin
title: The Pope of Physics: Enrico Fermi and the birth of the atomic age
publisher: Henry Holt and Company
address: New York, NY, USA
pages: xi + 351
year: 2016
ISBN: 1-62779-005-5, 1-62779-006-3 (e-book) OR 1627790055, 1627790063 (ebook)
ISBN13: 978-1-62779-005-5, 978-1-62779-006-2 (e-book) OR 9781627790055, 9781627790062 (ebook)
LCCN: QC16.F46 S44 2016
bibdate: Thu Mar 23 08:22:05 MDT 2017
bibtimestamp: 2017.03.23 08:22:05 MDT
subject: Fermi, Enrico; Physicists; Italy; Biography; United States
acknowledgement: ack-nhfb
subjectdates: 1901--1954
rawauthor: Gino Segr{\`e} and Bettina Hoerlin
rawtitle: The {Pope} of Physics: {Enrico Fermi} and the birth of the atomic age
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib; https://www.math.utah.edu/pub/bibnet/authors/m/majorana-ettore.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

abstract:
The first full-scale biography of the Nobel Prize-winning physicist and one of the fathers of the atomic age, Enrico Fermi. Enrico Fermi is unquestionably the most famous scientist to come from Italy since Galileo, so revered that he's known as The Pope of Physics. A modest, unassuming man, Fermi was nevertheless one of the most productive and creative scientists of the twentieth century, one of the fathers of the Atomic Bomb and a Nobel Prize winner whose contributions to physics and nuclear technology live on today, with the largest particle accelerator in the United States and the nation's most significant science and technology award both bearing his name. In this, the first major biography of Fermi in English, Gino Segre, professor of Physics and Astronomy at the University of Pennsylvania, brings this scientific visionary to life. An examination of the human dramas that touched Fermi's life as well as a thrilling history of scientific innovation in the twentieth century --- including the birth of one of its most controversial disciplines, nuclear physics --- this is the comprehensive biography that Fermi deserves

TOC:
Family roots The Little Match (Il Piccolo Fiammifero) Leaning in: physics and Pisa Student days The young protege The summer of 1924 Florence Quantum leaps Enrico and Laura The boys of Via Panisperna The Royal Academy Crossing the Atlantic Bombarding the neutron Decay The neutron comes to Rome The rise and fall of the boys Transitions Stockholm calls Fission News travels Chain reaction The race begins New Americans and the birth of the pile The sleeping giant Chicago bound Critical pile (CP-1) The day the atomic age was born The Manhattan project: a three-legged stool Signor Fermi becomes Mister Farmer Gotterdammerung The hill ``No acceptable alternative'' Aftershock Goodbye, Mr. Farmer Physicist with a capital `F' The Fermi method The super Circling back Summer of '54 Farewell to the navigator

rawabstract:
The first full-scale biography of the Nobel Prize-winning physicist and one of the fathers of the atomic age, Enrico Fermi. Enrico Fermi is unquestionably the most famous scientist to come from Italy since Galileo, so revered that he's known as The Pope of Physics. A modest, unassuming man, Fermi was nevertheless one of the most productive and creative scientists of the twentieth century, one of the fathers of the Atomic Bomb and a Nobel Prize winner whose contributions to physics and nuclear technology live on today, with the largest particle accelerator in the United States and the nation's most significant science and technology award both bearing his name. In this, the first major biography of Fermi in English, Gino Segre, professor of Physics and Astronomy at the University of Pennsylvania, brings this scientific visionary to life. An examination of the human dramas that touched Fermi's life as well as a thrilling history of scientific innovation in the twentieth century --- including the birth of one of its most controversial disciplines, nuclear physics --- this is the comprehensive biography that Fermi deserves

rawTOC:
Family roots \\ The Little Match (Il Piccolo Fiammifero) \\ Leaning in: physics and Pisa \\ Student days \\ The young prot{\'e}g{\'e} \\ The summer of 1924 \\ Florence \\ Quantum leaps \\ Enrico and Laura \\ The boys of Via Panisperna \\ The Royal Academy \\ Crossing the Atlantic \\ Bombarding the neutron \\ Decay \\ The neutron comes to Rome \\ The rise and fall of the boys \\ Transitions \\ Stockholm calls \\ Fission \\ News travels \\ Chain reaction \\ The race begins \\ New Americans and the birth of the pile \\ The sleeping giant \\ Chicago bound \\ Critical pile (CP-1) \\ The day the atomic age was born \\ The Manhattan project: a three-legged stool \\ Signor Fermi becomes Mister Farmer \\ G{\"o}tterd{\"a}mmerung \\ The hill \\ ``No acceptable alternative'' \\ Aftershock \\ Goodbye, Mr. Farmer \\ Physicist with a capital `F' \\ The Fermi method \\ The super \\ Circling back \\ Summer of '54 \\ Farewell to the navigator

entry:
@Book{Segre:2016:PPE,
  author =       "Gino Segr{\`e} and Bettina Hoerlin",
  title =        "The {Pope} of Physics: {Enrico Fermi} and the birth of
                 the atomic age",
  publisher =    "Henry Holt and Company",
  address =      "New York, NY, USA",
  pages =        "xi + 351",
  year =         "2016",
  ISBN =         "1-62779-005-5, 1-62779-006-3 (e-book)",
  ISBN-13 =      "978-1-62779-005-5, 978-1-62779-006-2 (e-book)",
  LCCN =         "QC16.F46 S44 2016",
  bibdate =      "Thu Mar 23 08:22:05 MDT 2017",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/majorana-ettore.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "The first full-scale biography of the Nobel
                 Prize-winning physicist and one of the fathers of the
                 atomic age, Enrico Fermi. Enrico Fermi is
                 unquestionably the most famous scientist to come from
                 Italy since Galileo, so revered that he's known as The
                 Pope of Physics. A modest, unassuming man, Fermi was
                 nevertheless one of the most productive and creative
                 scientists of the twentieth century, one of the fathers
                 of the Atomic Bomb and a Nobel Prize winner whose
                 contributions to physics and nuclear technology live on
                 today, with the largest particle accelerator in the
                 United States and the nation's most significant science
                 and technology award both bearing his name. In this,
                 the first major biography of Fermi in English, Gino
                 Segre, professor of Physics and Astronomy at the
                 University of Pennsylvania, brings this scientific
                 visionary to life. An examination of the human dramas
                 that touched Fermi's life as well as a thrilling
                 history of scientific innovation in the twentieth
                 century --- including the birth of one of its most
                 controversial disciplines, nuclear physics --- this is
                 the comprehensive biography that Fermi deserves",
  acknowledgement = ack-nhfb # "\slash " # ack-wl,
  subject =      "Fermi, Enrico; Physicists; Italy; Biography; United
                 States",
  subject-dates = "1901--1954",
  tableofcontents = "Family roots \\
                 The Little Match (Il Piccolo Fiammifero) \\
                 Leaning in: physics and Pisa \\
                 Student days \\
                 The young prot{\'e}g{\'e} \\
                 The summer of 1924 \\
                 Florence \\
                 Quantum leaps \\
                 Enrico and Laura \\
                 The boys of Via Panisperna \\
                 The Royal Academy \\
                 Crossing the Atlantic \\
                 Bombarding the neutron \\
                 Decay \\
                 The neutron comes to Rome \\
                 The rise and fall of the boys \\
                 Transitions \\
                 Stockholm calls \\
                 Fission \\
                 News travels \\
                 Chain reaction \\
                 The race begins \\
                 New Americans and the birth of the pile \\
                 The sleeping giant \\
                 Chicago bound \\
                 Critical pile (CP-1) \\
                 The day the atomic age was born \\
                 The Manhattan project: a three-legged stool \\
                 Signor Fermi becomes Mister Farmer \\
                 G{\"o}tterd{\"a}mmerung \\
                 The hill \\
                 ``No acceptable alternative'' \\
                 Aftershock \\
                 Goodbye, Mr. Farmer \\
                 Physicist with a capital `F' \\
                 The Fermi method \\
                 The super \\
                 Circling back \\
                 Summer of '54 \\
                 Farewell to the navigator",
}


bibtype: book
filename: master.bib
label: Seife:2008:SBS
author: Charles Seife
title: Sun in a bottle: the strange history of fusion and the science of wishful thinking
publisher: pub-VIKING
address: pub-VIKING:adr
pages: vi + 294
year: 2008
ISBN: 0-670-02033-8 OR 0670020338
ISBN13: 978-0-670-02033-1 OR 9780670020331
LCCN: QC791 .S45 2008
bibdate: Tue Jan 24 14:06:59 MST 2012
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2012.01.24 14:06:59 MST
subject: Kernfusion; Nuclear fusion; History; Kernfusion; Geschichte
acknowledgement: ack-nhfb
rawauthor: Charles Seife
rawtitle: {Sun} in a bottle: the strange history of fusion and the science of wishful thinking
TOC:
Sword of Michael The valley of iron Project plowshare and the sunshine units Kinks, instabilities, and baloney bombs Heat and light The cold shoulder Secrets Bubble trouble Nothing like the Sun The science of wishful thinking

rawTOC:
Sword of Michael \\ The valley of iron \\ Project plowshare and the sunshine units \\ Kinks, instabilities, and baloney bombs \\ Heat and light \\ The cold shoulder \\ Secrets \\ Bubble trouble \\ Nothing like the Sun \\ The science of wishful thinking

entry:
@Book{Seife:2008:SBS,
  author =       "Charles Seife",
  title =        "{Sun} in a bottle: the strange history of fusion and
                 the science of wishful thinking",
  publisher =    pub-VIKING,
  address =      pub-VIKING:adr,
  pages =        "vi + 294",
  year =         "2008",
  ISBN =         "0-670-02033-8",
  ISBN-13 =      "978-0-670-02033-1",
  LCCN =         "QC791 .S45 2008",
  bibdate =      "Tue Jan 24 14:06:59 MST 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  subject =      "Kernfusion; Nuclear fusion; History; Kernfusion;
                 Geschichte",
  tableofcontents = "Sword of Michael \\
                 The valley of iron \\
                 Project plowshare and the sunshine units \\
                 Kinks, instabilities, and baloney bombs \\
                 Heat and light \\
                 The cold shoulder \\
                 Secrets \\
                 Bubble trouble \\
                 Nothing like the Sun \\
                 The science of wishful thinking",
}


bibtype: book
filename: master.bib
label: Seifer:1996:WLT
author: Marc J. Seifer
title: Wizard: The Life and Times of Nikola Tesla: Biography of a Genius
publisher: Birch Lane Press, Carol Publishing Group
address: 120 Enterprise Avenue, Secaucus, NJ, USA
pages: xiv + 542
year: 1996
ISBN: 1-55972-329-7 OR 1559723297
ISBN13: 978-1-55972-329-9 OR 9781559723299
LCCN: TK140.T4 S65 1996
bibdate: Sat Mar 08 20:37:02 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1997.03.08 20:37:02 ???
acknowledgement: ack-nhfb
subjectdates: Nikola Tesla (1856--1943)
rawauthor: Marc J. Seifer
rawtitle: Wizard: The Life and Times of {Nikola Tesla}: Biography of a Genius
abstract:
Nikola Tesla (1856--1943), credited as the inspiration for radio, robots, and even radar, has been called the patron saint of modern electricity. Based on original material and previously unavailable documents, Wizard is the definitive biography of the man considered by many to be the founding father of modern electrical technology. Wizard reveals the details of Tesla's struggles with competing contemporary inventors such as Edison, Steinmetz, and Marconi and with financial giants such as J. P. Morgan and John Jacob Astor as they were underwriting his laboratory work. (Tesla even worked for the Edison Company for several years.). Wizard brings to the fore an extraordinary man and recreates his life during one of the most exciting and innovative eras in America's history. The book is illustrated with 16 pages of photographs and drawings, including the July 20, 1931, Time magazine cover for an issue celebrating the inventor's career.

TOC:
Heritage Childhood (1856--74) College years (1875--82) Tesla meets the Wizard of Menlo Park (1882--85) Liberty Street (1886--88) Induction at Pittsburgh (1889) Bogus inventors (1889--90) South Fifth Avenue (1890--91) Revising the past (1891) The Royal Society (1892) Father of the wireless (1893) Electric sorcerer (1893) The Filipovs (1894) Niagara power (1894) Effulgent glory (1894) Fire at the lab (1895) Martian fever (1895--96) High society (1894--97) Shadowgraphs (1896) Falls speech (1897) Luminaries (1896--98) Sorcerer's apprentice (1896--97) Vril power (1898) Waldorf--Astoria (1898) Colorado Springs (1899) Contact (1899) Thor's emissary (1899) The hero's return (1900) The house of Morgan (1901) World Telegraphy Center (1901) Clash of the Titans (1901) The passing of the torch (1902) Wardenclyffe (1902--1903) The web (1903--1904) Dissolution (1904--1906) The child of his dreams (1907--1908) Bladeless turbines (1909--10) The Hammond connection (1909--13) J. P. Morgan Jr. (1912--14) Fifth column (1914--16) The invisible audience (1915--21) Transmutation (1918--21) The Roaring Twenties (1918--27) Faster than the speed of light (1927--40) Living on credit (1925--40) Loose ends (1931--43) The FBI and the Tesla papers (1943--56) The Wizard's legacy Appendix: The magnifying transmitter: a technical discussion

rawabstract:
Nikola Tesla (1856--1943), credited as the inspiration for radio, robots, and even radar, has been called the patron saint of modern electricity. Based on original material and previously unavailable documents, Wizard is the definitive biography of the man considered by many to be the founding father of modern electrical technology. Wizard reveals the details of Tesla's struggles with competing contemporary inventors such as Edison, Steinmetz, and Marconi and with financial giants such as J. P. Morgan and John Jacob Astor as they were underwriting his laboratory work. (Tesla even worked for the Edison Company for several years.). Wizard brings to the fore an extraordinary man and recreates his life during one of the most exciting and innovative eras in America's history. The book is illustrated with 16 pages of photographs and drawings, including the July 20, 1931, Time magazine cover for an issue celebrating the inventor's career.

rawTOC:
Heritage \\ Childhood (1856--74) \\ College years (1875--82) \\ Tesla meets the Wizard of Menlo Park (1882--85) \\ Liberty Street (1886--88) \\ Induction at Pittsburgh (1889) \\ Bogus inventors (1889--90) \\ South Fifth Avenue (1890--91) \\ Revising the past (1891) \\ The Royal Society (1892) \\ Father of the wireless (1893) \\ Electric sorcerer (1893) \\ The Filipovs (1894) \\ Niagara power (1894) \\ Effulgent glory (1894) \\ Fire at the lab (1895) \\ Martian fever (1895--96) \\ High society (1894--97) \\ Shadowgraphs (1896) \\ Falls speech (1897) \\ Luminaries (1896--98) \\ Sorcerer's apprentice (1896--97) \\ Vril power (1898) \\ Waldorf--Astoria (1898) \\ Colorado Springs (1899) \\ Contact (1899) \\ Thor's emissary (1899) \\ The hero's return (1900) \\ The house of Morgan (1901) \\ World Telegraphy Center (1901) \\ Clash of the Titans (1901) \\ The passing of the torch (1902) \\ Wardenclyffe (1902--1903) \\ The web (1903--1904) \\ Dissolution (1904--1906) \\ The child of his dreams (1907--1908) \\ Bladeless turbines (1909--10) \\ The Hammond connection (1909--13) \\ J. P. Morgan Jr. (1912--14) \\ Fifth column (1914--16) \\ The invisible audience (1915--21) \\ Transmutation (1918--21) \\ The Roaring Twenties (1918--27) \\ Faster than the speed of light (1927--40) \\ Living on credit (1925--40) \\ Loose ends (1931--43) \\ The FBI and the Tesla papers (1943--56) \\ The Wizard's legacy \\ Appendix: The magnifying transmitter: a technical discussion

entry:
@Book{Seifer:1996:WLT,
  author =       "Marc J. Seifer",
  title =        "Wizard: The Life and Times of {Nikola Tesla}:
                 Biography of a Genius",
  publisher =    "Birch Lane Press, Carol Publishing Group",
  address =      "120 Enterprise Avenue, Secaucus, NJ, USA",
  pages =        "xiv + 542",
  year =         "1996",
  ISBN =         "1-55972-329-7",
  ISBN-13 =      "978-1-55972-329-9",
  LCCN =         "TK140.T4 S65 1996",
  bibdate =      "Sat Mar 08 20:37:02 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$32.00, CDN\$41.95",
  abstract =     "Nikola Tesla (1856--1943), credited as the inspiration
                 for radio, robots, and even radar, has been called the
                 patron saint of modern electricity. Based on original
                 material and previously unavailable documents, Wizard
                 is the definitive biography of the man considered by
                 many to be the founding father of modern electrical
                 technology. Wizard reveals the details of Tesla's
                 struggles with competing contemporary inventors such as
                 Edison, Steinmetz, and Marconi and with financial
                 giants such as J. P. Morgan and John Jacob Astor as
                 they were underwriting his laboratory work. (Tesla even
                 worked for the Edison Company for several years.).
                 Wizard brings to the fore an extraordinary man and
                 recreates his life during one of the most exciting and
                 innovative eras in America's history. The book is
                 illustrated with 16 pages of photographs and drawings,
                 including the July 20, 1931, Time magazine cover for an
                 issue celebrating the inventor's career.",
  acknowledgement = ack-nhfb,
  subject-dates = "Nikola Tesla (1856--1943)",
  tableofcontents = "Heritage \\
                 Childhood (1856--74) \\
                 College years (1875--82) \\
                 Tesla meets the Wizard of Menlo Park (1882--85) \\
                 Liberty Street (1886--88) \\
                 Induction at Pittsburgh (1889) \\
                 Bogus inventors (1889--90) \\
                 South Fifth Avenue (1890--91) \\
                 Revising the past (1891) \\
                 The Royal Society (1892) \\
                 Father of the wireless (1893) \\
                 Electric sorcerer (1893) \\
                 The Filipovs (1894) \\
                 Niagara power (1894) \\
                 Effulgent glory (1894) \\
                 Fire at the lab (1895) \\
                 Martian fever (1895--96) \\
                 High society (1894--97) \\
                 Shadowgraphs (1896) \\
                 Falls speech (1897) \\
                 Luminaries (1896--98) \\
                 Sorcerer's apprentice (1896--97) \\
                 Vril power (1898) \\
                 Waldorf--Astoria (1898) \\
                 Colorado Springs (1899) \\
                 Contact (1899) \\
                 Thor's emissary (1899) \\
                 The hero's return (1900) \\
                 The house of Morgan (1901) \\
                 World Telegraphy Center (1901) \\
                 Clash of the Titans (1901) \\
                 The passing of the torch (1902) \\
                 Wardenclyffe (1902--1903) \\
                 The web (1903--1904) \\
                 Dissolution (1904--1906) \\
                 The child of his dreams (1907--1908) \\
                 Bladeless turbines (1909--10) \\
                 The Hammond connection (1909--13) \\
                 J. P. Morgan Jr. (1912--14) \\
                 Fifth column (1914--16) \\
                 The invisible audience (1915--21) \\
                 Transmutation (1918--21) \\
                 The Roaring Twenties (1918--27) \\
                 Faster than the speed of light (1927--40) \\
                 Living on credit (1925--40) \\
                 Loose ends (1931--43) \\
                 The FBI and the Tesla papers (1943--56) \\
                 The Wizard's legacy \\
                 Appendix: The magnifying transmitter: a technical
                 discussion",
}


bibtype: book
filename: master.bib
label: Seifert:1998:GET
author: Rich Seifert
title: Gigabit Ethernet: Technology and Applications for High-Speed LANs
publisher: pub-AW
address: pub-AW:adr
pages: xv + 411
year: 1998
ISBN: 0-201-18553-9 OR 0201185539
ISBN13: 978-0-201-18553-9 OR 9780201185539
LCCN: TK5105.8.E83S45 1998
bibdate: Wed May 27 07:20:38 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.05.27 07:20:38 ???
acknowledgement: ack-nhfb
rawauthor: Rich Seifert
rawtitle: Gigabit {Ethernet}: Technology and Applications for High-Speed {LANs}
abstract:
Appropriate for anyone involved with LAN technologies --- network planners, designers and administrators, equipment and applications developers, technical salespeople, students --- this book provides a thorough explanation of Gigabit Ethernet and the principles on which it was built. Gigabit Ethernet explains the technology in clear terms, exploring the implications for its application and operation in real-world LANs. You will learn how to identify appropriate application environments for Gigabit Ethernet, as well as how to integrate it with other technologies, make intelligent choices about products and features, and set realistic expectations about performance.

TOC:
Part I: Foundations of Gigabit Ethernet 1: Ethernet before Gigabit 2: From Shared to Dedicated Media 3: From Shared to Dedicated LANs 4: Full-Duplex Ethernet 5: Frame Formats 6: Ethernet Flow Control 7: Ethernet Medium Independence 8: Automatic Configuration Part II: Gigabit Ethernet Technology 9: Architecture and Overview of Gigabit Ethernet 10: Gigabit Ethernet Media Access Control 11: Gigabit Ethernet Hubs 12: Gigabit Ethernet Physical Layer 13: The Hitchhiker's Guide to the Gigabit Ethernet Standard Part III: Applying Gigabit Ethernet 14: Application Environments 15: Performance Considerations 16: Technology Alternatives Appendix A: 8B/10B Code Tables

rawabstract:
Appropriate for anyone involved with LAN technologies --- network planners, designers and administrators, equipment and applications developers, technical salespeople, students --- this book provides a thorough explanation of Gigabit Ethernet and the principles on which it was built. Gigabit Ethernet explains the technology in clear terms, exploring the implications for its application and operation in real-world LANs. You will learn how to identify appropriate application environments for Gigabit Ethernet, as well as how to integrate it with other technologies, make intelligent choices about products and features, and set realistic expectations about performance.

rawTOC:
Part I: Foundations of Gigabit Ethernet \\ 1: Ethernet before Gigabit \\ 2: From Shared to Dedicated Media \\ 3: From Shared to Dedicated LANs \\ 4: Full-Duplex Ethernet \\ 5: Frame Formats \\ 6: Ethernet Flow Control \\ 7: Ethernet Medium Independence \\ 8: Automatic Configuration \\ Part II: Gigabit Ethernet Technology \\ 9: Architecture and Overview of Gigabit Ethernet \\ 10: Gigabit Ethernet Media Access Control \\ 11: Gigabit Ethernet Hubs \\ 12: Gigabit Ethernet Physical Layer \\ 13: The Hitchhiker's Guide to the Gigabit Ethernet Standard \\ Part III: Applying Gigabit Ethernet \\ 14: Application Environments \\ 15: Performance Considerations \\ 16: Technology Alternatives \\ Appendix A: 8B/10B Code Tables

entry:
@Book{Seifert:1998:GET,
  author =       "Rich Seifert",
  title =        "Gigabit {Ethernet}: Technology and Applications for
                 High-Speed {LANs}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 411",
  year =         "1998",
  ISBN =         "0-201-18553-9",
  ISBN-13 =      "978-0-201-18553-9",
  LCCN =         "TK5105.8.E83S45 1998",
  bibdate =      "Wed May 27 07:20:38 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.95",
  abstract =     "Appropriate for anyone involved with LAN technologies
                 --- network planners, designers and administrators,
                 equipment and applications developers, technical
                 salespeople, students --- this book provides a thorough
                 explanation of Gigabit Ethernet and the principles on
                 which it was built. Gigabit Ethernet explains the
                 technology in clear terms, exploring the implications
                 for its application and operation in real-world LANs.
                 You will learn how to identify appropriate application
                 environments for Gigabit Ethernet, as well as how to
                 integrate it with other technologies, make intelligent
                 choices about products and features, and set realistic
                 expectations about performance.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Foundations of Gigabit Ethernet \\
                 1: Ethernet before Gigabit \\
                 2: From Shared to Dedicated Media \\
                 3: From Shared to Dedicated LANs \\
                 4: Full-Duplex Ethernet \\
                 5: Frame Formats \\
                 6: Ethernet Flow Control \\
                 7: Ethernet Medium Independence \\
                 8: Automatic Configuration \\
                 Part II: Gigabit Ethernet Technology \\
                 9: Architecture and Overview of Gigabit Ethernet \\
                 10: Gigabit Ethernet Media Access Control \\
                 11: Gigabit Ethernet Hubs \\
                 12: Gigabit Ethernet Physical Layer \\
                 13: The Hitchhiker's Guide to the Gigabit Ethernet
                 Standard \\
                 Part III: Applying Gigabit Ethernet \\
                 14: Application Environments \\
                 15: Performance Considerations \\
                 16: Technology Alternatives \\
                 Appendix A: 8B/10B Code Tables",
}


bibtype: book
filename: master.bib
label: Seltzer:1997:ASR
author: Richard Seltzer and Deborah S. Ray and Eric J. Ray
title: The AltaVista Search Revolution: How to Find Anything on the Internet
publisher: pub-OSBORNE-MCGRAW-HILL
address: pub-OSBORNE-MCGRAW-HILL:adr
pages: xxii + 274
year: 1997
ISBN: 0-07-882235-1 OR 0078822351
ISBN13: 978-0-07-882235-3 OR 9780078822353
LCCN: TK5105.875 .I57 S44 1997
bibdate: Mon Jul 21 14:34:59 1997
bibtimestamp: 1997.07.21 14:34:59 ???
acknowledgement: ack-nhfb
rawauthor: Richard Seltzer and Deborah S. Ray and Eric J. Ray
rawtitle: The {AltaVista} Search Revolution: How to Find Anything on the {Internet}
TOC:
Introduction to AltaVista Search Getting started with AltaVista Search Advanced Search Searching Usenet newsgroups Providing information the AltaVista way Using the AltaVista Search A to Z reference The AltaVista story The top 1,000 most common words on the World Wide Web A sample of 1,000 queries Frequency of words used in AltaVista Search queries Index

rawTOC:
Introduction to AltaVista Search \\ Getting started with AltaVista Search \\ Advanced Search \\ Searching Usenet newsgroups \\ Providing information the AltaVista way \\ Using the AltaVista Search A to Z reference \\ The AltaVista story \\ The top 1,000 most common words on the World Wide Web \\ A sample of 1,000 queries \\ Frequency of words used in AltaVista Search queries \\ Index

entry:
@Book{Seltzer:1997:ASR,
  author =       "Richard Seltzer and Deborah S. Ray and Eric J. Ray",
  title =        "The {AltaVista} Search Revolution: How to Find
                 Anything on the {Internet}",
  publisher =    pub-OSBORNE-MCGRAW-HILL,
  address =      pub-OSBORNE-MCGRAW-HILL:adr,
  pages =        "xxii + 274",
  year =         "1997",
  ISBN =         "0-07-882235-1",
  ISBN-13 =      "978-0-07-882235-3",
  LCCN =         "TK5105.875 .I57 S44 1997",
  bibdate =      "Mon Jul 21 14:34:59 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$16.99",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction to AltaVista Search \\
                 Getting started with AltaVista Search \\
                 Advanced Search \\
                 Searching Usenet newsgroups \\
                 Providing information the AltaVista way \\
                 Using the AltaVista Search A to Z reference \\
                 The AltaVista story \\
                 The top 1,000 most common words on the World Wide Web
                 \\
                 A sample of 1,000 queries \\
                 Frequency of words used in AltaVista Search queries \\
                 Index",
}


bibtype: book
filename: master.bib
label: Sen:2021:EFH
author: Paul Sen
title: Einstein's fridge: how the difference between hot and cold explains the universe
publisher: Scribner
address: New York, NY, USA
pages: xii + 305
year: 2021
ISBN: 1-5011-8130-0 (hardcover), 1-5011-8132-7 (e-book) OR 1501181300 (hardcover), 1501181327 (ebook)
LCCN: QC311 .S5118 2021
bibdate: Fri Mar 5 22:16:38 MST 2021
bibtimestamp: 2021.03.05 22:16:38 MST
subject: Thermodynamics
acknowledgement: ack-nhfb
rawauthor: Paul Sen
rawtitle: {Einstein}'s fridge: how the difference between hot and cold explains the universe
ISBN13:
978-1-5011-8130-6 (hardcover), 978-1-5011-8132-0 (e-book) OR 9781501181306 (hardcover), 9781501181320 (ebook)

abstract:
booktitle Einstein's Fridge tells the incredible epic story of the scientists who, over two centuries, harnessed the power of heat and ice and formulated a theory essential to comprehending our universe. Thermodynamics --- the branch of physics that deals with energy and entropy --- is the least known and yet most consequential of all the sciences. It governs everything from the behavior of living cells to the black hole at the center of our galaxy. Not only that, but thermodynamics explains why we must eat and breathe, how lights turn on, the limits of computing, and how the universe will end. The brilliant people who decoded its laws came from every branch of the sciences; they were engineers, physicists, chemists, biologists, cosmologists, and mathematicians. From French military engineer and physicist Sadi Carnot to Lord Kelvin, James Joule, Albert Einstein, Emmy Noether, Alan Turing, and Stephen Hawking, author Paul Sen introduces us to all of the players who passed the baton of scientific progress through time and across nations. Incredibly driven and idealistic, these brave pioneers performed groundbreaking work often in the face of torment and tragedy. Their discoveries helped create the modern world and transformed every branch of science, from biology to cosmology. Einstein's Fridge brings to life one of the most important scientific revolutions of all time and captures the thrill of discovery and the power of scientific progress to shape the course of history.

TOC:
Prologue / ix 1; A Tour of Britain / 1 2; The Motive Power of Fire / 7 3; The Creator's Fiat / 23 4; The Valley of the Clyde / 33 5; The Principal Problem of Physics / 41 6; The Flow of Heat and the End of Time / 51 7; Entropy / 63 8; The Motion We Call Heat / 75 9; Collisions / 83 IO; Counting the Ways / 95 11; ``The Terroristic Nimbus'' / 115 12; Boltzmann Brains / 127 13; Quanta / 133 14; Sugar and Pollen / 143 IS; Symmetry / 155 16; Information Is Physical / 167 17; Demons / 187 18; The Mathematics of Life / 199 19; Event Horizon / 219 Epilogue / 241 Acknowledgments / 245 Appendix I: The Carnot Cycle / 247 Appendix II: How Clausius Reconciled the Conservation of Energy with the Ideas of Sadi Carnot / 253 Appendix III: The Four Laws of Thermodynamics / 257 Notes / 259 Bibliography / 283 Index / 287

rawabstract:
\booktitle{Einstein's Fridge} tells the incredible epic story of the scientists who, over two centuries, harnessed the power of heat and ice and formulated a theory essential to comprehending our universe. Thermodynamics --- the branch of physics that deals with energy and entropy --- is the least known and yet most consequential of all the sciences. It governs everything from the behavior of living cells to the black hole at the center of our galaxy. Not only that, but thermodynamics explains why we must eat and breathe, how lights turn on, the limits of computing, and how the universe will end. The brilliant people who decoded its laws came from every branch of the sciences; they were engineers, physicists, chemists, biologists, cosmologists, and mathematicians. From French military engineer and physicist Sadi Carnot to Lord Kelvin, James Joule, Albert Einstein, Emmy Noether, Alan Turing, and Stephen Hawking, author Paul Sen introduces us to all of the players who passed the baton of scientific progress through time and across nations. Incredibly driven and idealistic, these brave pioneers performed groundbreaking work often in the face of torment and tragedy. Their discoveries helped create the modern world and transformed every branch of science, from biology to cosmology. Einstein's Fridge brings to life one of the most important scientific revolutions of all time and captures the thrill of discovery and the power of scientific progress to shape the course of history.

rawTOC:
Prologue / ix \\ 1; A Tour of Britain / 1 \\ 2; The Motive Power of Fire / 7 \\ 3; The Creator's Fiat / 23 \\ 4; The Valley of the Clyde / 33 \\ 5; The Principal Problem of Physics / 41 \\ 6; The Flow of Heat and the End of Time / 51 \\ 7; Entropy / 63 \\ 8; The Motion We Call Heat / 75 \\ 9; Collisions / 83 \\ IO; Counting the Ways / 95 \\ 11; ``The Terroristic Nimbus'' / 115 \\ 12; Boltzmann Brains / 127 \\ 13; Quanta / 133 \\ 14; Sugar and Pollen / 143 \\ IS; Symmetry / 155 \\ 16; Information Is Physical / 167 \\ 17; Demons / 187 \\ 18; The Mathematics of Life / 199 \\ 19; Event Horizon / 219 \\ Epilogue / 241 \\ Acknowledgments / 245 \\ Appendix I: The Carnot Cycle / 247 \\ Appendix II: How Clausius Reconciled the Conservation of Energy with the Ideas of Sadi Carnot / 253 \\ Appendix III: The Four Laws of Thermodynamics / 257 \\ Notes / 259 \\ Bibliography / 283 \\ Index / 287

entry:
@Book{Sen:2021:EFH,
  author =       "Paul Sen",
  title =        "{Einstein}'s fridge: how the difference between hot
                 and cold explains the universe",
  publisher =    "Scribner",
  address =      "New York, NY, USA",
  pages =        "xii + 305",
  year =         "2021",
  ISBN =         "1-5011-8130-0 (hardcover), 1-5011-8132-7 (e-book)",
  ISBN-13 =      "978-1-5011-8130-6 (hardcover), 978-1-5011-8132-0
                 (e-book)",
  LCCN =         "QC311 .S5118 2021",
  bibdate =      "Fri Mar 5 22:16:38 MST 2021",
  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",
  abstract =     "\booktitle{Einstein's Fridge} tells the incredible
                 epic story of the scientists who, over two centuries,
                 harnessed the power of heat and ice and formulated a
                 theory essential to comprehending our universe.
                 Thermodynamics --- the branch of physics that deals
                 with energy and entropy --- is the least known and yet
                 most consequential of all the sciences. It governs
                 everything from the behavior of living cells to the
                 black hole at the center of our galaxy. Not only that,
                 but thermodynamics explains why we must eat and
                 breathe, how lights turn on, the limits of computing,
                 and how the universe will end. The brilliant people who
                 decoded its laws came from every branch of the
                 sciences; they were engineers, physicists, chemists,
                 biologists, cosmologists, and mathematicians. From
                 French military engineer and physicist Sadi Carnot to
                 Lord Kelvin, James Joule, Albert Einstein, Emmy
                 Noether, Alan Turing, and Stephen Hawking, author Paul
                 Sen introduces us to all of the players who passed the
                 baton of scientific progress through time and across
                 nations. Incredibly driven and idealistic, these brave
                 pioneers performed groundbreaking work often in the
                 face of torment and tragedy. Their discoveries helped
                 create the modern world and transformed every branch of
                 science, from biology to cosmology. Einstein's Fridge
                 brings to life one of the most important scientific
                 revolutions of all time and captures the thrill of
                 discovery and the power of scientific progress to shape
                 the course of history.",
  acknowledgement = ack-nhfb,
  subject =      "Thermodynamics",
  tableofcontents = "Prologue / ix \\
                 1; A Tour of Britain / 1 \\
                 2; The Motive Power of Fire / 7 \\
                 3; The Creator's Fiat / 23 \\
                 4; The Valley of the Clyde / 33 \\
                 5; The Principal Problem of Physics / 41 \\
                 6; The Flow of Heat and the End of Time / 51 \\
                 7; Entropy / 63 \\
                 8; The Motion We Call Heat / 75 \\
                 9; Collisions / 83 \\
                 IO; Counting the Ways / 95 \\
                 11; ``The Terroristic Nimbus'' / 115 \\
                 12; Boltzmann Brains / 127 \\
                 13; Quanta / 133 \\
                 14; Sugar and Pollen / 143 \\
                 IS; Symmetry / 155 \\
                 16; Information Is Physical / 167 \\
                 17; Demons / 187 \\
                 18; The Mathematics of Life / 199 \\
                 19; Event Horizon / 219 \\
                 Epilogue / 241 \\
                 Acknowledgments / 245 \\
                 Appendix I: The Carnot Cycle / 247 \\
                 Appendix II: How Clausius Reconciled the Conservation
                 of Energy with the Ideas of Sadi Carnot / 253 \\
                 Appendix III: The Four Laws of Thermodynamics / 257 \\
                 Notes / 259 \\
                 Bibliography / 283 \\
                 Index / 287",
}


bibtype: book
filename: master.bib
label: Senor:2009:SNS
author: Dan Senor and Saul Singer
title: Start-up Nation: the Story of Israel's Economic Miracle
publisher: Twelve
address: New York, NY, USA
pages: x + 304
year: 2009
LCCN: HC415.25 .S455 2009eb
bibdate: Mon Feb 11 08:55:54 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.02.11 08:55:54 MST
abstract: What the world can learn from Israel's meteoric economic success.
rawabstract: What the world can learn from Israel's meteoric economic success.
rawauthor: Dan Senor and Saul Singer
rawtitle: Start-up Nation: the Story of {Israel}'s Economic Miracle
ISBN:
0-446-54146-X, 0-446-54147-8 (paperback), 1-4555-0346-0 (e-book), 1-59995-857-0 (e-book) OR 044654146X, 0446541478 (paperback), 1455503460 (ebook), 1599958570 (ebook)

ISBN13:
978-0-446-54146-6, 978-0-446-54147-3 (paperback), 978-1-4555-0346-9 (e-book X11), 978-1-59995-857-6 (e-book X11) OR 9780446541466, 9780446541473 (paperback), 9781455503469 (ebook X11), 9781599958576 (ebook X11)

TOC:
Foreword by Shimon Peres / xi Authors' Note / xv Maps / xvii Introduction / 1 Part I: The Little Nation That Could / 1: Persistance / 23 2: Battlefield entrepreneurs / 41 Part ii: Seeding a Culture of Innovation / 3: The people of the book / 57 4: Harvard, Princeton and Yale / 67 5: Where order meets random chaos / 84 Part III: Beginnings 6: An industrial policy that worked / 103 7: Immigration: the Google guys' challenge / 121 8: The Diaspora: stealing airplanes / 135 9: The Buffett test / 145 10: Yozma: the match / 159 Part IV: Country With a Motive 11: Betrayal and opportunity / 177 12: From nose cones to geysers / 184 13: The sheikh's dilemma / 194 14: Threats to the economic miracle / 215 Conclusion: Farmers of high tech / 225 Afterword / 237 Acknowledgments / 245 Notes / 251 Bibliography / 273 Index / 299 About the Authors / 311

rawTOC:
Foreword by Shimon Peres / xi \\ Authors' Note / xv \\ Maps / xvii \\ Introduction / 1 \\ Part I: The Little Nation That Could / \\ 1: Persistance / 23 \\ 2: Battlefield entrepreneurs / 41 \\ Part ii: Seeding a Culture of Innovation / \\ 3: The people of the book / 57 \\ 4: Harvard, Princeton and Yale / 67 \\ 5: Where order meets random chaos / 84 \\ Part III: Beginnings \\ 6: An industrial policy that worked / 103 \\ 7: Immigration: the Google guys' challenge / 121 \\ 8: The Diaspora: stealing airplanes / 135 \\ 9: The Buffett test / 145 \\ 10: Yozma: the match / 159 \\ Part IV: Country With a Motive \\ 11: Betrayal and opportunity / 177 \\ 12: From nose cones to geysers / 184 \\ 13: The sheikh's dilemma / 194 \\ 14: Threats to the economic miracle / 215 \\ Conclusion: Farmers of high tech / 225 \\ Afterword / 237 \\ Acknowledgments / 245 \\ Notes / 251 \\ Bibliography / 273 \\ Index / 299 \\ About the Authors / 311

entry:
@Book{Senor:2009:SNS,
  author =       "Dan Senor and Saul Singer",
  title =        "Start-up Nation: the Story of {Israel}'s Economic
                 Miracle",
  publisher =    "Twelve",
  address =      "New York, NY, USA",
  pages =        "x + 304",
  year =         "2009",
  ISBN =         "0-446-54146-X, 0-446-54147-8 (paperback),
                 1-4555-0346-0 (e-book), 1-59995-857-0 (e-book)",
  ISBN-13 =      "978-0-446-54146-6, 978-0-446-54147-3 (paperback),
                 978-1-4555-0346-9 (e-book X11), 978-1-59995-857-6
                 (e-book X11)",
  LCCN =         "HC415.25 .S455 2009eb",
  bibdate =      "Mon Feb 11 08:55:54 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "What the world can learn from Israel's meteoric
                 economic success.",
  libnote =      "Not in my library.",
  tableofcontents = "Foreword by Shimon Peres / xi \\
                 Authors' Note / xv \\
                 Maps / xvii \\
                 Introduction / 1 \\
                 Part I: The Little Nation That Could / \\
                 1: Persistance / 23 \\
                 2: Battlefield entrepreneurs / 41 \\
                 Part ii: Seeding a Culture of Innovation / \\
                 3: The people of the book / 57 \\
                 4: Harvard, Princeton and Yale / 67 \\
                 5: Where order meets random chaos / 84 \\
                 Part III: Beginnings \\
                 6: An industrial policy that worked / 103 \\
                 7: Immigration: the Google guys' challenge / 121 \\
                 8: The Diaspora: stealing airplanes / 135 \\
                 9: The Buffett test / 145 \\
                 10: Yozma: the match / 159 \\
                 Part IV: Country With a Motive \\
                 11: Betrayal and opportunity / 177 \\
                 12: From nose cones to geysers / 184 \\
                 13: The sheikh's dilemma / 194 \\
                 14: Threats to the economic miracle / 215 \\
                 Conclusion: Farmers of high tech / 225 \\
                 Afterword / 237 \\
                 Acknowledgments / 245 \\
                 Notes / 251 \\
                 Bibliography / 273 \\
                 Index / 299 \\
                 About the Authors / 311",
}


bibtype: book
filename: master.bib
label: Seroul:1989:PLT
author: Raymond Seroul
title: Le petit Livre de TeX
publisher: pub-IE
address: pub-IE:adr
pages: 317
year: 1989
ISBN: 2-7296-0233-X OR 272960233X
ISBN13: 978-2-7296-0233-8 OR 9782729602338
LCCN: Z253.4 T47 S47 1989
bibdate: Sun May 02 07:53:23 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:53:23 ???
note: English translation available as cite Seroul:1991:BBT.
acknowledgement: ack-nhfb
rawauthor: Raymond Seroul
rawnote: English translation available as \cite{Seroul:1991:BBT}.
rawtitle: Le petit Livre de {\TeX}
entry:
@Book{Seroul:1989:PLT,
  author =       "Raymond Seroul",
  title =        "Le petit Livre de {\TeX}",
  publisher =    pub-IE,
  address =      pub-IE:adr,
  pages =        "317",
  year =         "1989",
  ISBN =         "2-7296-0233-X",
  ISBN-13 =      "978-2-7296-0233-8",
  LCCN =         "Z253.4 T47 S47 1989",
  bibdate =      "Sun May 02 07:53:23 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "English translation available as
                 \cite{Seroul:1991:BBT}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Seroul:1991:BBT
author: Raymond Seroul and Silvio Levy
title: A Beginner's Book of TeX
publisher: pub-SV
address: pub-SV:adr
pages: xii + 282
year: 1991
DOI: https://doi.org/10.1007/978-1-4419-8654-2
ISBN: 0-387-97562-4, 3-540-97562-4 OR 0387975624, 3540975624
ISBN13: 978-0-387-97562-7, 978-3-540-97562-5 OR 9780387975627, 9783540975625
LCCN: Z253.4.T47 S47 1991
bibdate: Sun Mar 27 19:05:51 1994
bibtimestamp: 1994.03.27 19:05:51 ???
note: This is a translation and adaption by Silvio Levy of cite Seroul:1989:PLT.
acknowledgement: ack-nhfb
rawauthor: Raymond Seroul and Silvio Levy
rawnote: This is a translation and adaption by Silvio Levy of \cite{Seroul:1989:PLT}.
rawtitle: A Beginner's Book of {\TeX}
abstract:
This book is a friendly introduction to TeX , the powerful typesetting system designed by Donald Knuth. It is addressed primarily to beginners, but it contains much information that will be useful to aspiring TeX ``wizards''. Moreover, the authors kept firmly in mind the diversity of backgrounds that characterizes TeX users: authors in the sciences and in the humanities, secretaries, technical typists. The book contains a careful explanation of all fundamental concepts and commands, but also a wealth of commented examples and ``tricks'' based on the authors' long experience with TeX . The attentive reader will quickly be able to create a table, or customize the appearance of the page, or code even the most complicated formula. The last third of the book is devoted to a Dictionary/Index, summarizing all the material in the text and going into greater depth in many areas.

TOC:
1: What is TeX 1.1 The birth of TeX 1.2 How TeX works 1.3 The good news and bad news about TeX 1.4 TeX who and what for? 1.5 TeX processing: an overview 1.6 Looking ahead 1.7 Creating a master file 1.8 Error messages 2: The characters of TeX 2.1 Characters that are special to TeX 2.2 Quotes 2.3 Ligatures and special characters 2.4 Accents 2.5 Two exercises 3: Groups and modes 3.1 Groups 3.2 Modes 3.3 For the aspiring wizard 4: The fonts TeX uses 4.1 TeX 's fonts 4.2 Preloaded fonts 4.3 Loading other fonts 4.4 A cornucopia of fonts 4.5 Scaling of fonts 4.6 Global scaling 4.7 For the aspiring wizard 4.8 Exercise 5: Spacing, glue and springs 5.1 Horizontal spacing 5.2 Vertical spacing 5.3 Glue, or, spaces that stretch and shrink 5.4 Springs 5.5 Spacing and breaks 5.6 Summary of basic spacing commands 5.7 Spacing between paragraphs 5.8 More spring like creatures 5.9 Leaders in their full glory 5.10 For the experienced user 5.11 Examples 6: Paragraphs 6.1 Beginning and ending a paragraph 6.2 What's in a paragraph? 6.3 Automatic indentation 6.4 Obeying lines 6.5 Left and right margins 6.6 Ragged margins 6.7 Quotations 6.8 Centering text 6.9 Series of items 6.10 More on hanging indentation 6.11 Paragraphs with fancy shapes 6.12 Footnotes 6.13 Two new macros for the aspiring wizard 7: Page layout 7.1 Page layout in plain TeX 7.2 A more elaborate layout 7.3 The title page 7.4 Starting a fresh page and leaving a blank page 7.5 Placing a title 7.6 Choosing line and page breaks by hand 7.7 Floats 7.8 A complete example 7.9 Penalties: or, the carrot and the stick 8: Boxes 8.1 What is a box? 8.2 Putting boxes together 8.3 What goes in a box? 8.4 Creating a box: summary 8.5 Storing a box 8.6 The baseline 8.7 The dimensions of a box 8.8 Some practical situations 8.9 Spacing between boxes 8.10 Rules 8.11 More practical examples 8.12 For the aspiring wizard 9: Alignments 9.1 The preamble, a.k.a. recipe 9.2 Simple alignments 9.3 Some practical suggestions 9.4 Treating special cases 9.5 Excessively wide entries 9.6 Inserting material between rows 9.7 Combining columns 9.8 Aligning digits 9.9 Horizontal rules and spacing 9.10 Vertical rules 9.11 Braces and tables 9.12 Fixing the width of an alignment 9.13 Vertical alignments 10: Tabbing 10.1 Setting tabs 10.2 Centering 10.3 Choosing column widths 10.4 Equally spaced tabs 10.5 Clearing tabs 10.6 Tabs and rules 10.7 Tabs and springs 10.8 Typesetting code 10.9 Tabs and alignments: a comparison 11: Typesetting mathematics 11.1 Generalities 11.2 Math symbols 11.3 Fonts in math mode 11.4 Subscripts and superscripts 11.5 Accents 11.6 Spacing in math mode 11.7 The four styles 11.8 Function names 11.9 Fractions 11.10 Large operators and limits 11.11 Radicals 11.12 Horizontally extensible symbols 11.13 Vertically extensible symbols 11.14 Stacking up symbols 11.15 Combining relations 11.16 More custom-made symbols: limits 11.17 Phantoms 11.18 Displaying several formulas 11.19 Aligning several formulas 11.20 Labeling formulas 11.21 Matrices 11.22 Adjusting the spacing 11.23 Ellipses 11.24 Diagrams 12: TeX Programming 12.1 Generalities 12.2 Abbreviations and clones 12.3 Macros with arguments 12.4 Fine points of macro syntax 12.5 Category codes 12.6 Active characters 12.7 How TeX reads and stores your text 12.8 Registers 12.9 Conditionals 12.10 For the aspiring wizard 13: Dictionary and Index

rawabstract:
This book is a friendly introduction to \TeX{}, the powerful typesetting system designed by Donald Knuth. It is addressed primarily to beginners, but it contains much information that will be useful to aspiring \TeX{} ``wizards''. Moreover, the authors kept firmly in mind the diversity of backgrounds that characterizes \TeX{} users: authors in the sciences and in the humanities, secretaries, technical typists. The book contains a careful explanation of all fundamental concepts and commands, but also a wealth of commented examples and ``tricks'' based on the authors' long experience with \TeX{}. The attentive reader will quickly be able to create a table, or customize the appearance of the page, or code even the most complicated formula. The last third of the book is devoted to a Dictionary/Index, summarizing all the material in the text and going into greater depth in many areas.

shortTOC:
What is TeX? The characters of TeX Groups and modes The fonts TeX uses Spacing, glue and springs Paragraphs Page layout Boxes Alignments Tabbing Typesetting mathematics TeX programming Dictionary and index

rawshortTOC:
What is TeX? \\ The characters of TeX \\ Groups and modes \\ The fonts TeX uses \\ Spacing, glue and springs \\ Paragraphs \\ Page layout \\ Boxes \\ Alignments \\ Tabbing \\ Typesetting mathematics \\ TeX programming \\ Dictionary and index

rawTOC:
1: What is \TeX{} \\ 1.1 The birth of \TeX{} \\ 1.2 How \TeX{} works \\ 1.3 The good news and bad news about \TeX{} \\ 1.4 \TeX{} who and what for? \\ 1.5 \TeX{} processing: an overview \\ 1.6 Looking ahead \\ 1.7 Creating a master file \\ 1.8 Error messages \\ 2: The characters of \TeX{} \\ 2.1 Characters that are special to \TeX{} \\ 2.2 Quotes \\ 2.3 Ligatures and special characters \\ 2.4 Accents \\ 2.5 Two exercises \\ 3: Groups and modes \\ 3.1 Groups \\ 3.2 Modes \\ 3.3 For the aspiring wizard \\ 4: The fonts \TeX{} uses \\ 4.1 \TeX{}'s fonts \\ 4.2 Preloaded fonts \\ 4.3 Loading other fonts \\ 4.4 A cornucopia of fonts \\ 4.5 Scaling of fonts \\ 4.6 Global scaling \\ 4.7 For the aspiring wizard \\ 4.8 Exercise \\ 5: Spacing, glue and springs \\ 5.1 Horizontal spacing \\ 5.2 Vertical spacing \\ 5.3 Glue, or, spaces that stretch and shrink \\ 5.4 Springs \\ 5.5 Spacing and breaks \\ 5.6 Summary of basic spacing commands \\ 5.7 Spacing between paragraphs \\ 5.8 More spring like creatures \\ 5.9 Leaders in their full glory \\ 5.10 For the experienced user \\ 5.11 Examples \\ 6: Paragraphs \\ 6.1 Beginning and ending a paragraph \\ 6.2 What's in a paragraph? \\ 6.3 Automatic indentation \\ 6.4 Obeying lines \\ 6.5 Left and right margins \\ 6.6 Ragged margins \\ 6.7 Quotations \\ 6.8 Centering text \\ 6.9 Series of items \\ 6.10 More on hanging indentation \\ 6.11 Paragraphs with fancy shapes \\ 6.12 Footnotes \\ 6.13 Two new macros for the aspiring wizard \\ 7: Page layout \\ 7.1 Page layout in plain \TeX{} \\ 7.2 A more elaborate layout \\ 7.3 The title page \\ 7.4 Starting a fresh page and leaving a blank page \\ 7.5 Placing a title \\ 7.6 Choosing line and page breaks by hand \\ 7.7 Floats \\ 7.8 A complete example \\ 7.9 Penalties: or, the carrot and the stick \\ 8: Boxes \\ 8.1 What is a box? \\ 8.2 Putting boxes together \\ 8.3 What goes in a box? \\ 8.4 Creating a box: summary \\ 8.5 Storing a box \\ 8.6 The baseline \\ 8.7 The dimensions of a box \\ 8.8 Some practical situations \\ 8.9 Spacing between boxes \\ 8.10 Rules \\ 8.11 More practical examples \\ 8.12 For the aspiring wizard \\ 9: Alignments \\ 9.1 The preamble, a.k.a. recipe \\ 9.2 Simple alignments \\ 9.3 Some practical suggestions \\ 9.4 Treating special cases \\ 9.5 Excessively wide entries \\ 9.6 Inserting material between rows \\ 9.7 Combining columns \\ 9.8 Aligning digits \\ 9.9 Horizontal rules and spacing \\ 9.10 Vertical rules \\ 9.11 Braces and tables \\ 9.12 Fixing the width of an alignment \\ 9.13 Vertical alignments \\ 10: Tabbing \\ 10.1 Setting tabs \\ 10.2 Centering \\ 10.3 Choosing column widths \\ 10.4 Equally spaced tabs \\ 10.5 Clearing tabs \\ 10.6 Tabs and rules \\ 10.7 Tabs and springs \\ 10.8 Typesetting code \\ 10.9 Tabs and alignments: a comparison \\ 11: Typesetting mathematics \\ 11.1 Generalities \\ 11.2 Math symbols \\ 11.3 Fonts in math mode \\ 11.4 Subscripts and superscripts \\ 11.5 Accents \\ 11.6 Spacing in math mode \\ 11.7 The four styles \\ 11.8 Function names \\ 11.9 Fractions \\ 11.10 Large operators and limits \\ 11.11 Radicals \\ 11.12 Horizontally extensible symbols \\ 11.13 Vertically extensible symbols \\ 11.14 Stacking up symbols \\ 11.15 Combining relations \\ 11.16 More custom-made symbols: limits \\ 11.17 Phantoms \\ 11.18 Displaying several formulas \\ 11.19 Aligning several formulas \\ 11.20 Labeling formulas \\ 11.21 Matrices \\ 11.22 Adjusting the spacing \\ 11.23 Ellipses \\ 11.24 Diagrams \\ 12: \TeX{} Programming \\ 12.1 Generalities \\ 12.2 Abbreviations and clones \\ 12.3 Macros with arguments \\ 12.4 Fine points of macro syntax \\ 12.5 Category codes \\ 12.6 Active characters \\ 12.7 How \TeX{} reads and stores your text \\ 12.8 Registers \\ 12.9 Conditionals \\ 12.10 For the aspiring wizard \\ 13: Dictionary and Index

entry:
@Book{Seroul:1991:BBT,
  author =       "Raymond Seroul and Silvio Levy",
  title =        "A Beginner's Book of {\TeX}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 282",
  year =         "1991",
  DOI =          "https://doi.org/10.1007/978-1-4419-8654-2",
  ISBN =         "0-387-97562-4, 3-540-97562-4",
  ISBN-13 =      "978-0-387-97562-7, 978-3-540-97562-5",
  LCCN =         "Z253.4.T47 S47 1991",
  bibdate =      "Sun Mar 27 19:05:51 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "This is a translation and adaption by Silvio Levy of
                 \cite{Seroul:1989:PLT}.",
  abstract =     "This book is a friendly introduction to \TeX{}, the
                 powerful typesetting system designed by Donald Knuth.
                 It is addressed primarily to beginners, but it contains
                 much information that will be useful to aspiring \TeX{}
                 ``wizards''. Moreover, the authors kept firmly in mind
                 the diversity of backgrounds that characterizes \TeX{}
                 users: authors in the sciences and in the humanities,
                 secretaries, technical typists. The book contains a
                 careful explanation of all fundamental concepts and
                 commands, but also a wealth of commented examples and
                 ``tricks'' based on the authors' long experience with
                 \TeX{}. The attentive reader will quickly be able to
                 create a table, or customize the appearance of the
                 page, or code even the most complicated formula. The
                 last third of the book is devoted to a
                 Dictionary/Index, summarizing all the material in the
                 text and going into greater depth in many areas.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "What is TeX? \\
                 The characters of TeX \\
                 Groups and modes \\
                 The fonts TeX uses \\
                 Spacing, glue and springs \\
                 Paragraphs \\
                 Page layout \\
                 Boxes \\
                 Alignments \\
                 Tabbing \\
                 Typesetting mathematics \\
                 TeX programming \\
                 Dictionary and index",
  tableofcontents = "1: What is \TeX{} \\
                 1.1 The birth of \TeX{} \\
                 1.2 How \TeX{} works \\
                 1.3 The good news and bad news about \TeX{} \\
                 1.4 \TeX{} who and what for? \\
                 1.5 \TeX{} processing: an overview \\
                 1.6 Looking ahead \\
                 1.7 Creating a master file \\
                 1.8 Error messages \\
                 2: The characters of \TeX{} \\
                 2.1 Characters that are special to \TeX{} \\
                 2.2 Quotes \\
                 2.3 Ligatures and special characters \\
                 2.4 Accents \\
                 2.5 Two exercises \\
                 3: Groups and modes \\
                 3.1 Groups \\
                 3.2 Modes \\
                 3.3 For the aspiring wizard \\
                 4: The fonts \TeX{} uses \\
                 4.1 \TeX{}'s fonts \\
                 4.2 Preloaded fonts \\
                 4.3 Loading other fonts \\
                 4.4 A cornucopia of fonts \\
                 4.5 Scaling of fonts \\
                 4.6 Global scaling \\
                 4.7 For the aspiring wizard \\
                 4.8 Exercise \\
                 5: Spacing, glue and springs \\
                 5.1 Horizontal spacing \\
                 5.2 Vertical spacing \\
                 5.3 Glue, or, spaces that stretch and shrink \\
                 5.4 Springs \\
                 5.5 Spacing and breaks \\
                 5.6 Summary of basic spacing commands \\
                 5.7 Spacing between paragraphs \\
                 5.8 More spring like creatures \\
                 5.9 Leaders in their full glory \\
                 5.10 For the experienced user \\
                 5.11 Examples \\
                 6: Paragraphs \\
                 6.1 Beginning and ending a paragraph \\
                 6.2 What's in a paragraph? \\
                 6.3 Automatic indentation \\
                 6.4 Obeying lines \\
                 6.5 Left and right margins \\
                 6.6 Ragged margins \\
                 6.7 Quotations \\
                 6.8 Centering text \\
                 6.9 Series of items \\
                 6.10 More on hanging indentation \\
                 6.11 Paragraphs with fancy shapes \\
                 6.12 Footnotes \\
                 6.13 Two new macros for the aspiring wizard \\
                 7: Page layout \\
                 7.1 Page layout in plain \TeX{} \\
                 7.2 A more elaborate layout \\
                 7.3 The title page \\
                 7.4 Starting a fresh page and leaving a blank page \\
                 7.5 Placing a title \\
                 7.6 Choosing line and page breaks by hand \\
                 7.7 Floats \\
                 7.8 A complete example \\
                 7.9 Penalties: or, the carrot and the stick \\
                 8: Boxes \\
                 8.1 What is a box? \\
                 8.2 Putting boxes together \\
                 8.3 What goes in a box? \\
                 8.4 Creating a box: summary \\
                 8.5 Storing a box \\
                 8.6 The baseline \\
                 8.7 The dimensions of a box \\
                 8.8 Some practical situations \\
                 8.9 Spacing between boxes \\
                 8.10 Rules \\
                 8.11 More practical examples \\
                 8.12 For the aspiring wizard \\
                 9: Alignments \\
                 9.1 The preamble, a.k.a. recipe \\
                 9.2 Simple alignments \\
                 9.3 Some practical suggestions \\
                 9.4 Treating special cases \\
                 9.5 Excessively wide entries \\
                 9.6 Inserting material between rows \\
                 9.7 Combining columns \\
                 9.8 Aligning digits \\
                 9.9 Horizontal rules and spacing \\
                 9.10 Vertical rules \\
                 9.11 Braces and tables \\
                 9.12 Fixing the width of an alignment \\
                 9.13 Vertical alignments \\
                 10: Tabbing \\
                 10.1 Setting tabs \\
                 10.2 Centering \\
                 10.3 Choosing column widths \\
                 10.4 Equally spaced tabs \\
                 10.5 Clearing tabs \\
                 10.6 Tabs and rules \\
                 10.7 Tabs and springs \\
                 10.8 Typesetting code \\
                 10.9 Tabs and alignments: a comparison \\
                 11: Typesetting mathematics \\
                 11.1 Generalities \\
                 11.2 Math symbols \\
                 11.3 Fonts in math mode \\
                 11.4 Subscripts and superscripts \\
                 11.5 Accents \\
                 11.6 Spacing in math mode \\
                 11.7 The four styles \\
                 11.8 Function names \\
                 11.9 Fractions \\
                 11.10 Large operators and limits \\
                 11.11 Radicals \\
                 11.12 Horizontally extensible symbols \\
                 11.13 Vertically extensible symbols \\
                 11.14 Stacking up symbols \\
                 11.15 Combining relations \\
                 11.16 More custom-made symbols: limits \\
                 11.17 Phantoms \\
                 11.18 Displaying several formulas \\
                 11.19 Aligning several formulas \\
                 11.20 Labeling formulas \\
                 11.21 Matrices \\
                 11.22 Adjusting the spacing \\
                 11.23 Ellipses \\
                 11.24 Diagrams \\
                 12: \TeX{} Programming \\
                 12.1 Generalities \\
                 12.2 Abbreviations and clones \\
                 12.3 Macros with arguments \\
                 12.4 Fine points of macro syntax \\
                 12.5 Category codes \\
                 12.6 Active characters \\
                 12.7 How \TeX{} reads and stores your text \\
                 12.8 Registers \\
                 12.9 Conditionals \\
                 12.10 For the aspiring wizard \\
                 13: Dictionary and Index",
}


