# bibtab

bibtype: book
filename: master.bib
label: Ceruzzi:1998:HMC
author: Paul E. Ceruzzi
title: A History of Modern Computing
publisher: pub-MIT
address: pub-MIT:adr
pages: x + 398
year: 1998
ISBN: 0-262-03255-4 OR 0262032554
ISBN13: 978-0-262-03255-1 OR 9780262032551
LCCN: QA76.17 .C47 1998
bibdate: Sat Apr 27 14:53:21 MDT 2024
bibtimestamp: 2024.04.27 14:53:21 MDT
series: History of computing
subject: Computer; Datenverarbeitung
acknowledgement: ack-nhfb
rawauthor: Paul E. Ceruzzi
rawtitle: A History of Modern Computing
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
This engaging history covers modern computing from the development of the first electronic digital computer through the advent of the World Wide Web. The author concentrates on four key moments of transition: the transformation of the computer in the late 1940s from a specialized scientific instrument to a commercial product; the emergence of small systems in the late 1960s; the beginnings of personal computing in the 1970s; and the spread of networking after 1985.

TOC:
Introduction: Defining ``Computer'' 1: The Advent of Commercial Computing, 1945--1956 2: Computing Comes of Age, 1956--1964 3: The Early History of Software, 1952--1968 4: From Mainframe to Minicomputer, 1959--1969 5: The Go-Go Years and the System/360, 1961--1975 6: The Chip and Its Impact, 1965--1975 7: The Personal Computer, 1972--1977 8: Augmenting Human Intellect, 1975--1985 9: Workstations, UNIX, and the Net, 1981--1995 Conclusion: The Digitization of the World Picture

rawabstract:
This engaging history covers modern computing from the development of the first electronic digital computer through the advent of the World Wide Web. The author concentrates on four key moments of transition: the transformation of the computer in the late 1940s from a specialized scientific instrument to a commercial product; the emergence of small systems in the late 1960s; the beginnings of personal computing in the 1970s; and the spread of networking after 1985.

rawTOC:
Introduction: Defining ``Computer'' \\ 1: The Advent of Commercial Computing, 1945--1956 \\ 2: Computing Comes of Age, 1956--1964 \\ 3: The Early History of Software, 1952--1968 \\ 4: From Mainframe to Minicomputer, 1959--1969 \\ 5: The Go-Go Years and the System/360, 1961--1975 \\ 6: The Chip and Its Impact, 1965--1975 \\ 7: The Personal Computer, 1972--1977 \\ 8: Augmenting Human Intellect, 1975--1985 \\ 9: Workstations, UNIX, and the Net, 1981--1995 \\ Conclusion: The Digitization of the World Picture

entry:
@Book{Ceruzzi:1998:HMC,
  author =       "Paul E. Ceruzzi",
  title =        "A History of Modern Computing",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "x + 398",
  year =         "1998",
  ISBN =         "0-262-03255-4",
  ISBN-13 =      "978-0-262-03255-1",
  LCCN =         "QA76.17 .C47 1998",
  bibdate =      "Sat Apr 27 14:53:21 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "History of computing",
  abstract =     "This engaging history covers modern computing from the
                 development of the first electronic digital computer
                 through the advent of the World Wide Web. The author
                 concentrates on four key moments of transition: the
                 transformation of the computer in the late 1940s from a
                 specialized scientific instrument to a commercial
                 product; the emergence of small systems in the late
                 1960s; the beginnings of personal computing in the
                 1970s; and the spread of networking after 1985.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Computer; Datenverarbeitung",
  tableofcontents = "Introduction: Defining ``Computer'' \\
                 1: The Advent of Commercial Computing, 1945--1956 \\
                 2: Computing Comes of Age, 1956--1964 \\
                 3: The Early History of Software, 1952--1968 \\
                 4: From Mainframe to Minicomputer, 1959--1969 \\
                 5: The Go-Go Years and the System/360, 1961--1975 \\
                 6: The Chip and Its Impact, 1965--1975 \\
                 7: The Personal Computer, 1972--1977 \\
                 8: Augmenting Human Intellect, 1975--1985 \\
                 9: Workstations, UNIX, and the Net, 1981--1995 \\
                 Conclusion: The Digitization of the World Picture",
}


bibtype: book
filename: master.bib
label: Ceruzzi:2003:HMC
author: Paul E. Ceruzzi
title: A History of Modern Computing
publisher: pub-MIT
address: pub-MIT:adr
edition: Second
pages: xi + 445
year: 2003
ISBN: 0-262-53203-4 (paperback) OR 0262532034 (paperback)
ISBN13: 978-0-262-53203-7 (paperback) OR 9780262532037 (paperback)
LCCN: QA76.17.C47 2003
bibdate: Sat Apr 27 15:03:11 MDT 2024
bibtimestamp: 2024.04.27 15:03:11 MDT
series: History of computing
acknowledgement: ack-nhfb
rawauthor: Paul E. Ceruzzi
rawtitle: A History of Modern Computing
bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/linux.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
This book covers modern computing from the development of the first electronic digital computer through the dot-com crash. The author concentrates on five key moments of transition: the transformation of the computer in the late 1940s from a specialized scientific instrument to a commercial product; the emergence of small systems in the late 1960s; the beginning of personal computing in the 1970s; the spread of networking after 1985; and, in a chapter written for this edition, the period 1995-2001. The new material focuses on the Microsoft antitrust suit, the rise and fall of the dot-coms, and the advent of open source software, particularly Linux. Within the chronological narrative, the book traces several overlapping threads: the evolution of the computer's internal design; the effect of economic trends and the Cold War; the long-term role of IBM as a player and as a target for upstart entrepreneurs; the growth of software from a hidden element to a major character in the story of computing; and the recurring issue of the place of information and computing in a democratic society. The focus is on the United States (though Europe and Japan enter the story at crucial points), on computing per se rather than on applications such as artificial intelligence, and on systems that were sold commercially and installed in quantities.

TOC:
Introduction: Defining ``Computer'' 1: The Advent of Commercial Computing, 1945--1956 2: Computing Comes of Age, 1956--1964 3: The Early History of Software, 1952--1968 4: From Mainframe to Minicomputer, 1959--1969 5: The ``Go-Go'' Years and the System/360, 1961--1975 6: The Chip and Its Impact, 1965--1975 7: The Personal Computer, 1972--1977 8: Augmenting Human Intellect, 1975--1985 9: Workstations, UNIX, and the Net, 1981--1995 10: ``Internet Time,'' 1995--2001 Conclusion: The Digitization of the World Picture

rawabstract:
This book covers modern computing from the development of the first electronic digital computer through the dot-com crash. The author concentrates on five key moments of transition: the transformation of the computer in the late 1940s from a specialized scientific instrument to a commercial product; the emergence of small systems in the late 1960s; the beginning of personal computing in the 1970s; the spread of networking after 1985; and, in a chapter written for this edition, the period 1995-2001. The new material focuses on the Microsoft antitrust suit, the rise and fall of the dot-coms, and the advent of open source software, particularly Linux. Within the chronological narrative, the book traces several overlapping threads: the evolution of the computer's internal design; the effect of economic trends and the Cold War; the long-term role of IBM as a player and as a target for upstart entrepreneurs; the growth of software from a hidden element to a major character in the story of computing; and the recurring issue of the place of information and computing in a democratic society. The focus is on the United States (though Europe and Japan enter the story at crucial points), on computing per se rather than on applications such as artificial intelligence, and on systems that were sold commercially and installed in quantities.

rawTOC:
Introduction: Defining ``Computer'' \\ 1: The Advent of Commercial Computing, 1945--1956 \\ 2: Computing Comes of Age, 1956--1964 \\ 3: The Early History of Software, 1952--1968 \\ 4: From Mainframe to Minicomputer, 1959--1969 \\ 5: The ``Go-Go'' Years and the System/360, 1961--1975 \\ 6: The Chip and Its Impact, 1965--1975 \\ 7: The Personal Computer, 1972--1977 \\ 8: Augmenting Human Intellect, 1975--1985 \\ 9: Workstations, UNIX, and the Net, 1981--1995 \\ 10: ``Internet Time,'' 1995--2001 \\ Conclusion: The Digitization of the World Picture

entry:
@Book{Ceruzzi:2003:HMC,
  author =       "Paul E. Ceruzzi",
  title =        "A History of Modern Computing",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Second",
  pages =        "xi + 445",
  year =         "2003",
  ISBN =         "0-262-53203-4 (paperback)",
  ISBN-13 =      "978-0-262-53203-7 (paperback)",
  LCCN =         "QA76.17.C47 2003",
  bibdate =      "Sat Apr 27 15:03:11 MDT 2024",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/linux.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "History of computing",
  abstract =     "This book covers modern computing from the development
                 of the first electronic digital computer through the
                 dot-com crash. The author concentrates on five key
                 moments of transition: the transformation of the
                 computer in the late 1940s from a specialized
                 scientific instrument to a commercial product; the
                 emergence of small systems in the late 1960s; the
                 beginning of personal computing in the 1970s; the
                 spread of networking after 1985; and, in a chapter
                 written for this edition, the period 1995-2001. The new
                 material focuses on the Microsoft antitrust suit, the
                 rise and fall of the dot-coms, and the advent of open
                 source software, particularly Linux. Within the
                 chronological narrative, the book traces several
                 overlapping threads: the evolution of the computer's
                 internal design; the effect of economic trends and the
                 Cold War; the long-term role of IBM as a player and as
                 a target for upstart entrepreneurs; the growth of
                 software from a hidden element to a major character in
                 the story of computing; and the recurring issue of the
                 place of information and computing in a democratic
                 society. The focus is on the United States (though
                 Europe and Japan enter the story at crucial points), on
                 computing per se rather than on applications such as
                 artificial intelligence, and on systems that were sold
                 commercially and installed in quantities.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Introduction: Defining ``Computer'' \\
                 1: The Advent of Commercial Computing, 1945--1956 \\
                 2: Computing Comes of Age, 1956--1964 \\
                 3: The Early History of Software, 1952--1968 \\
                 4: From Mainframe to Minicomputer, 1959--1969 \\
                 5: The ``Go-Go'' Years and the System/360, 1961--1975
                 \\
                 6: The Chip and Its Impact, 1965--1975 \\
                 7: The Personal Computer, 1972--1977 \\
                 8: Augmenting Human Intellect, 1975--1985 \\
                 9: Workstations, UNIX, and the Net, 1981--1995 \\
                 10: ``Internet Time,'' 1995--2001 \\
                 Conclusion: The Digitization of the World Picture",
}


bibtype: article
filename: master.bib
label: Cesareo:1946:RI
author: O. Cesareo
title: The Relay Interpolator
journal: j-BELL-LABS-RECORD
volume: 23
pages: 457--460
year: 1946
CODEN: BLRCAB
ISSN: 0005-8564 OR 00058564
bibdate: Wed Oct 13 11:31:47 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2010.10.13 11:31:47 ???
note: Reprinted in cite [ 6.2]Randell:1982:ODC.
acknowledgement: ack-nhfb
rawauthor: O. Cesareo
rawnote: Reprinted in \cite[\S 6.2]{Randell:1982:ODC}.
rawtitle: The Relay Interpolator
entry:
@Article{Cesareo:1946:RI,
  author =       "O. Cesareo",
  title =        "The Relay Interpolator",
  journal =      j-BELL-LABS-RECORD,
  volume =       "23",
  number =       "??",
  pages =        "457--460",
  year =         "1946",
  CODEN =        "BLRCAB",
  ISSN =         "0005-8564",
  bibdate =      "Wed Oct 13 11:31:47 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in \cite[\S 6.2]{Randell:1982:ODC}.",
  acknowledgement = ack-nhfb,
}


bibtype: phdthesis
filename: master.bib
label: Cetron:1991:CRA
author: Edward J. Cetron
title: Complexity Reduction for Analysis and Visualization of Textured Electrostatic Fields
school: Department of Bioengineering, University of Utah
address: Salt Lake City, UT, USA
pages: xiii + 124
month: jun
monthnumber: 6
year: 1991
bibdate: Sat Apr 27 07:56:07 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.04.27 07:56:07 ???
acknowledgement: ack-nhfb
rawauthor: Edward J. Cetron
rawtitle: Complexity Reduction for Analysis and Visualization of Textured Electrostatic Fields
entry:
@PhdThesis{Cetron:1991:CRA,
  author =       "Edward J. Cetron",
  title =        "Complexity Reduction for Analysis and Visualization of
                 Textured Electrostatic Fields",
  school =       "Department of Bioengineering, University of Utah",
  address =      "Salt Lake City, UT, USA",
  pages =        "xiii + 124",
  month =        jun,
  year =         "1991",
  bibdate =      "Sat Apr 27 07:56:07 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Chabert:1999:HAH
title: A history of algorithms: from the pebble to the microchip
publisher: pub-SV
address: pub-SV:adr
pages: ix + 524
year: 1999
ISBN: 3-540-63369-3 (softcover) OR 3540633693 (softcover)
ISBN13: 978-3-540-63369-3 (softcover) OR 9783540633693 (softcover)
LCCN: QA58 .H5813 1998
bibdate: Mon Dec 31 17:29:07 MST 2007
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2007.12.31 17:29:07 MST
URL: http://www.springer.com/west/home/math/cse?SGWID=4-10045-22-1455224-0
subject: algorithms; history
acknowledgement: ack-nhfb
rawtitle: A history of algorithms: from the pebble to the microchip
editor:
Jean-Luc Chabert and Evelyne Barbin and Jacques Borowczyk and Michel Guillemot and Anne Michel-Pajus and Ahmed Djebbar and Jean-Claude Martzloff

remark:
Translated from the French original ``Histoire d'algorithmes. Du caillou a la puce'' (1994) by Chris Weeks.

TOC:
Introduction 1 1 Algorithms for Arithmetic Operations 7 1.1 Sumerian Division 8 1.2 A Babylonian Algorithm for Calculating Inverses 11 1.3 Egyptian Algorithms for Arithmetic 15 1.4 Tableau Multiplication 20 1.5 Optimising Calculations 28 1.6 Simple Division by Difference on a Counting Board 30 1.7 Division on the Chinese Abacus 35 1.8 Numbers Written as Decimals 37 1.9 Binary Arithmetic 40 1.10 Computer Arithmetic 43 Bibliography 46 2 Magic Squares 49 2.1 Squares with Borders 53 2.2 The Marking Cells Method 58 2.3 Proceeding by 2 and by 3 64 2.4 Arnauld's Borders Method 70 Bibliography 81 3 Methods of False Position 83 3.1 Mesopotamia: a Geometric False Position 86 3.2 Egypt: Problem 26 of the Rhind Papyrus 88 3.3 China: Chapter VII of the Jiuzhang Suanshu 91 3.4 India: Bhaskara and the Rule of Simple False Position 96 3.5 Qusta Ibn Luqa: A Geometric Justification 98 3.6 Ibn al-Banna: The Method of the Scales 101 3.7 Fibonacci: the Elchatayn rule 103 3.8 Pellos: The Rule of Three and The Method of Simple False Position 106 3.9 Clavius: Solving a System of Equations 107 Bibliography 111 4 Euclid's Algorithm 113 4.1 Euclid's Algorithm 113 4.2 Comparing Ratios 118 4.3 Bezout's Identity 122 4.4 Continued Fractions 126 4.5 The Number of Roots of an Equation 132 Bibliography 136 5 From Measuring the Circle to Calculating 139 Geometric Approaches 140 5.1 The Circumference of the Circle 140 5.2 The Area of the Circle in the Jiuzhang Suanshu 146 5.3 The Method of Isoperimeters 152 Analytic Approaches 156 5.4 Arithmetic Quadrature 156 5.5 Using Series 161 5.6 Epilogue 164 Bibliography 166 6 Newton's Methods 169 The Tangent Method 170 6.1 Straight Line Approximations 170 6.2 Recurrence Formulas 175 6.3 Initial Conditions 178 6.4 Measure of Convergence 183 6.5 Complex Roots 188 Newton's Polygon 191 6.6 The Ruler and Small Parallelograms 191 Bibliography 196 7 Solving Equations by Successive Approximations 199 Extraction of Square Roots 200 7.1 The Method of Heron of Alexandria 202 7.2 The Method of Theon of Alexandria 203 7.3 Mediaeval Binomial Algorithms 205 Numerical Solutions of Equations 208 7.4 Al-Tusi's Tables 208 7.5 Viete's Method 213 7.6 Kepler's Equation 219 7.7 Bernoulli's Method of Recurrent Series 223 7.8 Approximation by Continued Fractions 227 Horner like Transformations of Polynomial Equations 230 7.9 The Ruffini-Budan Schema 230 Bibliography 236 8 Algorithms in Arithmetic 239 Factors and Multiples 240 8.1 The Sieve of Eratosthenes 241 8.2 Criteria For Divisibility 243 8.3 Quadratic Residues 248 Tests for Primality 251 8.4 The Converse of Fermat's Theorem 252 8.5 The Lucas Test 256 8.6 Pepin's Test 260 Factorisation Algorithms 263 8.7 Factorisation by the Difference of Two Squares 264 8.8 Factorisation by Quadratic Residues 267 8.9 Factorisation by Continued Fractions 269 The Pell-Fermat Equation 272 8.10 The Arithmetica of Diophantus 273 8.11 The Lagrange Result 275 Bibliography 280 9 Solving Systems of Linear Equations 283 9.1 Cramer's Rule 284 9.2 The Method of Least Squares 287 9.3 The Gauss Pivot Method 291 9.4 A Gauss Iterative Method 296 9.5 Jacobi's Method 300 9.6 Seidel's Method 302 9.7 Nekrasov and the Rate of Convergence 306 9.8 Cholesky's Method 310 9.9 Epilogue 314 Bibliography 315 10 Tables and Interpolation 319 10.1 Ptolemy's Chord Tables 321 10.2 Briggs and Decimal Logarithms 328 10.3 The Gregory-Newton Formula 332 10.4 Newton's Interpolation Polynomial 336 10.5 The Lagrange Interpolation Polynomial 340 10.6 An Error Upper Bound 345 10.7 Neville's Algorithm 347 Bibliography 350 11 Approximate Quadratures 353 11.1 Gregory's Formula 354 11.2 Newton's Three-Eighths Rule 356 11.3 The Newton--Cotes Formulas 357 11.4 Stirling's Correction Formulas 359 11.5 Simpson's Rule 362 11.6 The Gauss Quadrature Formulas 363 11.7 Chebyshev's Choice 367 11.8 Epilogue 369 Bibliography 370 12 Approximate Solutions of Differential Equations 373 12.1 Euler's Method 374 12.2 The Existence of a Solution 378 12.3 Runge's Methods 381 12.4 Heun's Methods 388 12.5 Kutta's Methods 392 12.6 John Adams and the Use of Finite Differences 396 12.7 Epilogue 401 Bibliography 402 13 Approximation of Functions 405 Uniform Approximation 407 13.1 Taylor's Formula 407 13.2 The Lagrange Remainder 409 13.3 Chebyshev's Polynomial of Best Approximation 412 13.4 Spline-Fitting 418 Mean Quadratic Approximation 420 13.5 Fourier Series 422 13.6 The Fast Fourier Transform 424 Bibliography 427 14 Acceleration of Convergence 429 14.1 Stirling's Method for Series 430 14.2 The Euler--Maclaurin Summation Formula 434 14.3 The Euler Constant 439 14.4 Aitken's Method 443 14.5 Richardson's Extrapolation Method 447 14.6 Romberg's Integration Method 451 Bibliography 453 15 Towards the Concept of Algorithm 455 Recursive Functions and Computable Functions 458 15.1 The 1931 Definition 458 15.2 General Godel Recursive Functions 460 15.3 Alonzo Church and Effective Calculability 462 15.4 Recursive Functions in the Kleene Sense 466 Machines 468 15.5 The Turing Machine 468 15.6 Post's Machine 474 15.7 Conclusion 479 Bibliography 480 Biographies 481 General Index 517 Index of Names 521

raweditor:
Jean-Luc Chabert and {\'E}velyne Barbin and Jacques Borowczyk and Michel Guillemot and Anne Michel-Pajus and Ahmed Djebbar and Jean-Claude Martzloff

rawTOC:
Introduction 1 \\ 1 Algorithms for Arithmetic Operations 7 \\ 1.1 Sumerian Division 8 \\ 1.2 A Babylonian Algorithm for Calculating Inverses 11 \\ 1.3 Egyptian Algorithms for Arithmetic 15 \\ 1.4 Tableau Multiplication 20 \\ 1.5 Optimising Calculations 28 \\ 1.6 Simple Division by Difference on a Counting Board 30 \\ 1.7 Division on the Chinese Abacus 35 \\ 1.8 Numbers Written as Decimals 37 \\ 1.9 Binary Arithmetic 40 \\ 1.10 Computer Arithmetic 43 \\ Bibliography 46 \\ 2 Magic Squares 49 \\ 2.1 Squares with Borders 53 \\ 2.2 The Marking Cells Method 58 \\ 2.3 Proceeding by 2 and by 3 64 \\ 2.4 Arnauld's Borders Method 70 \\ Bibliography 81 \\ 3 Methods of False Position 83 \\ 3.1 Mesopotamia: a Geometric False Position 86 \\ 3.2 Egypt: Problem 26 of the Rhind Papyrus 88 \\ 3.3 China: Chapter VII of the Jiuzhang Suanshu 91 \\ 3.4 India: Bhaskara and the Rule of Simple False Position 96 \\ 3.5 Qusta Ibn Luqa: A Geometric Justification 98 \\ 3.6 Ibn al-Banna: The Method of the Scales 101 \\ 3.7 Fibonacci: the Elchatayn rule 103 \\ 3.8 Pellos: The Rule of Three and The Method of Simple False Position 106 \\ 3.9 Clavius: Solving a System of Equations 107 \\ Bibliography 111 \\ 4 Euclid's Algorithm 113 \\ 4.1 Euclid's Algorithm 113 \\ 4.2 Comparing Ratios 118 \\ 4.3 B{\'e}zout's Identity 122 \\ 4.4 Continued Fractions 126 \\ 4.5 The Number of Roots of an Equation 132 \\ Bibliography 136 \\ 5 From Measuring the Circle to Calculating 139 \\ Geometric Approaches 140 \\ 5.1 The Circumference of the Circle 140 \\ 5.2 The Area of the Circle in the Jiuzhang Suanshu 146 \\ 5.3 The Method of Isoperimeters 152 \\ Analytic Approaches 156 \\ 5.4 Arithmetic Quadrature 156 \\ 5.5 Using Series 161 \\ 5.6 Epilogue 164 \\ Bibliography 166 \\ 6 Newton's Methods 169 \\ The Tangent Method 170 \\ 6.1 Straight Line Approximations 170 \\ 6.2 Recurrence Formulas 175 \\ 6.3 Initial Conditions 178 \\ 6.4 Measure of Convergence 183 \\ 6.5 Complex Roots 188 \\ Newton's Polygon 191 \\ 6.6 The Ruler and Small Parallelograms 191 \\ Bibliography 196 \\ 7 Solving Equations by Successive Approximations 199 \\ Extraction of Square Roots 200 \\ 7.1 The Method of Heron of Alexandria 202 \\ 7.2 The Method of Theon of Alexandria 203 \\ 7.3 Mediaeval Binomial Algorithms 205 \\ Numerical Solutions of Equations 208 \\ 7.4 Al-Tusi's Tables 208 \\ 7.5 Vi{\`e}te's Method 213 \\ 7.6 Kepler's Equation 219 \\ 7.7 Bernoulli's Method of Recurrent Series 223 \\ 7.8 Approximation by Continued Fractions 227 \\ Horner like Transformations of Polynomial Equations 230 \\ 7.9 The Ruffini-Budan Schema 230 \\ Bibliography 236 \\ 8 Algorithms in Arithmetic 239 \\ Factors and Multiples 240 \\ 8.1 The Sieve of Eratosthenes 241 \\ 8.2 Criteria For Divisibility 243 \\ 8.3 Quadratic Residues 248 \\ Tests for Primality 251 \\ 8.4 The Converse of Fermat's Theorem 252 \\ 8.5 The Lucas Test 256 \\ 8.6 P{\'e}pin's Test 260 \\ Factorisation Algorithms 263 \\ 8.7 Factorisation by the Difference of Two Squares 264 \\ 8.8 Factorisation by Quadratic Residues 267 \\ 8.9 Factorisation by Continued Fractions 269 \\ The Pell-Fermat Equation 272 \\ 8.10 The Arithmetica of Diophantus 273 \\ 8.11 The Lagrange Result 275 \\ Bibliography 280 \\ 9 Solving Systems of Linear Equations 283 \\ 9.1 Cramer's Rule 284 \\ 9.2 The Method of Least Squares 287 \\ 9.3 The Gauss Pivot Method 291 \\ 9.4 A Gauss Iterative Method 296 \\ 9.5 Jacobi's Method 300 \\ 9.6 Seidel's Method 302 \\ 9.7 Nekrasov and the Rate of Convergence 306 \\ 9.8 Cholesky's Method 310 \\ 9.9 Epilogue 314 \\ Bibliography 315 \\ 10 Tables and Interpolation 319 \\ 10.1 Ptolemy's Chord Tables 321 \\ 10.2 Briggs and Decimal Logarithms 328 \\ 10.3 The Gregory-Newton Formula 332 \\ 10.4 Newton's Interpolation Polynomial 336 \\ 10.5 The Lagrange Interpolation Polynomial 340 \\ 10.6 An Error Upper Bound 345 \\ 10.7 Neville's Algorithm 347 \\ Bibliography 350 \\ 11 Approximate Quadratures 353 \\ 11.1 Gregory's Formula 354 \\ 11.2 Newton's Three-Eighths Rule 356 \\ 11.3 The Newton--Cotes Formulas 357 \\ 11.4 Stirling's Correction Formulas 359 \\ 11.5 Simpson's Rule 362 \\ 11.6 The Gauss Quadrature Formulas 363 \\ 11.7 Chebyshev's Choice 367 \\ 11.8 Epilogue 369 \\ Bibliography 370 \\ 12 Approximate Solutions of Differential Equations 373 \\ 12.1 Euler's Method 374 \\ 12.2 The Existence of a Solution 378 \\ 12.3 Runge's Methods 381 \\ 12.4 Heun's Methods 388 \\ 12.5 Kutta's Methods 392 \\ 12.6 John Adams and the Use of Finite Differences 396 \\ 12.7 Epilogue 401 \\ Bibliography 402 \\ 13 Approximation of Functions 405 \\ Uniform Approximation 407 \\ 13.1 Taylor's Formula 407 \\ 13.2 The Lagrange Remainder 409 \\ 13.3 Chebyshev's Polynomial of Best Approximation 412 \\ 13.4 Spline-Fitting 418 \\ Mean Quadratic Approximation 420 \\ 13.5 Fourier Series 422 \\ 13.6 The Fast Fourier Transform 424 \\ Bibliography 427 \\ 14 Acceleration of Convergence 429 \\ 14.1 Stirling's Method for Series 430 \\ 14.2 The Euler--Maclaurin Summation Formula 434 \\ 14.3 The Euler Constant 439 \\ 14.4 Aitken's Method 443 \\ 14.5 Richardson's Extrapolation Method 447 \\ 14.6 Romberg's Integration Method 451 \\ Bibliography 453 \\ 15 Towards the Concept of Algorithm 455 \\ Recursive Functions and Computable Functions 458 \\ 15.1 The 1931 Definition 458 \\ 15.2 General G{\"o}del Recursive Functions 460 \\ 15.3 Alonzo Church and Effective Calculability 462 \\ 15.4 Recursive Functions in the Kleene Sense 466 \\ Machines 468 \\ 15.5 The Turing Machine 468 \\ 15.6 Post's Machine 474 \\ 15.7 Conclusion 479 \\ Bibliography 480 \\ Biographies 481 \\ General Index 517 \\ Index of Names 521

entry:
@Book{Chabert:1999:HAH,
  editor =       "Jean-Luc Chabert and {\'E}velyne Barbin and Jacques
                 Borowczyk and Michel Guillemot and Anne Michel-Pajus
                 and Ahmed Djebbar and Jean-Claude Martzloff",
  title =        "A history of algorithms: from the pebble to the
                 microchip",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 524",
  year =         "1999",
  ISBN =         "3-540-63369-3 (softcover)",
  ISBN-13 =      "978-3-540-63369-3 (softcover)",
  LCCN =         "QA58 .H5813 1998",
  bibdate =      "Mon Dec 31 17:29:07 MST 2007",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.springer.com/west/home/math/cse?SGWID=4-10045-22-1455224-0",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  remark =       "Translated from the French original ``Histoire
                 d'algorithmes. Du caillou {\`a} la puce'' (1994) by
                 Chris Weeks.",
  subject =      "algorithms; history",
  tableofcontents = "Introduction 1 \\
                 1 Algorithms for Arithmetic Operations 7 \\
                 1.1 Sumerian Division 8 \\
                 1.2 A Babylonian Algorithm for Calculating Inverses 11
                 \\
                 1.3 Egyptian Algorithms for Arithmetic 15 \\
                 1.4 Tableau Multiplication 20 \\
                 1.5 Optimising Calculations 28 \\
                 1.6 Simple Division by Difference on a Counting Board
                 30 \\
                 1.7 Division on the Chinese Abacus 35 \\
                 1.8 Numbers Written as Decimals 37 \\
                 1.9 Binary Arithmetic 40 \\
                 1.10 Computer Arithmetic 43 \\
                 Bibliography 46 \\
                 2 Magic Squares 49 \\
                 2.1 Squares with Borders 53 \\
                 2.2 The Marking Cells Method 58 \\
                 2.3 Proceeding by 2 and by 3 64 \\
                 2.4 Arnauld's Borders Method 70 \\
                 Bibliography 81 \\
                 3 Methods of False Position 83 \\
                 3.1 Mesopotamia: a Geometric False Position 86 \\
                 3.2 Egypt: Problem 26 of the Rhind Papyrus 88 \\
                 3.3 China: Chapter VII of the Jiuzhang Suanshu 91 \\
                 3.4 India: Bhaskara and the Rule of Simple False
                 Position 96 \\
                 3.5 Qusta Ibn Luqa: A Geometric Justification 98 \\
                 3.6 Ibn al-Banna: The Method of the Scales 101 \\
                 3.7 Fibonacci: the Elchatayn rule 103 \\
                 3.8 Pellos: The Rule of Three and The Method of Simple
                 False Position 106 \\
                 3.9 Clavius: Solving a System of Equations 107 \\
                 Bibliography 111 \\
                 4 Euclid's Algorithm 113 \\
                 4.1 Euclid's Algorithm 113 \\
                 4.2 Comparing Ratios 118 \\
                 4.3 B{\'e}zout's Identity 122 \\
                 4.4 Continued Fractions 126 \\
                 4.5 The Number of Roots of an Equation 132 \\
                 Bibliography 136 \\
                 5 From Measuring the Circle to Calculating 139 \\
                 Geometric Approaches 140 \\
                 5.1 The Circumference of the Circle 140 \\
                 5.2 The Area of the Circle in the Jiuzhang Suanshu 146
                 \\
                 5.3 The Method of Isoperimeters 152 \\
                 Analytic Approaches 156 \\
                 5.4 Arithmetic Quadrature 156 \\
                 5.5 Using Series 161 \\
                 5.6 Epilogue 164 \\
                 Bibliography 166 \\
                 6 Newton's Methods 169 \\
                 The Tangent Method 170 \\
                 6.1 Straight Line Approximations 170 \\
                 6.2 Recurrence Formulas 175 \\
                 6.3 Initial Conditions 178 \\
                 6.4 Measure of Convergence 183 \\
                 6.5 Complex Roots 188 \\
                 Newton's Polygon 191 \\
                 6.6 The Ruler and Small Parallelograms 191 \\
                 Bibliography 196 \\
                 7 Solving Equations by Successive Approximations 199
                 \\
                 Extraction of Square Roots 200 \\
                 7.1 The Method of Heron of Alexandria 202 \\
                 7.2 The Method of Theon of Alexandria 203 \\
                 7.3 Mediaeval Binomial Algorithms 205 \\
                 Numerical Solutions of Equations 208 \\
                 7.4 Al-Tusi's Tables 208 \\
                 7.5 Vi{\`e}te's Method 213 \\
                 7.6 Kepler's Equation 219 \\
                 7.7 Bernoulli's Method of Recurrent Series 223 \\
                 7.8 Approximation by Continued Fractions 227 \\
                 Horner like Transformations of Polynomial Equations 230
                 \\
                 7.9 The Ruffini-Budan Schema 230 \\
                 Bibliography 236 \\
                 8 Algorithms in Arithmetic 239 \\
                 Factors and Multiples 240 \\
                 8.1 The Sieve of Eratosthenes 241 \\
                 8.2 Criteria For Divisibility 243 \\
                 8.3 Quadratic Residues 248 \\
                 Tests for Primality 251 \\
                 8.4 The Converse of Fermat's Theorem 252 \\
                 8.5 The Lucas Test 256 \\
                 8.6 P{\'e}pin's Test 260 \\
                 Factorisation Algorithms 263 \\
                 8.7 Factorisation by the Difference of Two Squares 264
                 \\
                 8.8 Factorisation by Quadratic Residues 267 \\
                 8.9 Factorisation by Continued Fractions 269 \\
                 The Pell-Fermat Equation 272 \\
                 8.10 The Arithmetica of Diophantus 273 \\
                 8.11 The Lagrange Result 275 \\
                 Bibliography 280 \\
                 9 Solving Systems of Linear Equations 283 \\
                 9.1 Cramer's Rule 284 \\
                 9.2 The Method of Least Squares 287 \\
                 9.3 The Gauss Pivot Method 291 \\
                 9.4 A Gauss Iterative Method 296 \\
                 9.5 Jacobi's Method 300 \\
                 9.6 Seidel's Method 302 \\
                 9.7 Nekrasov and the Rate of Convergence 306 \\
                 9.8 Cholesky's Method 310 \\
                 9.9 Epilogue 314 \\
                 Bibliography 315 \\
                 10 Tables and Interpolation 319 \\
                 10.1 Ptolemy's Chord Tables 321 \\
                 10.2 Briggs and Decimal Logarithms 328 \\
                 10.3 The Gregory-Newton Formula 332 \\
                 10.4 Newton's Interpolation Polynomial 336 \\
                 10.5 The Lagrange Interpolation Polynomial 340 \\
                 10.6 An Error Upper Bound 345 \\
                 10.7 Neville's Algorithm 347 \\
                 Bibliography 350 \\
                 11 Approximate Quadratures 353 \\
                 11.1 Gregory's Formula 354 \\
                 11.2 Newton's Three-Eighths Rule 356 \\
                 11.3 The Newton--Cotes Formulas 357 \\
                 11.4 Stirling's Correction Formulas 359 \\
                 11.5 Simpson's Rule 362 \\
                 11.6 The Gauss Quadrature Formulas 363 \\
                 11.7 Chebyshev's Choice 367 \\
                 11.8 Epilogue 369 \\
                 Bibliography 370 \\
                 12 Approximate Solutions of Differential Equations 373
                 \\
                 12.1 Euler's Method 374 \\
                 12.2 The Existence of a Solution 378 \\
                 12.3 Runge's Methods 381 \\
                 12.4 Heun's Methods 388 \\
                 12.5 Kutta's Methods 392 \\
                 12.6 John Adams and the Use of Finite Differences 396
                 \\
                 12.7 Epilogue 401 \\
                 Bibliography 402 \\
                 13 Approximation of Functions 405 \\
                 Uniform Approximation 407 \\
                 13.1 Taylor's Formula 407 \\
                 13.2 The Lagrange Remainder 409 \\
                 13.3 Chebyshev's Polynomial of Best Approximation 412
                 \\
                 13.4 Spline-Fitting 418 \\
                 Mean Quadratic Approximation 420 \\
                 13.5 Fourier Series 422 \\
                 13.6 The Fast Fourier Transform 424 \\
                 Bibliography 427 \\
                 14 Acceleration of Convergence 429 \\
                 14.1 Stirling's Method for Series 430 \\
                 14.2 The Euler--Maclaurin Summation Formula 434 \\
                 14.3 The Euler Constant 439 \\
                 14.4 Aitken's Method 443 \\
                 14.5 Richardson's Extrapolation Method 447 \\
                 14.6 Romberg's Integration Method 451 \\
                 Bibliography 453 \\
                 15 Towards the Concept of Algorithm 455 \\
                 Recursive Functions and Computable Functions 458 \\
                 15.1 The 1931 Definition 458 \\
                 15.2 General G{\"o}del Recursive Functions 460 \\
                 15.3 Alonzo Church and Effective Calculability 462 \\
                 15.4 Recursive Functions in the Kleene Sense 466 \\
                 Machines 468 \\
                 15.5 The Turing Machine 468 \\
                 15.6 Post's Machine 474 \\
                 15.7 Conclusion 479 \\
                 Bibliography 480 \\
                 Biographies 481 \\
                 General Index 517 \\
                 Index of Names 521",
}


bibtype: book
filename: master.bib
label: Chambers:CSF58-1
editor: James Pryde
title: Chambers's Seven-Figure Mathematical Tables
volume: 1
publisher: pub-W-R-CHAMBERS
address: pub-W-R-CHAMBERS:adr
pages: 392
year: 1958
LCCN: QA47 .P7 1958
bibdate: Tue May 12 07:43:03 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.05.12 07:43:03 ???
acknowledgement: ack-nhfb
raweditor: James Pryde
rawtitle: {Chambers}'s Seven-Figure Mathematical Tables
entry:
@Book{Chambers:CSF58-1,
  editor =       "James Pryde",
  title =        "{Chambers}'s Seven-Figure Mathematical Tables",
  volume =       "1",
  publisher =    pub-W-R-CHAMBERS,
  address =      pub-W-R-CHAMBERS:adr,
  pages =        "392",
  year =         "1958",
  LCCN =         "QA47 .P7 1958",
  bibdate =      "Tue May 12 07:43:03 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Chambers:CSF58-2
editor: James Pryde
title: Chambers's Seven-Figure Mathematical Tables
volume: 2
publisher: pub-W-R-CHAMBERS
address: pub-W-R-CHAMBERS:adr
pages: 392
year: 1958
LCCN: QA47 .P7 1958
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
raweditor: James Pryde
rawtitle: {Chambers}'s Seven-Figure Mathematical Tables
entry:
@Book{Chambers:CSF58-2,
  editor =       "James Pryde",
  title =        "{Chambers}'s Seven-Figure Mathematical Tables",
  volume =       "2",
  publisher =    pub-W-R-CHAMBERS,
  address =      pub-W-R-CHAMBERS:adr,
  year =         "1958",
  LCCN =         "QA47 .P7 1958",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Chan:1998:JCLb
author: Patrick Chan and Rosanna Lee
title: The Java Class Libraries: tt java.applet, tt java.awt, tt java.beans
volume: 2
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xxix + 1682
year: 1998
ISBN: 0-201-31003-1 OR 0201310031
ISBN13: 978-0-201-31003-0 OR 9780201310030
LCCN: QA76.73.J38C47 1998
bibdate: Mon Jun 10 13:33:36 2002
bibsource: http://www.aw.com/; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.06.10 13:33:36 ???
acknowledgement: ack-nhfb
annote: See cite Chan:1999:JCLb for vol. 1.
rawauthor: Patrick Chan and Rosanna Lee
rawtitle: The {Java} Class Libraries: {\tt java.applet}, {\tt java.awt}, {\tt java.beans}
URL:
http://cseng.aw.com/bookdetail.qry?ISBN=0-201-31003-1; http://www2.awl.com/cgi-bin/htsearch?restrict=&exclude=&config=htdig&method=boolean&format=builtin%2Dlong&words=Chan%20AND%20Lee&page=2

entry:
@Book{Chan:1998:JCLb,
  author =       "Patrick Chan and Rosanna Lee",
  title =        "The {Java} Class Libraries: {\tt java.applet}, {\tt
                 java.awt}, {\tt java.beans}",
  volume =       "2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxix + 1682",
  year =         "1998",
  ISBN =         "0-201-31003-1",
  ISBN-13 =      "978-0-201-31003-0",
  LCCN =         "QA76.73.J38C47 1998",
  bibdate =      "Mon Jun 10 13:33:36 2002",
  bibsource =    "http://www.aw.com/;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$54.95",
  URL =          "http://cseng.aw.com/bookdetail.qry?ISBN=0-201-31003-1;
                 http://www2.awl.com/cgi-bin/htsearch?restrict=&exclude=&config=htdig&method=boolean&format=builtin%2Dlong&words=Chan%20AND%20Lee&page=2",
  acknowledgement = ack-nhfb,
  annote =       "See \cite{Chan:1999:JCLb} for vol. 1.",
}


bibtype: book
filename: master.bib
label: Chan:1999:JCLb
author: Patrick Chan and Rosanna Lee and Doug Kramer
volume: 1
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xxvi + 2050
year: 1999
ISBN: 0-201-31002-3 OR 0201310023
ISBN13: 978-0-201-31002-3 OR 9780201310023
LCCN: QA76.73.J38 C47 1998
bibdate: Mon Jun 10 13:32:26 2002
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2002.06.10 13:32:26 ???
acknowledgement: ack-nhfb
annote: See cite Chan:1998:JCLb for vol. 2.
rawauthor: Patrick Chan and Rosanna Lee and Doug Kramer
title:
The Java Class Libraries: tt java.io, tt java.lang, tt java.math, tt java.net, tt java.text, tt java.util

abstract:
This book is intended as a reference rather than a tutorial. Its format is similar to a dictionary's in that it is designed to optimize the time it takes for you to look up information on a class or class member.

rawabstract:
This book is intended as a reference rather than a tutorial. Its format is similar to a dictionary's in that it is designed to optimize the time it takes for you to look up information on a class or class member.

rawtitle:
The {Java} Class Libraries: {\tt java.io}, {\tt java.lang}, {\tt java.math}, {\tt java.net}, {\tt java.text}, {\tt java.util}

entry:
@Book{Chan:1999:JCLb,
  author =       "Patrick Chan and Rosanna Lee and Doug Kramer",
  title =        "The {Java} Class Libraries: {\tt java.io}, {\tt
                 java.lang}, {\tt java.math}, {\tt java.net}, {\tt
                 java.text}, {\tt java.util}",
  volume =       "1",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xxvi + 2050",
  year =         "1999",
  ISBN =         "0-201-31002-3",
  ISBN-13 =      "978-0-201-31002-3",
  LCCN =         "QA76.73.J38 C47 1998",
  bibdate =      "Mon Jun 10 13:32:26 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$59.99",
  abstract =     "This book is intended as a reference rather than a
                 tutorial. Its format is similar to a dictionary's in
                 that it is designed to optimize the time it takes for
                 you to look up information on a class or class
                 member.",
  acknowledgement = ack-nhfb,
  annote =       "See \cite{Chan:1998:JCLb} for vol. 2.",
}


bibtype: book
filename: master.bib
label: Chan:1999:JCLc
author: Patrick Chan and Rosanna Lee and Douglas Kramer
publisher: pub-AW
address: pub-AW:adr
pages: xxix + 1157
year: 1999
ISBN: 0-201-48552-4 OR 0201485524
ISBN13: 978-0-201-48552-3 OR 9780201485523
LCCN: QA76.73.J38 C47 1998
bibdate: Sat May 11 09:29:34 2002
bibtimestamp: 2002.05.11 09:29:34 ???
acknowledgement: ack-nhfb
rawauthor: Patrick Chan and Rosanna Lee and Douglas Kramer
title:
The Java Class Libraries, Second Edition, Volume 1: Supplement for Java 2 Platform, Standard Edition, v1.2

bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; http://www1.fatbrain.com/asp/bookinfo/bookinfo.asp?theisbn=0201485524

rawtitle:
The {Java} Class Libraries, Second Edition, Volume 1: Supplement for {Java 2} Platform, Standard Edition, v1.2

entry:
@Book{Chan:1999:JCLc,
  author =       "Patrick Chan and Rosanna Lee and Douglas Kramer",
  title =        "The {Java} Class Libraries, Second Edition, Volume 1:
                 Supplement for {Java 2} Platform, Standard Edition,
                 v1.2",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxix + 1157",
  year =         "1999",
  ISBN =         "0-201-48552-4",
  ISBN-13 =      "978-0-201-48552-3",
  LCCN =         "QA76.73.J38 C47 1998",
  bibdate =      "Sat May 11 09:29:34 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www1.fatbrain.com/asp/bookinfo/bookinfo.asp?theisbn=0201485524",
  price =        "US\$34.95",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Chanda:2018:NPR
author: Abhishek Chanda
publisher: pub-PACKT
address: pub-PACKT:adr
pages: iii + 265
year: 2018
ISBN: 1-78862-171-9 (e-book), 1-78862-489-0 (paperback) OR 1788621719 (ebook), 1788624890 (paperback)
LCCN: QA76.73.R88
bibdate: Tue Dec 10 06:07:22 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.12.10 06:07:22 MST
URL: http://proquest.safaribooksonline.com/?fpi=9781788624893
acknowledgement: ack-nhfb
rawauthor: Abhishek Chanda
title:
Network Programming Rust: Build Fast and Resilient Network Servers and Clients by Leveraging Rust's Memory-safety and Concurrency Features

ISBN13:
978-1-78862-171-7 (e-book), 978-1-78862-489-3 (paperback) OR 9781788621717 (ebook), 9781788624893 (paperback)

subject:
Rust (Computer program language); Programming languages (Electronic computers); Computer programming; Computer programming.; Programming languages (Electronic computers); Rust (Computer program language)

TOC:
Preface 1: Introduction to Client/Server Networking A brief history of networks Layering in networks Addressing in networks How IP routing works How DNS works Common service models Connection-oriented service Connectionless service The network programming interface in Linux Summary 2: Introduction to Rust and its Ecosystem The Rust ecosystem Getting started with Rust Introduction to the borrow checker Generics and the trait system Error handling The macro system Syntactic macros Procedural macros Functional features in Rust Higher-order functions Iterators Concurrency primitives Testing Summary 3: TCP and UDP Using Rust A Simple TCP server and client A Simple UDP server and client UDP multicasting Miscellaneous utilities in std::net Some related crates Summary 4: Data Serialization, Deserialization, and Parsing Serialization and deserialization using Serde Custom serialization and deserialization Parsing textual data Parsing binary data Summary 5: Application Layer Protocols Introduction to RPC Introduction to SMTP Introduction to FTP and TFTP Summary 6: Talking HTTP in the Internet Introducing Hyper Introducing Rocket Introducing reqwest Summary 7: Asynchronous Network Programming Using Tokio Looking into the Future Working with streams and sinks Heading to tokio Socket multiplexing in tokio Writing streaming protocols The larger tokio ecosystem Conclusion 8: Security Securing the web Letsencrypt using Rust OpenSSL using Rust Securing tokio applications Cryptography using ring Summary 9: Appendix Introduction to coroutines and generators How May handles coroutines Awaiting the future Data parallelism Parsing using Pest Miscellaneous utilities Summary Other Books You May Enjoy Index

rawtitle:
Network Programming {Rust}: Build Fast and Resilient Network Servers and Clients by Leveraging {Rust}'s Memory-safety and Concurrency Features

rawTOC:
Preface \\ 1: Introduction to Client/Server Networking \\ A brief history of networks \\ Layering in networks \\ Addressing in networks \\ How IP routing works \\ How DNS works \\ Common service models \\ Connection-oriented service \\ Connectionless service \\ The network programming interface in Linux \\ Summary \\ 2: Introduction to Rust and its Ecosystem \\ The Rust ecosystem \\ Getting started with Rust \\ Introduction to the borrow checker \\ Generics and the trait system \\ Error handling \\ The macro system \\ Syntactic macros \\ Procedural macros \\ Functional features in Rust \\ Higher-order functions \\ Iterators \\ Concurrency primitives \\ Testing \\ Summary \\ 3: TCP and UDP Using Rust \\ A Simple TCP server and client \\ A Simple UDP server and client \\ UDP multicasting \\ Miscellaneous utilities in std::net \\ Some related crates \\ Summary \\ 4: Data Serialization, Deserialization, and Parsing \\ Serialization and deserialization using Serde \\ Custom serialization and deserialization \\ Parsing textual data \\ Parsing binary data \\ Summary \\ 5: Application Layer Protocols \\ Introduction to RPC \\ Introduction to SMTP \\ Introduction to FTP and TFTP \\ Summary \\ 6: Talking HTTP in the Internet \\ Introducing Hyper \\ Introducing Rocket \\ Introducing reqwest \\ Summary \\ 7: Asynchronous Network Programming Using Tokio \\ Looking into the Future \\ Working with streams and sinks \\ Heading to tokio \\ Socket multiplexing in tokio \\ Writing streaming protocols \\ The larger tokio ecosystem \\ Conclusion \\ 8: Security \\ Securing the web \\ Letsencrypt using Rust \\ OpenSSL using Rust \\ Securing tokio applications \\ Cryptography using ring \\ Summary \\ 9: Appendix \\ Introduction to coroutines and generators \\ How May handles coroutines \\ Awaiting the future \\ Data parallelism \\ Parsing using Pest \\ Miscellaneous utilities \\ Summary \\ Other Books You May Enjoy \\ Index

entry:
@Book{Chanda:2018:NPR,
  author =       "Abhishek Chanda",
  title =        "Network Programming {Rust}: Build Fast and Resilient
                 Network Servers and Clients by Leveraging {Rust}'s
                 Memory-safety and Concurrency Features",
  publisher =    pub-PACKT,
  address =      pub-PACKT:adr,
  pages =        "iii + 265",
  year =         "2018",
  ISBN =         "1-78862-171-9 (e-book), 1-78862-489-0 (paperback)",
  ISBN-13 =      "978-1-78862-171-7 (e-book), 978-1-78862-489-3
                 (paperback)",
  LCCN =         "QA76.73.R88",
  bibdate =      "Tue Dec 10 06:07:22 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  URL =          "http://proquest.safaribooksonline.com/?fpi=9781788624893",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Rust (Computer program language); Programming
                 languages (Electronic computers); Computer programming;
                 Computer programming.; Programming languages
                 (Electronic computers); Rust (Computer program
                 language)",
  tableofcontents = "Preface \\
                 1: Introduction to Client/Server Networking \\
                 A brief history of networks \\
                 Layering in networks \\
                 Addressing in networks \\
                 How IP routing works \\
                 How DNS works \\
                 Common service models \\
                 Connection-oriented service \\
                 Connectionless service \\
                 The network programming interface in Linux \\
                 Summary \\
                 2: Introduction to Rust and its Ecosystem \\
                 The Rust ecosystem \\
                 Getting started with Rust \\
                 Introduction to the borrow checker \\
                 Generics and the trait system \\
                 Error handling \\
                 The macro system \\
                 Syntactic macros \\
                 Procedural macros \\
                 Functional features in Rust \\
                 Higher-order functions \\
                 Iterators \\
                 Concurrency primitives \\
                 Testing \\
                 Summary \\
                 3: TCP and UDP Using Rust \\
                 A Simple TCP server and client \\
                 A Simple UDP server and client \\
                 UDP multicasting \\
                 Miscellaneous utilities in std::net \\
                 Some related crates \\
                 Summary \\
                 4: Data Serialization, Deserialization, and Parsing \\
                 Serialization and deserialization using Serde \\
                 Custom serialization and deserialization \\
                 Parsing textual data \\
                 Parsing binary data \\
                 Summary \\
                 5: Application Layer Protocols \\
                 Introduction to RPC \\
                 Introduction to SMTP \\
                 Introduction to FTP and TFTP \\
                 Summary \\
                 6: Talking HTTP in the Internet \\
                 Introducing Hyper \\
                 Introducing Rocket \\
                 Introducing reqwest \\
                 Summary \\
                 7: Asynchronous Network Programming Using Tokio \\
                 Looking into the Future \\
                 Working with streams and sinks \\
                 Heading to tokio \\
                 Socket multiplexing in tokio \\
                 Writing streaming protocols \\
                 The larger tokio ecosystem \\
                 Conclusion \\
                 8: Security \\
                 Securing the web \\
                 Letsencrypt using Rust \\
                 OpenSSL using Rust \\
                 Securing tokio applications \\
                 Cryptography using ring \\
                 Summary \\
                 9: Appendix \\
                 Introduction to coroutines and generators \\
                 How May handles coroutines \\
                 Awaiting the future \\
                 Data parallelism \\
                 Parsing using Pest \\
                 Miscellaneous utilities \\
                 Summary \\
                 Other Books You May Enjoy \\
                 Index",
}


bibtype: book
filename: master.bib
label: Char:1989:FLM
author: Bruce W. Char and others
title: First leaves for the Macintosh: a tutorial introduction to Maple
publisher: pub-BROOKS-COLE
address: pub-BROOKS-COLE:adr
pages: xv + 140
year: 1989
ISBN: 0-534-10222-0 OR 0534102220
ISBN13: 978-0-534-10222-7 OR 9780534102227
LCCN: QA155.7.E4 F57 1989
bibdate: Wed Nov 01 08:21:24 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.11.01 08:21:24 ???
acknowledgement: ack-nhfb
rawauthor: Bruce W. Char and others
rawtitle: First leaves for the Macintosh: a tutorial introduction to Maple
entry:
@Book{Char:1989:FLM,
  author =       "Bruce W. Char and others",
  title =        "First leaves for the Macintosh: a tutorial
                 introduction to Maple",
  publisher =    pub-BROOKS-COLE,
  address =      pub-BROOKS-COLE:adr,
  pages =        "xv + 140",
  year =         "1989",
  ISBN =         "0-534-10222-0",
  ISBN-13 =      "978-0-534-10222-7",
  LCCN =         "QA155.7.E4 F57 1989",
  bibdate =      "Wed Nov 01 08:21:24 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
}


bibtype: book
filename: master.bib
label: Char:1991:MLVb
title: Maple Library V Reference Manual
publisher: pub-SV
address: pub-SV:adr
pages: xxv + 698
year: 1991
DOI: https://doi.org/10.1007/978-1-4757-2133-1
ISBN: 0-387-97592-6, 3-540-97592-6 OR 0387975926, 3540975926
ISBN13: 978-0-387-97592-4, 978-3-540-97592-2 OR 9780387975924, 9783540975922
LCCN: QA155.7.E4 M353 1991
bibdate: Fri Jul 08 19:01:01 1994
bibtimestamp: 1994.07.08 19:01:01 ???
acknowledgement: ack-nhfb
rawtitle: {Maple Library V} Reference Manual
author:
Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet and Benton Leong and Michael B. Monagan and Stephen M. Watt

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

abstract:
The design and implementation of the Maple system is an on-going project of the Symbolic Computation Group at the University of Waterloo in Ontario, Canada. This manual corresponds with version V (roman numeral five) of the Maple system. The on-line help subsystem can be invoked from within a Maple session to view documentation on specific topics. In particular, the command ``?updates'' points the user to documentation updates for each new version of Maple. The Maple project was first conceived in the autumn of 1980, growing out of discussions on the state of symbolic computation at the University of Waterloo. The authors wish to acknowledge many fruitful discussions with colleagues at the University of Waterloo, particularly Morven Gentleman, Michael Malcolm, and Frank Tompa. It was recognized in these discussions that none of the locally-available systems for symbolic computation provided the facilities that should be expected for symbolic computation in modern computing environments. We concluded that since the basic design decisions for the then-current symbolic systems such as ALTRAN, CAMAL, REDUCE, and MACSYMA were based on 1960's computing technology, it would be wise to design a new system ``from scratch''. Thus we could take advantage of the software engineering technology which had become available in recent years, as well as drawing from the lessons of experience. Maple's basic features (elementary data structures, Input / output, arithmetic with numbers, and elementary simplification) are coded in a systems programming language for efficiency.

TOC:
The Maple Library Main routines Packages Packages for discrete mathematics Packages for applied mathematics Packages for geometry Miscellaneous packages

rawabstract:
The design and implementation of the Maple system is an on-going project of the Symbolic Computation Group at the University of Waterloo in Ontario, Canada. This manual corresponds with version V (roman numeral five) of the Maple system. The on-line help subsystem can be invoked from within a Maple session to view documentation on specific topics. In particular, the command ``?updates'' points the user to documentation updates for each new version of Maple. The Maple project was first conceived in the autumn of 1980, growing out of discussions on the state of symbolic computation at the University of Waterloo. The authors wish to acknowledge many fruitful discussions with colleagues at the University of Waterloo, particularly Morven Gentleman, Michael Malcolm, and Frank Tompa. It was recognized in these discussions that none of the locally-available systems for symbolic computation provided the facilities that should be expected for symbolic computation in modern computing environments. We concluded that since the basic design decisions for the then-current symbolic systems such as ALTRAN, CAMAL, REDUCE, and MACSYMA were based on 1960's computing technology, it would be wise to design a new system ``from scratch''. Thus we could take advantage of the software engineering technology which had become available in recent years, as well as drawing from the lessons of experience. Maple's basic features (elementary data structures, Input\slash output, arithmetic with numbers, and elementary simplification) are coded in a systems programming language for efficiency.

rawauthor:
Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet and Benton Leong and Michael B. Monagan and Stephen M. Watt

rawTOC:
The Maple Library \\ Main routines \\ Packages \\ Packages for discrete mathematics \\ Packages for applied mathematics \\ Packages for geometry \\ Miscellaneous packages

entry:
@Book{Char:1991:MLVb,
  author =       "Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet
                 and Benton Leong and Michael B. Monagan and Stephen M.
                 Watt",
  title =        "{Maple Library V} Reference Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxv + 698",
  year =         "1991",
  DOI =          "https://doi.org/10.1007/978-1-4757-2133-1",
  ISBN =         "0-387-97592-6, 3-540-97592-6",
  ISBN-13 =      "978-0-387-97592-4, 978-3-540-97592-2",
  LCCN =         "QA155.7.E4 M353 1991",
  bibdate =      "Fri Jul 08 19:01:01 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  abstract =     "The design and implementation of the Maple system is
                 an on-going project of the Symbolic Computation Group
                 at the University of Waterloo in Ontario, Canada. This
                 manual corresponds with version V (roman numeral five)
                 of the Maple system. The on-line help subsystem can be
                 invoked from within a Maple session to view
                 documentation on specific topics. In particular, the
                 command ``?updates'' points the user to documentation
                 updates for each new version of Maple. The Maple
                 project was first conceived in the autumn of 1980,
                 growing out of discussions on the state of symbolic
                 computation at the University of Waterloo. The authors
                 wish to acknowledge many fruitful discussions with
                 colleagues at the University of Waterloo, particularly
                 Morven Gentleman, Michael Malcolm, and Frank Tompa. It
                 was recognized in these discussions that none of the
                 locally-available systems for symbolic computation
                 provided the facilities that should be expected for
                 symbolic computation in modern computing environments.
                 We concluded that since the basic design decisions for
                 the then-current symbolic systems such as ALTRAN,
                 CAMAL, REDUCE, and MACSYMA were based on 1960's
                 computing technology, it would be wise to design a new
                 system ``from scratch''. Thus we could take advantage
                 of the software engineering technology which had become
                 available in recent years, as well as drawing from the
                 lessons of experience. Maple's basic features
                 (elementary data structures, Input\slash output,
                 arithmetic with numbers, and elementary simplification)
                 are coded in a systems programming language for
                 efficiency.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The Maple Library \\
                 Main routines \\
                 Packages \\
                 Packages for discrete mathematics \\
                 Packages for applied mathematics \\
                 Packages for geometry \\
                 Miscellaneous packages",
}


bibtype: book
filename: master.bib
label: Char:1991:MVLa
title: Maple V: Language Reference Manual
publisher: pub-SV
address: pub-SV:adr
pages: xv + 267
year: 1991
DOI: https://doi.org/10.1007/978-1-4615-7386-9
ISBN: 0-387-97622-1 (New York), 3-540-97622-1 (Berlin) OR 0387976221 (New York), 3540976221 (Berlin)
LCCN: QA155.7.E4 M36 1991
bibdate: Wed Dec 1 12:17:05 1993
bibtimestamp: 1993.12.01 12:17:05 ???
acknowledgement: ack-nhfb
rawtitle: {Maple V}: Language Reference Manual
author:
Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet and Benton Leong and Michael B. Monagan and Stephen M. Watt

ISBN13:
978-0-387-97622-8 (New York), 978-3-540-97622-6 (Berlin) OR 9780387976228 (New York), 9783540976226 (Berlin)

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

abstract:
This book describes the Maple Symbolic Computation System and the Maple V language. It describes the numeric and symbolic expressions that can be used in Maple V. All the basic data types, such as names, polynomials, and functions, as well as structured data types, are covered. The book also gives a complete description of the programming language statements that are provided in the Maple V system and shows how a user can extend the functionality of the Maple V system by adding user-defined routines. The manual also provides a complete description of the Maple V system, including its 2D and 3D graphics. Maple V features a newly designed user interface on many systems. Separate appendices describe how to use Maple V on systems using the X Window System, DOS, and the Macintosh.

TOC:
1 Introduction 1.1 Some General Examples 1.2 Numbers 1.3 Examples from Calculus 1.4 Data Structures 1.5 Examples from Linear Algebra 1.6 Equation Solving 1.7 Output and Programming 2 Language Elements 2.1 Character Set 2.2 Tokens 2.3 Escape Characters 2.4 Blanks, Lines, Comments, and Continuation 2.5 Files 3 Statements and Expressions 3.1 Types of Statements 3.2 Expressions 3.3 Formal Syntax 4 Data Types 4.1 Basic Data Types 4.2 Map, Subs, and Subsop 5 Type Testing 5.1 Definition of a Type in Maple 5.2 Simple Types 5.3 Structured Types 5.4 Surface and Nested Types 5.5 Simplification of Types 5.6 Parameter Type Testing 5.7 Undesirable Simplifications and Evaluations of Types 5.8 Type Testing Versus Pattern Matching 6 Arrays and Tables 6.1 Overview 6.2 Creating Tables 6.3 Evaluation Rules for Tables and Table Components 6.4 Tables as Objects 6.5 Indexing Functions 7 Procedures 7.1 Procedure Definitions 7.2 Parameter Passing 7.3 Local Variables 7.4 Options 7.5 Remember Tables 7.6 Assigning Values to Parameters 7.7 Error Returns and Explicit Returns 7.8 Simplification and Returning Unevaluated 7.9 Boolean Procedures 7.10 Reading and Saving Procedures 8 Operators 8.1 Operator Definition 8.2 Syntactic Definition 8.3 Semantic Definition 8.3.1 Application Versus Composition 8.4 Partial Definition of Operators 8.5 Example: The Differentiation Operator D 9 Internal Representation and Manipulation 9.1 Internal Organization 9.2 Internal Representation of Data Types 9.3 The Use of Hashing in Maple 9.4 Portability of the Maple System 10 Plotting 10.1 Introduction 10.2 Plots in 2D 10.3 Plots in 3D 10.4 Saving Plots 10.5 Plots Package 10.6 Examples 11 Miscellaneous Facilities 11.1 Debugging Facilities: Detecting Syntax Errors 11.2 Debugging Facilities: Monitoring Run-Time Execution 11.3 Alias and Macro 11.4 Monitoring Space and Time 11.5 Global Variables 11.6 User Interface Variables 11.7 Maple Command Line Options 11.8 Other Facilities 12 Overview of the Maple Library 12.1 Introduction 12.2 Description of the Maple Library 12.3 Format of Library Function Descriptions 12.4 Printing Maple Help Files 12.5 Library Index A Maple under UNIX A.1 Introduction A.2 Maple Initialization Files A.3 Quit and Interrupt Characters A.4 Temporarily Escaping from Maple A.5 Redirection of Input and Output A.6 Maple Command Line Options for UNIX A.6.1 Overview of Maple command line options A.6.2 Library Specification Option: -b A.6.3 Suppress Initialization Option: -s A.6.4 Quiet Option: -q A.7 Mint A.8 Summary of Site- and UNIX- Dependent Aspects of Maple B Using Maple with X B.1 Introduction B.2 Getting Started B.3 Entering Commands in Maple B.4 Editing B.5 Maple Input and Output Cells B.6 Including and Saving Text B.7 Searching B.8 Resource Usage B.9 Interrupt, Pause and Quit Buttons B.10 Resizing Windows B.11 Help Windows B.12 2D Plot Windows B.13 3D Plot Windows B.14 Customizing Maple Under X B.15 Tips B.16 Troubleshooting B.17 Information for Xperts C Maple under DOS C.1 Introduction C.2 Using Maple V C.2.1 Exiting Maple C.2.2 The Status Line C.2.3 The Command Line Editor C.2.4 Expression Editing C.2.5 File Editing C.2.6 Accessing Maple Help C.2.7 Session Review Mode C.2.8 Using the Menu C.2.9 Input/Output Capture Mode C.3 Manipulating Graphical Output C.3.1 Three Dimensional Graphics Display Driver C.3.2 Two Dimensional Graphics Display Driver C.3.3 Printing and Saving Graphic Output C.3.4 Using Maple Plots in Other Programs

rawabstract:
This book describes the Maple Symbolic Computation System and the Maple V language. It describes the numeric and symbolic expressions that can be used in Maple V. All the basic data types, such as names, polynomials, and functions, as well as structured data types, are covered. The book also gives a complete description of the programming language statements that are provided in the Maple V system and shows how a user can extend the functionality of the Maple V system by adding user-defined routines. The manual also provides a complete description of the Maple V system, including its 2D and 3D graphics. Maple V features a newly designed user interface on many systems. Separate appendices describe how to use Maple V on systems using the X Window System, DOS, and the Macintosh.

shortTOC:
Language elements Statements and expressions Data types Type testing Arrays and tables Procedures Operators Internal representation and manipulation Plotting Miscellaneous facilities Overview of the Maple Library A. Maple under UNIX B. Using Maple with X C. Maple under DOS

rawshortTOC:
Language elements \\ Statements and expressions \\ Data types \\ Type testing \\ Arrays and tables \\ Procedures \\ Operators \\ Internal representation and manipulation \\ Plotting \\ Miscellaneous facilities \\ Overview of the Maple Library \\ A. Maple under UNIX \\ B. Using Maple with X \\ C. Maple under DOS

rawTOC:
1 Introduction \\ 1.1 Some General Examples \\ 1.2 Numbers \\ 1.3 Examples from Calculus \\ 1.4 Data Structures \\ 1.5 Examples from Linear Algebra \\ 1.6 Equation Solving \\ 1.7 Output and Programming \\ 2 Language Elements \\ 2.1 Character Set \\ 2.2 Tokens \\ 2.3 Escape Characters \\ 2.4 Blanks, Lines, Comments, and Continuation \\ 2.5 Files \\ 3 Statements and Expressions \\ 3.1 Types of Statements \\ 3.2 Expressions \\ 3.3 Formal Syntax \\ 4 Data Types \\ 4.1 Basic Data Types \\ 4.2 Map, Subs, and Subsop \\ 5 Type Testing \\ 5.1 Definition of a Type in Maple \\ 5.2 Simple Types \\ 5.3 Structured Types \\ 5.4 Surface and Nested Types \\ 5.5 Simplification of Types \\ 5.6 Parameter Type Testing \\ 5.7 Undesirable Simplifications and Evaluations of Types \\ 5.8 Type Testing Versus Pattern Matching \\ 6 Arrays and Tables \\ 6.1 Overview \\ 6.2 Creating Tables \\ 6.3 Evaluation Rules for Tables and Table Components \\ 6.4 Tables as Objects \\ 6.5 Indexing Functions \\ 7 Procedures \\ 7.1 Procedure Definitions \\ 7.2 Parameter Passing \\ 7.3 Local Variables \\ 7.4 Options \\ 7.5 Remember Tables \\ 7.6 Assigning Values to Parameters \\ 7.7 Error Returns and Explicit Returns \\ 7.8 Simplification and Returning Unevaluated \\ 7.9 Boolean Procedures \\ 7.10 Reading and Saving Procedures \\ 8 Operators \\ 8.1 Operator Definition \\ 8.2 Syntactic Definition \\ 8.3 Semantic Definition \\ 8.3.1 Application Versus Composition \\ 8.4 Partial Definition of Operators \\ 8.5 Example: The Differentiation Operator D \\ 9 Internal Representation and Manipulation \\ 9.1 Internal Organization \\ 9.2 Internal Representation of Data Types \\ 9.3 The Use of Hashing in Maple \\ 9.4 Portability of the Maple System \\ 10 Plotting \\ 10.1 Introduction \\ 10.2 Plots in 2D \\ 10.3 Plots in 3D \\ 10.4 Saving Plots \\ 10.5 Plots Package \\ 10.6 Examples \\ 11 Miscellaneous Facilities \\ 11.1 Debugging Facilities: Detecting Syntax Errors \\ 11.2 Debugging Facilities: Monitoring Run-Time Execution \\ 11.3 Alias and Macro \\ 11.4 Monitoring Space and Time \\ 11.5 Global Variables \\ 11.6 User Interface Variables \\ 11.7 Maple Command Line Options \\ 11.8 Other Facilities \\ 12 Overview of the Maple Library \\ 12.1 Introduction \\ 12.2 Description of the Maple Library \\ 12.3 Format of Library Function Descriptions \\ 12.4 Printing Maple Help Files \\ 12.5 Library Index \\ A Maple under UNIX \\ A.1 Introduction \\ A.2 Maple Initialization Files \\ A.3 Quit and Interrupt Characters \\ A.4 Temporarily Escaping from Maple \\ A.5 Redirection of Input and Output \\ A.6 Maple Command Line Options for UNIX \\ A.6.1 Overview of Maple command line options \\ A.6.2 Library Specification Option: -b \\ A.6.3 Suppress Initialization Option: -s \\ A.6.4 Quiet Option: -q \\ A.7 Mint \\ A.8 Summary of Site- and UNIX- Dependent Aspects of Maple \\ B Using Maple with X \\ B.1 Introduction \\ B.2 Getting Started \\ B.3 Entering Commands in Maple \\ B.4 Editing \\ B.5 Maple Input and Output Cells \\ B.6 Including and Saving Text \\ B.7 Searching \\ B.8 Resource Usage \\ B.9 Interrupt, Pause and Quit Buttons \\ B.10 Resizing Windows \\ B.11 Help Windows \\ B.12 2D Plot Windows \\ B.13 3D Plot Windows \\ B.14 Customizing Maple Under X \\ B.15 Tips \\ B.16 Troubleshooting \\ B.17 Information for Xperts \\ C Maple under DOS \\ C.1 Introduction \\ C.2 Using Maple V \\ C.2.1 Exiting Maple \\ C.2.2 The Status Line \\ C.2.3 The Command Line Editor \\ C.2.4 Expression Editing \\ C.2.5 File Editing \\ C.2.6 Accessing Maple Help \\ C.2.7 Session Review Mode \\ C.2.8 Using the Menu \\ C.2.9 Input/Output Capture Mode \\ C.3 Manipulating Graphical Output \\ C.3.1 Three Dimensional Graphics Display Driver \\ C.3.2 Two Dimensional Graphics Display Driver \\ C.3.3 Printing and Saving Graphic Output \\ C.3.4 Using Maple Plots in Other Programs

entry:
@Book{Char:1991:MVLa,
  author =       "Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet
                 and Benton Leong and Michael B. Monagan and Stephen M.
                 Watt",
  title =        "{Maple V}: Language Reference Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 267",
  year =         "1991",
  DOI =          "https://doi.org/10.1007/978-1-4615-7386-9",
  ISBN =         "0-387-97622-1 (New York), 3-540-97622-1 (Berlin)",
  ISBN-13 =      "978-0-387-97622-8 (New York), 978-3-540-97622-6
                 (Berlin)",
  LCCN =         "QA155.7.E4 M36 1991",
  bibdate =      "Wed Dec 1 12:17:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$24.95, FF 193,00",
  abstract =     "This book describes the Maple Symbolic Computation
                 System and the Maple V language. It describes the
                 numeric and symbolic expressions that can be used in
                 Maple V. All the basic data types, such as names,
                 polynomials, and functions, as well as structured data
                 types, are covered. The book also gives a complete
                 description of the programming language statements that
                 are provided in the Maple V system and shows how a user
                 can extend the functionality of the Maple V system by
                 adding user-defined routines. The manual also provides
                 a complete description of the Maple V system, including
                 its 2D and 3D graphics. Maple V features a newly
                 designed user interface on many systems. Separate
                 appendices describe how to use Maple V on systems using
                 the X Window System, DOS, and the Macintosh.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Language elements \\
                 Statements and expressions \\
                 Data types \\
                 Type testing \\
                 Arrays and tables \\
                 Procedures \\
                 Operators \\
                 Internal representation and manipulation \\
                 Plotting \\
                 Miscellaneous facilities \\
                 Overview of the Maple Library \\
                 A. Maple under UNIX \\
                 B. Using Maple with X \\
                 C. Maple under DOS",
  tableofcontents = "1 Introduction \\
                 1.1 Some General Examples \\
                 1.2 Numbers \\
                 1.3 Examples from Calculus \\
                 1.4 Data Structures \\
                 1.5 Examples from Linear Algebra \\
                 1.6 Equation Solving \\
                 1.7 Output and Programming \\
                 2 Language Elements \\
                 2.1 Character Set \\
                 2.2 Tokens \\
                 2.3 Escape Characters \\
                 2.4 Blanks, Lines, Comments, and Continuation \\
                 2.5 Files \\
                 3 Statements and Expressions \\
                 3.1 Types of Statements \\
                 3.2 Expressions \\
                 3.3 Formal Syntax \\
                 4 Data Types \\
                 4.1 Basic Data Types \\
                 4.2 Map, Subs, and Subsop \\
                 5 Type Testing \\
                 5.1 Definition of a Type in Maple \\
                 5.2 Simple Types \\
                 5.3 Structured Types \\
                 5.4 Surface and Nested Types \\
                 5.5 Simplification of Types \\
                 5.6 Parameter Type Testing \\
                 5.7 Undesirable Simplifications and Evaluations of
                 Types \\
                 5.8 Type Testing Versus Pattern Matching \\
                 6 Arrays and Tables \\
                 6.1 Overview \\
                 6.2 Creating Tables \\
                 6.3 Evaluation Rules for Tables and Table Components
                 \\
                 6.4 Tables as Objects \\
                 6.5 Indexing Functions \\
                 7 Procedures \\
                 7.1 Procedure Definitions \\
                 7.2 Parameter Passing \\
                 7.3 Local Variables \\
                 7.4 Options \\
                 7.5 Remember Tables \\
                 7.6 Assigning Values to Parameters \\
                 7.7 Error Returns and Explicit Returns \\
                 7.8 Simplification and Returning Unevaluated \\
                 7.9 Boolean Procedures \\
                 7.10 Reading and Saving Procedures \\
                 8 Operators \\
                 8.1 Operator Definition \\
                 8.2 Syntactic Definition \\
                 8.3 Semantic Definition \\
                 8.3.1 Application Versus Composition \\
                 8.4 Partial Definition of Operators \\
                 8.5 Example: The Differentiation Operator D \\
                 9 Internal Representation and Manipulation \\
                 9.1 Internal Organization \\
                 9.2 Internal Representation of Data Types \\
                 9.3 The Use of Hashing in Maple \\
                 9.4 Portability of the Maple System \\
                 10 Plotting \\
                 10.1 Introduction \\
                 10.2 Plots in 2D \\
                 10.3 Plots in 3D \\
                 10.4 Saving Plots \\
                 10.5 Plots Package \\
                 10.6 Examples \\
                 11 Miscellaneous Facilities \\
                 11.1 Debugging Facilities: Detecting Syntax Errors \\
                 11.2 Debugging Facilities: Monitoring Run-Time
                 Execution \\
                 11.3 Alias and Macro \\
                 11.4 Monitoring Space and Time \\
                 11.5 Global Variables \\
                 11.6 User Interface Variables \\
                 11.7 Maple Command Line Options \\
                 11.8 Other Facilities \\
                 12 Overview of the Maple Library \\
                 12.1 Introduction \\
                 12.2 Description of the Maple Library \\
                 12.3 Format of Library Function Descriptions \\
                 12.4 Printing Maple Help Files \\
                 12.5 Library Index \\
                 A Maple under UNIX \\
                 A.1 Introduction \\
                 A.2 Maple Initialization Files \\
                 A.3 Quit and Interrupt Characters \\
                 A.4 Temporarily Escaping from Maple \\
                 A.5 Redirection of Input and Output \\
                 A.6 Maple Command Line Options for UNIX \\
                 A.6.1 Overview of Maple command line options \\
                 A.6.2 Library Specification Option: -b \\
                 A.6.3 Suppress Initialization Option: -s \\
                 A.6.4 Quiet Option: -q \\
                 A.7 Mint \\
                 A.8 Summary of Site- and UNIX- Dependent Aspects of
                 Maple \\
                 B Using Maple with X \\
                 B.1 Introduction \\
                 B.2 Getting Started \\
                 B.3 Entering Commands in Maple \\
                 B.4 Editing \\
                 B.5 Maple Input and Output Cells \\
                 B.6 Including and Saving Text \\
                 B.7 Searching \\
                 B.8 Resource Usage \\
                 B.9 Interrupt, Pause and Quit Buttons \\
                 B.10 Resizing Windows \\
                 B.11 Help Windows \\
                 B.12 2D Plot Windows \\
                 B.13 3D Plot Windows \\
                 B.14 Customizing Maple Under X \\
                 B.15 Tips \\
                 B.16 Troubleshooting \\
                 B.17 Information for Xperts \\
                 C Maple under DOS \\
                 C.1 Introduction \\
                 C.2 Using Maple V \\
                 C.2.1 Exiting Maple \\
                 C.2.2 The Status Line \\
                 C.2.3 The Command Line Editor \\
                 C.2.4 Expression Editing \\
                 C.2.5 File Editing \\
                 C.2.6 Accessing Maple Help \\
                 C.2.7 Session Review Mode \\
                 C.2.8 Using the Menu \\
                 C.2.9 Input/Output Capture Mode \\
                 C.3 Manipulating Graphical Output \\
                 C.3.1 Three Dimensional Graphics Display Driver \\
                 C.3.2 Two Dimensional Graphics Display Driver \\
                 C.3.3 Printing and Saving Graphic Output \\
                 C.3.4 Using Maple Plots in Other Programs",
}


bibtype: book
filename: master.bib
label: Char:1992:FLT
title: First Leaves: a Tutorial Introduction to Maple V
publisher: pub-SV
address: pub-SV:adr
pages: xvii + 253
year: 1992
DOI: https://doi.org/10.1007/978-1-4615-6996-1
ISBN: 0-387-97621-3, 3-540-97621-3 OR 0387976213, 3540976213
ISBN13: 978-0-387-97621-1, 978-3-540-97621-9 OR 9780387976211, 9783540976219
LCCN: QA155.7.E4 F56 1992
bibdate: Tue Nov 2 12:30:08 1993
bibtimestamp: 1993.11.02 12:30:08 ???
note: Also available in Japanese, ISBN 4-431-70651-8
acknowledgement: ack-nhfb
rawnote: Also available in Japanese, ISBN 4-431-70651-8
rawtitle: First Leaves: a Tutorial Introduction to {Maple V}
bibsource:
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/texbook2.bib

TOC:
One: Interactive Use of Maple 1.1: The user interface and the computational engine 1.2: Getting started 1.3: Starting a Maple session: how Maple behaves interactively 1.4: Simple arithmetic in Maple 1.5: Fixing mistakes 1.6: help yourself to more of Maple 1.7: Parentheses and the priority of arithmetic operations 1.8: Ending a Maple session 1.9: Maple variables 1.10: Built-in commands for mathematical computation 1.11: Introducing Maple's mathematical commands 1.12: Using Maple as a numerical calculator 1.13: Graphing and plotting functions on screen and on paper 1.14: More about syntax errors 1.15: You ask too much! (Run-time errors) 1.16: Interrupting a Maple computation 1.17: Printing values: print and lprint 1.18: Defining simple functions in Maple 1.19: Automatic simplification 1.20: Simplifying expressions with simplify 1.21: Maple's commands for calculus 1.22: Computing sums 1.23: Solving recurrence relations with rsolve 1.24: Other commands for solving, and other mathematical functions Two: Less Simple Maple 2.1: A few words to experienced programmers 2.2: Programming variables and mathematical symbols 2.3: More on simplification: specialized simplification commands 2.4: Full and delayed evaluation 2.5: Quotation and unevaluation 2.6: Using quoted variables as function arguments 2.7: Concatenation forming new names from old 2.8: Looking at parts of expressions op, nops, coeff 2.9: Expression sequences, sets, and lists 2.10: Tables and arrays indexed collections of data 2.11: Converting from one structure to another 2.12: The map function: performing the same operation on all elements of a data structure 2.13: Linear algebra in Maple 2.14: alias for changing the names of built-in functions and mathematical symbols 2.15: Saving the state of your Maple session 2.16: Recording results in files in human-readable format 2.17: Access to additional library procedures 2.18: Other formats for output: fortran, latex, and eqn Three: The Maple Programming Language 3.1: Repetition while you wait 3.2: Repetition for each one 3.3: Conditional execution with if-then-else-fi 3.4: break and next: control within for-while loops 3.5: Simple Maple procedures 3.6: Maple procedures multiple statements, local variables, RETURN 3.7: Using error exiting several procedures at once 3.8: Checking types: writing safer programs 3.9: Nested types and structured types 3.10: Remembering function values 3.11: Functional operators 3.12: Packages in Maple 3.13: Your Maple initialization file 3.14: Creating help for your procedures 3.15: Creating your own library 3.16: Creating and debugging Maple programs 3.17: Viewing Maple library source code 3.18: Calling Maple from programs written in other languages Four: Advanced Graphics 4.1: More on plot 4.2: Plotting in three dimensions: graphing surfaces 4.3: Plotting functional expressions with plot and plot3d Five: Measuring and improving performance 5.1: Monitoring time and space consumed during a computation 5.2: Garbage collection and gc 5.3: Querying the state of the system through status 5.4: Profiling the performance of Maple programs 5.5: Using option remember to improve performance 5.6: Faster floating-point computation Six: Advanced Examples 6.1: Introduction 6.2: Balancing chemical reactions 6.3: Maxwell's formula for the velocity of a gas sample 6.4: Critical length of a rod 6.5: Zeros of Bessel functions 6.6: Stock market analysis through linear algebra 6.7: Primitive trinomials 6.8: Computations on the 3n +1 conjecture 6.9: A numerical approximation problem 6.10: Reading more about Maple problem-solving techniques Seven: Global access to Maple information 7.1: New users' problems 7.2: The community of Maple users 7.3: What to do when the answer seems wrong 7.4: Electronic access to user-contributed Maple software 7.5: Maple publications Conclusion A: Bibliography B: Books and articles for Maple users B.1: Some books for Maple users B.2: Some research articles on Maple and its usage

rawTOC:
One: Interactive Use of Maple \\ 1.1: The user interface and the computational engine \\ 1.2: Getting started \\ 1.3: Starting a Maple session: how Maple behaves interactively \\ 1.4: Simple arithmetic in Maple \\ 1.5: Fixing mistakes \\ 1.6: help yourself to more of Maple \\ 1.7: Parentheses and the priority of arithmetic operations \\ 1.8: Ending a Maple session \\ 1.9: Maple variables \\ 1.10: Built-in commands for mathematical computation \\ 1.11: Introducing Maple's mathematical commands \\ 1.12: Using Maple as a numerical calculator \\ 1.13: Graphing and plotting functions on screen and on paper \\ 1.14: More about syntax errors \\ 1.15: You ask too much! (Run-time errors) \\ 1.16: Interrupting a Maple computation \\ 1.17: Printing values: print and lprint \\ 1.18: Defining simple functions in Maple \\ 1.19: Automatic simplification \\ 1.20: Simplifying expressions with simplify \\ 1.21: Maple's commands for calculus \\ 1.22: Computing sums \\ 1.23: Solving recurrence relations with rsolve \\ 1.24: Other commands for solving, and other mathematical functions \\ Two: Less Simple Maple \\ 2.1: A few words to experienced programmers \\ 2.2: Programming variables and mathematical symbols \\ 2.3: More on simplification: specialized simplification commands \\ 2.4: Full and delayed evaluation \\ 2.5: Quotation and unevaluation \\ 2.6: Using quoted variables as function arguments \\ 2.7: Concatenation \\ forming new names from old \\ 2.8: Looking at parts of expressions \\ op, nops, coeff \\ 2.9: Expression sequences, sets, and lists \\ 2.10: Tables and arrays \\ indexed collections of data \\ 2.11: Converting from one structure to another \\ 2.12: The map function: performing the same operation on all elements of a data structure \\ 2.13: Linear algebra in Maple \\ 2.14: alias for changing the names of built-in functions and mathematical symbols \\ 2.15: Saving the state of your Maple session \\ 2.16: Recording results in files in human-readable format \\ 2.17: Access to additional library procedures \\ 2.18: Other formats for output: fortran, latex, and eqn \\ Three: The Maple Programming Language \\ 3.1: Repetition while you wait \\ 3.2: Repetition for each one \\ 3.3: Conditional execution with if-then-else-fi \\ 3.4: break and next: control within for-while loops \\ 3.5: Simple Maple procedures \\ 3.6: Maple procedures \\ multiple statements, local variables, RETURN \\ 3.7: Using error \\ exiting several procedures at once \\ 3.8: Checking types: writing safer programs \\ 3.9: Nested types and structured types \\ 3.10: Remembering function values \\ 3.11: Functional operators \\ 3.12: Packages in Maple \\ 3.13: Your Maple initialization file \\ 3.14: Creating help for your procedures \\ 3.15: Creating your own library \\ 3.16: Creating and debugging Maple programs \\ 3.17: Viewing Maple library source code \\ 3.18: Calling Maple from programs written in other languages \\ Four: Advanced Graphics \\ 4.1: More on plot \\ 4.2: Plotting in three dimensions: graphing surfaces \\ 4.3: Plotting functional expressions with plot and plot3d \\ Five: Measuring and improving performance \\ 5.1: Monitoring time and space consumed during a computation \\ 5.2: Garbage collection and gc \\ 5.3: Querying the state of the system through status \\ 5.4: Profiling the performance of Maple programs \\ 5.5: Using option remember to improve performance \\ 5.6: Faster floating-point computation \\ Six: Advanced Examples \\ 6.1: Introduction \\ 6.2: Balancing chemical reactions \\ 6.3: Maxwell's formula for the velocity of a gas sample \\ 6.4: Critical length of a rod \\ 6.5: Zeros of Bessel functions \\ 6.6: Stock market analysis through linear algebra \\ 6.7: Primitive trinomials \\ 6.8: Computations on the 3n +1 conjecture \\ 6.9: A numerical approximation problem \\ 6.10: Reading more about Maple problem-solving techniques \\ Seven: Global access to Maple information \\ 7.1: New users' problems \\ 7.2: The community of Maple users \\ 7.3: What to do when the answer seems wrong \\ 7.4: Electronic access to user-contributed Maple software \\ 7.5: Maple publications \\ Conclusion \\ A: Bibliography \\ B: Books and articles for Maple users \\ B.1: Some books for Maple users \\ B.2: Some research articles on Maple and its usage

entry:
@Book{Char:1992:FLT,
  author =       "Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet
                 and Benton Leong and Michael B. Monagan and Stephen M.
                 Watt",
  title =        "First Leaves: a Tutorial Introduction to {Maple V}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvii + 253",
  year =         "1992",
  DOI =          "https://doi.org/10.1007/978-1-4615-6996-1",
  ISBN =         "0-387-97621-3, 3-540-97621-3",
  ISBN-13 =      "978-0-387-97621-1, 978-3-540-97621-9",
  LCCN =         "QA155.7.E4 F56 1992",
  bibdate =      "Tue Nov 2 12:30:08 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  note =         "Also available in Japanese, ISBN 4-431-70651-8",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "One: Interactive Use of Maple \\
                 1.1: The user interface and the computational engine
                 \\
                 1.2: Getting started \\
                 1.3: Starting a Maple session: how Maple behaves
                 interactively \\
                 1.4: Simple arithmetic in Maple \\
                 1.5: Fixing mistakes \\
                 1.6: help yourself to more of Maple \\
                 1.7: Parentheses and the priority of arithmetic
                 operations \\
                 1.8: Ending a Maple session \\
                 1.9: Maple variables \\
                 1.10: Built-in commands for mathematical computation
                 \\
                 1.11: Introducing Maple's mathematical commands \\
                 1.12: Using Maple as a numerical calculator \\
                 1.13: Graphing and plotting functions on screen and on
                 paper \\
                 1.14: More about syntax errors \\
                 1.15: You ask too much! (Run-time errors) \\
                 1.16: Interrupting a Maple computation \\
                 1.17: Printing values: print and lprint \\
                 1.18: Defining simple functions in Maple \\
                 1.19: Automatic simplification \\
                 1.20: Simplifying expressions with simplify \\
                 1.21: Maple's commands for calculus \\
                 1.22: Computing sums \\
                 1.23: Solving recurrence relations with rsolve \\
                 1.24: Other commands for solving, and other
                 mathematical functions \\
                 Two: Less Simple Maple \\
                 2.1: A few words to experienced programmers \\
                 2.2: Programming variables and mathematical symbols \\
                 2.3: More on simplification: specialized simplification
                 commands \\
                 2.4: Full and delayed evaluation \\
                 2.5: Quotation and unevaluation \\
                 2.6: Using quoted variables as function arguments \\
                 2.7: Concatenation \\
                 forming new names from old \\
                 2.8: Looking at parts of expressions \\
                 op, nops, coeff \\
                 2.9: Expression sequences, sets, and lists \\
                 2.10: Tables and arrays \\
                 indexed collections of data \\
                 2.11: Converting from one structure to another \\
                 2.12: The map function: performing the same operation
                 on all elements of a data structure \\
                 2.13: Linear algebra in Maple \\
                 2.14: alias for changing the names of built-in
                 functions and mathematical symbols \\
                 2.15: Saving the state of your Maple session \\
                 2.16: Recording results in files in human-readable
                 format \\
                 2.17: Access to additional library procedures \\
                 2.18: Other formats for output: fortran, latex, and eqn
                 \\
                 Three: The Maple Programming Language \\
                 3.1: Repetition while you wait \\
                 3.2: Repetition for each one \\
                 3.3: Conditional execution with if-then-else-fi \\
                 3.4: break and next: control within for-while loops \\
                 3.5: Simple Maple procedures \\
                 3.6: Maple procedures \\
                 multiple statements, local variables, RETURN \\
                 3.7: Using error \\
                 exiting several procedures at once \\
                 3.8: Checking types: writing safer programs \\
                 3.9: Nested types and structured types \\
                 3.10: Remembering function values \\
                 3.11: Functional operators \\
                 3.12: Packages in Maple \\
                 3.13: Your Maple initialization file \\
                 3.14: Creating help for your procedures \\
                 3.15: Creating your own library \\
                 3.16: Creating and debugging Maple programs \\
                 3.17: Viewing Maple library source code \\
                 3.18: Calling Maple from programs written in other
                 languages \\
                 Four: Advanced Graphics \\
                 4.1: More on plot \\
                 4.2: Plotting in three dimensions: graphing surfaces
                 \\
                 4.3: Plotting functional expressions with plot and
                 plot3d \\
                 Five: Measuring and improving performance \\
                 5.1: Monitoring time and space consumed during a
                 computation \\
                 5.2: Garbage collection and gc \\
                 5.3: Querying the state of the system through status
                 \\
                 5.4: Profiling the performance of Maple programs \\
                 5.5: Using option remember to improve performance \\
                 5.6: Faster floating-point computation \\
                 Six: Advanced Examples \\
                 6.1: Introduction \\
                 6.2: Balancing chemical reactions \\
                 6.3: Maxwell's formula for the velocity of a gas sample
                 \\
                 6.4: Critical length of a rod \\
                 6.5: Zeros of Bessel functions \\
                 6.6: Stock market analysis through linear algebra \\
                 6.7: Primitive trinomials \\
                 6.8: Computations on the 3n +1 conjecture \\
                 6.9: A numerical approximation problem \\
                 6.10: Reading more about Maple problem-solving
                 techniques \\
                 Seven: Global access to Maple information \\
                 7.1: New users' problems \\
                 7.2: The community of Maple users \\
                 7.3: What to do when the answer seems wrong \\
                 7.4: Electronic access to user-contributed Maple
                 software \\
                 7.5: Maple publications \\
                 Conclusion \\
                 A: Bibliography \\
                 B: Books and articles for Maple users \\
                 B.1: Some books for Maple users \\
                 B.2: Some research articles on Maple and its usage",
}


bibtype: book
filename: master.bib
label: Chasen:1978:GPP
author: Sylvan H. Chasen
title: Geometric Principles and Procedures for Computer Graphics Applications
publisher: pub-PH
address: pub-PH:adr
pages: xiv + 241
year: 1978
ISBN: 0-13-352559-7 OR 0133525597
ISBN13: 978-0-13-352559-5 OR 9780133525595
LCCN: T385 .C46
bibdate: Tue Dec 14 23:27:35 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:27:35 ???
acknowledgement: ack-nhfb
rawauthor: Sylvan H. Chasen
rawtitle: Geometric Principles and Procedures for Computer Graphics Applications
entry:
@Book{Chasen:1978:GPP,
  author =       "Sylvan H. Chasen",
  title =        "Geometric Principles and Procedures for Computer
                 Graphics Applications",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 241",
  year =         "1978",
  ISBN =         "0-13-352559-7",
  ISBN-13 =      "978-0-13-352559-5",
  LCCN =         "T385 .C46",
  bibdate =      "Tue Dec 14 23:27:35 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Chassell:1999:TGD
author: Robert J. Chassell and Richard M. Stallman
title: Texinfo: The GNU Documentation Format (for Texinfo version 4.0, 28 September 1999)
publisher: pub-FSF
address: pub-FSF:adr
pages: x + 244
year: 1999
ISBN: 1-882114-67-1 OR 1882114671
ISBN13: 978-1-882114-67-2 OR 9781882114672
LCCN: QA76.76.T49 C53 1999
bibdate: Wed Sep 20 10:17:03 2000
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2000.09.20 10:17:03 ???
acknowledgement: ack-nhfb
rawauthor: Robert J. Chassell and Richard M. Stallman
rawtitle: {Texinfo}: The {GNU} Documentation Format (for {Texinfo} version 4.0, {28 September 1999})
entry:
@Book{Chassell:1999:TGD,
  author =       "Robert J. Chassell and Richard M. Stallman",
  title =        "{Texinfo}: The {GNU} Documentation Format (for
                 {Texinfo} version 4.0, {28 September 1999})",
  publisher =    pub-FSF,
  address =      pub-FSF:adr,
  pages =        "x + 244",
  year =         "1999",
  ISBN =         "1-882114-67-1",
  ISBN-13 =      "978-1-882114-67-2",
  LCCN =         "QA76.76.T49 C53 1999",
  bibdate =      "Wed Sep 20 10:17:03 2000",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$25.00",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Chen:2002:GGS
author: Jim X. Chen
title: Guide to Graphics Software Tools
publisher: pub-SV
address: pub-SV:adr
pages: xxiv + 503
year: 2002
LCCN: T385 .C473 2003
bibdate: Sat Aug 02 09:19:58 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.08.02 09:19:58 ???
note: Includes CD-ROM.
acknowledgement: ack-nhfb
rawauthor: Jim X. Chen
rawnote: Includes CD-ROM.
rawtitle: Guide to Graphics Software Tools
ISBN:
0-387-95049-4 (hardcover), 0-585-47254-8, 0-387-22430-0 (e-book) OR 0387950494 (hardcover), 0585472548, 0387224300 (ebook)

ISBN13:
978-0-387-95049-5 (hardcover), 978-0-585-47254-6, 978-0-387-22430-5 (e-book) OR 9780387950495 (hardcover), 9780585472546, 9780387224305 (ebook)

abstract:
Today, graphics software tools open up new areas and form into different combinations of multiple functions. Learning graphics programming is time consuming, and the many new graphics tools might seem overwhelming. If we know how graphics work and what basic functions the graphics tools provide, we can understand and employ some of the tools without spending much precious time to learn all the details that may not be applicable. There are many books on graphics principles and practice already. However, there is no book available as a helpful entry point on widely used graphics software tools for specialists and nonspecialists alike. Today, many scientists in different disciplines realize the power of graphics, but are also bewildered by the numerous graphics tools. More often than not, they choose the improper software tools and end up with unsatisfactory results. This book introduces and categorizes the most commonly used graphics tools and their applications. The purpose is not to provide an exhausting list of tools and their explicit functions, but instead to provide scientific researchers different means and application areas in computer graphics, and help to efficiently use visualization, modeling, simulation, and virtual reality to complement their research needs. The guide will include coverage of the most widely used commercial software, freeware and open-source software.

TOC:
Preface Table of Contents 1: Objects and Models 2: Transformation and Viewing 3: Color and Lighting 4: Blending and Texture Mapping 5: Advanced Topics 6: Low-Level Graphics Libraries 7: Visualization 8: Modeling and Rendering 9: Animation and Simulation 10: Virtual Reality 11: Web3D Tools and Networked Environment 12: 3D File Formats Appendix: Graphics Software Tools

rawabstract:
Today, graphics software tools open up new areas and form into different combinations of multiple functions. Learning graphics programming is time consuming, and the many new graphics tools might seem overwhelming. If we know how graphics work and what basic functions the graphics tools provide, we can understand and employ some of the tools without spending much precious time to learn all the details that may not be applicable. There are many books on graphics principles and practice already. However, there is no book available as a helpful entry point on widely used graphics software tools for specialists and nonspecialists alike. Today, many scientists in different disciplines realize the power of graphics, but are also bewildered by the numerous graphics tools. More often than not, they choose the improper software tools and end up with unsatisfactory results. This book introduces and categorizes the most commonly used graphics tools and their applications. The purpose is not to provide an exhausting list of tools and their explicit functions, but instead to provide scientific researchers different means and application areas in computer graphics, and help to efficiently use visualization, modeling, simulation, and virtual reality to complement their research needs. The guide will include coverage of the most widely used commercial software, freeware and open-source software.

rawTOC:
Preface \\ Table of Contents \\ 1: Objects and Models \\ 2: Transformation and Viewing \\ 3: Color and Lighting \\ 4: Blending and Texture Mapping \\ 5: Advanced Topics \\ 6: Low-Level Graphics Libraries \\ 7: Visualization \\ 8: Modeling and Rendering \\ 9: Animation and Simulation \\ 10: Virtual Reality \\ 11: Web3D Tools and Networked Environment \\ 12: 3D File Formats \\ Appendix: Graphics Software Tools

entry:
@Book{Chen:2002:GGS,
  author =       "Jim X. Chen",
  title =        "Guide to Graphics Software Tools",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxiv + 503",
  year =         "2002",
  ISBN =         "0-387-95049-4 (hardcover), 0-585-47254-8,
                 0-387-22430-0 (e-book)",
  ISBN-13 =      "978-0-387-95049-5 (hardcover), 978-0-585-47254-6,
                 978-0-387-22430-5 (e-book)",
  LCCN =         "T385 .C473 2003",
  bibdate =      "Sat Aug 02 09:19:58 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Includes CD-ROM.",
  price =        "US\$59.95",
  abstract =     "Today, graphics software tools open up new areas and
                 form into different combinations of multiple functions.
                 Learning graphics programming is time consuming, and
                 the many new graphics tools might seem overwhelming. If
                 we know how graphics work and what basic functions the
                 graphics tools provide, we can understand and employ
                 some of the tools without spending much precious time
                 to learn all the details that may not be applicable.
                 There are many books on graphics principles and
                 practice already. However, there is no book available
                 as a helpful entry point on widely used graphics
                 software tools for specialists and nonspecialists
                 alike. Today, many scientists in different disciplines
                 realize the power of graphics, but are also bewildered
                 by the numerous graphics tools. More often than not,
                 they choose the improper software tools and end up with
                 unsatisfactory results. This book introduces and
                 categorizes the most commonly used graphics tools and
                 their applications. The purpose is not to provide an
                 exhausting list of tools and their explicit functions,
                 but instead to provide scientific researchers different
                 means and application areas in computer graphics, and
                 help to efficiently use visualization, modeling,
                 simulation, and virtual reality to complement their
                 research needs. The guide will include coverage of the
                 most widely used commercial software, freeware and
                 open-source software.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  tableofcontents = "Preface \\
                 Table of Contents \\
                 1: Objects and Models \\
                 2: Transformation and Viewing \\
                 3: Color and Lighting \\
                 4: Blending and Texture Mapping \\
                 5: Advanced Topics \\
                 6: Low-Level Graphics Libraries \\
                 7: Visualization \\
                 8: Modeling and Rendering \\
                 9: Animation and Simulation \\
                 10: Virtual Reality \\
                 11: Web3D Tools and Networked Environment \\
                 12: 3D File Formats \\
                 Appendix: Graphics Software Tools",
}


bibtype: article
filename: master.bib
label: Chen:SPE-19-9-897
author: Pehong Chen and Michael A. Harrison
title: Index Preparation and Processing
journal: j-SPE
volume: 19
number: 9
pages: 897--915
month: sep
monthnumber: 9
year: 1988
bibdate: Sun May 2 07:46:42 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:46:42 ???
acknowledgement: ack-nhfb
rawauthor: Pehong Chen and Michael A. Harrison
rawtitle: Index Preparation and Processing
note:
The LaTeX text of this paper is included in the tt makeindex software distribution. See cite Chen:UCB-TR-87-347.

rawnote:
The {\LaTeX} text of this paper is included in the {\tt makeindex} software distribution. See \cite{Chen:UCB-TR-87-347}.

entry:
@Article{Chen:SPE-19-9-897,
  author =       "Pehong Chen and Michael A. Harrison",
  title =        "Index Preparation and Processing",
  journal =      j-SPE,
  volume =       "19",
  number =       "9",
  pages =        "897--915",
  month =        sep,
  year =         "1988",
  bibdate =      "Sun May 2 07:46:42 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "The {\LaTeX} text of this paper is included in the
                 {\tt makeindex} software distribution. See
                 \cite{Chen:UCB-TR-87-347}.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: master.bib
label: Chen:UCB-TR-87-347
author: Pehong Chen and Michael A. Harrison
title: Automating Index Preparation
type: Technical Report
number: 87/347
institution: Computer Science Division, University of California
address: Berkeley, CA, USA
pages: 897--915
month: mar
monthnumber: 3
year: 1987
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
note: This is an expanded version of cite Chen:SPE-19-9-897.
acknowledgement: ack-nhfb
rawauthor: Pehong Chen and Michael A. Harrison
rawnote: This is an expanded version of \cite{Chen:SPE-19-9-897}.
rawtitle: Automating Index Preparation
entry:
@TechReport{Chen:UCB-TR-87-347,
  author =       "Pehong Chen and Michael A. Harrison",
  title =        "Automating Index Preparation",
  type =         "Technical Report",
  number =       "87/347",
  institution =  "Computer Science Division, University of California",
  address =      "Berkeley, CA, USA",
  month =        mar,
  year =         "1987",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "This is an expanded version of
                 \cite{Chen:SPE-19-9-897}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Cheswick:1994:FIS
author: William R. Cheswick and Steven M. Bellovin
title: Firewalls and Internet Security: Repelling the Wily Hacker
publisher: pub-AW
address: pub-AW:adr
pages: xiv + 306
year: 1994
ISBN: 0-201-63357-4 OR 0201633574
ISBN13: 978-0-201-63357-3 OR 9780201633573
LCCN: TK5105.875.I57C44 1994
bibdate: Wed May 18 19:08:21 1994
bibtimestamp: 1994.05.18 19:08:21 ???
acknowledgement: ack-nhfb
rawauthor: William R. Cheswick and Steven M. Bellovin
rawtitle: Firewalls and Internet Security: Repelling the Wily Hacker
bibsource:
https://www.math.utah.edu/pub/tex/bib/internet.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

TOC:
1: Introduction 2: An Overview of TCP/IP 3: Firewall Gateways 4: How to Build an Application-Level Gateway 5: Authentication 6: Gateway Tools 7: Traps, Lures, and Honey Pots 8: The Hacker's Workbench 9: Classes of Attacks 10: An Evening with Berferd 11: Where the Wild Things Are: A Look at the Logs 12: Legal Considerations 13: Secure Communications over Insecure Networks 14: Where Do We Go from Here? A: Useful Free Stuff B: TCP and UDP Ports C: Recommendations to Vendors

rawTOC:
1: Introduction \\ 2: An Overview of TCP/IP \\ 3: Firewall Gateways \\ 4: How to Build an Application-Level Gateway \\ 5: Authentication \\ 6: Gateway Tools \\ 7: Traps, Lures, and Honey Pots \\ 8: The Hacker's Workbench \\ 9: Classes of Attacks \\ 10: An Evening with Berferd \\ 11: Where the Wild Things Are: A Look at the Logs \\ 12: Legal Considerations \\ 13: Secure Communications over Insecure Networks \\ 14: Where Do We Go from Here? \\ A: Useful Free Stuff \\ B: TCP and UDP Ports \\ C: Recommendations to Vendors

entry:
@Book{Cheswick:1994:FIS,
  author =       "William R. Cheswick and Steven M. Bellovin",
  title =        "Firewalls and Internet Security: Repelling the Wily
                 Hacker",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 306",
  year =         "1994",
  ISBN =         "0-201-63357-4",
  ISBN-13 =      "978-0-201-63357-3",
  LCCN =         "TK5105.875.I57C44 1994",
  bibdate =      "Wed May 18 19:08:21 1994",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
  tableofcontents = "1: Introduction \\
                 2: An Overview of TCP/IP \\
                 3: Firewall Gateways \\
                 4: How to Build an Application-Level Gateway \\
                 5: Authentication \\
                 6: Gateway Tools \\
                 7: Traps, Lures, and Honey Pots \\
                 8: The Hacker's Workbench \\
                 9: Classes of Attacks \\
                 10: An Evening with Berferd \\
                 11: Where the Wild Things Are: A Look at the Logs \\
                 12: Legal Considerations \\
                 13: Secure Communications over Insecure Networks \\
                 14: Where Do We Go from Here? \\
                 A: Useful Free Stuff \\
                 B: TCP and UDP Ports \\
                 C: Recommendations to Vendors",
}


bibtype: book
filename: master.bib
label: Cheswick:2003:FIS
author: William R. Cheswick and Steven M. Bellovin and Aviel D. Rubin
title: Firewalls and Internet Security: Repelling the Wily Hacker
publisher: pub-AW
address: pub-AW:adr
edition: Second
pages: xiv + 433
year: 2003
ISBN: 0-201-63466-X OR 020163466X
ISBN13: 978-0-201-63466-2 OR 9780201634662
LCCN: TK5105.875.I57C44 2003
bibdate: Mon Mar 10 05:40:10 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.03.10 05:40:10 ???
acknowledgement: ack-nhfb
rawauthor: William R. Cheswick and Steven M. Bellovin and Aviel D. Rubin
rawtitle: Firewalls and {Internet} Security: Repelling the Wily Hacker
abstract:
Focusing on Unix network security, this guide reviews the TCP/IP protocol suite, identifies the techniques used to attack hosts and networks, and evaluates authentication tools, types of firewalls, and filtering services. The second edition adds chapters on the problems and practices of modern intranets, and the variety of intrusion detection systems.

TOC:
I: Getting Started 1: Introduction 2: A Security Review of Protocols: Lower Layers 3: Security Review: The Upper Layers 4: The Web: Threat or Menace? II: The Threats 5: Classes of Attacks 6: The Hacker's Workbench, and Other Munitions III: Safer Tools and Services 7: Authentication 8: Using Some Tools and Services IV: Firewalls and VPNs 9: Kinds of Firewalls 10: Filtering Services 11: Firewall Engineering 12: Tunneling and VPNs V: Protecting an Organization 13: Network Layout 14: Safe Hosts in a Hostile Environment 15: Instruction Detection VI: Lessons Learned 16: An Evening with Berferd 17: The Taking of Clark

rawabstract:
Focusing on Unix network security, this guide reviews the TCP/IP protocol suite, identifies the techniques used to attack hosts and networks, and evaluates authentication tools, types of firewalls, and filtering services. The second edition adds chapters on the problems and practices of modern intranets, and the variety of intrusion detection systems.

rawTOC:
I: Getting Started \\ 1: Introduction \\ 2: A Security Review of Protocols: Lower Layers \\ 3: Security Review: The Upper Layers \\ 4: The Web: Threat or Menace? \\ II: The Threats \\ 5: Classes of Attacks \\ 6: The Hacker's Workbench, and Other Munitions \\ III: Safer Tools and Services \\ 7: Authentication \\ 8: Using Some Tools and Services \\ IV: Firewalls and VPNs \\ 9: Kinds of Firewalls \\ 10: Filtering Services \\ 11: Firewall Engineering \\ 12: Tunneling and VPNs \\ V: Protecting an Organization \\ 13: Network Layout \\ 14: Safe Hosts in a Hostile Environment \\ 15: Instruction Detection \\ VI: Lessons Learned \\ 16: An Evening with Berferd \\ 17: The Taking of Clark

entry:
@Book{Cheswick:2003:FIS,
  author =       "William R. Cheswick and Steven M. Bellovin and Aviel
                 D. Rubin",
  title =        "Firewalls and {Internet} Security: Repelling the Wily
                 Hacker",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xiv + 433",
  year =         "2003",
  ISBN =         "0-201-63466-X",
  ISBN-13 =      "978-0-201-63466-2",
  LCCN =         "TK5105.875.I57C44 2003",
  bibdate =      "Mon Mar 10 05:40:10 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$49.99, CAN\$77.99",
  abstract =     "Focusing on Unix network security, this guide reviews
                 the TCP/IP protocol suite, identifies the techniques
                 used to attack hosts and networks, and evaluates
                 authentication tools, types of firewalls, and filtering
                 services. The second edition adds chapters on the
                 problems and practices of modern intranets, and the
                 variety of intrusion detection systems.",
  acknowledgement = ack-nhfb,
  tableofcontents = "I: Getting Started \\
                 1: Introduction \\
                 2: A Security Review of Protocols: Lower Layers \\
                 3: Security Review: The Upper Layers \\
                 4: The Web: Threat or Menace? \\
                 II: The Threats \\
                 5: Classes of Attacks \\
                 6: The Hacker's Workbench, and Other Munitions \\
                 III: Safer Tools and Services \\
                 7: Authentication \\
                 8: Using Some Tools and Services \\
                 IV: Firewalls and VPNs \\
                 9: Kinds of Firewalls \\
                 10: Filtering Services \\
                 11: Firewall Engineering \\
                 12: Tunneling and VPNs \\
                 V: Protecting an Organization \\
                 13: Network Layout \\
                 14: Safe Hosts in a Hostile Environment \\
                 15: Instruction Detection \\
                 VI: Lessons Learned \\
                 16: An Evening with Berferd \\
                 17: The Taking of Clark",
}


bibtype: book
filename: master.bib
label: Chow:1989:MXR
editor: Paul Chow
title: The MIPS-X RISC Microprocessor
publisher: pub-KLUWER
address: pub-KLUWER:adr
pages: xxiv + 231
year: 1989
ISBN: 0-7923-9045-8 OR 0792390458
ISBN13: 978-0-7923-9045-9 OR 9780792390459
LCCN: QA76.8.M524 M57 1989
bibdate: Tue Dec 14 23:27:43 1993
bibtimestamp: 1993.12.14 23:27:43 ???
series: The Kluwer international series in engineering and computer science
keywords: MIPS-X (microprocessor); VLSI, computer architecture, and digital signal processing SECS 81
ZMnumber: 0706.68010
acknowledgement: ack-nhfb
raweditor: Paul Chow
rawtitle: The {MIPS-X RISC} Microprocessor
bibsource:
https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/microchip.bib

entry:
@Book{Chow:1989:MXR,
  editor =       "Paul Chow",
  title =        "The {MIPS-X RISC} Microprocessor",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xxiv + 231",
  year =         "1989",
  ISBN =         "0-7923-9045-8",
  ISBN-13 =      "978-0-7923-9045-9",
  LCCN =         "QA76.8.M524 M57 1989",
  bibdate =      "Tue Dec 14 23:27:43 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/microchip.bib",
  series =       "The Kluwer international series in engineering and
                 computer science",
  ZMnumber =     "0706.68010",
  acknowledgement = ack-nhfb,
  keywords =     "MIPS-X (microprocessor); VLSI, computer architecture,
                 and digital signal processing SECS 81",
}


bibtype: book
filename: master.bib
label: Chposky:1988:BMP
author: James Chposky and Ted Leonsis
title: Blue magic: the people, power, and politics behind the IBM personal computer
publisher: Facts on File
address: New York, NY, USA
pages: xi + 228
year: 1988
ISBN: 0-8160-1391-8 OR 0816013918
ISBN13: 978-0-8160-1391-3 OR 9780816013913
LCCN: HD9696.C64 I4832 1988
bibdate: Fri Jan 24 07:03:11 MST 2014
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2014.01.24 07:03:11 MST
subject: IBM microcomputers; History; IBM Personal Computer
TOC: The vixen and the rocket Putting a toe in the water
acknowledgement: ack-nhfb
rawauthor: James Chposky and Ted Leonsis
rawtitle: Blue magic: the people, power, and politics behind the {IBM} personal computer
rawTOC: The vixen and the rocket \\ Putting a toe in the water
entry:
@Book{Chposky:1988:BMP,
  author =       "James Chposky and Ted Leonsis",
  title =        "Blue magic: the people, power, and politics behind the
                 {IBM} personal computer",
  publisher =    "Facts on File",
  address =      "New York, NY, USA",
  pages =        "xi + 228",
  year =         "1988",
  ISBN =         "0-8160-1391-8",
  ISBN-13 =      "978-0-8160-1391-3",
  LCCN =         "HD9696.C64 I4832 1988",
  bibdate =      "Fri Jan 24 07:03:11 MST 2014",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "IBM microcomputers; History; IBM Personal Computer",
  tableofcontents = "The vixen and the rocket \\
                 Putting a toe in the water",
}


bibtype: book
filename: master.bib
label: Christensen:1997:IDW
author: Clayton M. Christensen
title: The innovator's dilemma: when new technologies cause great firms to fail
publisher: Harvard Business School
address: Boston, MA, USA
pages: xxiv + 225
year: 1997
ISBN: 0-87584-585-1 OR 0875845851
ISBN13: 978-0-87584-585-2 OR 9780875845852
LCCN: HD53 .C49 1997
bibdate: Thu Dec 28 07:47:15 MST 2017
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2017.12.28 07:47:15 MST
series: The Management of Innovation and Change Series
acknowledgement: ack-nhfb
rawauthor: Clayton M. Christensen
rawtitle: The innovator's dilemma: when new technologies cause great firms to fail
abstract:
This book takes the radical position that great companies can fail precisely because they do everything right. It demonstrates why outstanding companies that had their competitive antennae up, listened astutely to customers, and invested aggressively in new technologies still lost their market leadership when confronted with disruptive changes in technology and market structure. And it tells how to avoid a similar fate. Using the lessons of successes and failures of leading companies, The booktitle Innovator's Dilemma presents a set of rules for capitalizing on the phenomenon of disruptive innovation. These principles will help managers determine when it is right not to listen to customers, when to invest in developing lower-performance products that promise lower margins, and when to pursue small markets at the expense of seemingly larger and more lucrative ones.

TOC:
How can great firms fail? Insights from the hard disk drive industry Value networks and the impetus to innovate Disruptive technological change in the mechanical excavator industry What goes up, can't go down Give responsibility for disruptive technologies to organizations whose customers need them Match the size of the organization to the size of the market Discovering new and emerging markets Performance provided, market demand, and the product life cycle Managing disruptive technological change: a case study The dilemmas of innovation: a summary

rawabstract:
This book takes the radical position that great companies can fail precisely because they do everything right. It demonstrates why outstanding companies that had their competitive antennae up, listened astutely to customers, and invested aggressively in new technologies still lost their market leadership when confronted with disruptive changes in technology and market structure. And it tells how to avoid a similar fate. Using the lessons of successes and failures of leading companies, The \booktitle{Innovator's Dilemma} presents a set of rules for capitalizing on the phenomenon of disruptive innovation. These principles will help managers determine when it is right not to listen to customers, when to invest in developing lower-performance products that promise lower margins, and when to pursue small markets at the expense of seemingly larger and more lucrative ones.

rawTOC:
How can great firms fail? Insights from the hard disk drive industry \\ Value networks and the impetus to innovate \\ Disruptive technological change in the mechanical excavator industry \\ What goes up, can't go down \\ Give responsibility for disruptive technologies to organizations whose customers need them \\ Match the size of the organization to the size of the market \\ Discovering new and emerging markets \\ Performance provided, market demand, and the product life cycle \\ Managing disruptive technological change: a case study \\ The dilemmas of innovation: a summary

entry:
@Book{Christensen:1997:IDW,
  author =       "Clayton M. Christensen",
  title =        "The innovator's dilemma: when new technologies cause
                 great firms to fail",
  publisher =    "Harvard Business School",
  address =      "Boston, MA, USA",
  pages =        "xxiv + 225",
  year =         "1997",
  ISBN =         "0-87584-585-1",
  ISBN-13 =      "978-0-87584-585-2",
  LCCN =         "HD53 .C49 1997",
  bibdate =      "Thu Dec 28 07:47:15 MST 2017",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "The Management of Innovation and Change Series",
  abstract =     "This book takes the radical position that great
                 companies can fail precisely because they do everything
                 right. It demonstrates why outstanding companies that
                 had their competitive antennae up, listened astutely to
                 customers, and invested aggressively in new
                 technologies still lost their market leadership when
                 confronted with disruptive changes in technology and
                 market structure. And it tells how to avoid a similar
                 fate. Using the lessons of successes and failures of
                 leading companies, The \booktitle{Innovator's Dilemma}
                 presents a set of rules for capitalizing on the
                 phenomenon of disruptive innovation. These principles
                 will help managers determine when it is right not to
                 listen to customers, when to invest in developing
                 lower-performance products that promise lower margins,
                 and when to pursue small markets at the expense of
                 seemingly larger and more lucrative ones.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "How can great firms fail? Insights from the hard
                 disk drive industry \\
                 Value networks and the impetus to innovate \\
                 Disruptive technological change in the mechanical
                 excavator industry \\
                 What goes up, can't go down \\
                 Give responsibility for disruptive technologies to
                 organizations whose customers need them \\
                 Match the size of the organization to the size of the
                 market \\
                 Discovering new and emerging markets \\
                 Performance provided, market demand, and the product
                 life cycle \\
                 Managing disruptive technological change: a case study
                 \\
                 The dilemmas of innovation: a summary",
}


bibtype: book
filename: master.bib
label: Christian:1983:UOS
author: Kaare Christian
title: The UNIX Operating System
publisher: pub-WILEY-INTERSCIENCE
address: pub-WILEY-INTERSCIENCE:adr
pages: xviii + 318
year: 1983
LCCN: QA76.8.U65 C45 1983
bibdate: Tue Dec 14 23:28:00 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:28:00 ???
acknowledgement: ack-nhfb
rawauthor: Kaare Christian
rawtitle: The {UNIX} Operating System
ISBN:
0-471-87542-2 (hardcover) and 0-471-89052-9 (paperback) OR 0471875422 (hardcover) and 0471890529 (paperback)

ISBN13:
978-0-471-87542-0 (hardcover) and 978-0-471-89052-2 (paperback) OR 9780471875420 (hardcover) and 9780471890522 (paperback)

entry:
@Book{Christian:1983:UOS,
  author =       "Kaare Christian",
  title =        "The {UNIX} Operating System",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "xviii + 318",
  year =         "1983",
  ISBN =         "0-471-87542-2 (hardcover) and 0-471-89052-9
                 (paperback)",
  ISBN-13 =      "978-0-471-87542-0 (hardcover) and 978-0-471-89052-2
                 (paperback)",
  LCCN =         "QA76.8.U65 C45 1983",
  bibdate =      "Tue Dec 14 23:28:00 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Christian:1986:GM
author: Kaare Christian
title: A Guide to Modula-2
publisher: pub-SV
address: pub-SV:adr
pages: xix + 436
year: 1986
ISBN: 0-387-96242-5 OR 0387962425
ISBN13: 978-0-387-96242-9 OR 9780387962429
LCCN: QA76.73.M63 C494 1986
bibdate: Tue Dec 14 23:27:52 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:27:52 ???
acknowledgement: ack-nhfb
rawauthor: Kaare Christian
rawtitle: A Guide to {Modula-2}
entry:
@Book{Christian:1986:GM,
  author =       "Kaare Christian",
  title =        "A Guide to {Modula-2}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xix + 436",
  year =         "1986",
  ISBN =         "0-387-96242-5",
  ISBN-13 =      "978-0-387-96242-9",
  LCCN =         "QA76.73.M63 C494 1986",
  bibdate =      "Tue Dec 14 23:27:52 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$28.00",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Christian:1988:UOS
author: Kaare Christian
title: The UNIX Operating System
publisher: pub-WILEY-INTERSCIENCE
address: pub-WILEY-INTERSCIENCE:adr
edition: Second
pages: xxii + 455
year: 1988
LCCN: QA76.8.U65 C45 1988
bibdate: Tue Dec 14 23:28:05 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1993.12.14 23:28:05 ???
acknowledgement: ack-nhfb
rawauthor: Kaare Christian
rawtitle: The {UNIX} Operating System
ISBN:
0-471-84782-8 (hardcover), 0-471-84781-X (paperback) OR 0471847828 (hardcover), 047184781X (paperback)

ISBN13:
978-0-471-84782-3 (hardcover), 978-0-471-84781-6 (paperback) OR 9780471847823 (hardcover), 9780471847816 (paperback)

abstract:
Contains over 50 percent new and expanded material and guides readers through every aspect of UNIX--from basic commands to shell programming to systems administration. Provides readers with useful quick summary sections that explain the important differences between UNIX versions. Includes special chapters on networking, security and Window systems.

TOC:
The History of the UNIX System Fundamentals UNIX System Basics Entering Commands Using the Shell The UNIX File System Managing Your Files What's Going on Utilities Text File Utilities Basic Text Editing with Vi Advanced Text Editing with Vi The Bourne Shell Programming Language A Few Shell Programs The AWK Programming Language The Sed Text Editor UNIX Platforms Window Systems Networking LAN Networking Utilities UUCP Networking Utilities System Management System Management Utilities Security The UNIX System Kernel Appendices Index

rawabstract:
Contains over 50 percent new and expanded material and guides readers through every aspect of UNIX--from basic commands to shell programming to systems administration. Provides readers with useful quick summary sections that explain the important differences between UNIX versions. Includes special chapters on networking, security and Window systems.

rawTOC:
The History of the UNIX System \\ Fundamentals \\ UNIX System Basics \\ Entering Commands Using the Shell \\ The UNIX File System \\ Managing Your Files \\ What's Going on Utilities \\ Text File Utilities \\ Basic Text Editing with Vi \\ Advanced Text Editing with Vi \\ The Bourne Shell Programming Language \\ A Few Shell Programs \\ The AWK Programming Language \\ The Sed Text Editor \\ UNIX Platforms \\ Window Systems \\ Networking \\ LAN Networking Utilities \\ UUCP Networking Utilities \\ System Management \\ System Management Utilities \\ Security \\ The UNIX System Kernel \\ Appendices \\ Index

entry:
@Book{Christian:1988:UOS,
  author =       "Kaare Christian",
  title =        "The {UNIX} Operating System",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  edition =      "Second",
  pages =        "xxii + 455",
  year =         "1988",
  ISBN =         "0-471-84782-8 (hardcover), 0-471-84781-X (paperback)",
  ISBN-13 =      "978-0-471-84782-3 (hardcover), 978-0-471-84781-6
                 (paperback)",
  LCCN =         "QA76.8.U65 C45 1988",
  bibdate =      "Tue Dec 14 23:28:05 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Contains over 50 percent new and expanded material and
                 guides readers through every aspect of UNIX--from basic
                 commands to shell programming to systems
                 administration. Provides readers with useful quick
                 summary sections that explain the important differences
                 between UNIX versions. Includes special chapters on
                 networking, security and Window systems.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The History of the UNIX System \\
                 Fundamentals \\
                 UNIX System Basics \\
                 Entering Commands Using the Shell \\
                 The UNIX File System \\
                 Managing Your Files \\
                 What's Going on Utilities \\
                 Text File Utilities \\
                 Basic Text Editing with Vi \\
                 Advanced Text Editing with Vi \\
                 The Bourne Shell Programming Language \\
                 A Few Shell Programs \\
                 The AWK Programming Language \\
                 The Sed Text Editor \\
                 UNIX Platforms \\
                 Window Systems \\
                 Networking \\
                 LAN Networking Utilities \\
                 UUCP Networking Utilities \\
                 System Management \\
                 System Management Utilities \\
                 Security \\
                 The UNIX System Kernel \\
                 Appendices \\
                 Index",
  xxnote =       "See \cite{Sobell:1989:PGU}.",
}


bibtype: book
filename: master.bib
label: Christiansen:1998:PC
author: Tohm Christiansen and Nathan Torkington
title: Perl Cookbook: Solutions and examples for Perl programmers
publisher: pub-ORA
address: pub-ORA:adr
pages: xxxiv + 757
year: 1998
ISBN: 1-56592-243-3 OR 1565922433
ISBN13: 978-1-56592-243-3 OR 9781565922433
LCCN: QA76.73.P22 C57 1998
bibdate: Thu Feb 18 06:53:00 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.02.18 06:53:00 ???
URL: http://www.oreilly.com/catalog/cookbook/
acknowledgement: ack-nhfb
rawauthor: Tohm Christiansen and Nathan Torkington
rawtitle: Perl Cookbook: Solutions and examples for {Perl} programmers
entry:
@Book{Christiansen:1998:PC,
  author =       "Tohm Christiansen and Nathan Torkington",
  title =        "Perl Cookbook: Solutions and examples for {Perl}
                 programmers",
  publisher =    pub-ORA,
  address =      pub-ORA:adr,
  pages =        "xxxiv + 757",
  year =         "1998",
  ISBN =         "1-56592-243-3",
  ISBN-13 =      "978-1-56592-243-3",
  LCCN =         "QA76.73.P22 C57 1998",
  bibdate =      "Thu Feb 18 06:53:00 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  URL =          "http://www.oreilly.com/catalog/cookbook/",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Chroskova:1993:ACC
author: Blank Chroskova and Bohumila Navratilova and Milos Vantuch and Eva Hrabcova
title: Anglicko--Cesky a Cesko--Anglicky Slovnik --- English--Czech and Czech--English Dictionary
publisher: Vydavatelstvi Montanex
address: Ostrava, Czechoslovakia
pages: 176
year: 1993
ISBN: 80-85300-57-5 OR 8085300575
ISBN13: 978-80-85300-57-4 OR 9788085300574
LCCN: PG4640 .A485 1993x
bibdate: Sat Dec 24 15:19:10 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.24 15:19:10 ???
remark: No publication year in book; WorldCat says 1993.
subject: Czech language; Dictionaries; English; English language; Czech
acknowledgement: ack-nhfb
rawauthor: Blank Chroskov{\'a} and Bohumila Navr{\'a}tilov{\'a} and Milo{\v{s}} Vantuch and Eva Hrabcov{\'a}
rawtitle:
Anglicko--{\v{C}}esk{\'y} a {\v{C}}esko--Anglick{\'y} Slovn{\'\i}k --- English--Czech and Czech--English Dictionary

entry:
@Book{Chroskova:1993:ACC,
  author =       "Blank Chroskov{\'a} and Bohumila Navr{\'a}tilov{\'a}
                 and Milo{\v{s}} Vantuch and Eva Hrabcov{\'a}",
  title =        "Anglicko--{\v{C}}esk{\'y} a {\v{C}}esko--Anglick{\'y}
                 Slovn{\'\i}k --- English--Czech and Czech--English
                 Dictionary",
  publisher =    "Vydavatelstv{\'\i} Montan{\v{e}}x",
  address =      "Ostrava, Czechoslovakia",
  pages =        "176",
  year =         "1993",
  ISBN =         "80-85300-57-5",
  ISBN-13 =      "978-80-85300-57-4",
  LCCN =         "PG4640 .A485 1993x",
  bibdate =      "Sat Dec 24 15:19:10 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  idnumber =     "519",
  remark =       "No publication year in book; WorldCat says 1993.",
  subject =      "Czech language; Dictionaries; English; English
                 language; Czech",
}


bibtype: book
filename: master.bib
label: Churchill:1958:OM
author: Ruel V. Churchill
title: Operational Mathematics
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
edition: Second
pages: 337
year: 1958
LCCN: QA432 .C45 1958
bibdate: Wed Dec 15 15:37:25 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 15:37:25 ???
acknowledgement: ack-nhfb
rawauthor: Ruel V. Churchill
rawtitle: Operational Mathematics
entry:
@Book{Churchill:1958:OM,
  author =       "Ruel V. Churchill",
  title =        "Operational Mathematics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "337",
  year =         "1958",
  LCCN =         "QA432 .C45 1958",
  bibdate =      "Wed Dec 15 15:37:25 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Churchill:1960:CVA
author: Ruel V. Churchill
title: Complex Variables and Applications
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
edition: Second
pages: 297
year: 1960
LCCN: QA331 .C45 1960
bibdate: Wed Dec 15 15:35:45 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.15 15:35:45 ???
acknowledgement: ack-nhfb
rawauthor: Ruel V. Churchill
rawtitle: Complex Variables and Applications
entry:
@Book{Churchill:1960:CVA,
  author =       "Ruel V. Churchill",
  title =        "Complex Variables and Applications",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  edition =      "Second",
  pages =        "297",
  year =         "1960",
  LCCN =         "QA331 .C45 1960",
  bibdate =      "Wed Dec 15 15:35:45 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Clark:1985:MPP
author: K. L. Clark and F. G. McCabe
title: micro-PROLOG: Programming in Logic
publisher: pub-PHI
address: pub-PHI:adr
pages: xi + 401
year: 1985
ISBN: 0-13-581264-X (paperback) OR 013581264X (paperback)
ISBN13: 978-0-13-581264-8 (paperback) OR 9780135812648 (paperback)
LCCN: QA76.73.M5 C55 1984
bibdate: Tue Dec 14 23:28:16 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:28:16 ???
series: Series in Computer Science, Editor: C. A. R. Hoare
acknowledgement: ack-nhfb
rawauthor: K. L. Clark and F. G. McCabe
rawtitle: micro-{PROLOG}: Programming in Logic
TOC:
Basic concepts Facts and queries Rules Lists Logic programming using micro-Prolog Complex conditions in queries and rules List processing Introduction to parsing Some pragmatic considerations Metalogical programming Core micro-Prolog The standard syntax of micro-Prolog Applications of micro-Prolog A critical path analysis program Micro-Prolog for expert systems The logic of two person games Micro-Prolog for problem solving Index

rawTOC:
Basic concepts \\ Facts and queries \\ Rules \\ Lists \\ Logic programming using micro-Prolog \\ Complex conditions in queries and rules \\ List processing \\ Introduction to parsing \\ Some pragmatic considerations \\ Metalogical programming \\ Core micro-Prolog \\ The standard syntax of micro-Prolog \\ Applications of micro-Prolog \\ A critical path analysis program \\ Micro-Prolog for expert systems \\ The logic of two person games \\ Micro-Prolog for problem solving \\ Index

entry:
@Book{Clark:1985:MPP,
  author =       "K. L. Clark and F. G. McCabe",
  title =        "micro-{PROLOG}: Programming in Logic",
  publisher =    pub-PHI,
  address =      pub-PHI:adr,
  pages =        "xi + 401",
  year =         "1985",
  ISBN =         "0-13-581264-X (paperback)",
  ISBN-13 =      "978-0-13-581264-8 (paperback)",
  LCCN =         "QA76.73.M5 C55 1984",
  bibdate =      "Tue Dec 14 23:28:16 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$17.95",
  series =       "Series in Computer Science, Editor: C. A. R. Hoare",
  acknowledgement = ack-nhfb,
  tableofcontents = "Basic concepts \\
                 Facts and queries \\
                 Rules \\
                 Lists \\
                 Logic programming using micro-Prolog \\
                 Complex conditions in queries and rules \\
                 List processing \\
                 Introduction to parsing \\
                 Some pragmatic considerations \\
                 Metalogical programming \\
                 Core micro-Prolog \\
                 The standard syntax of micro-Prolog \\
                 Applications of micro-Prolog \\
                 A critical path analysis program \\
                 Micro-Prolog for expert systems \\
                 The logic of two person games \\
                 Micro-Prolog for problem solving \\
                 Index",
}


bibtype: book
filename: master.bib
label: Clark:1992:PTP
author: Malcolm Clark
title: A Plain TeX Primer
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: 481
year: 1992
LCCN: Z253.4.T47 C46 1992
bibdate: Tue Dec 14 23:41:37 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:41:37 ???
acknowledgement: ack-nhfb
rawauthor: Malcolm Clark
rawtitle: A Plain {\TeX} Primer
ISBN:
0-19-853784-0 (hardcover), 0-19-853724-7 (paperback) OR 0198537840 (hardcover), 0198537247 (paperback)

ISBN13:
978-0-19-853784-7 (hardcover), 978-0-19-853724-3 (paperback) OR 9780198537847 (hardcover), 9780198537243 (paperback)

abstract:
This outstanding introductory primer demystifies and explains TeX , an advanced and widely popular typesetting and page make-up system that is especially designed to facilitate scientific and technical publishing. The TeX system is highly versatile, designed for use on over 50 different types of personal, mini-, and mainframe computers. The book immediately provides the reader with sufficient information to begin the majority of tasks which he or she most likely wishes to tackle. Accessibly written at an introductory level, the book explains how high-quality results can be obtained by someone with only a little TeX background. In a straightforward manner, it details why TeX approaches its subject in the way it does, and provides the ``context'' into which it fits. Special emphasis is placed on document structure and practical work. In fact, not only is this book a ``primer,'' but it is a ``plain'' TeX primer. Wherever TeX is running, it comes with at least one basic style definition, called ``plain''. Plain TeX is the common starting point for TeX users and can be extended or modified to suit individual needs. Thus, with the aid of this book, scientists and researchers preparing their own books and papers, or technical typists used to the conventions and jargon of their field, will find little difficulty in adopting TeX 's approach. Students and professionals involved in document preparation or desk-top publishing will also find this an extremely useful volume.

subject:
TeX (Computer file); TeX (Computer file); Computerized typesetting; Mathematics printing; Computer programs; Computerized typesetting; Computer programs; Linguagens De Programacao (Codificacao); TeX (logiciel)

TOC:
1. Introduction 2. Getting started 3. Do it yourself 4. Beginning mathematics 5. Continuing mathematics 6. More words 7. Commands 8. More maths 9. Boxing 10. Commands#1 11. Matrix manipulations 12. Pages 13. Tables by tabs 14. Tables again 15. Rules 16. Further rules 17. Graphics 18. Fonts 19. More detailed fonts 20. Making pages 21. Breaking up 22. Delays and deferments 23. Collections 24. Last words A. Fonts B. Annotated bibliography and references

rawabstract:
This outstanding introductory primer demystifies and explains \TeX{}, an advanced and widely popular typesetting and page make-up system that is especially designed to facilitate scientific and technical publishing. The \TeX{} system is highly versatile, designed for use on over 50 different types of personal, mini-, and mainframe computers. The book immediately provides the reader with sufficient information to begin the majority of tasks which he or she most likely wishes to tackle. Accessibly written at an introductory level, the book explains how high-quality results can be obtained by someone with only a little \TeX{} background. In a straightforward manner, it details why \TeX{} approaches its subject in the way it does, and provides the ``context'' into which it fits. Special emphasis is placed on document structure and practical work. In fact, not only is this book a ``primer,'' but it is a ``plain'' \TeX{} primer. Wherever \TeX{} is running, it comes with at least one basic style definition, called ``plain''. Plain \TeX{} is the common starting point for \TeX{} users and can be extended or modified to suit individual needs. Thus, with the aid of this book, scientists and researchers preparing their own books and papers, or technical typists used to the conventions and jargon of their field, will find little difficulty in adopting \TeX{}'s approach. Students and professionals involved in document preparation or desk-top publishing will also find this an extremely useful volume.

rawTOC:
1. Introduction \\ 2. Getting started \\ 3. Do it yourself \\ 4. Beginning mathematics \\ 5. Continuing mathematics \\ 6. More words \\ 7. Commands \\ 8. More maths \\ 9. Boxing \\ 10. Commands\#1 \\ 11. Matrix manipulations \\ 12. Pages \\ 13. Tables by tabs \\ 14. Tables again \\ 15. Rules \\ 16. Further rules \\ 17. Graphics \\ 18. Fonts \\ 19. More detailed fonts \\ 20. Making pages \\ 21. Breaking up \\ 22. Delays and deferments \\ 23. Collections \\ 24. Last words \\ A. Fonts \\ B. Annotated bibliography and references

entry:
@Book{Clark:1992:PTP,
  author =       "Malcolm Clark",
  title =        "A Plain {\TeX} Primer",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "481",
  year =         "1992",
  ISBN =         "0-19-853784-0 (hardcover), 0-19-853724-7 (paperback)",
  ISBN-13 =      "978-0-19-853784-7 (hardcover), 978-0-19-853724-3
                 (paperback)",
  LCCN =         "Z253.4.T47 C46 1992",
  bibdate =      "Tue Dec 14 23:41:37 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "This outstanding introductory primer demystifies and
                 explains \TeX{}, an advanced and widely popular
                 typesetting and page make-up system that is especially
                 designed to facilitate scientific and technical
                 publishing. The \TeX{} system is highly versatile,
                 designed for use on over 50 different types of
                 personal, mini-, and mainframe computers. The book
                 immediately provides the reader with sufficient
                 information to begin the majority of tasks which he or
                 she most likely wishes to tackle. Accessibly written at
                 an introductory level, the book explains how
                 high-quality results can be obtained by someone with
                 only a little \TeX{} background. In a straightforward
                 manner, it details why \TeX{} approaches its subject in
                 the way it does, and provides the ``context'' into
                 which it fits. Special emphasis is placed on document
                 structure and practical work. In fact, not only is this
                 book a ``primer,'' but it is a ``plain'' \TeX{} primer.
                 Wherever \TeX{} is running, it comes with at least one
                 basic style definition, called ``plain''. Plain \TeX{}
                 is the common starting point for \TeX{} users and can
                 be extended or modified to suit individual needs. Thus,
                 with the aid of this book, scientists and researchers
                 preparing their own books and papers, or technical
                 typists used to the conventions and jargon of their
                 field, will find little difficulty in adopting \TeX{}'s
                 approach. Students and professionals involved in
                 document preparation or desk-top publishing will also
                 find this an extremely useful volume.",
  acknowledgement = ack-nhfb,
  subject =      "TeX (Computer file); TeX (Computer file); Computerized
                 typesetting; Mathematics printing; Computer programs;
                 Computerized typesetting; Computer programs; Linguagens
                 De Programa{\c{c}}ao (Codifica{\c{c}}ao); TeX
                 (logiciel)",
  tableofcontents = "1. Introduction \\
                 2. Getting started \\
                 3. Do it yourself \\
                 4. Beginning mathematics \\
                 5. Continuing mathematics \\
                 6. More words \\
                 7. Commands \\
                 8. More maths \\
                 9. Boxing \\
                 10. Commands\#1 \\
                 11. Matrix manipulations \\
                 12. Pages \\
                 13. Tables by tabs \\
                 14. Tables again \\
                 15. Rules \\
                 16. Further rules \\
                 17. Graphics \\
                 18. Fonts \\
                 19. More detailed fonts \\
                 20. Making pages \\
                 21. Breaking up \\
                 22. Delays and deferments \\
                 23. Collections \\
                 24. Last words \\
                 A. Fonts \\
                 B. Annotated bibliography and references",
}


bibtype: book
filename: master.bib
label: Clark:2009:SKU
author: Stuart (Stuart G.) Clark
publisher: pub-PRINCETON
address: pub-PRINCETON:adr
pages: xii + 211
year: 2009
ISBN: 0-691-14126-6 (paperback) OR 0691141266 (paperback)
ISBN13: 978-0-691-14126-8 (paperback) OR 9780691141268 (paperback)
LCCN: M09.E06300
bibdate: Thu Nov 12 16:40:25 MST 2009
bibtimestamp: 2009.11.12 16:40:25 MST
URL: http://press.princeton.edu/titles/8370.html
remark: Originally published: 2007.
acknowledgement: ack-nhfb
rawauthor: Stuart (Stuart G.) Clark
title:
The Sun Kings: the unexpected tragedy of Richard Carrington and the tale of how modern astronomy began

bibsource:
https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/physperspect.bib; library.ox.ac.uk:210/ADVANCE

abstract:
Recounts the story behind English astronomer Richard Carrington's observations of a mysterious explosion on the surface of the sun and how his understanding that the sun's magnetism directly influences the Earth helped usher in the modern era of astronomy.

subject:
Carrington, Richard Christopher; astronomy; England; 19th Century history; solar flares; observations; sun; Carrington, Richard Christopher; Herschel, William, Sir; Herschel, John F. W (John Frederick William), Sir; Maunder, E. Walter (Edward Walter); Hale, George Ellery; Carrington, Richard Christopher; Herschel, William; Herschel, John Frederick William; Maunder, Edward Walter; Hale, George Ellery; Astronomers; Great Britain; Biography; Solar flares; Observations; History; 19th century; Astronomes; Grande-Bretagne; Biographies; Eruptions solaires; 19e siecle; Soleil; Sun; 19th century

TOC:
List of Illustrations / ix Acknowledgments / xi Prologue: The Dog Years / 1 Chapter One: The First Swallow of Summer / 9 Chapter Two: Herschel's Grand Absurdity / 25 Chapter Three: The Magnetic Crusade / 47 Chapter Four: The Solar Lockstep / 58 Chapter Five: The Day and Night Observatory / 71 Chapter Six: The Perfect Solar Storm / 80 Chapter Seven: In the Grip of the Sun / 93 Chapter Eight: The Greatest Prize of All / 98 Chapter Nine: Death at the Devil's Jumps / 117 Chapter Ten: The Sun's Librarian / 129 Chapter Eleven: New Flare, New Storm, New Understanding / 148 Chapter Twelve: The Waiting Game / 168 Chapter Thirteen: The Cloud Chamber / 179 Epilogue: Magnetar Spring / 188 Bibliography / 191 Index / 207

subjectdates:
Richard Carrington (1826--1875); Sir William Herschel (1738--1822); John F. W. Herschel (1792--1871); E. Walter Maunder (1851--1928); George Ellery Hale (1868--1938)

rawabstract:
Recounts the story behind English astronomer Richard Carrington's observations of a mysterious explosion on the surface of the sun and how his understanding that the sun's magnetism directly influences the Earth helped usher in the modern era of astronomy.

rawtitle:
The {Sun Kings}: the unexpected tragedy of {Richard Carrington} and the tale of how modern astronomy began

rawTOC:
List of Illustrations / ix \\ Acknowledgments / xi \\ Prologue: The Dog Years / 1 \\ Chapter One: The First Swallow of Summer / 9 \\ Chapter Two: Herschel's Grand Absurdity / 25 \\ Chapter Three: The Magnetic Crusade / 47 \\ Chapter Four: The Solar Lockstep / 58 \\ Chapter Five: The Day and Night Observatory / 71 \\ Chapter Six: The Perfect Solar Storm / 80 \\ Chapter Seven: In the Grip of the Sun / 93 \\ Chapter Eight: The Greatest Prize of All / 98 \\ Chapter Nine: Death at the Devil's Jumps / 117 \\ Chapter Ten: The Sun's Librarian / 129 \\ Chapter Eleven: New Flare, New Storm, New Understanding / 148 \\ Chapter Twelve: The Waiting Game / 168 \\ Chapter Thirteen: The Cloud Chamber / 179 \\ Epilogue: Magnetar Spring / 188 \\ Bibliography / 191 \\ Index / 207

entry:
@Book{Clark:2009:SKU,
  author =       "Stuart (Stuart G.) Clark",
  title =        "The {Sun Kings}: the unexpected tragedy of {Richard
                 Carrington} and the tale of how modern astronomy
                 began",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xii + 211",
  year =         "2009",
  ISBN =         "0-691-14126-6 (paperback)",
  ISBN-13 =      "978-0-691-14126-8 (paperback)",
  LCCN =         "M09.E06300",
  bibdate =      "Thu Nov 12 16:40:25 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/physperspect.bib;
                 library.ox.ac.uk:210/ADVANCE",
  URL =          "http://press.princeton.edu/titles/8370.html",
  abstract =     "Recounts the story behind English astronomer Richard
                 Carrington's observations of a mysterious explosion on
                 the surface of the sun and how his understanding that
                 the sun's magnetism directly influences the Earth
                 helped usher in the modern era of astronomy.",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: 2007.",
  subject =      "Carrington, Richard Christopher; astronomy; England;
                 19th Century history; solar flares; observations; sun;
                 Carrington, Richard Christopher; Herschel, William,
                 Sir; Herschel, John F. W (John Frederick William), Sir;
                 Maunder, E. Walter (Edward Walter); Hale, George
                 Ellery; Carrington, Richard Christopher; Herschel,
                 William; Herschel, John Frederick William; Maunder,
                 Edward Walter; Hale, George Ellery; Astronomers; Great
                 Britain; Biography; Solar flares; Observations;
                 History; 19th century; Astronomes; Grande-Bretagne;
                 Biographies; {\'E}ruptions solaires; 19e si{\`e}cle;
                 Soleil; Sun; 19th century",
  subject-dates = "Richard Carrington (1826--1875); Sir William Herschel
                 (1738--1822); John F. W. Herschel (1792--1871); E.
                 Walter Maunder (1851--1928); George Ellery Hale
                 (1868--1938)",
  tableofcontents = "List of Illustrations / ix \\
                 Acknowledgments / xi \\
                 Prologue: The Dog Years / 1 \\
                 Chapter One: The First Swallow of Summer / 9 \\
                 Chapter Two: Herschel's Grand Absurdity / 25 \\
                 Chapter Three: The Magnetic Crusade / 47 \\
                 Chapter Four: The Solar Lockstep / 58 \\
                 Chapter Five: The Day and Night Observatory / 71 \\
                 Chapter Six: The Perfect Solar Storm / 80 \\
                 Chapter Seven: In the Grip of the Sun / 93 \\
                 Chapter Eight: The Greatest Prize of All / 98 \\
                 Chapter Nine: Death at the Devil's Jumps / 117 \\
                 Chapter Ten: The Sun's Librarian / 129 \\
                 Chapter Eleven: New Flare, New Storm, New Understanding
                 / 148 \\
                 Chapter Twelve: The Waiting Game / 168 \\
                 Chapter Thirteen: The Cloud Chamber / 179 \\
                 Epilogue: Magnetar Spring / 188 \\
                 Bibliography / 191 \\
                 Index / 207",
}


bibtype: book
filename: master.bib
label: Clawson:1994:MTE
author: Calvin C. Clawson
title: The Mathematical Traveler: Exploring the Grand History of Numbers
publisher: pub-PLENUM
address: pub-PLENUM:adr
pages: x + 307
year: 1994
ISBN: 0-306-44645-6 OR 0306446456
ISBN13: 978-0-306-44645-0 OR 9780306446450
LCCN: QA141 .C52 1994
bibdate: Wed Dec 31 11:51:02 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/pi.bib
bibtimestamp: 1997.12.31 11:51:02 ???
subject: Numeration; Counting; Counting; Numeration; Getaltheorie; Geschichte; Zahlentheorie
acknowledgement: ack-nhfb
rawauthor: Calvin C. Clawson
rawtitle: The Mathematical Traveler: Exploring the Grand History of Numbers
abstract:
The story of numbers is a rich, sweeping history that shows how our mathematical achievements contributed to the greatest innovations of civilization. Calvin Clawson, acclaimed author of booktitle Conquering Math Phobia, weaves a story of numbers that spans thousands of years. As Clawson so clearly shows, numbers are not only an intrinsic and essential thread in our modern lives, but have always been an integral part of the human psyche --- knit into the very fabric of our identity as humans. Clawson travels back through time to the roots of the history of numbers. In exploring early human fascination with numbers, he unearths the clay beads, knotted ropes, and tablets used by our ancestors as counting tools. He then investigates how numeric symbols and concepts developed uniquely and independently in Meso-America, China, and Egypt. As he persuasively argues, the mathematical concepts that arose and flourished in the ancient world enabled the creation of architectural masterpieces as well as the establishment of vast trade networks. Continuing the journey, Clawson brings us to the elegant logic of numbers that soon came to distinguish itself as a discipline and the language of science. From the concepts of infinity contemplated by the Greeks to the complex numbers that are indispensable to scientists on the cutting edge of research today, Clawson breathes life and meaning into the history of great mathematical mysteries and problems. In this spirit of inquiry, he explores, in their times and places, the discovery of numbers that lie outside the province of counting, including irrational numbers, transcendentals, complex numbers, and the enormous transfinite numbers. The personalities and the creative feats surrounding each mathematical invention come alive vividly in Clawson's lucid prose. In this work of breathtaking scope, Clawson guides us through the wonders of numbers and illustrates their monumental impact on civilization.

TOC:
Acknowledgments / vii Introduction / 1 1: How Do We Count? / 5 2: Early Counting / 19 3: Counting in Other Species: How Smart Are They? / 37 4: Ancient Numbers / 49 5: Chinese and New World Numbers / 77 6: Problems in Paradise / 95 7: The Negative Numbers / 121 8: Dealing with the Infinite / 135 9: Dedekind's Cut: Irrational Numbers / 161 10: Story of $pi $: Transcendental Numbers / 181 11: Expanding the Kingdom: Complex Numbers / 207 12: Really Big: Transfinite Numbers / 223 13: The Genius Calculators / 233 14: What Does It All Mean? / 247 15: Numbers: Past, Present, and Future / 263 End Notes / 281 Glossary / 289 Bibliography / 299 Index / 303

rawabstract:
The story of numbers is a rich, sweeping history that shows how our mathematical achievements contributed to the greatest innovations of civilization. Calvin Clawson, acclaimed author of \booktitle{Conquering Math Phobia}, weaves a story of numbers that spans thousands of years. As Clawson so clearly shows, numbers are not only an intrinsic and essential thread in our modern lives, but have always been an integral part of the human psyche --- knit into the very fabric of our identity as humans. Clawson travels back through time to the roots of the history of numbers. In exploring early human fascination with numbers, he unearths the clay beads, knotted ropes, and tablets used by our ancestors as counting tools. He then investigates how numeric symbols and concepts developed uniquely and independently in Meso-America, China, and Egypt. As he persuasively argues, the mathematical concepts that arose and flourished in the ancient world enabled the creation of architectural masterpieces as well as the establishment of vast trade networks. Continuing the journey, Clawson brings us to the elegant logic of numbers that soon came to distinguish itself as a discipline and the language of science. From the concepts of infinity contemplated by the Greeks to the complex numbers that are indispensable to scientists on the cutting edge of research today, Clawson breathes life and meaning into the history of great mathematical mysteries and problems. In this spirit of inquiry, he explores, in their times and places, the discovery of numbers that lie outside the province of counting, including irrational numbers, transcendentals, complex numbers, and the enormous transfinite numbers. The personalities and the creative feats surrounding each mathematical invention come alive vividly in Clawson's lucid prose. In this work of breathtaking scope, Clawson guides us through the wonders of numbers and illustrates their monumental impact on civilization.

rawTOC:
Acknowledgments / vii \\ Introduction / 1 \\ 1: How Do We Count? / 5 \\ 2: Early Counting / 19 \\ 3: Counting in Other Species: How Smart Are They? / 37 \\ 4: Ancient Numbers / 49 \\ 5: Chinese and New World Numbers / 77 \\ 6: Problems in Paradise / 95 \\ 7: The Negative Numbers / 121 \\ 8: Dealing with the Infinite / 135 \\ 9: Dedekind's Cut: Irrational Numbers / 161 \\ 10: Story of $\pi$: Transcendental Numbers / 181 \\ 11: Expanding the Kingdom: Complex Numbers / 207 \\ 12: Really Big: Transfinite Numbers / 223 \\ 13: The Genius Calculators / 233 \\ 14: What Does It All Mean? / 247 \\ 15: Numbers: Past, Present, and Future / 263 \\ End Notes / 281 \\ Glossary / 289 \\ Bibliography / 299 \\ Index / 303

entry:
@Book{Clawson:1994:MTE,
  author =       "Calvin C. Clawson",
  title =        "The Mathematical Traveler: Exploring the Grand History
                 of Numbers",
  publisher =    pub-PLENUM,
  address =      pub-PLENUM:adr,
  pages =        "x + 307",
  year =         "1994",
  ISBN =         "0-306-44645-6",
  ISBN-13 =      "978-0-306-44645-0",
  LCCN =         "QA141 .C52 1994",
  bibdate =      "Wed Dec 31 11:51:02 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/pi.bib",
  price =        "US\$25.95",
  abstract =     "The story of numbers is a rich, sweeping history that
                 shows how our mathematical achievements contributed to
                 the greatest innovations of civilization. Calvin
                 Clawson, acclaimed author of \booktitle{Conquering Math
                 Phobia}, weaves a story of numbers that spans thousands
                 of years. As Clawson so clearly shows, numbers are not
                 only an intrinsic and essential thread in our modern
                 lives, but have always been an integral part of the
                 human psyche --- knit into the very fabric of our
                 identity as humans. Clawson travels back through time
                 to the roots of the history of numbers. In exploring
                 early human fascination with numbers, he unearths the
                 clay beads, knotted ropes, and tablets used by our
                 ancestors as counting tools. He then investigates how
                 numeric symbols and concepts developed uniquely and
                 independently in Meso-America, China, and Egypt. As he
                 persuasively argues, the mathematical concepts that
                 arose and flourished in the ancient world enabled the
                 creation of architectural masterpieces as well as the
                 establishment of vast trade networks. Continuing the
                 journey, Clawson brings us to the elegant logic of
                 numbers that soon came to distinguish itself as a
                 discipline and the language of science. From the
                 concepts of infinity contemplated by the Greeks to the
                 complex numbers that are indispensable to scientists on
                 the cutting edge of research today, Clawson breathes
                 life and meaning into the history of great mathematical
                 mysteries and problems. In this spirit of inquiry, he
                 explores, in their times and places, the discovery of
                 numbers that lie outside the province of counting,
                 including irrational numbers, transcendentals, complex
                 numbers, and the enormous transfinite numbers. The
                 personalities and the creative feats surrounding each
                 mathematical invention come alive vividly in Clawson's
                 lucid prose. In this work of breathtaking scope,
                 Clawson guides us through the wonders of numbers and
                 illustrates their monumental impact on civilization.",
  acknowledgement = ack-nhfb,
  subject =      "Numeration; Counting; Counting; Numeration;
                 Getaltheorie; Geschichte; Zahlentheorie",
  tableofcontents = "Acknowledgments / vii \\
                 Introduction / 1 \\
                 1: How Do We Count? / 5 \\
                 2: Early Counting / 19 \\
                 3: Counting in Other Species: How Smart Are They? / 37
                 \\
                 4: Ancient Numbers / 49 \\
                 5: Chinese and New World Numbers / 77 \\
                 6: Problems in Paradise / 95 \\
                 7: The Negative Numbers / 121 \\
                 8: Dealing with the Infinite / 135 \\
                 9: Dedekind's Cut: Irrational Numbers / 161 \\
                 10: Story of $\pi$: Transcendental Numbers / 181 \\
                 11: Expanding the Kingdom: Complex Numbers / 207 \\
                 12: Really Big: Transfinite Numbers / 223 \\
                 13: The Genius Calculators / 233 \\
                 14: What Does It All Mean? / 247 \\
                 15: Numbers: Past, Present, and Future / 263 \\
                 End Notes / 281 \\
                 Glossary / 289 \\
                 Bibliography / 299 \\
                 Index / 303",
}


bibtype: book
filename: master.bib
label: Cleaveland:1977:GPL
author: J. Craig Cleaveland and Robert C. Uzgalis
title: Grammars for Programming Languages
volume: 4
publisher: pub-ELSEVIER
address: pub-ELSEVIER:adr
pages: xiii + 154
year: 1977
LCCN: QA76.7.C571
bibdate: Tue Dec 14 23:28:27 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:28:27 ???
series: Programming Languages Series, Editor: Thomas E. Cheatham
acknowledgement: ack-nhfb
rawauthor: J. Craig Cleaveland and Robert C. Uzgalis
rawtitle: Grammars for Programming Languages
ISBN:
0-444-00187-5 (hardcover), 0-444-00199-9 (paperback) OR 0444001875 (hardcover), 0444001999 (paperback)

ISBN13:
978-0-444-00187-0 (hardcover), 978-0-444-00199-3 (paperback) OR 9780444001870 (hardcover), 9780444001993 (paperback)

entry:
@Book{Cleaveland:1977:GPL,
  author =       "J. Craig Cleaveland and Robert C. Uzgalis",
  title =        "Grammars for Programming Languages",
  volume =       "4",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  pages =        "xiii + 154",
  year =         "1977",
  ISBN =         "0-444-00187-5 (hardcover), 0-444-00199-9 (paperback)",
  ISBN-13 =      "978-0-444-00187-0 (hardcover), 978-0-444-00199-3
                 (paperback)",
  LCCN =         "QA76.7.C571",
  bibdate =      "Tue Dec 14 23:28:27 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  series =       "Programming Languages Series, Editor: Thomas E.
                 Cheatham",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Clegg:2003:BHI
author: Brian Clegg
title: A Brief History of Infinity: The Quest to Think the Unthinkable
publisher: Robinson
address: London, UK
pages: 255
year: 2003
ISBN: 1-84119-650-9 OR 1841196509
ISBN13: 978-1-84119-650-3 OR 9781841196503
LCCN: BD411 .C57 2003
bibdate: Wed Nov 26 05:33:08 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2003.11.26 05:33:08 ???
acknowledgement: ack-nhfb
rawauthor: Brian Clegg
rawtitle: A Brief History of Infinity: The Quest to Think the Unthinkable
abstract:
Infinity is a concept that fascinates everyone from a seven-year-old child to a maths professor. So remarkable and strange is it that contemplating it has driven at least two great mathematicians over the edge into insanity. Where did the concept of infinity come from? Who were the people who originally defined and later refined this paradoxical quantity? Why is infinity, a concept we can never experience or truly grasp, at the heart of science? How can some infinities be bigger than others? An exploration of the most mind-boggling feature of maths and physics, this work examines amazing paradoxes, for example Hilbert's Hotel. This imaginary resort has an infinite number of rooms, which all happen to be occupied. Unfortunately an endless coach turns up carrying an infinite number of new guests. It's not a problem though --- it's easy to prove they can all be accommodated. The book also looks at: the people who devised and refined the concept, the many mind-bending paradoxes of infinity, infinity's place at the heart of mathematics and science in processes such as calculus, how dividing by zero brings infinity into view and infinity and cosmos.

rawabstract:
Infinity is a concept that fascinates everyone from a seven-year-old child to a maths professor. So remarkable and strange is it that contemplating it has driven at least two great mathematicians over the edge into insanity. Where did the concept of infinity come from? Who were the people who originally defined and later refined this paradoxical quantity? Why is infinity, a concept we can never experience or truly grasp, at the heart of science? How can some infinities be bigger than others? An exploration of the most mind-boggling feature of maths and physics, this work examines amazing paradoxes, for example Hilbert's Hotel. This imaginary resort has an infinite number of rooms, which all happen to be occupied. Unfortunately an endless coach turns up carrying an infinite number of new guests. It's not a problem though --- it's easy to prove they can all be accommodated. The book also looks at: the people who devised and refined the concept, the many mind-bending paradoxes of infinity, infinity's place at the heart of mathematics and science in processes such as calculus, how dividing by zero brings infinity into view and infinity and cosmos.

entry:
@Book{Clegg:2003:BHI,
  author =       "Brian Clegg",
  title =        "A Brief History of Infinity: The Quest to Think the
                 Unthinkable",
  publisher =    "Robinson",
  address =      "London, UK",
  pages =        "255",
  year =         "2003",
  ISBN =         "1-84119-650-9",
  ISBN-13 =      "978-1-84119-650-3",
  LCCN =         "BD411 .C57 2003",
  bibdate =      "Wed Nov 26 05:33:08 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "UK\pounds 8.99",
  abstract =     "Infinity is a concept that fascinates everyone from a
                 seven-year-old child to a maths professor. So
                 remarkable and strange is it that contemplating it has
                 driven at least two great mathematicians over the edge
                 into insanity. Where did the concept of infinity come
                 from? Who were the people who originally defined and
                 later refined this paradoxical quantity? Why is
                 infinity, a concept we can never experience or truly
                 grasp, at the heart of science? How can some infinities
                 be bigger than others? An exploration of the most
                 mind-boggling feature of maths and physics, this work
                 examines amazing paradoxes, for example Hilbert's
                 Hotel. This imaginary resort has an infinite number of
                 rooms, which all happen to be occupied. Unfortunately
                 an endless coach turns up carrying an infinite number
                 of new guests. It's not a problem though --- it's easy
                 to prove they can all be accommodated. The book also
                 looks at: the people who devised and refined the
                 concept, the many mind-bending paradoxes of infinity,
                 infinity's place at the heart of mathematics and
                 science in processes such as calculus, how dividing by
                 zero brings infinity into view and infinity and
                 cosmos.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Clegg:2009:BBB
author: Brian Clegg
title: Before the Big Bang: the prehistory of our universe
publisher: St. Martin's Press
address: New York, NY, USA
pages: 306
year: 2009
ISBN: 0-312-38547-1 OR 0312385471
ISBN13: 978-0-312-38547-7 OR 9780312385477
LCCN: QB981 .C627 2009
bibdate: Mon Jun 13 16:38:13 MDT 2011
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2011.06.13 16:38:13 MDT
subject: Cosmology; Big bang theory
acknowledgement: ack-nhfb
rawauthor: Brian Clegg
rawtitle: Before the {Big Bang}: the prehistory of our universe
URL:
http://www.loc.gov/catdir/enhancements/fy0908/2008046035-b.html; http://www.loc.gov/catdir/enhancements/fy0908/2008046035-d.html

abstract:
Explores the history of the big bang theory while considering the myriad beliefs about what may have compelled it, providing coverage of such topics as creation myths, the discovery of other galaxies, and ongoing debates about black holes.

TOC:
Big bang primer Enter the creator What and how big? How old? A bang or a whimper? Keeping things steady Inflating the truth Let there be time Groundhog universe Living in a bubble Welcome to the matrix Snapshot universe

rawabstract:
Explores the history of the big bang theory while considering the myriad beliefs about what may have compelled it, providing coverage of such topics as creation myths, the discovery of other galaxies, and ongoing debates about black holes.

rawTOC:
Big bang primer \\ Enter the creator \\ What and how big? \\ How old? \\ A bang or a whimper? \\ Keeping things steady \\ Inflating the truth \\ Let there be time \\ Groundhog universe \\ Living in a bubble \\ Welcome to the matrix \\ Snapshot universe

entry:
@Book{Clegg:2009:BBB,
  author =       "Brian Clegg",
  title =        "Before the {Big Bang}: the prehistory of our
                 universe",
  publisher =    "St. Martin's Press",
  address =      "New York, NY, USA",
  pages =        "306",
  year =         "2009",
  ISBN =         "0-312-38547-1",
  ISBN-13 =      "978-0-312-38547-7",
  LCCN =         "QB981 .C627 2009",
  bibdate =      "Mon Jun 13 16:38:13 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0908/2008046035-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0908/2008046035-d.html",
  abstract =     "Explores the history of the big bang theory while
                 considering the myriad beliefs about what may have
                 compelled it, providing coverage of such topics as
                 creation myths, the discovery of other galaxies, and
                 ongoing debates about black holes.",
  acknowledgement = ack-nhfb,
  subject =      "Cosmology; Big bang theory",
  tableofcontents = "Big bang primer \\
                 Enter the creator \\
                 What and how big? \\
                 How old? \\
                 A bang or a whimper? \\
                 Keeping things steady \\
                 Inflating the truth \\
                 Let there be time \\
                 Groundhog universe \\
                 Living in a bubble \\
                 Welcome to the matrix \\
                 Snapshot universe",
}


bibtype: book
filename: master.bib
label: Clews:1988:LAW
author: John Clews
title: Language automation worldwide: the development of character set standards
number: 5962
publisher: SESAME Computer Projects
address: Harrogate, North Yorkshire, UK
pages: 104
year: 1988
ISBN: 1-870095-01-4 OR 1870095014
ISBN13: 978-1-870095-01-3 OR 9781870095013
LCCN: QA76.5 .C54 1988
bibdate: Mon Jul 21 09:08:40 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unicode.bib
bibtimestamp: 1997.07.21 09:08:40 ???
series: British Library R & D reports
acknowledgement: ack-nhfb
rawauthor: John Clews
rawtitle: Language automation worldwide: the development of character set standards
TOC:
Abstract / iii Acknowledgements / iii Introduction / 1 1. Coded Character Sets, Scripts and Standards in Library Automation / 4 1.1 Scripts / 8 1.2 Standards / 12 1.3 International Standards / 12 1.3.1 The standardization process / 12 1.3.2 The scope and origins of ISO / 13 1.3.3 National members of ISO / 13 1.3.4 The Technical Committee structure within ISO / 15 1.3.5 Liaison members / 15 1.3.6 ISO Technical Committee 97 / 16 1.3.7 ISO Technical Committee 46 / 16 1.4 National Standards / 19 1.5 De facto Standards - / 19 1.6 Industry Standards / 20 2. Roman Script Character Sets: Accommodating Additional Characters / 21 2.1 Substitution / 21 2.2 Control Functions Related to Code Extension Techniques / 22 2.3 Escape sequences: ISO 2022, ISO 2375 and the International Register / 25 2.4 Registration / 26 2.5 Non-standard Uses of Escape Sequences in Library Systems / 26 2.5.1 Escape sequences in UNIMARC / 28 2.5.2 Escape sequences in USMARC and related exchange formats / 29 3. Graphic Character Sets for Libraries / 31 3.1 USMARC / 31 3.2 National Variants of USMARC / 35 3.3 EBCDIC / 36 3.4 Bibliographic Uses of EBCDIC / 37 3.5 Latin Alphabet Character Sets of IS0/TC46 / 39 3.6 ISO 5426 / 42 3.7 ISO 6438 - African Character Set / 44 3.8 International Phonetic Alphabet Character Set / 46 3.9 ISO 6862 (Mathematical Symbols) / 49 4. 8 bit Graphic Character Sets Developed by ISO/TC97/SC2 / 50 4.1 ISO 4873 / 50 4.2 ISO 6937 / 52 4.3 ISO 8859 / 56 4.4 Future Development of 8-bit Codes / 63 5. Character Set Standards for Other European Scripts / 64 5.1 ISO/TC97 Character Sets for Cyrillic Script / 65 5.2 ISO/TC46 Character Sets for Cyrillic Script / 74 5.3 Non-Slavonic Cyrillic Character Sets / 74 5.4 Character Sets for American and Georgian / 74 5.5 ISO/TC97 Character Sets for Greek Script / 88 5.6 ISO/TC46 Character Sets for Greek Script / 88 5.7 Duplication of Effort Within ISO / 88 6. Character Sets for North African and Middle Eastern Scripts / 93 6.1 Hebrew Script / 93 6.2 Arabic Script / 98 6.3 Maldivian Script / 105 6.4 Amharic Script / 107 7. Character Sets for South Asian Scripts / 108 7.1 ISCII / 112 7.2 Sinhalese / 118 7.3 Tibetan / 119 7.4 Conjunct Letters / 121 8. Character Sets for South East Asian Scripts / 122 8.1 Burmese / 122 8.2 Khmer / 122 8.3 Tai Scripts / 124 9. Character Sets for East Asian Scripts / 128 9.1 Chinese Script / 129 9.2 Other Scripts of China / 122 9.3 Korean Script / 124 9.4 Japanese Script / 126 10. Multiple-byte Coded Character Sets for East Asian Scripts / 138 10.1 Japan and its Influence on Other National Standards / 138 10.2 Korea / 142 10.3 China / 44 10.4 Taiwan / 146 10.5 Handling of Variant Forms in CCCII / 148 11. International Standardization of Multiple-byte Coded Character Sets / 150 11.1 REACC / 150 11.2 EACC / 150 11.3 Layers in EACC / 125 11.4 An ISO/TC46 Multiple-byte Character Set / 157 11.5 The IS0/TC97 Multiple-byte Character Set / 157 11.6 Non-locking shifts / 160 11.7 Locking shifts / 162 11.8 Multiple-byte code extension for bibliographic needs / 162 11.9 Registration issues / 164 12. Convergence of Interests in Character Set Standardization / 165

rawTOC:
Abstract / iii \\ Acknowledgements / iii \\ Introduction / 1 \\ 1. Coded Character Sets, Scripts and Standards in Library Automation / 4 \\ 1.1 Scripts / 8 \\ 1.2 Standards / 12 \\ 1.3 International Standards / 12 \\ 1.3.1 The standardization process / 12 \\ 1.3.2 The scope and origins of ISO / 13 \\ 1.3.3 National members of ISO / 13 \\ 1.3.4 The Technical Committee structure within ISO / 15 \\ 1.3.5 Liaison members / 15 \\ 1.3.6 ISO Technical Committee 97 / 16 \\ 1.3.7 ISO Technical Committee 46 / 16 \\ 1.4 National Standards / 19 \\ 1.5 De facto Standards - / 19 \\ 1.6 Industry Standards / 20 \\ 2. Roman Script Character Sets: Accommodating Additional Characters / 21 \\ 2.1 Substitution / 21 \\ 2.2 Control Functions Related to Code Extension Techniques / 22 \\ 2.3 Escape sequences: ISO 2022, ISO 2375 and the International Register / 25 \\ 2.4 Registration / 26 \\ 2.5 Non-standard Uses of Escape Sequences in Library Systems / 26 \\ 2.5.1 Escape sequences in UNIMARC / 28 \\ 2.5.2 Escape sequences in USMARC and related exchange formats / 29 \\ 3. Graphic Character Sets for Libraries / 31 \\ 3.1 USMARC / 31 \\ 3.2 National Variants of USMARC / 35 \\ 3.3 EBCDIC / 36 \\ 3.4 Bibliographic Uses of EBCDIC / 37 \\ 3.5 Latin Alphabet Character Sets of IS0/TC46 / 39 \\ 3.6 ISO 5426 / 42 \\ 3.7 ISO 6438 - African Character Set / 44 \\ 3.8 International Phonetic Alphabet Character Set / 46 \\ 3.9 ISO 6862 (Mathematical Symbols) / 49 \\ 4. 8 bit Graphic Character Sets Developed by ISO/TC97/SC2 / 50 \\ 4.1 ISO 4873 / 50 \\ 4.2 ISO 6937 / 52 \\ 4.3 ISO 8859 / 56 \\ 4.4 Future Development of 8-bit Codes / 63 \\ 5. Character Set Standards for Other European Scripts / 64 \\ 5.1 ISO/TC97 Character Sets for Cyrillic Script / 65 \\ 5.2 ISO/TC46 Character Sets for Cyrillic Script / 74 \\ 5.3 Non-Slavonic Cyrillic Character Sets / 74 \\ 5.4 Character Sets for American and Georgian / 74 \\ 5.5 ISO/TC97 Character Sets for Greek Script / 88 \\ 5.6 ISO/TC46 Character Sets for Greek Script / 88 \\ 5.7 Duplication of Effort Within ISO / 88 \\ 6. Character Sets for North African and Middle Eastern Scripts / 93 \\ 6.1 Hebrew Script / 93 \\ 6.2 Arabic Script / 98 \\ 6.3 Maldivian Script / 105 \\ 6.4 Amharic Script / 107 \\ 7. Character Sets for South Asian Scripts / 108 \\ 7.1 ISCII / 112 \\ 7.2 Sinhalese / 118 \\ 7.3 Tibetan / 119 \\ 7.4 Conjunct Letters / 121 \\ 8. Character Sets for South East Asian Scripts / 122 \\ 8.1 Burmese / 122 \\ 8.2 Khmer / 122 \\ 8.3 Tai Scripts / 124 \\ 9. Character Sets for East Asian Scripts / 128 \\ 9.1 Chinese Script / 129 \\ 9.2 Other Scripts of China / 122 \\ 9.3 Korean Script / 124 \\ 9.4 Japanese Script / 126 \\ 10. Multiple-byte Coded Character Sets for East Asian Scripts / 138 \\ 10.1 Japan and its Influence on Other National Standards / 138 \\ 10.2 Korea / 142 \\ 10.3 China / 44 \\ 10.4 Taiwan / 146 \\ 10.5 Handling of Variant Forms in CCCII / 148 \\ 11. International Standardization of Multiple-byte Coded Character Sets / 150 \\ 11.1 REACC / 150 \\ 11.2 EACC / 150 \\ 11.3 Layers in EACC / 125 \\ 11.4 An ISO/TC46 Multiple-byte Character Set / 157 \\ 11.5 The IS0/TC97 Multiple-byte Character Set / 157 \\ 11.6 Non-locking shifts / 160 \\ 11.7 Locking shifts / 162 \\ 11.8 Multiple-byte code extension for bibliographic needs / 162 \\ 11.9 Registration issues / 164 \\ 12. Convergence of Interests in Character Set Standardization / 165

entry:
@Book{Clews:1988:LAW,
  author =       "John Clews",
  title =        "Language automation worldwide: the development of
                 character set standards",
  number =       "5962",
  publisher =    "SESAME Computer Projects",
  address =      "Harrogate, North Yorkshire, UK",
  pages =        "104",
  year =         "1988",
  ISBN =         "1-870095-01-4",
  ISBN-13 =      "978-1-870095-01-3",
  LCCN =         "QA76.5 .C54 1988",
  bibdate =      "Mon Jul 21 09:08:40 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unicode.bib",
  series =       "British Library R \& D reports",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Abstract / iii \\
                 Acknowledgements / iii \\
                 Introduction / 1 \\
                 1. Coded Character Sets, Scripts and Standards in
                 Library Automation / 4 \\
                 1.1 Scripts / 8 \\
                 1.2 Standards / 12 \\
                 1.3 International Standards / 12 \\
                 1.3.1 The standardization process / 12 \\
                 1.3.2 The scope and origins of ISO / 13 \\
                 1.3.3 National members of ISO / 13 \\
                 1.3.4 The Technical Committee structure within ISO / 15
                 \\
                 1.3.5 Liaison members / 15 \\
                 1.3.6 ISO Technical Committee 97 / 16 \\
                 1.3.7 ISO Technical Committee 46 / 16 \\
                 1.4 National Standards / 19 \\
                 1.5 De facto Standards - / 19 \\
                 1.6 Industry Standards / 20 \\
                 2. Roman Script Character Sets: Accommodating
                 Additional Characters / 21 \\
                 2.1 Substitution / 21 \\
                 2.2 Control Functions Related to Code Extension
                 Techniques / 22 \\
                 2.3 Escape sequences: ISO 2022, ISO 2375 and the
                 International Register / 25 \\
                 2.4 Registration / 26 \\
                 2.5 Non-standard Uses of Escape Sequences in Library
                 Systems / 26 \\
                 2.5.1 Escape sequences in UNIMARC / 28 \\
                 2.5.2 Escape sequences in USMARC and related exchange
                 formats / 29 \\
                 3. Graphic Character Sets for Libraries / 31 \\
                 3.1 USMARC / 31 \\
                 3.2 National Variants of USMARC / 35 \\
                 3.3 EBCDIC / 36 \\
                 3.4 Bibliographic Uses of EBCDIC / 37 \\
                 3.5 Latin Alphabet Character Sets of IS0/TC46 / 39 \\
                 3.6 ISO 5426 / 42 \\
                 3.7 ISO 6438 - African Character Set / 44 \\
                 3.8 International Phonetic Alphabet Character Set / 46
                 \\
                 3.9 ISO 6862 (Mathematical Symbols) / 49 \\
                 4. 8 bit Graphic Character Sets Developed by
                 ISO/TC97/SC2 / 50 \\
                 4.1 ISO 4873 / 50 \\
                 4.2 ISO 6937 / 52 \\
                 4.3 ISO 8859 / 56 \\
                 4.4 Future Development of 8-bit Codes / 63 \\
                 5. Character Set Standards for Other European Scripts /
                 64 \\
                 5.1 ISO/TC97 Character Sets for Cyrillic Script / 65
                 \\
                 5.2 ISO/TC46 Character Sets for Cyrillic Script / 74
                 \\
                 5.3 Non-Slavonic Cyrillic Character Sets / 74 \\
                 5.4 Character Sets for American and Georgian / 74 \\
                 5.5 ISO/TC97 Character Sets for Greek Script / 88 \\
                 5.6 ISO/TC46 Character Sets for Greek Script / 88 \\
                 5.7 Duplication of Effort Within ISO / 88 \\
                 6. Character Sets for North African and Middle Eastern
                 Scripts / 93 \\
                 6.1 Hebrew Script / 93 \\
                 6.2 Arabic Script / 98 \\
                 6.3 Maldivian Script / 105 \\
                 6.4 Amharic Script / 107 \\
                 7. Character Sets for South Asian Scripts / 108 \\
                 7.1 ISCII / 112 \\
                 7.2 Sinhalese / 118 \\
                 7.3 Tibetan / 119 \\
                 7.4 Conjunct Letters / 121 \\
                 8. Character Sets for South East Asian Scripts / 122
                 \\
                 8.1 Burmese / 122 \\
                 8.2 Khmer / 122 \\
                 8.3 Tai Scripts / 124 \\
                 9. Character Sets for East Asian Scripts / 128 \\
                 9.1 Chinese Script / 129 \\
                 9.2 Other Scripts of China / 122 \\
                 9.3 Korean Script / 124 \\
                 9.4 Japanese Script / 126 \\
                 10. Multiple-byte Coded Character Sets for East Asian
                 Scripts / 138 \\
                 10.1 Japan and its Influence on Other National
                 Standards / 138 \\
                 10.2 Korea / 142 \\
                 10.3 China / 44 \\
                 10.4 Taiwan / 146 \\
                 10.5 Handling of Variant Forms in CCCII / 148 \\
                 11. International Standardization of Multiple-byte
                 Coded Character Sets / 150 \\
                 11.1 REACC / 150 \\
                 11.2 EACC / 150 \\
                 11.3 Layers in EACC / 125 \\
                 11.4 An ISO/TC46 Multiple-byte Character Set / 157 \\
                 11.5 The IS0/TC97 Multiple-byte Character Set / 157 \\
                 11.6 Non-locking shifts / 160 \\
                 11.7 Locking shifts / 162 \\
                 11.8 Multiple-byte code extension for bibliographic
                 needs / 162 \\
                 11.9 Registration issues / 164 \\
                 12. Convergence of Interests in Character Set
                 Standardization / 165",
}


bibtype: book
filename: master.bib
label: Cline:1999:CF
author: Marshall Cline and Greg Lomow and Mike Girou
title: C++ FAQs
publisher: pub-AW
address: pub-AW:adr
pages: xxxiii + 587
year: 1999
ISBN: 0-201-30983-1 OR 0201309831
ISBN13: 978-0-201-30983-6 OR 9780201309836
LCCN: QA76.73.C153C55 1999
bibdate: Tue May 11 07:03:19 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.11 07:03:19 ???
acknowledgement: ack-nhfb
rawauthor: Marshall Cline and Greg Lomow and Mike Girou
rawtitle: {C++ FAQs}
entry:
@Book{Cline:1999:CF,
  author =       "Marshall Cline and Greg Lomow and Mike Girou",
  title =        "{C++ FAQs}",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxxiii + 587",
  year =         "1999",
  ISBN =         "0-201-30983-1",
  ISBN-13 =      "978-0-201-30983-6",
  LCCN =         "QA76.73.C153C55 1999",
  bibdate =      "Tue May 11 07:03:19 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$39.95",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
}


bibtype: article
filename: master.bib
label: Clinger:floating-point-input
author: William D. Clinger
title: How to Read Floating Point Numbers Accurately
journal: j-SIGPLAN
volume: 25
number: 6
pages: 92--101
month: jun
monthnumber: 6
year: 1990
bibdate: Sun May 2 07:47:01 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:47:01 ???
note: See also output algorithm in cite Steele:floating-point-output and cite Knuth:1990:SPW.
acknowledgement: ack-nhfb
rawauthor: William D. Clinger
rawnote: See also output algorithm in \cite{Steele:floating-point-output} and \cite{Knuth:1990:SPW}.
rawtitle: How to Read Floating Point Numbers Accurately
entry:
@Article{Clinger:floating-point-input,
  author =       "William D. Clinger",
  title =        "How to Read Floating Point Numbers Accurately",
  journal =      j-SIGPLAN,
  volume =       "25",
  number =       "6",
  pages =        "92--101",
  month =        jun,
  year =         "1990",
  bibdate =      "Sun May 2 07:47:01 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also output algorithm in
                 \cite{Steele:floating-point-output} and
                 \cite{Knuth:1990:SPW}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Close:2015:HLD
author: Frank E. Close
title: Half-life: the divided life of Bruno Pontecorvo, physicist or spy
publisher: pub-BASIC-BOOKS
address: pub-BASIC-BOOKS:adr
pages: xix + 378
year: 2015
LCCN: QC774.P66 C56 2014
bibdate: Thu Mar 5 05:45:53 MST 2015
bibtimestamp: 2015.03.05 05:45:53 MST
subject: Pontekorvo, Bruno (1913--1993); nuclear physicists; Soviet Union; biography; Italy; spies
acknowledgement: ack-nhfb
subjectdates: 1913--1993
rawauthor: Frank E. Close
rawtitle: Half-life: the divided life of {Bruno Pontecorvo}, physicist or spy
ISBN:
0-465-06998-3 (hardcover), 0-465-04487-5 (e-book), 1-78074-582-6 (e-book) OR 0465069983 (hardcover), 0465044875 (ebook), 1780745826 (ebook)

ISBN13:
978-0-465-06998-9 (hardcover), 978-0-465-04487-0 (e-book), 978-1-78074-582-4 (e-book) OR 9780465069989 (hardcover), 9780465044870 (ebook), 9781780745824 (ebook)

bibsource:
fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib; 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

abstract:
Bruno Pontecorvo dedicated his career to hunting for the Higgs boson of his day --- the neutrino, a nearly massless particle considered essential to the process of nuclear fission. His work on the Manhattan Project under Enrico Fermi confirmed his reputation as a brilliant physicist and helped usher in the nuclear age. He should have won a Nobel Prize, but late in the summer of 1950 he vanished. At the height of the Cold War, Pontecorvo had disappeared behind the Iron Curtain. In booktitle Half-Life, physicist and historian Frank Close offers a heretofore untold history of Pontecorvo's life, based on unprecedented access to his friends, family, and colleagues. With all the elements of a Cold War thriller --- classified atomic research, an infamous double agent, a kidnapping by Soviet operatives --- booktitle Half-Life is a history of particle physics at perhaps its most powerful: when it created the bomb.

TOC:
Preface / ix Prologue: Midway on life's journey / xi First half 1: From Pisa to Rome / 3 2: Slow neutrons and fast reactions: 1934--1936 / 12 3: Paris and politics: 1936--1940 / 28 4: The first escape: 1940 / 53 5: Neutrons for oil and war: 1940--1941 / 66 6: East and West: 1941--1942 / 77 7: The pile at Chalk River: 1943--1945 / 87 8: Physics in the open: 1945--1948 / 105 9: Maneuvers: 1945--1950 / 117 Interlude West to East / 127 Half time 10: Chain reaction: 1949--1950 / 147 11: From Abingdon --- to where?: 1950 / 160 12: The dear departed: 1950 / 180 13: The MI5 letters / 200 Second half 14: In dark woods / 213 15: Exile / 225 16: Resurrection / 243 17: Mr. Neutrino / 253 18: Private Bruno / 275 Afterlife 19: The right road lost / 299 Afterword / 307 Acknowledgments / 315 Acronyms / 318 Notes / 319 Bibliography / 363 Index / 367

rawabstract:
Bruno Pontecorvo dedicated his career to hunting for the Higgs boson of his day --- the neutrino, a nearly massless particle considered essential to the process of nuclear fission. His work on the Manhattan Project under Enrico Fermi confirmed his reputation as a brilliant physicist and helped usher in the nuclear age. He should have won a Nobel Prize, but late in the summer of 1950 he vanished. At the height of the Cold War, Pontecorvo had disappeared behind the Iron Curtain. In \booktitle{Half-Life}, physicist and historian Frank Close offers a heretofore untold history of Pontecorvo's life, based on unprecedented access to his friends, family, and colleagues. With all the elements of a Cold War thriller --- classified atomic research, an infamous double agent, a kidnapping by Soviet operatives --- \booktitle{Half-Life} is a history of particle physics at perhaps its most powerful: when it created the bomb.

rawTOC:
Preface / ix \\ Prologue: Midway on life's journey / xi \\ First half \\ 1: From Pisa to Rome / 3 \\ 2: Slow neutrons and fast reactions: 1934--1936 / 12 \\ 3: Paris and politics: 1936--1940 / 28 \\ 4: The first escape: 1940 / 53 \\ 5: Neutrons for oil and war: 1940--1941 / 66 \\ 6: East and West: 1941--1942 / 77 \\ 7: The pile at Chalk River: 1943--1945 / 87 \\ 8: Physics in the open: 1945--1948 / 105 \\ 9: Maneuvers: 1945--1950 / 117 \\ Interlude \\ West to East / 127 \\ Half time\\ 10: Chain reaction: 1949--1950 / 147 \\ 11: From Abingdon --- to where?: 1950 / 160 \\ 12: The dear departed: 1950 / 180 \\ 13: The MI5 letters / 200 \\ Second half \\ 14: In dark woods / 213 \\ 15: Exile / 225 \\ 16: Resurrection / 243 \\ 17: Mr. Neutrino / 253 \\ 18: Private Bruno / 275 \\ Afterlife \\ 19: The right road lost / 299 \\ Afterword / 307 \\ Acknowledgments / 315 \\ Acronyms / 318 \\ Notes / 319 \\ Bibliography / 363 \\ Index / 367

entry:
@Book{Close:2015:HLD,
  author =       "Frank E. Close",
  title =        "Half-life: the divided life of {Bruno Pontecorvo},
                 physicist or spy",
  publisher =    pub-BASIC-BOOKS,
  address =      pub-BASIC-BOOKS:adr,
  pages =        "xix + 378",
  year =         "2015",
  ISBN =         "0-465-06998-3 (hardcover), 0-465-04487-5 (e-book),
                 1-78074-582-6 (e-book)",
  ISBN-13 =      "978-0-465-06998-9 (hardcover), 978-0-465-04487-0
                 (e-book), 978-1-78074-582-4 (e-book)",
  LCCN =         "QC774.P66 C56 2014",
  bibdate =      "Thu Mar 5 05:45:53 MST 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/bibnet/authors/f/fermi-enrico.bib;
                 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",
  price =        "US\$29.99",
  abstract =     "Bruno Pontecorvo dedicated his career to hunting for
                 the Higgs boson of his day --- the neutrino, a nearly
                 massless particle considered essential to the process
                 of nuclear fission. His work on the Manhattan Project
                 under Enrico Fermi confirmed his reputation as a
                 brilliant physicist and helped usher in the nuclear
                 age. He should have won a Nobel Prize, but late in the
                 summer of 1950 he vanished. At the height of the Cold
                 War, Pontecorvo had disappeared behind the Iron
                 Curtain. In \booktitle{Half-Life}, physicist and
                 historian Frank Close offers a heretofore untold
                 history of Pontecorvo's life, based on unprecedented
                 access to his friends, family, and colleagues. With all
                 the elements of a Cold War thriller --- classified
                 atomic research, an infamous double agent, a kidnapping
                 by Soviet operatives --- \booktitle{Half-Life} is a
                 history of particle physics at perhaps its most
                 powerful: when it created the bomb.",
  acknowledgement = ack-nhfb,
  subject =      "Pontekorvo, Bruno (1913--1993); nuclear physicists;
                 Soviet Union; biography; Italy; spies",
  subject-dates = "1913--1993",
  tableofcontents = "Preface / ix \\
                 Prologue: Midway on life's journey / xi \\
                 First half \\
                 1: From Pisa to Rome / 3 \\
                 2: Slow neutrons and fast reactions: 1934--1936 / 12
                 \\
                 3: Paris and politics: 1936--1940 / 28 \\
                 4: The first escape: 1940 / 53 \\
                 5: Neutrons for oil and war: 1940--1941 / 66 \\
                 6: East and West: 1941--1942 / 77 \\
                 7: The pile at Chalk River: 1943--1945 / 87 \\
                 8: Physics in the open: 1945--1948 / 105 \\
                 9: Maneuvers: 1945--1950 / 117 \\
                 Interlude \\
                 West to East / 127 \\
                 Half time\\
                 10: Chain reaction: 1949--1950 / 147 \\
                 11: From Abingdon --- to where?: 1950 / 160 \\
                 12: The dear departed: 1950 / 180 \\
                 13: The MI5 letters / 200 \\
                 Second half \\
                 14: In dark woods / 213 \\
                 15: Exile / 225 \\
                 16: Resurrection / 243 \\
                 17: Mr. Neutrino / 253 \\
                 18: Private Bruno / 275 \\
                 Afterlife \\
                 19: The right road lost / 299 \\
                 Afterword / 307 \\
                 Acknowledgments / 315 \\
                 Acronyms / 318 \\
                 Notes / 319 \\
                 Bibliography / 363 \\
                 Index / 367",
}


bibtype: book
filename: master.bib
label: Cody:1980:SME
author: William J. Cody, Jr. and William Waite
title: Software Manual for the Elementary Functions
publisher: pub-PH
address: pub-PH:adr
pages: x + 269
year: 1980
ISBN: 0-13-822064-6 OR 0138220646
ISBN13: 978-0-13-822064-8 OR 9780138220648
LCCN: QA331 .C635 1980
bibdate: Tue Dec 14 23:28:38 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:28:38 ???
acknowledgement: ack-nhfb
rawauthor: William J. {Cody, Jr.} and William Waite
rawtitle: Software Manual for the Elementary Functions
TOC:
Preface / ix 1. Introduction / 1 2. Preliminaries / 3 3. Performance Testing / 11 4. SQRT / 17 a. General Discussion / 17 b. Flow Chart for SQRT(X) / 18 c. Implementation Notes, Non-Decimal Fixed-Point Machines / 19 d. Implementation Notes, Binary Floating-Point Machines / 23 e. Implementation Notes, Non-Binary Floating-Point Machines / 25 f. Testing / 28 5. ALOG/ALOG10 / 35 a. General Discussion / 35 b. Flow Chart for ALOG(X)/ALOG10(X) / 37 c. Implementation Notes, Non-Decimal Fixed-Point Machines / 38 d. Implementation Notes, Non-Decimal Floating-Point Machines / 42 e. Implementation Notes, Decimal Floating-Point Machines / 46 f. Testing / 49 6. EXP / 60 a. General Discussion / 60 b. Flow Chart for EXP(X) / 62 c. Implementation Notes, Non-Decimal Fixed-Point Machines / 63 d. Implementation Notes, Non-Decimal Floating-Point Machines / 67 e. Implementation Notes, Decimal Floating-Point Machines / 71 f. Testing / 75 7. POWER (**) / 84 a. General Discussion / 84 b. Flow Chart for POWER(X,Y) / 88 c. Implementation Notes, Non-Decimal Fixed-Point Machines / 90 d. Implementation Notes, Non-Decimal Floating-Point Machines / 97 e. Implementation Notes, Decimal Floating-Point Machines / 106 f. Testing / 113 8. SIN/COS / 125 a. General Discussion / 125 b. Flow Chart for SIN(X)/COS(X) / 127 c. Implementation Notes, Non-Decimal Fixed-Point Machines / 129 d. Implementation Notes, All Floating-Point Machines / 134 e. Testing / 139 9. TAN/COT / 150 a. General Discussion / 150 b. Flow Chart for TAN(X)/COTAN(X) / 152 c. Implementation Notes, Non-Decimal Fixed-Point Machines / 154 d. Implementation Notes, All Floating-Point Machines / 159 e. Testing / 164 10. ASIN/ACOS / 174 a. General Discuss i on / 174 b. Flow Chart for AS IN(X)/ACOS(X) / 176 c. Implementation Not es, Non-Decimal Fixed-Point Machines / 177 d. Implementation Notes, All Floating-Point Machines / 181 e. Testing / 185 11. ATAN/ATAN2 / 194 a. General Discussion / 194 b. Flow Chart for ATAN(X)/ATAN2(V,U) / 196 c. Implementation Notes, Non-Decimal Fixed-Point Machines / 198 d. Implementation Notes, All Floating-Point Machines / 203 e. Testing / 207 12. SINH/COSH / 217 a. General Discussion / 217 b. Flow Chart for SINH(X)/COSH(X) / 220 c. Implementation Notes, Non-Decimal Fixed-Point Machines / 221 d. Implementation Notes, All Floating-Point Machines / 225 e. Testing / 229

shortTOC:
Preface / ix 1. Introduction / 1 2. Preliminaries / 3 3. Performance Testing / 11 4. SQRT / 17 5. ALOG/ALOG10 / 35 6. EXP / 60 7. POWER (**) / 84 8. SIN/COS / 125 9. TAN/COT / 150 10. ASIN/ACOS / 174 11. ATAN/ATAN2 / 194 12. SINH/COSH / 217

rawshortTOC:
Preface / ix \\ 1. Introduction / 1 \\ 2. Preliminaries / 3 \\ 3. Performance Testing / 11 \\ 4. SQRT / 17 \\ 5. ALOG/ALOG10 / 35 \\ 6. EXP / 60 \\ 7. POWER (**) / 84 \\ 8. SIN/COS / 125 \\ 9. TAN/COT / 150 \\ 10. ASIN/ACOS / 174 \\ 11. ATAN/ATAN2 / 194 \\ 12. SINH/COSH / 217

rawTOC:
Preface / ix \\ 1. Introduction / 1 \\ 2. Preliminaries / 3 \\ 3. Performance Testing / 11 \\ 4. SQRT / 17 \\ a. General Discussion / 17 \\ b. Flow Chart for SQRT(X) / 18 \\ c. Implementation Notes, Non-Decimal Fixed-Point Machines / 19 \\ d. Implementation Notes, Binary Floating-Point Machines / 23 \\ e. Implementation Notes, Non-Binary Floating-Point Machines / 25 \\ f. Testing / 28 \\ 5. ALOG/ALOG10 / 35 \\ a. General Discussion / 35 \\ b. Flow Chart for ALOG(X)/ALOG10(X) / 37 \\ c. Implementation Notes, Non-Decimal Fixed-Point Machines / 38 \\ d. Implementation Notes, Non-Decimal Floating-Point Machines / 42 \\ e. Implementation Notes, Decimal Floating-Point Machines / 46 \\ f. Testing / 49 \\ 6. EXP / 60 \\ a. General Discussion / 60 \\ b. Flow Chart for EXP(X) / 62 \\ c. Implementation Notes, Non-Decimal Fixed-Point Machines / 63 \\ d. Implementation Notes, Non-Decimal Floating-Point Machines / 67 \\ e. Implementation Notes, Decimal Floating-Point Machines / 71 \\ f. Testing / 75 \\ 7. POWER (**) / 84 \\ a. General Discussion / 84 \\ b. Flow Chart for POWER(X,Y) / 88 \\ c. Implementation Notes, Non-Decimal Fixed-Point Machines / 90 \\ d. Implementation Notes, Non-Decimal Floating-Point Machines / 97 \\ e. Implementation Notes, Decimal Floating-Point Machines / 106 \\ f. Testing / 113 \\ 8. SIN/COS / 125 \\ a. General Discussion / 125 \\ b. Flow Chart for SIN(X)/COS(X) / 127 \\ c. Implementation Notes, Non-Decimal Fixed-Point Machines / 129 \\ d. Implementation Notes, All Floating-Point Machines / 134 \\ e. Testing / 139 \\ 9. TAN/COT / 150 \\ a. General Discussion / 150 \\ b. Flow Chart for TAN(X)/COTAN(X) / 152 \\ c. Implementation Notes, Non-Decimal Fixed-Point Machines / 154 \\ d. Implementation Notes, All Floating-Point Machines / 159 \\ e. Testing / 164 \\ 10. ASIN/ACOS / 174 \\ a. General Discuss i on / 174 \\ b. Flow Chart for AS IN(X)/ACOS(X) / 176 \\ c. Implementation Not es, Non-Decimal Fixed-Point Machines / 177 \\ d. Implementation Notes, All Floating-Point Machines / 181 \\ e. Testing / 185 \\ 11. ATAN/ATAN2 / 194 \\ a. General Discussion / 194 \\ b. Flow Chart for ATAN(X)/ATAN2(V,U) / 196 \\ c. Implementation Notes, Non-Decimal Fixed-Point Machines / 198 \\ d. Implementation Notes, All Floating-Point Machines / 203 \\ e. Testing / 207 \\ 12. SINH/COSH / 217 \\ a. General Discussion / 217 \\ b. Flow Chart for SINH(X)/COSH(X) / 220 \\ c. Implementation Notes, Non-Decimal Fixed-Point Machines / 221 \\ d. Implementation Notes, All Floating-Point Machines / 225 \\ e. Testing / 229

entry:
@Book{Cody:1980:SME,
  author =       "William J. {Cody, Jr.} and William Waite",
  title =        "Software Manual for the Elementary Functions",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 269",
  year =         "1980",
  ISBN =         "0-13-822064-6",
  ISBN-13 =      "978-0-13-822064-8",
  LCCN =         "QA331 .C635 1980",
  bibdate =      "Tue Dec 14 23:28:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Preface / ix \\
                 1. Introduction / 1 \\
                 2. Preliminaries / 3 \\
                 3. Performance Testing / 11 \\
                 4. SQRT / 17 \\
                 5. ALOG/ALOG10 / 35 \\
                 6. EXP / 60 \\
                 7. POWER (**) / 84 \\
                 8. SIN/COS / 125 \\
                 9. TAN/COT / 150 \\
                 10. ASIN/ACOS / 174 \\
                 11. ATAN/ATAN2 / 194 \\
                 12. SINH/COSH / 217",
  tableofcontents = "Preface / ix \\
                 1. Introduction / 1 \\
                 2. Preliminaries / 3 \\
                 3. Performance Testing / 11 \\
                 4. SQRT / 17 \\
                 a. General Discussion / 17 \\
                 b. Flow Chart for SQRT(X) / 18 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 19 \\
                 d. Implementation Notes, Binary Floating-Point Machines
                 / 23 \\
                 e. Implementation Notes, Non-Binary Floating-Point
                 Machines / 25 \\
                 f. Testing / 28 \\
                 5. ALOG/ALOG10 / 35 \\
                 a. General Discussion / 35 \\
                 b. Flow Chart for ALOG(X)/ALOG10(X) / 37 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 38 \\
                 d. Implementation Notes, Non-Decimal Floating-Point
                 Machines / 42 \\
                 e. Implementation Notes, Decimal Floating-Point
                 Machines / 46 \\
                 f. Testing / 49 \\
                 6. EXP / 60 \\
                 a. General Discussion / 60 \\
                 b. Flow Chart for EXP(X) / 62 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 63 \\
                 d. Implementation Notes, Non-Decimal Floating-Point
                 Machines / 67 \\
                 e. Implementation Notes, Decimal Floating-Point
                 Machines / 71 \\
                 f. Testing / 75 \\
                 7. POWER (**) / 84 \\
                 a. General Discussion / 84 \\
                 b. Flow Chart for POWER(X,Y) / 88 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 90 \\
                 d. Implementation Notes, Non-Decimal Floating-Point
                 Machines / 97 \\
                 e. Implementation Notes, Decimal Floating-Point
                 Machines / 106 \\
                 f. Testing / 113 \\
                 8. SIN/COS / 125 \\
                 a. General Discussion / 125 \\
                 b. Flow Chart for SIN(X)/COS(X) / 127 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 129 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 134 \\
                 e. Testing / 139 \\
                 9. TAN/COT / 150 \\
                 a. General Discussion / 150 \\
                 b. Flow Chart for TAN(X)/COTAN(X) / 152 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 154 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 159 \\
                 e. Testing / 164 \\
                 10. ASIN/ACOS / 174 \\
                 a. General Discuss i on / 174 \\
                 b. Flow Chart for AS IN(X)/ACOS(X) / 176 \\
                 c. Implementation Not es, Non-Decimal Fixed-Point
                 Machines / 177 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 181 \\
                 e. Testing / 185 \\
                 11. ATAN/ATAN2 / 194 \\
                 a. General Discussion / 194 \\
                 b. Flow Chart for ATAN(X)/ATAN2(V,U) / 196 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 198 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 203 \\
                 e. Testing / 207 \\
                 12. SINH/COSH / 217 \\
                 a. General Discussion / 217 \\
                 b. Flow Chart for SINH(X)/COSH(X) / 220 \\
                 c. Implementation Notes, Non-Decimal Fixed-Point
                 Machines / 221 \\
                 d. Implementation Notes, All Floating-Point Machines /
                 225 \\
                 e. Testing / 229",
}


bibtype: article
filename: master.bib
label: Cody:1984:PRW
title: A Proposed Radix- and Word-length-independent Standard for Floating-Point Arithmetic
journal: j-IEEE-MICRO
volume: 4
number: 4
pages: 86--100
month: jul
monthnumber: 7
year: 1984
CODEN: IEMIDZ
DOI: https://doi.org/10.1109/MM.1984.291224
ISSN: 0272-1732 (print), 1937-4143 (electronic) OR 02721732 (print), 19374143 (electronic)
ISSNL: 0272-1732 OR 02721732
bibdate: Thu Dec 14 06:08:58 MST 2000
bibtimestamp: 2000.12.14 06:08:58 MST
fjournal: IEEE Micro
acknowledgement: ack-nj
classcodes: C5230 (Digital arithmetic methods)
corpsource: Argonne Nat. Lab., IL, USA
treatment: P Practical
rawtitle: A Proposed Radix- and Word-length-independent Standard for Floating-Point Arithmetic
author:
William J. Cody, Jr. and Jerome T. Coonen and David M. Gay and K. Hanson and David G. Hough and William Kahan and Richard Karpinski and John F. Palmer and Frederic N. Ris and David Stevenson

bibsource:
Compendex database; https://www.math.utah.edu/pub/bibnet/authors/c/cody-william-j.bib; https://www.math.utah.edu/pub/bibnet/authors/g/gay-david-m.bib; https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; Science Citation Index database (1980--2000)

keywords:
computer software; digital arithmetic; exceptions; floating-point arithmetic; IEEE P854; independent standard; infinity; mathematical techniques --- Digital Arithmetic; NaNs; operations; precision; proposed radix- and word-length-independent standard; radix independent standard; rounding; standardization; standards; traps; word-length-

subject:
K.1 Computing Milieux, THE COMPUTER INDUSTRY, Suppliers G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Computer arithmetic

rawauthor:
William J. {Cody, Jr.} and Jerome T. Coonen and David M. Gay and K. Hanson and David G. Hough and William Kahan and Richard Karpinski and John F. Palmer and Frederic N. Ris and David Stevenson

entry:
@Article{Cody:1984:PRW,
  author =       "William J. {Cody, Jr.} and Jerome T. Coonen and David
                 M. Gay and K. Hanson and David G. Hough and William
                 Kahan and Richard Karpinski and John F. Palmer and
                 Frederic N. Ris and David Stevenson",
  title =        "A Proposed Radix- and Word-length-independent Standard
                 for Floating-Point Arithmetic",
  journal =      j-IEEE-MICRO,
  volume =       "4",
  number =       "4",
  pages =        "86--100",
  month =        jul # "\slash " # aug,
  year =         "1984",
  CODEN =        "IEMIDZ",
  DOI =          "https://doi.org/10.1109/MM.1984.291224",
  ISSN =         "0272-1732 (print), 1937-4143 (electronic)",
  ISSN-L =       "0272-1732",
  bibdate =      "Thu Dec 14 06:08:58 MST 2000",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/bibnet/authors/c/cody-william-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/gay-david-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 Science Citation Index database (1980--2000)",
  acknowledgement = ack-nj # " and " # ack-nhfb,
  classcodes =   "C5230 (Digital arithmetic methods)",
  classification = "723; 902; 921",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  fjournal =     "IEEE Micro",
  keywords =     "computer software; digital arithmetic; exceptions;
                 floating-point arithmetic; IEEE P854; independent
                 standard; infinity; mathematical techniques --- Digital
                 Arithmetic; NaNs; operations; precision; proposed
                 radix- and word-length-independent standard; radix
                 independent standard; rounding; standardization;
                 standards; traps; word-length-",
  subject =      "K.1 Computing Milieux, THE COMPUTER INDUSTRY,
                 Suppliers \\ G.1.0 Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Computer arithmetic",
  treatment =    "P Practical",
  xxtitle =      "A Proposed Radix-Independent and
                 Word-Length-Independent Standard for Floating-Point
                 Arithmetic",
}


bibtype: article
filename: master.bib
label: Cody:fps-analysis
author: William J. Cody, Jr.
title: Analysis of Proposals for the Floating-Point Standard
journal: j-COMPUTER
volume: 14
number: 3
pages: 63--69
month: mar
monthnumber: 3
year: 1981
bibdate: Sun May 2 07:47:15 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:47:15 ???
note: See cite IEEE:p754.
acknowledgement: ack-nhfb
rawauthor: William J. {Cody, Jr.}
rawnote: See \cite{IEEE:p754}.
rawtitle: Analysis of Proposals for the Floating-Point Standard
entry:
@Article{Cody:fps-analysis,
  author =       "William J. {Cody, Jr.}",
  title =        "Analysis of Proposals for the Floating-Point
                 Standard",
  journal =      j-COMPUTER,
  volume =       "14",
  number =       "3",
  pages =        "63--69",
  month =        mar,
  year =         "1981",
  bibdate =      "Sun May 2 07:47:15 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{IEEE:p754}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Cohen:2010:CSH
author: Richard Cohen
title: Chasing the Sun: a History of the Star That Gives Us Life
publisher: pub-RANDOM-HOUSE
address: pub-RANDOM-HOUSE:adr
pages: xxxi + 574
year: 2010
ISBN: 1-4000-6875-4 OR 1400068754
ISBN13: 978-1-4000-6875-3 OR 9781400068753
LCCN: QB521 .C625 2010
bibdate: Fri Nov 12 14:45:03 MST 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2010.11.12 14:45:03 MST
subject: Sun; history; astronomy; science and civilization
acknowledgement: ack-nhfb
rawauthor: Richard Cohen
rawtitle: Chasing the {Sun}: a History of the Star That Gives Us Life
TOC:
Sunrise: Mount Fuji The sun before science Telling stories Celebrating the seasons The three thousand witnesses Terrors of the sky Discovering the sun The first astronomers Enter the Greeks Gifts of the Yellow Emperor The sultan's turret The Earth moves Strange seas of thought Eclipses and enlightenment The sun dethroned The sun on Earth Sunspots The qualities of light Beneath the beating sun Skin deep The breath of life The dark biosphere Harnessing the sun The heavenly guide Of calendars and dials How time goes by The sun in our pocket Inspired by a star The vital symbol Drawing on the sun Negative capabilities Talk of the day Busie Old Foole The rising star of politics The sun and the future Over the horizon Under the weather The impossible and beyond The death of the sun Sunset: the Ganges

rawTOC:
Sunrise: Mount Fuji \\ The sun before science \\ Telling stories \\ Celebrating the seasons \\ The three thousand witnesses \\ Terrors of the sky \\ Discovering the sun \\ The first astronomers \\ Enter the Greeks \\ Gifts of the Yellow Emperor \\ The sultan's turret \\ The Earth moves \\ Strange seas of thought \\ Eclipses and enlightenment \\ The sun dethroned \\ The sun on Earth \\ Sunspots \\ The qualities of light \\ Beneath the beating sun \\ Skin deep \\ The breath of life \\ The dark biosphere \\ Harnessing the sun \\ The heavenly guide \\ Of calendars and dials \\ How time goes by \\ The sun in our pocket \\ Inspired by a star \\ The vital symbol \\ Drawing on the sun \\ Negative capabilities \\ Talk of the day \\ Busie Old Foole \\ The rising star of politics \\ The sun and the future \\ Over the horizon \\ Under the weather \\ The impossible and beyond \\ The death of the sun \\ Sunset: the Ganges

entry:
@Book{Cohen:2010:CSH,
  author =       "Richard Cohen",
  title =        "Chasing the {Sun}: a History of the Star That Gives Us
                 Life",
  publisher =    pub-RANDOM-HOUSE,
  address =      pub-RANDOM-HOUSE:adr,
  pages =        "xxxi + 574",
  year =         "2010",
  ISBN =         "1-4000-6875-4",
  ISBN-13 =      "978-1-4000-6875-3",
  LCCN =         "QB521 .C625 2010",
  bibdate =      "Fri Nov 12 14:45:03 MST 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Sun; history; astronomy; science and civilization",
  tableofcontents = "Sunrise: Mount Fuji \\
                 The sun before science \\
                 Telling stories \\
                 Celebrating the seasons \\
                 The three thousand witnesses \\
                 Terrors of the sky \\
                 Discovering the sun \\
                 The first astronomers \\
                 Enter the Greeks \\
                 Gifts of the Yellow Emperor \\
                 The sultan's turret \\
                 The Earth moves \\
                 Strange seas of thought \\
                 Eclipses and enlightenment \\
                 The sun dethroned \\
                 The sun on Earth \\
                 Sunspots \\
                 The qualities of light \\
                 Beneath the beating sun \\
                 Skin deep \\
                 The breath of life \\
                 The dark biosphere \\
                 Harnessing the sun \\
                 The heavenly guide \\
                 Of calendars and dials \\
                 How time goes by \\
                 The sun in our pocket \\
                 Inspired by a star \\
                 The vital symbol \\
                 Drawing on the sun \\
                 Negative capabilities \\
                 Talk of the day \\
                 Busie Old Foole \\
                 The rising star of politics \\
                 The sun and the future \\
                 Over the horizon \\
                 Under the weather \\
                 The impossible and beyond \\
                 The death of the sun \\
                 Sunset: the Ganges",
}


bibtype: book
filename: master.bib
label: Cokinos:2009:FSI
author: Christopher Cokinos
title: The Fallen Sky: an Intimate History of Shooting Stars
publisher: Jeremy P. Tarcher/Penguin
address: New York, NY, USA
pages: 517
year: 2009
ISBN: 1-58542-720-9 OR 1585427209
ISBN13: 978-1-58542-720-8 OR 9781585427208
LCCN: QB755 .C65 2009
bibdate: Thu Nov 12 16:37:15 MST 2009
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2009.11.12 16:37:15 MST
subject: meteorites; miscellanea
acknowledgement: ack-nhfb
rawauthor: Christopher Cokinos
rawtitle: The Fallen Sky: an Intimate History of Shooting Stars
URL:
http://www.loc.gov/catdir/enhancements/fy1001/2009017493-b.html; http://www.loc.gov/catdir/enhancements/fy1001/2009017493-d.html

abstract:
Weaving natural history, memoir, and the stories of maverick scientists, daring adventurers, and stargazing dreamers, this book takes us from Antarctica to outer space to tell the tale of how the study of meteorites became a scientific passion.

TOC:
Prologue: Dust: a brief memoir of overlooked things Distances measured in various units What breaks out entire: the Eliza Kimberly story Higher latitudes: in search of Peary's meteorites The weather of belief Mr. Barringer's big idea Harvey Nininger sees the light A serious case of the I wants: passions of the dealers Church of the sky Life works: the biology of meteorites Old fire on blue ice: an Antarctic journey Afterword

rawabstract:
Weaving natural history, memoir, and the stories of maverick scientists, daring adventurers, and stargazing dreamers, this book takes us from Antarctica to outer space to tell the tale of how the study of meteorites became a scientific passion.

rawTOC:
Prologue: Dust: a brief memoir of overlooked things \\ Distances measured in various units \\ What breaks out entire: the Eliza Kimberly story \\ Higher latitudes: in search of Peary's meteorites \\ The weather of belief \\ Mr. Barringer's big idea \\ Harvey Nininger sees the light \\ A serious case of the I wants: passions of the dealers \\ Church of the sky \\ Life works: the biology of meteorites \\ Old fire on blue ice: an Antarctic journey \\ Afterword

entry:
@Book{Cokinos:2009:FSI,
  author =       "Christopher Cokinos",
  title =        "The Fallen Sky: an Intimate History of Shooting
                 Stars",
  publisher =    "Jeremy P. Tarcher/Penguin",
  address =      "New York, NY, USA",
  pages =        "517",
  year =         "2009",
  ISBN =         "1-58542-720-9",
  ISBN-13 =      "978-1-58542-720-8",
  LCCN =         "QB755 .C65 2009",
  bibdate =      "Thu Nov 12 16:37:15 MST 2009",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1001/2009017493-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1001/2009017493-d.html",
  abstract =     "Weaving natural history, memoir, and the stories of
                 maverick scientists, daring adventurers, and stargazing
                 dreamers, this book takes us from Antarctica to outer
                 space to tell the tale of how the study of meteorites
                 became a scientific passion.",
  acknowledgement = ack-nhfb,
  subject =      "meteorites; miscellanea",
  tableofcontents = "Prologue: Dust: a brief memoir of overlooked things
                 \\
                 Distances measured in various units \\
                 What breaks out entire: the Eliza Kimberly story \\
                 Higher latitudes: in search of Peary's meteorites \\
                 The weather of belief \\
                 Mr. Barringer's big idea \\
                 Harvey Nininger sees the light \\
                 A serious case of the I wants: passions of the dealers
                 \\
                 Church of the sky \\
                 Life works: the biology of meteorites \\
                 Old fire on blue ice: an Antarctic journey \\
                 Afterword",
}


bibtype: book
filename: master.bib
label: Cole:1976:MP
author: A. J. Cole
title: Macro Processors
volume: 4
publisher: pub-CAMBRIDGE
address: pub-CAMBRIDGE:adr
pages: viii + 230
year: 1976
ISBN: 0-521-29024-4 OR 0521290244
ISBN13: 978-0-521-29024-1 OR 9780521290241
LCCN: QA76.C358
bibdate: Tue Dec 14 23:28:51 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:28:51 ???
series: Cambridge Computer Science Texts, Editors: E. S. Page and C. M. Reeves and D. E. Conway
acknowledgement: ack-nhfb
rawauthor: A. J. Cole
rawtitle: Macro Processors
entry:
@Book{Cole:1976:MP,
  author =       "A. J. Cole",
  title =        "Macro Processors",
  volume =       "4",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 230",
  year =         "1976",
  ISBN =         "0-521-29024-4",
  ISBN-13 =      "978-0-521-29024-1",
  LCCN =         "QA76.C358",
  bibdate =      "Tue Dec 14 23:28:51 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$7.95",
  series =       "Cambridge Computer Science Texts, Editors: E. S. Page
                 and C. M. Reeves and D. E. Conway",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Coleman:1988:HMC
author: Thomas F. Coleman and Charles F. Van Loan
title: Handbook for Matrix Computations
volume: 4
publisher: pub-SIAM
address: pub-SIAM:adr
pages: vii + 264
year: 1988
DOI: https://doi.org/10.1137/1.9781611971040
ISBN: 0-89871-227-0 (paperback), 1-61197-104-7 (e-book) OR 0898712270 (paperback), 1611971047 (ebook)
LCCN: QA188 .C651 1988
bibdate: Mon Oct 26 07:30:48 1998
bibtimestamp: 1998.10.26 07:30:48 ???
series: Frontiers in applied mathematics
subject: Matrices; Data processing
acknowledgement: ack-nhfb
rawauthor: Thomas F. Coleman and Charles F. {Van Loan}
rawtitle: Handbook for Matrix Computations
shortTOC: 1: A subset of Fortran 77 2: The BLAS 3: LINPACK 4: MATLAB
rawshortTOC: 1: A subset of Fortran 77 \\ 2: The BLAS \\ 3: LINPACK \\ 4: MATLAB
ISBN13:
978-0-89871-227-8 (paperback), 978-1-61197-104-0 (e-book) OR 9780898712278 (paperback), 9781611971040 (ebook)

bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/fortran2.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/matlab.bib

abstract:
This handbook can be used as a reference by those actively engaged in scientific computation. It can also serve as a practical companion text in a numerical methods course that involves a significant amount of linear algebraic computation. The book has four chapters, each being fairly independent of the others. Our treatment of Fortran 77 in Chapter 1 involves a much stronger emphasis on arrays than is accorded by other authors. We also assume that the reader has experience with some high-level programming language. This might be in the form of a recent course in Pascal or a course in Fortran taken many years ago and now half-forgotten. The second chapter is about the Basic Linear Algebra Subprograms (BLAS). The elementary linear algebra that underpins the BLAS makes them a good vehicle for acquainting the beginning student with modular programming and the importance of ``thinking vector'' when organizing a matrix computation. Chapter 3 is concerned with LINPACK, a highly acclaimed package that is suitable for many linear equation and least square calculations. The last chapter is about MATLAB, an interactive system in which it is possible to couch sophisticated matrix computations at a very high level.

TOC:
Preface / vii 1: A Subset of Fortran 77 / 1 1.1: Basics / 3 1.2: Logical Operations / 18 1.3: Loops / 25 1.4: Arrays / 32 1.5: Subprograms / 42 1.6: Arrays and Subprograms / 58 1.7: Input and Output / 69 1.8: Complex Arithmetic / 82 1.9: Programming Tips / 87 Appendix: Fortran 77 Built-in Functions / 101 2: The BLAS / 105 2.1: Bookkeeping Operations / 107 2.2: Vector Operations / 112 2.3: Norm Computations / 119 2.4: Givens Rotations / 125 2.5: Double Precision and Complex Versions / 132 3: LINPACK / 139 3.1: Triangular Systems / 141 3.2: General Systems / 147 3.3: Symmetric Systems / 152 3.4: Banded Systems / 161 3.5: The QR Factorization / 166 3.6: The Singular Value Decomposition / 175 3.7: Double Precision and Complex Versions / 180 4: MATLAB / 187 4.1: Basics / 189 4.2: Loops and Conditionals / 203 4.3: Working with Submatrices / 212 4.4: Built-in Functions / 219 4.5: Functions / 232 4.6: Factorization / 243 4.7: Miscellaneous / 256 References / 261 Index / 262

rawabstract:
This handbook can be used as a reference by those actively engaged in scientific computation. It can also serve as a practical companion text in a numerical methods course that involves a significant amount of linear algebraic computation. The book has four chapters, each being fairly independent of the others. Our treatment of Fortran 77 in Chapter 1 involves a much stronger emphasis on arrays than is accorded by other authors. We also assume that the reader has experience with some high-level programming language. This might be in the form of a recent course in Pascal or a course in Fortran taken many years ago and now half-forgotten. The second chapter is about the Basic Linear Algebra Subprograms (BLAS). The elementary linear algebra that underpins the BLAS makes them a good vehicle for acquainting the beginning student with modular programming and the importance of ``thinking vector'' when organizing a matrix computation. Chapter 3 is concerned with LINPACK, a highly acclaimed package that is suitable for many linear equation and least square calculations. The last chapter is about MATLAB, an interactive system in which it is possible to couch sophisticated matrix computations at a very high level.

rawTOC:
Preface / vii \\ 1: A Subset of Fortran 77 / 1 \\ 1.1: Basics / 3 \\ 1.2: Logical Operations / 18 \\ 1.3: Loops / 25 \\ 1.4: Arrays / 32 \\ 1.5: Subprograms / 42 \\ 1.6: Arrays and Subprograms / 58 \\ 1.7: Input and Output / 69 \\ 1.8: Complex Arithmetic / 82 \\ 1.9: Programming Tips / 87 \\ Appendix: Fortran 77 Built-in Functions / 101 \\ 2: The BLAS / 105 \\ 2.1: Bookkeeping Operations / 107 \\ 2.2: Vector Operations / 112 \\ 2.3: Norm Computations / 119 \\ 2.4: Givens Rotations / 125 \\ 2.5: Double Precision and Complex Versions / 132 \\ 3: LINPACK / 139 \\ 3.1: Triangular Systems / 141 \\ 3.2: General Systems / 147 \\ 3.3: Symmetric Systems / 152 \\ 3.4: Banded Systems / 161 \\ 3.5: The QR Factorization / 166 \\ 3.6: The Singular Value Decomposition / 175 \\ 3.7: Double Precision and Complex Versions / 180 \\ 4: MATLAB / 187 \\ 4.1: Basics / 189 \\ 4.2: Loops and Conditionals / 203 \\ 4.3: Working with Submatrices / 212 \\ 4.4: Built-in Functions / 219 \\ 4.5: Functions / 232 \\ 4.6: Factorization / 243 \\ 4.7: Miscellaneous / 256 \\ References / 261 \\ Index / 262

entry:
@Book{Coleman:1988:HMC,
  author =       "Thomas F. Coleman and Charles F. {Van Loan}",
  title =        "Handbook for Matrix Computations",
  volume =       "4",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "vii + 264",
  year =         "1988",
  DOI =          "https://doi.org/10.1137/1.9781611971040",
  ISBN =         "0-89871-227-0 (paperback), 1-61197-104-7 (e-book)",
  ISBN-13 =      "978-0-89871-227-8 (paperback), 978-1-61197-104-0
                 (e-book)",
  LCCN =         "QA188 .C651 1988",
  bibdate =      "Mon Oct 26 07:30:48 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/matlab.bib",
  price =        "US\$34.00",
  series =       "Frontiers in applied mathematics",
  abstract =     "This handbook can be used as a reference by those
                 actively engaged in scientific computation. It can also
                 serve as a practical companion text in a numerical
                 methods course that involves a significant amount of
                 linear algebraic computation. The book has four
                 chapters, each being fairly independent of the others.
                 Our treatment of Fortran 77 in Chapter 1 involves a
                 much stronger emphasis on arrays than is accorded by
                 other authors. We also assume that the reader has
                 experience with some high-level programming language.
                 This might be in the form of a recent course in Pascal
                 or a course in Fortran taken many years ago and now
                 half-forgotten. The second chapter is about the Basic
                 Linear Algebra Subprograms (BLAS). The elementary
                 linear algebra that underpins the BLAS makes them a
                 good vehicle for acquainting the beginning student with
                 modular programming and the importance of ``thinking
                 vector'' when organizing a matrix computation. Chapter
                 3 is concerned with LINPACK, a highly acclaimed package
                 that is suitable for many linear equation and least
                 square calculations. The last chapter is about MATLAB,
                 an interactive system in which it is possible to couch
                 sophisticated matrix computations at a very high
                 level.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "1: A subset of Fortran 77 \\
                 2: The BLAS \\
                 3: LINPACK \\
                 4: MATLAB",
  subject =      "Matrices; Data processing",
  tableofcontents = "Preface / vii \\
                 1: A Subset of Fortran 77 / 1 \\
                 1.1: Basics / 3 \\
                 1.2: Logical Operations / 18 \\
                 1.3: Loops / 25 \\
                 1.4: Arrays / 32 \\
                 1.5: Subprograms / 42 \\
                 1.6: Arrays and Subprograms / 58 \\
                 1.7: Input and Output / 69 \\
                 1.8: Complex Arithmetic / 82 \\
                 1.9: Programming Tips / 87 \\
                 Appendix: Fortran 77 Built-in Functions / 101 \\
                 2: The BLAS / 105 \\
                 2.1: Bookkeeping Operations / 107 \\
                 2.2: Vector Operations / 112 \\
                 2.3: Norm Computations / 119 \\
                 2.4: Givens Rotations / 125 \\
                 2.5: Double Precision and Complex Versions / 132 \\
                 3: LINPACK / 139 \\
                 3.1: Triangular Systems / 141 \\
                 3.2: General Systems / 147 \\
                 3.3: Symmetric Systems / 152 \\
                 3.4: Banded Systems / 161 \\
                 3.5: The QR Factorization / 166 \\
                 3.6: The Singular Value Decomposition / 175 \\
                 3.7: Double Precision and Complex Versions / 180 \\
                 4: MATLAB / 187 \\
                 4.1: Basics / 189 \\
                 4.2: Loops and Conditionals / 203 \\
                 4.3: Working with Submatrices / 212 \\
                 4.4: Built-in Functions / 219 \\
                 4.5: Functions / 232 \\
                 4.6: Factorization / 243 \\
                 4.7: Miscellaneous / 256 \\
                 References / 261 \\
                 Index / 262",
}


bibtype: article
filename: master.bib
label: Collinson:awk
author: Peter Collinson
title: Awk
journal: j-SUNEXPERT
volume: 2
number: 1
pages: 33--36
month: jan
monthnumber: 1
year: 1991
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: Peter Collinson
rawtitle: Awk
entry:
@Article{Collinson:awk,
  author =       "Peter Collinson",
  title =        "Awk",
  journal =      j-SUNEXPERT,
  volume =       "2",
  number =       "1",
  pages =        "33--36",
  month =        jan,
  year =         "1991",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Colwell:2005:PCP
author: Robert P. Colwell
title: The Pentium Chronicles: The People, Passion, and Politics Behind Intel's Landmark Chips
publisher: pub-WILEY
address: pub-WILEY:adr
pages: xix + 187
year: 2005
ISBN: 0-471-73617-1 OR 0471736171
ISBN13: 978-0-471-73617-2 OR 9780471736172
LCCN: HD9696.S44 I563 2006
bibdate: Fri Dec 09 06:57:21 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2005.12.09 06:57:21 ???
acknowledgement: ack-nhfb
rawauthor: Robert P. Colwell
rawtitle: The {Pentium} Chronicles: The People, Passion, and Politics Behind {Intel}'s Landmark Chips
abstract:
A landmark chip like the P6 or Pentium 4 doesn't just happen. It takes a confluence of brilliant minds, dedication for beyond the ordinary, and management that nurtures the vision while keeping a firm hand on the project tiller.As chief architect of the P6, Robert Colwell offers a unique perspective as he unfolds the saga of a project that ballooned from a few architects to hundreds of engineers, many just out of school. For more than a treatise on project management, The Pentium Chronicles gives the rationale, the personal triumphs, and the humor that characterized the P6 project, an undertaking that broke all technical boundaries by being the first to try an out-of order, speculative super-scalar architecture in a microprocessor.In refreshingly down-to-earth language, organized around a framework ``we wish we had known about then,'' Chronicles describes the architecture and key decisions that shaped the P6, Intel's most successful chip to date. Colwell's inimitable style will have readers laughing out loud at the project team's creative solutions to well-known problems. From architectural planning in a storage room jimmied open with a credit card, to a marketing presentation using shopping carts, he takes readers through events from the projects beginning through its production. As Colwell himself recognizes, success is all about learning from others, and Chronicles is filled with stories of ordinary and exceptional people and frank assessments of ``oops'' moments, like the infamous FDIV bug.As its subtitle implies, the book looks beyond RTL models and transistors to the Intel culture, often poking fun at corporate policies, like team-building exercises in which engineers ruthlessly shoot down each other's plans. Whatever your level of computing expertise, Chronicles will delight and inform you, leaving you with a better understanding of what it takes to create and grow a winning product.

TOC:
Foreword Preface 1: Introduction P6 project context Betting on CISC Proliferation thinking The gauntlet Developing big ideas Defining success and failure Senior wisdom Four project phases The business of excellence 2: The concept phase Of immediate concern Success factors Clear goals The right people P6 senior leadership Setting the leadership tone Managing mechanics Physical context matters The storage room solution--: Beyond the whiteboard ``Kooshing'' the talkers A data-driven culture The right tool The ``what would happen if'' game DFA frontiers Performance Benchmark selections Avoiding myopic do-loops Floating-point chickens and eggs Legacy code performance Intelligent projections All design teams are not equal Overpromise or overdeliver? Customer visits Loose lips Memorable moments Microsoft Novell Compaq Insights from input Not-so-secret instructions Help from the software world The truth about hardware and software Establishing the design team Roles and responsibilities Presilicon validation Wizard problem solving Making microcode a special case Cubicle floorplanning Architects, engineers, and schedules Coding, egos, subterfuge 3: The refinement phase Of immediate concern Success factors Handling the nonquantifiable Managing new perspectives Planning for complexity Behavioral models Managing a changing POR The wrong way to plan Engineering change orders The origin of change When, where, who Communicating change Timely resolution, no pocket vetoes The ECO czar ECO control and the project POR The bridge from architecture to design Focus groups Product quality--: Mismanaging design errors Make and example of the offender Hire only geniuses Flog validation Avoid/find/survive Design to avoid bugs When bugs get in anyway, find them before production Identifying bugs Tracking bugs Managing validation Plan to survive bugs that make it to production A six-step plan for high product quality The design review How not to do a review When to do review Another one rides the bus4: The realization phase Of immediate concern Success factors Balanced decision making Documentation and communication Capturing unit decisions Integrating architects and design engineers Performance and feature trade-offs (Over- ) optimizing performance Perfect A; mediocre B, C, and D The technical purity trap The unbreakable computer Performance-monitoring facilities Counters and triggers Protecting the family jewels Testability hooks Gratuitous innovation considered harmful Validation and model health A thankless job Choosing a metric Health and the tapeout target Metric doldrums Coordinating with other projects Performance estimation The overshooting scheme Psychological stuff Simulator wars Project management Awards, rewards, and recognition The dark side of awards Project management by grass cutting Marginal return from incremental heads Project tracking The experiment The mystery of the unchanging curve Flexibility is required of all The simplification effort5: The production phase Of immediate concern Functional correctness Speed paths Chip sets and platforms Success factors Prioritizing war room issues Managing the microcode patch space Product care and feeding Test vectors Performance surprises Feature surprises Executive pedagogy and shopping carts Managing to the next processor The Windows NT saga Product rollout On stage with Andy Grove How not to give magazine interviews Speech training 6: The people factor Hiring and firing Rational recruitment Hiring and the promotion list Firing Policy wars Corporate disincentives The Led Zeppelin incident Exiting the exit bag check Sailboats and ditches Orbiting the bathrooms Management by objective We are so rich, we must be good Burnout 7: Inquiring minds like yours What was Intel thinking with that chip ID tag, which caused such a public uproar? Was the P6 project affected by the Pentium's floating point divider bug? Why did Pentium have a flawed floating point divider, when its predecessor, the i486, did not?How would you respond to the claim that the P6 is built on ideas stolen from Digital Equipment Corp.? What did the P6 team think about Intel's Itanium Processor Family? Is Intel the sweatshop some people say it is? How can I become the chief architect of a company such as Intel? Why did you leave Intel? And in closing I'd just like to say Bibliography Appendix Out-of-order, superscalar microarchitecture: a primer Plausibility checking Glossary Index

rawabstract:
A landmark chip like the P6 or Pentium 4 doesn't just happen. It takes a confluence of brilliant minds, dedication for beyond the ordinary, and management that nurtures the vision while keeping a firm hand on the project tiller.As chief architect of the P6, Robert Colwell offers a unique perspective as he unfolds the saga of a project that ballooned from a few architects to hundreds of engineers, many just out of school. For more than a treatise on project management, The Pentium Chronicles gives the rationale, the personal triumphs, and the humor that characterized the P6 project, an undertaking that broke all technical boundaries by being the first to try an out-of order, speculative super-scalar architecture in a microprocessor.In refreshingly down-to-earth language, organized around a framework ``we wish we had known about then,'' Chronicles describes the architecture and key decisions that shaped the P6, Intel's most successful chip to date. Colwell's inimitable style will have readers laughing out loud at the project team's creative solutions to well-known problems. From architectural planning in a storage room jimmied open with a credit card, to a marketing presentation using shopping carts, he takes readers through events from the projects beginning through its production. As Colwell himself recognizes, success is all about learning from others, and Chronicles is filled with stories of ordinary and exceptional people and frank assessments of ``oops'' moments, like the infamous FDIV bug.As its subtitle implies, the book looks beyond RTL models and transistors to the Intel culture, often poking fun at corporate policies, like team-building exercises in which engineers ruthlessly shoot down each other's plans. Whatever your level of computing expertise, Chronicles will delight and inform you, leaving you with a better understanding of what it takes to create and grow a winning product.

rawTOC:
Foreword \\ Preface \\ 1: Introduction \\ P6 project context \\ Betting on CISC \\ Proliferation thinking \\ The gauntlet \\ Developing big ideas \\ Defining success and failure \\ Senior wisdom \\ Four project phases \\ The business of excellence \\ 2: The concept phase \\ Of immediate concern \\ Success factors \\ Clear goals \\ The right people \\ P6 senior leadership \\ Setting the leadership tone \\ Managing mechanics \\ Physical context matters \\ The storage room solution--: Beyond the whiteboard \\ ``Kooshing'' the talkers \\ A data-driven culture \\ The right tool \\ The ``what would happen if'' game \\ DFA frontiers \\ Performance \\ Benchmark selections \\ Avoiding myopic do-loops \\ Floating-point chickens and eggs \\ Legacy code performance \\ Intelligent projections \\ All design teams are not equal \\ Overpromise or overdeliver? \\ Customer visits \\ Loose lips \\ Memorable moments \\ Microsoft \\ Novell \\ Compaq \\ Insights from input \\ Not-so-secret instructions \\ Help from the software world \\ The truth about hardware and software \\ Establishing the design team \\ Roles and responsibilities \\ Presilicon validation \\ Wizard problem solving \\ Making microcode a special case \\ Cubicle floorplanning \\ Architects, engineers, and schedules \\ Coding, egos, subterfuge \\ 3: The refinement phase \\ Of immediate concern \\ Success factors \\ Handling the nonquantifiable \\ Managing new perspectives \\ Planning for complexity \\ Behavioral models \\ Managing a changing POR \\ The wrong way to plan \\ Engineering change orders \\ The origin of change \\ When, where, who \\ Communicating change \\ Timely resolution, no pocket vetoes \\ The ECO czar \\ ECO control and the project POR \\ The bridge from architecture to design \\ Focus groups \\ Product quality--: Mismanaging design errors \\ Make and example of the offender \\ Hire only geniuses \\ Flog validation \\ Avoid/find/survive \\ Design to avoid bugs \\ When bugs get in anyway, find them before production \\ Identifying bugs \\ Tracking bugs \\ Managing validation \\ Plan to survive bugs that make it to production \\ A six-step plan for high product quality \\ The design review \\ How not to do a review \\ When to do review \\ Another one rides the bus4: The realization phase \\ Of immediate concern \\ Success factors \\ Balanced decision making \\ Documentation and communication \\ Capturing unit decisions \\ Integrating architects and design engineers \\ Performance and feature trade-offs \\ (Over- ) optimizing performance \\ Perfect A; mediocre B, C, and D \\ The technical purity trap \\ The unbreakable computer \\ Performance-monitoring facilities \\ Counters and triggers \\ Protecting the family jewels \\ Testability hooks \\ Gratuitous innovation considered harmful \\ Validation and model health \\ A thankless job \\ Choosing a metric \\ Health and the tapeout target \\ Metric doldrums \\ Coordinating with other projects \\ Performance estimation \\ The overshooting scheme \\ Psychological stuff \\ Simulator wars \\ Project management \\ Awards, rewards, and recognition \\ The dark side of awards \\ Project management by grass cutting \\ Marginal return from incremental heads \\ Project tracking \\ The experiment \\ The mystery of the unchanging curve \\ Flexibility is required of all \\ The simplification effort5: The production phase \\ Of immediate concern \\ Functional correctness \\ Speed paths \\ Chip sets and platforms \\ Success factors \\ Prioritizing war room issues \\ Managing the microcode patch space \\ Product care and feeding \\ Test vectors \\ Performance surprises \\ Feature surprises \\ Executive pedagogy and shopping carts \\ Managing to the next processor \\ The Windows NT saga \\ Product rollout \\ On stage with Andy Grove \\ How not to give magazine interviews \\ Speech training \\ 6: The people factor \\ Hiring and firing \\ Rational recruitment \\ Hiring and the promotion list \\ Firing \\ Policy wars \\ Corporate disincentives \\ The Led Zeppelin incident \\ Exiting the exit bag check \\ Sailboats and ditches \\ Orbiting the bathrooms \\ Management by objective \\ We are so rich, we must be good \\ Burnout \\ 7: Inquiring minds like yours \\ What was Intel thinking with that chip ID tag, which caused such a public uproar? \\ Was the P6 project affected by the Pentium's floating point divider bug? \\ Why did Pentium have a flawed floating point divider, when its predecessor, the i486, did not?How would you respond to the claim that the P6 is built on ideas stolen from Digital Equipment Corp.? \\ What did the P6 team think about Intel's Itanium Processor Family? \\ Is Intel the sweatshop some people say it is? \\ How can I become the chief architect of a company such as Intel? \\ Why did you leave Intel? \\ And in closing I'd just like to say \\ Bibliography \\ Appendix \\ Out-of-order, superscalar microarchitecture: a primer \\ Plausibility checking \\ Glossary \\ Index

entry:
@Book{Colwell:2005:PCP,
  author =       "Robert P. Colwell",
  title =        "The {Pentium} Chronicles: The People, Passion, and
                 Politics Behind {Intel}'s Landmark Chips",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xix + 187",
  year =         "2005",
  ISBN =         "0-471-73617-1",
  ISBN-13 =      "978-0-471-73617-2",
  LCCN =         "HD9696.S44 I563 2006",
  bibdate =      "Fri Dec 09 06:57:21 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$24.95",
  abstract =     "A landmark chip like the P6 or Pentium 4 doesn't just
                 happen. It takes a confluence of brilliant minds,
                 dedication for beyond the ordinary, and management that
                 nurtures the vision while keeping a firm hand on the
                 project tiller.As chief architect of the P6, Robert
                 Colwell offers a unique perspective as he unfolds the
                 saga of a project that ballooned from a few architects
                 to hundreds of engineers, many just out of school. For
                 more than a treatise on project management, The Pentium
                 Chronicles gives the rationale, the personal triumphs,
                 and the humor that characterized the P6 project, an
                 undertaking that broke all technical boundaries by
                 being the first to try an out-of order, speculative
                 super-scalar architecture in a microprocessor.In
                 refreshingly down-to-earth language, organized around a
                 framework ``we wish we had known about then,''
                 Chronicles describes the architecture and key decisions
                 that shaped the P6, Intel's most successful chip to
                 date. Colwell's inimitable style will have readers
                 laughing out loud at the project team's creative
                 solutions to well-known problems. From architectural
                 planning in a storage room jimmied open with a credit
                 card, to a marketing presentation using shopping carts,
                 he takes readers through events from the projects
                 beginning through its production. As Colwell himself
                 recognizes, success is all about learning from others,
                 and Chronicles is filled with stories of ordinary and
                 exceptional people and frank assessments of ``oops''
                 moments, like the infamous FDIV bug.As its subtitle
                 implies, the book looks beyond RTL models and
                 transistors to the Intel culture, often poking fun at
                 corporate policies, like team-building exercises in
                 which engineers ruthlessly shoot down each other's
                 plans. Whatever your level of computing expertise,
                 Chronicles will delight and inform you, leaving you
                 with a better understanding of what it takes to create
                 and grow a winning product.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword \\
                 Preface \\
                 1: Introduction \\
                 P6 project context \\
                 Betting on CISC \\
                 Proliferation thinking \\
                 The gauntlet \\
                 Developing big ideas \\
                 Defining success and failure \\
                 Senior wisdom \\
                 Four project phases \\
                 The business of excellence \\
                 2: The concept phase \\
                 Of immediate concern \\
                 Success factors \\
                 Clear goals \\
                 The right people \\
                 P6 senior leadership \\
                 Setting the leadership tone \\
                 Managing mechanics \\
                 Physical context matters \\
                 The storage room solution--: Beyond the whiteboard \\
                 ``Kooshing'' the talkers \\
                 A data-driven culture \\
                 The right tool \\
                 The ``what would happen if'' game \\
                 DFA frontiers \\
                 Performance \\
                 Benchmark selections \\
                 Avoiding myopic do-loops \\
                 Floating-point chickens and eggs \\
                 Legacy code performance \\
                 Intelligent projections \\
                 All design teams are not equal \\
                 Overpromise or overdeliver? \\
                 Customer visits \\
                 Loose lips \\
                 Memorable moments \\
                 Microsoft \\
                 Novell \\
                 Compaq \\
                 Insights from input \\
                 Not-so-secret instructions \\
                 Help from the software world \\
                 The truth about hardware and software \\
                 Establishing the design team \\
                 Roles and responsibilities \\
                 Presilicon validation \\
                 Wizard problem solving \\
                 Making microcode a special case \\
                 Cubicle floorplanning \\
                 Architects, engineers, and schedules \\
                 Coding, egos, subterfuge \\
                 3: The refinement phase \\
                 Of immediate concern \\
                 Success factors \\
                 Handling the nonquantifiable \\
                 Managing new perspectives \\
                 Planning for complexity \\
                 Behavioral models \\
                 Managing a changing POR \\
                 The wrong way to plan \\
                 Engineering change orders \\
                 The origin of change \\
                 When, where, who \\
                 Communicating change \\
                 Timely resolution, no pocket vetoes \\
                 The ECO czar \\
                 ECO control and the project POR \\
                 The bridge from architecture to design \\
                 Focus groups \\
                 Product quality--: Mismanaging design errors \\
                 Make and example of the offender \\
                 Hire only geniuses \\
                 Flog validation \\
                 Avoid/find/survive \\
                 Design to avoid bugs \\
                 When bugs get in anyway, find them before production
                 \\
                 Identifying bugs \\
                 Tracking bugs \\
                 Managing validation \\
                 Plan to survive bugs that make it to production \\
                 A six-step plan for high product quality \\
                 The design review \\
                 How not to do a review \\
                 When to do review \\
                 Another one rides the bus4: The realization phase \\
                 Of immediate concern \\
                 Success factors \\
                 Balanced decision making \\
                 Documentation and communication \\
                 Capturing unit decisions \\
                 Integrating architects and design engineers \\
                 Performance and feature trade-offs \\
                 (Over- ) optimizing performance \\
                 Perfect A; mediocre B, C, and D \\
                 The technical purity trap \\
                 The unbreakable computer \\
                 Performance-monitoring facilities \\
                 Counters and triggers \\
                 Protecting the family jewels \\
                 Testability hooks \\
                 Gratuitous innovation considered harmful \\
                 Validation and model health \\
                 A thankless job \\
                 Choosing a metric \\
                 Health and the tapeout target \\
                 Metric doldrums \\
                 Coordinating with other projects \\
                 Performance estimation \\
                 The overshooting scheme \\
                 Psychological stuff \\
                 Simulator wars \\
                 Project management \\
                 Awards, rewards, and recognition \\
                 The dark side of awards \\
                 Project management by grass cutting \\
                 Marginal return from incremental heads \\
                 Project tracking \\
                 The experiment \\
                 The mystery of the unchanging curve \\
                 Flexibility is required of all \\
                 The simplification effort5: The production phase \\
                 Of immediate concern \\
                 Functional correctness \\
                 Speed paths \\
                 Chip sets and platforms \\
                 Success factors \\
                 Prioritizing war room issues \\
                 Managing the microcode patch space \\
                 Product care and feeding \\
                 Test vectors \\
                 Performance surprises \\
                 Feature surprises \\
                 Executive pedagogy and shopping carts \\
                 Managing to the next processor \\
                 The Windows NT saga \\
                 Product rollout \\
                 On stage with Andy Grove \\
                 How not to give magazine interviews \\
                 Speech training \\
                 6: The people factor \\
                 Hiring and firing \\
                 Rational recruitment \\
                 Hiring and the promotion list \\
                 Firing \\
                 Policy wars \\
                 Corporate disincentives \\
                 The Led Zeppelin incident \\
                 Exiting the exit bag check \\
                 Sailboats and ditches \\
                 Orbiting the bathrooms \\
                 Management by objective \\
                 We are so rich, we must be good \\
                 Burnout \\
                 7: Inquiring minds like yours \\
                 What was Intel thinking with that chip ID tag, which
                 caused such a public uproar? \\
                 Was the P6 project affected by the Pentium's floating
                 point divider bug? \\
                 Why did Pentium have a flawed floating point divider,
                 when its predecessor, the i486, did not?How would you
                 respond to the claim that the P6 is built on ideas
                 stolen from Digital Equipment Corp.? \\
                 What did the P6 team think about Intel's Itanium
                 Processor Family? \\
                 Is Intel the sweatshop some people say it is? \\
                 How can I become the chief architect of a company such
                 as Intel? \\
                 Why did you leave Intel? \\
                 And in closing I'd just like to say \\
                 Bibliography \\
                 Appendix \\
                 Out-of-order, superscalar microarchitecture: a primer
                 \\
                 Plausibility checking \\
                 Glossary \\
                 Index",
}


bibtype: book
filename: master.bib
label: Comer:1984:OSD
author: Douglas E. Comer
title: Operating Systems Design. The XINU Approach
volume: 1
publisher: pub-PH
address: pub-PH:adr
pages: xix + 187
year: 1984
ISBN: 0-13-637539-1 OR 0136375391
ISBN13: 978-0-13-637539-5 OR 9780136375395
LCCN: QA76.6 .C6275 1984
bibdate: Tue Dec 14 23:29:35 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:29:35 ???
acknowledgement: ack-nhfb
rawauthor: Douglas E. Comer
rawtitle: Operating Systems Design. The {XINU} Approach
TOC:
Introduction and overview An overview of the machine and run-time environment List and queue manipulation Scheduling and context switching More process management Process coordination Message passing Memory management Interrupt processing Real-time clock management Device independent input and output An example device driver System initialization A data link communication driver High-level memory management and message passing Frame-level network communication A disk driver File systems Exception handling and support routines System configuration Appendices Bibliography Index

rawTOC:
Introduction and overview \\ An overview of the machine and run-time environment \\ List and queue manipulation \\ Scheduling and context switching \\ More process management \\ Process coordination \\ Message passing \\ Memory management \\ Interrupt processing \\ Real-time clock management \\ Device independent input and output \\ An example device driver \\ System initialization \\ A data link communication driver \\ High-level memory management and message passing \\ Frame-level network communication \\ A disk driver \\ File systems \\ Exception handling and support routines \\ System configuration \\ Appendices \\ Bibliography \\ Index

entry:
@Book{Comer:1984:OSD,
  author =       "Douglas E. Comer",
  title =        "Operating Systems Design. The {XINU} Approach",
  volume =       "1",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1984",
  ISBN =         "0-13-637539-1",
  ISBN-13 =      "978-0-13-637539-5",
  LCCN =         "QA76.6 .C6275 1984",
  bibdate =      "Tue Dec 14 23:29:35 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Introduction and overview \\
                 An overview of the machine and run-time environment \\
                 List and queue manipulation \\
                 Scheduling and context switching \\
                 More process management \\
                 Process coordination \\
                 Message passing \\
                 Memory management \\
                 Interrupt processing \\
                 Real-time clock management \\
                 Device independent input and output \\
                 An example device driver \\
                 System initialization \\
                 A data link communication driver \\
                 High-level memory management and message passing \\
                 Frame-level network communication \\
                 A disk driver \\
                 File systems \\
                 Exception handling and support routines \\
                 System configuration \\
                 Appendices \\
                 Bibliography \\
                 Index",
}


bibtype: book
filename: master.bib
label: Comer:1987:OSD
author: Douglas E. Comer
title: Operating Systems Design. Internetworking with XINU
volume: 2
publisher: pub-PH
address: pub-PH:adr
pages: xix + 187
year: 1987
ISBN: 0-13-637414-X OR 013637414X
ISBN13: 978-0-13-637414-5 OR 9780136374145
LCCN: QA76.6 .C6275 1984
bibdate: Tue Dec 14 23:30:03 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:30:03 ???
acknowledgement: ack-nhfb
rawauthor: Douglas E. Comer
rawtitle: Operating Systems Design. Internetworking with {XINU}
entry:
@Book{Comer:1987:OSD,
  author =       "Douglas E. Comer",
  title =        "Operating Systems Design. Internetworking with
                 {XINU}",
  volume =       "2",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1987",
  ISBN =         "0-13-637414-X",
  ISBN-13 =      "978-0-13-637414-5",
  LCCN =         "QA76.6 .C6275 1984",
  bibdate =      "Tue Dec 14 23:30:03 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Comer:1988:ITI
author: Douglas E. Comer
title: Internetworking with TCP / IP. Principles, Protocols, and Architecture
publisher: pub-PH
address: pub-PH:adr
pages: xix + 187
year: 1988
ISBN: 0-13-470154-2 OR 0134701542
ISBN13: 978-0-13-470154-7 OR 9780134701547
LCCN: TK5105.5 .C59 1988
bibdate: Tue Dec 14 23:41:49 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 23:41:49 ???
acknowledgement: ack-nhfb
rawauthor: Douglas E. Comer
rawtitle: Internetworking with {TCP\slash IP}. Principles, Protocols, and Architecture
entry:
@Book{Comer:1988:ITI,
  author =       "Douglas E. Comer",
  title =        "Internetworking with {TCP\slash IP}. Principles,
                 Protocols, and Architecture",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1988",
  ISBN =         "0-13-470154-2",
  ISBN-13 =      "978-0-13-470154-7",
  LCCN =         "TK5105.5 .C59 1988",
  bibdate =      "Tue Dec 14 23:41:49 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$27.00",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Comer:1991:ITI
author: Douglas E. Comer and David L. Stevens
title: Internetworking with TCP / IP. Design, Implementation, and Internals
volume: 2
publisher: pub-PH
address: pub-PH:adr
pages: xix + 187
year: 1991
ISBN: 0-13-465378-5, 0-13-472242-6 OR 0134653785, 0134722426
ISBN13: 978-0-13-465378-5, 978-0-13-472242-9 OR 9780134653785, 9780134722429
LCCN: TK5105.5 .C59 1991-92
bibdate: Tue Dec 14 23:29:18 1993
bibtimestamp: 1993.12.14 23:29:18 ???
acknowledgement: ack-nhfb
rawauthor: Douglas E. Comer and David L. Stevens
rawtitle: Internetworking with {TCP\slash IP}. {Design}, Implementation, and Internals
bibsource:
https://www.math.utah.edu/pub/tex/bib/internet.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Book{Comer:1991:ITI,
  author =       "Douglas E. Comer and David L. Stevens",
  title =        "Internetworking with {TCP\slash IP}. {Design},
                 Implementation, and Internals",
  volume =       "2",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  year =         "1991",
  ISBN =         "0-13-465378-5, 0-13-472242-6",
  ISBN-13 =      "978-0-13-465378-5, 978-0-13-472242-9",
  LCCN =         "TK5105.5 .C59 1991-92",
  bibdate =      "Tue Dec 14 23:29:18 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Comer:2000:IBE
author: Douglas Comer
title: The Internet book: everything you need to know about computer networking and how the Internet works
publisher: pub-PH
address: pub-PH:adr
edition: Third
pages: xxvi + 351
year: 2000
ISBN: 0-13-030852-8 OR 0130308528
ISBN13: 978-0-13-030852-8 OR 9780130308528
LCCN: TK5105.875.I57 C65 2000
bibdate: Mon Apr 29 11:50:37 MDT 2002
bibtimestamp: 2002.04.29 11:50:37 MDT
keywords: Internet
acknowledgement: ack-nhfb
rawauthor: Douglas Comer
bibsource:
https://www.math.utah.edu/pub/tex/bib/internet2000.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1: The Internet Has Arrived 2: Getting Started: Hands-On Experience 3: Telephones Everywhere 4: The World Was Once Analog 5: The Once And Future Digital Network 6: Basic Communication 7: The Local Area Network Arrives 8: Internet: The Early Years 9: Two Decades Of incredible Growth 10: The Global Internet 11: A Global Information Infrastructure 12: Packet Switching 13: Internet: A Network Of Networks 14: ISPs And Network Connections 15: IP: Software To Create A Virtual Network 16: TCP: Software For Reliable Communication 17: Clients + Servers = Distributed Computing 18: Names For Computers 19: Why The Internet Works Well 20: Electronic Mail 21: Bulletin Board Service (Network News) 22: Browsing The World Wide Web 23: World Wide Web Documents (HTML) 24: Advanced Web Technologies (Forms, Frames, Plugins, CGI, Java, JavaScript) 25: Automated Web Search (Search Engines) 26: Audio And Video Communication 27: Faxes And Files (FTP) 28: Remote Login And Remote Desktops (TELNET) 29: Facilities For Secure Communication 30: Electronic Commerce And Business 31: The Global Digital Library Appendix 1: Example Netnews Newsgroups Appendix 2: Glossary Of Internet Terms

rawtitle:
The {Internet} book: everything you need to know about computer networking and how the {Internet} works

rawTOC:
1: The Internet Has Arrived \\ 2: Getting Started: Hands-On Experience \\ 3: Telephones Everywhere \\ 4: The World Was Once Analog \\ 5: The Once And Future Digital Network \\ 6: Basic Communication \\ 7: The Local Area Network Arrives \\ 8: Internet: The Early Years \\ 9: Two Decades Of incredible Growth \\ 10: The Global Internet \\ 11: A Global Information Infrastructure \\ 12: Packet Switching \\ 13: Internet: A Network Of Networks \\ 14: ISPs And Network Connections \\ 15: IP: Software To Create A Virtual Network \\ 16: TCP: Software For Reliable Communication \\ 17: Clients + Servers = Distributed Computing \\ 18: Names For Computers \\ 19: Why The Internet Works Well \\ 20: Electronic Mail \\ 21: Bulletin Board Service (Network News) \\ 22: Browsing The World Wide Web \\ 23: World Wide Web Documents (HTML) \\ 24: Advanced Web Technologies (Forms, Frames, Plugins, CGI, Java, JavaScript) \\ 25: Automated Web Search (Search Engines) \\ 26: Audio And Video Communication \\ 27: Faxes And Files (FTP) \\ 28: Remote Login And Remote Desktops (TELNET) \\ 29: Facilities For Secure Communication \\ 30: Electronic Commerce And Business \\ 31: The Global Digital Library \\ Appendix 1: Example Netnews Newsgroups \\ Appendix 2: Glossary Of Internet Terms

entry:
@Book{Comer:2000:IBE,
  author =       "Douglas Comer",
  title =        "The {Internet} book: everything you need to know about
                 computer networking and how the {Internet} works",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Third",
  pages =        "xxvi + 351",
  year =         "2000",
  ISBN =         "0-13-030852-8",
  ISBN-13 =      "978-0-13-030852-8",
  LCCN =         "TK5105.875.I57 C65 2000",
  bibdate =      "Mon Apr 29 11:50:37 MDT 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Internet",
  tableofcontents = "1: The Internet Has Arrived \\
                 2: Getting Started: Hands-On Experience \\
                 3: Telephones Everywhere \\
                 4: The World Was Once Analog \\
                 5: The Once And Future Digital Network \\
                 6: Basic Communication \\
                 7: The Local Area Network Arrives \\
                 8: Internet: The Early Years \\
                 9: Two Decades Of incredible Growth \\
                 10: The Global Internet \\
                 11: A Global Information Infrastructure \\
                 12: Packet Switching \\
                 13: Internet: A Network Of Networks \\
                 14: ISPs And Network Connections \\
                 15: IP: Software To Create A Virtual Network \\
                 16: TCP: Software For Reliable Communication \\
                 17: Clients + Servers = Distributed Computing \\
                 18: Names For Computers \\
                 19: Why The Internet Works Well \\
                 20: Electronic Mail \\
                 21: Bulletin Board Service (Network News) \\
                 22: Browsing The World Wide Web \\
                 23: World Wide Web Documents (HTML) \\
                 24: Advanced Web Technologies (Forms, Frames, Plugins,
                 CGI, Java, JavaScript) \\
                 25: Automated Web Search (Search Engines) \\
                 26: Audio And Video Communication \\
                 27: Faxes And Files (FTP) \\
                 28: Remote Login And Remote Desktops (TELNET) \\
                 29: Facilities For Secure Communication \\
                 30: Electronic Commerce And Business \\
                 31: The Global Digital Library \\
                 Appendix 1: Example Netnews Newsgroups \\
                 Appendix 2: Glossary Of Internet Terms",
}


bibtype: book
filename: master.bib
label: Comer:2000:ITI
author: Douglas E. Comer
title: Internetworking with TCP / IP: Volume 1. Principles, Protocols, and Architectures
publisher: pub-PH
address: pub-PH:adr
edition: Fourth
pages: xxix + 750
year: 2000
ISBN: 0-13-018380-6 (hardcover) OR 0130183806 (hardcover)
ISBN13: 978-0-13-018380-4 (hardcover) OR 9780130183804 (hardcover)
LCCN: TK5105.585 .C66 2000 v.1, 3 (2000-c2001)
bibdate: Mon Apr 29 11:50:37 MDT 2002
bibtimestamp: 2002.04.29 11:50:37 MDT
keywords: client/server computing; Internetworking (telecommunication); TCP/IP (computer network protocol)
acknowledgement: ack-nhfb
rawauthor: Douglas E. Comer
rawtitle: Internetworking with {TCP\slash IP}: Volume 1. Principles, Protocols, and Architectures
bibsource:
https://www.math.utah.edu/pub/tex/bib/internet2000.bib; https://www.math.utah.edu/pub/tex/bib/master.bib

TOC:
1: Introduction And Overview 2: Review Of Underlying Network Technologies 3: Internetworking Concept And Architectural Model. 4: Classful Internet Addresses 5: Mapping Internet Addresses To Physical Addresses (ARP) 6: Determining An Internet Address At Startup (RARP). 7: Internet Protocol: Connectionless Datagram Delivery. 8: Internet Protocol: Routing IP Datagrams 9: Internet Protocol: Error And Control Messages (ICMP) 10: Classless And Subnet Address Extensions (CIDR). 11: Protocol Layering 12: User Datagram Protocol (UDP) 13: Reliable Stream Transport Service (TCP) 14: Routing: Cores, Peers, And Algorithms 15: Routing: Exterior Gateway Protocols And Autonomous Systems (BGP) 16: Routing: In An Autonomous System (RIP, OSPF, HELLO) 17: Internet Multicasting 18: TCP/IP Over ATM Networks 19: Mobile IP 20: Private Network Interconnection (NAT, VPN) 21: Client-Server Model Of Interaction 22: The Socket Interface 23: Bootstrap And Autoconfiguration (BOOTP, DHCP). 24: The Domain Name System (DNS) 25: Applications: Remote Login (TELNET, Rlogin) 26: Applications: File Transfer And Access (FTP, TFTP, NFS) 27: Applications: Electronic Mail (SMTP, POP, IMAP, MIME) 28: Applications: World Wide Web (HTTP) 29: Applications: Voice And Video Over IP (RTP) 30: Applications: Internet Management (SNMP) 31: Summary Of Protocol Dependencies 32: Internet Security And Firewall Design (IPsec). 33: The Future Of TCP/IP (IPv6) Appendix 1: A Guide To RFCs Appendix 2: Glossary Of Internetworking Terms And Abbreviations

rawTOC:
1: Introduction And Overview \\ 2: Review Of Underlying Network Technologies \\ 3: Internetworking Concept And Architectural Model. \\ 4: Classful Internet Addresses \\ 5: Mapping Internet Addresses To Physical Addresses (ARP) \\ 6: Determining An Internet Address At Startup (RARP). \\ 7: Internet Protocol: Connectionless Datagram Delivery. \\ 8: Internet Protocol: Routing IP Datagrams \\ 9: Internet Protocol: Error And Control Messages (ICMP) \\ 10: Classless And Subnet Address Extensions (CIDR). \\ 11: Protocol Layering \\ 12: User Datagram Protocol (UDP) \\ 13: Reliable Stream Transport Service (TCP) \\ 14: Routing: Cores, Peers, And Algorithms \\ 15: Routing: Exterior Gateway Protocols And Autonomous Systems (BGP) \\ 16: Routing: In An Autonomous System (RIP, OSPF, HELLO) \\ 17: Internet Multicasting \\ 18: TCP/IP Over ATM Networks \\ 19: Mobile IP \\ 20: Private Network Interconnection (NAT, VPN) \\ 21: Client-Server Model Of Interaction \\ 22: The Socket Interface \\ 23: Bootstrap And Autoconfiguration (BOOTP, DHCP). \\ 24: The Domain Name System (DNS) \\ 25: Applications: Remote Login (TELNET, Rlogin) \\ 26: Applications: File Transfer And Access (FTP, TFTP, NFS) \\ 27: Applications: Electronic Mail (SMTP, POP, IMAP, MIME) \\ 28: Applications: World Wide Web (HTTP) \\ 29: Applications: Voice And Video Over IP (RTP) \\ 30: Applications: Internet Management (SNMP) \\ 31: Summary Of Protocol Dependencies \\ 32: Internet Security And Firewall Design (IPsec). \\ 33: The Future Of TCP/IP (IPv6) \\ Appendix 1: A Guide To RFCs \\ Appendix 2: Glossary Of Internetworking Terms And Abbreviations

entry:
@Book{Comer:2000:ITI,
  author =       "Douglas E. Comer",
  title =        "Internetworking with {TCP\slash IP}: Volume 1.
                 Principles, Protocols, and Architectures",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Fourth",
  pages =        "xxix + 750",
  year =         "2000",
  ISBN =         "0-13-018380-6 (hardcover)",
  ISBN-13 =      "978-0-13-018380-4 (hardcover)",
  LCCN =         "TK5105.585 .C66 2000 v.1, 3 (2000-c2001)",
  bibdate =      "Mon Apr 29 11:50:37 MDT 2002",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/internet2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  keywords =     "client/server computing; Internetworking
                 (telecommunication); TCP/IP (computer network
                 protocol)",
  tableofcontents = "1: Introduction And Overview \\
                 2: Review Of Underlying Network Technologies \\
                 3: Internetworking Concept And Architectural Model. \\
                 4: Classful Internet Addresses \\
                 5: Mapping Internet Addresses To Physical Addresses
                 (ARP) \\
                 6: Determining An Internet Address At Startup (RARP).
                 \\
                 7: Internet Protocol: Connectionless Datagram Delivery.
                 \\
                 8: Internet Protocol: Routing IP Datagrams \\
                 9: Internet Protocol: Error And Control Messages (ICMP)
                 \\
                 10: Classless And Subnet Address Extensions (CIDR). \\
                 11: Protocol Layering \\
                 12: User Datagram Protocol (UDP) \\
                 13: Reliable Stream Transport Service (TCP) \\
                 14: Routing: Cores, Peers, And Algorithms \\
                 15: Routing: Exterior Gateway Protocols And Autonomous
                 Systems (BGP) \\
                 16: Routing: In An Autonomous System (RIP, OSPF, HELLO)
                 \\
                 17: Internet Multicasting \\
                 18: TCP/IP Over ATM Networks \\
                 19: Mobile IP \\
                 20: Private Network Interconnection (NAT, VPN) \\
                 21: Client-Server Model Of Interaction \\
                 22: The Socket Interface \\
                 23: Bootstrap And Autoconfiguration (BOOTP, DHCP). \\
                 24: The Domain Name System (DNS) \\
                 25: Applications: Remote Login (TELNET, Rlogin) \\
                 26: Applications: File Transfer And Access (FTP, TFTP,
                 NFS) \\
                 27: Applications: Electronic Mail (SMTP, POP, IMAP,
                 MIME) \\
                 28: Applications: World Wide Web (HTTP) \\
                 29: Applications: Voice And Video Over IP (RTP) \\
                 30: Applications: Internet Management (SNMP) \\
                 31: Summary Of Protocol Dependencies \\
                 32: Internet Security And Firewall Design (IPsec). \\
                 33: The Future Of TCP/IP (IPv6) \\
                 Appendix 1: A Guide To RFCs \\
                 Appendix 2: Glossary Of Internetworking Terms And
                 Abbreviations",
}


bibtype: book
filename: master.bib
label: Comer:2013:IT
author: Douglas E. Comer
title: Internetworking with TCP
publisher: Pearson
address: New York, NY, USA
edition: Sixth
pages: xxviii + 689
year: 2013
ISBN: 0-13-608530-X (hardcover) OR 013608530X (hardcover)
ISBN13: 978-0-13-608530-0 (hardcover) OR 9780136085300 (hardcover)
LCCN: TK5105.585 .C66 2014
bibdate: Mon Dec 9 08:04:33 MST 2019
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2019.12.09 08:04:33 MST
acknowledgement: ack-nhfb
rawauthor: Douglas E. Comer
rawtitle: Internetworking with {TCP}
abstract:
An internationally best-selling, conceptual introduction to the TCP/IP protocols and Internetworking, this book interweaves a clear discussion of fundamentals and scientific principles with details and examples drawn from the latest technologies. Leading author Douglas Comer covers layering and packet formats for all the Internet protocols, including TCP, IPv4, IPv6, DHCP, and DNS. In addition, the text explains new trends in Internet systems, including packet classification, Software Defined Networking (SDN), and mesh protocols used in The Internet of Things. The text is appropriate for individuals interested in learning more about TCP/IP protocols, Internet architecture, and current networking technologies, as well as engineers who build network systems. It is suitable for junior to graduate-level courses in Computer Networks, Data Networks, Network Protocols, and Internetworking.

subject:
TCP/IP (Computer network protocol); Client/server computing; Internetworking (Telecommunication); TCP/IP; Klient-server-teknik; Datanat; Client/server computing; Internetworking (Telecommunication); TCP/IP (Computer network protocol)

TOC:
Overview of underlying network technologies Internetworking concept and architectural model Protocol layering Internet addressing Mapping internet addresses to physical addresses (ARP) Internet protocol: connectionless datagram delivery (IPv4, IPv6) Internet protocol: forwarding IP datagrams Internet protocol: error and control messages (ICMP) User datagram protocol (UDP) Reliable stream transport service (TCP) Routing architecture: cores, peers and algorithms Routing among autonomous systems (BGP) Routing within an autonomous system (RIP, RIPng, OSPF, IS-IS) Internet multicasting Label switching, flows and MPLS Packet classification Mobility and mobile IP Network virtualization: VPNs, NATs and overlays Client-server model of interaction The socket API Bootstrap and autoconfiguration (DHCP, NDP, IPv6-ND) The domain name system (DNS) Electronic mail (SMTP, POP, IMAP, MIME) World wide web (HTTP) Voice and voice over IP (RTP, RSVP QoS) Network management (SNMP) Software defined networking (SDN, OperFlow) Internet security and firewall design (IPsec, SSL)

rawabstract:
An internationally best-selling, conceptual introduction to the TCP/IP protocols and Internetworking, this book interweaves a clear discussion of fundamentals and scientific principles with details and examples drawn from the latest technologies. Leading author Douglas Comer covers layering and packet formats for all the Internet protocols, including TCP, IPv4, IPv6, DHCP, and DNS. In addition, the text explains new trends in Internet systems, including packet classification, Software Defined Networking (SDN), and mesh protocols used in The Internet of Things. The text is appropriate for individuals interested in learning more about TCP/IP protocols, Internet architecture, and current networking technologies, as well as engineers who build network systems. It is suitable for junior to graduate-level courses in Computer Networks, Data Networks, Network Protocols, and Internetworking.

shortTOC:
vol. 1. Principles, protocols, and architecture vol. 2. Design, implementation, and internals vol. 3. Client-server programming and applications

rawshortTOC:
vol. 1. Principles, protocols, and architecture \\ vol. 2. Design, implementation, and internals \\ vol. 3. Client-server programming and applications

rawTOC:
Overview of underlying network technologies \\ Internetworking concept and architectural model \\ Protocol layering \\ Internet addressing \\ Mapping internet addresses to physical addresses (ARP) \\ Internet protocol: connectionless datagram delivery (IPv4, IPv6) \\ Internet protocol: forwarding IP datagrams \\ Internet protocol: error and control messages (ICMP) \\ User datagram protocol (UDP) \\ Reliable stream transport service (TCP) \\ Routing architecture: cores, peers and algorithms \\ Routing among autonomous systems (BGP) \\ Routing within an autonomous system (RIP, RIPng, OSPF, IS-IS) \\ Internet multicasting \\ Label switching, flows and MPLS \\ Packet classification \\ Mobility and mobile IP \\ Network virtualization: VPNs, NATs and overlays \\ Client-server model of interaction \\ The socket API \\ Bootstrap and autoconfiguration (DHCP, NDP, IPv6-ND) \\ The domain name system (DNS) \\ Electronic mail (SMTP, POP, IMAP, MIME) \\ World wide web (HTTP) \\ Voice and voice over IP (RTP, RSVP \\ QoS) \\ Network management (SNMP) \\ Software defined networking (SDN, OperFlow) \\ Internet security and firewall design (IPsec, SSL)

entry:
@Book{Comer:2013:IT,
  author =       "Douglas E. Comer",
  title =        "Internetworking with {TCP}",
  publisher =    "Pearson",
  address =      "New York, NY, USA",
  edition =      "Sixth",
  pages =        "xxviii + 689",
  year =         "2013",
  ISBN =         "0-13-608530-X (hardcover)",
  ISBN-13 =      "978-0-13-608530-0 (hardcover)",
  LCCN =         "TK5105.585 .C66 2014",
  bibdate =      "Mon Dec 9 08:04:33 MST 2019",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "An internationally best-selling, conceptual
                 introduction to the TCP/IP protocols and
                 Internetworking, this book interweaves a clear
                 discussion of fundamentals and scientific principles
                 with details and examples drawn from the latest
                 technologies. Leading author Douglas Comer covers
                 layering and packet formats for all the Internet
                 protocols, including TCP, IPv4, IPv6, DHCP, and DNS. In
                 addition, the text explains new trends in Internet
                 systems, including packet classification, Software
                 Defined Networking (SDN), and mesh protocols used in
                 The Internet of Things. The text is appropriate for
                 individuals interested in learning more about TCP/IP
                 protocols, Internet architecture, and current
                 networking technologies, as well as engineers who build
                 network systems. It is suitable for junior to
                 graduate-level courses in Computer Networks, Data
                 Networks, Network Protocols, and Internetworking.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  shorttableofcontents = "vol. 1. Principles, protocols, and
                 architecture \\
                 vol. 2. Design, implementation, and internals \\
                 vol. 3. Client-server programming and applications",
  subject =      "TCP/IP (Computer network protocol); Client/server
                 computing; Internetworking (Telecommunication); TCP/IP;
                 Klient-server-teknik; Datan{\"a}t; Client/server
                 computing; Internetworking (Telecommunication); TCP/IP
                 (Computer network protocol)",
  tableofcontents = "Overview of underlying network technologies \\
                 Internetworking concept and architectural model \\
                 Protocol layering \\
                 Internet addressing \\
                 Mapping internet addresses to physical addresses (ARP)
                 \\
                 Internet protocol: connectionless datagram delivery
                 (IPv4, IPv6) \\
                 Internet protocol: forwarding IP datagrams \\
                 Internet protocol: error and control messages (ICMP)
                 \\
                 User datagram protocol (UDP) \\
                 Reliable stream transport service (TCP) \\
                 Routing architecture: cores, peers and algorithms \\
                 Routing among autonomous systems (BGP) \\
                 Routing within an autonomous system (RIP, RIPng, OSPF,
                 IS-IS) \\
                 Internet multicasting \\
                 Label switching, flows and MPLS \\
                 Packet classification \\
                 Mobility and mobile IP \\
                 Network virtualization: VPNs, NATs and overlays \\
                 Client-server model of interaction \\
                 The socket API \\
                 Bootstrap and autoconfiguration (DHCP, NDP, IPv6-ND)
                 \\
                 The domain name system (DNS) \\
                 Electronic mail (SMTP, POP, IMAP, MIME) \\
                 World wide web (HTTP) \\
                 Voice and voice over IP (RTP, RSVP \\
                 QoS) \\
                 Network management (SNMP) \\
                 Software defined networking (SDN, OperFlow) \\
                 Internet security and firewall design (IPsec, SSL)",
}


bibtype: book
filename: master.bib
label: Companion:1964:CB
author: Audrey L. Companion
title: Chemical Bonding
publisher: pub-MCGRAW-HILL
address: pub-MCGRAW-HILL:adr
pages: vi + 155
year: 1964
LCCN: QD461 .C63
bibdate: Sat Jul 25 13:55:27 1998
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1998.07.25 13:55:27 ???
acknowledgement: ack-nhfb
rawauthor: Audrey L. Companion
rawtitle: Chemical Bonding
entry:
@Book{Companion:1964:CB,
  author =       "Audrey L. Companion",
  title =        "Chemical Bonding",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "vi + 155",
  year =         "1964",
  LCCN =         "QD461 .C63",
  bibdate =      "Sat Jul 25 13:55:27 1998",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
  xxISBN =       "none",
}


bibtype: book
filename: master.bib
label: Comrie:1964:KFF
author: L. J. Comrie
title: Knott's Four-Figure Mathematical Tables
publisher: pub-W-R-CHAMBERS
address: pub-W-R-CHAMBERS:adr
pages: vi + 155
year: 1964
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
acknowledgement: ack-nhfb
rawauthor: L. J. Comrie
rawtitle: {Knott}'s Four-Figure Mathematical Tables
entry:
@Book{Comrie:1964:KFF,
  author =       "L. J. Comrie",
  title =        "{Knott}'s Four-Figure Mathematical Tables",
  publisher =    pub-W-R-CHAMBERS,
  address =      pub-W-R-CHAMBERS:adr,
  year =         "1964",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Comrie:1987:WML
editor: Bernard Comrie
title: The World's Major Languages
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: xiii + 1025
year: 1987
LCCN: P371.W6 1987
bibdate: Sat Sep 28 17:27:01 1996
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1996.09.28 17:27:01 ???
note: Reprinted in paperback in 1990.
acknowledgement: ack-nhfb
raweditor: Bernard Comrie
rawnote: Reprinted in paperback in 1990.
rawtitle: The World's Major Languages
ISBN:
0-19-520521-9 (hardcover), 0-19-506511-5 (paperback) OR 0195205219 (hardcover), 0195065115 (paperback)

ISBN13:
978-0-19-520521-3 (hardcover), 978-0-19-506511-4 (paperback) OR 9780195205213 (hardcover), 9780195065114 (paperback)

entry:
@Book{Comrie:1987:WML,
  editor =       "Bernard Comrie",
  title =        "The World's Major Languages",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xiii + 1025",
  year =         "1987",
  ISBN =         "0-19-520521-9 (hardcover), 0-19-506511-5 (paperback)",
  ISBN-13 =      "978-0-19-520521-3 (hardcover), 978-0-19-506511-4
                 (paperback)",
  LCCN =         "P371.W6 1987",
  bibdate =      "Sat Sep 28 17:27:01 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Reprinted in paperback in 1990.",
  price =        "US\$35.00",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Conant:2005:EPR
author: Jennet Conant
title: 109 East Palace: Robert Oppenheimer and the secret city of Los Alamos
publisher: pub-SIMON-SCHUSTER
address: pub-SIMON-SCHUSTER:adr
pages: xviii + 425 + 16
year: 2005
ISBN: 0-7432-5007-9 OR 0743250079
ISBN13: 978-0-7432-5007-8 OR 9780743250078
LCCN: QC773.A1 C66 2005
bibdate: Mon Dec 12 15:27:36 MST 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; melvyl.cdlib.org:210/CDL90
bibtimestamp: 2005.12.12 15:27:36 MST
remark: Maps on lining papers.
subject: Atomic bomb; United States; History; McKibbin, Dorothy Scarritt; Oppenheimer, J. Robert
acknowledgement: ack-nhfb
subjectdates: 1897--1985; 1904--1967
rawauthor: Jennet Conant
rawtitle: {109 East Palace}: {Robert Oppenheimer} and the secret city of {Los Alamos}
abstract:
This book captures the drama of 27 perilous months at Los Alamos, a secret city cut off from the rest of society, ringed by barbed wire, where Oppenheimer and his young recruits lived as virtual prisoners of the U.S. government---freshly minted secretaries and worldly scientists contending with living conditions straight out of pioneer days, racing to build the first atomic bomb before Germany could. Oppenheimer was as arrogant as he was inexperienced, and few believed the 38-year-old theoretical physicist would succeed. Yet despite the obstacles, he forged a vibrant community through the sheer force of his personality.

TOC:
Charmed A most improbable choice The bluest eyes I've ever seen Cowboy boots and all The gatekeeper The professor and the general Summer camp Lost almost Welcome distractions Nothing dangerous The big shot Baby boom Summer lightning A bad case of the jitters Playing with fire A dirty trick Everything was different A rain of ruin By our works we are committed Elysian dreamer Scorpions in a bottle Fallout

rawabstract:
This book captures the drama of 27 perilous months at Los Alamos, a secret city cut off from the rest of society, ringed by barbed wire, where Oppenheimer and his young recruits lived as virtual prisoners of the U.S. government---freshly minted secretaries and worldly scientists contending with living conditions straight out of pioneer days, racing to build the first atomic bomb before Germany could. Oppenheimer was as arrogant as he was inexperienced, and few believed the 38-year-old theoretical physicist would succeed. Yet despite the obstacles, he forged a vibrant community through the sheer force of his personality.

rawTOC:
Charmed \\ A most improbable choice \\ The bluest eyes I've ever seen \\ Cowboy boots and all \\ The gatekeeper \\ The professor and the general \\ Summer camp \\ Lost almost \\ Welcome distractions \\ Nothing dangerous \\ The big shot \\ Baby boom \\ Summer lightning \\ A bad case of the jitters \\ Playing with fire \\ A dirty trick \\ Everything was different \\ A rain of ruin \\ By our works we are committed \\ Elysian dreamer \\ Scorpions in a bottle \\ Fallout

entry:
@Book{Conant:2005:EPR,
  author =       "Jennet Conant",
  title =        "{109 East Palace}: {Robert Oppenheimer} and the secret
                 city of {Los Alamos}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xviii + 425 + 16",
  year =         "2005",
  ISBN =         "0-7432-5007-9",
  ISBN-13 =      "978-0-7432-5007-8",
  LCCN =         "QC773.A1 C66 2005",
  bibdate =      "Mon Dec 12 15:27:36 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 melvyl.cdlib.org:210/CDL90",
  abstract =     "This book captures the drama of 27 perilous months at
                 Los Alamos, a secret city cut off from the rest of
                 society, ringed by barbed wire, where Oppenheimer and
                 his young recruits lived as virtual prisoners of the
                 U.S. government---freshly minted secretaries and
                 worldly scientists contending with living conditions
                 straight out of pioneer days, racing to build the first
                 atomic bomb before Germany could. Oppenheimer was as
                 arrogant as he was inexperienced, and few believed the
                 38-year-old theoretical physicist would succeed. Yet
                 despite the obstacles, he forged a vibrant community
                 through the sheer force of his personality.",
  acknowledgement = ack-nhfb,
  remark =       "Maps on lining papers.",
  subject =      "Atomic bomb; United States; History; McKibbin, Dorothy
                 Scarritt; Oppenheimer, J. Robert",
  subject-dates = "1897--1985; 1904--1967",
  tableofcontents = "Charmed \\
                 A most improbable choice \\
                 The bluest eyes I've ever seen \\
                 Cowboy boots and all \\
                 The gatekeeper \\
                 The professor and the general \\
                 Summer camp \\
                 Lost almost \\
                 Welcome distractions \\
                 Nothing dangerous \\
                 The big shot \\
                 Baby boom \\
                 Summer lightning \\
                 A bad case of the jitters \\
                 Playing with fire \\
                 A dirty trick \\
                 Everything was different \\
                 A rain of ruin \\
                 By our works we are committed \\
                 Elysian dreamer \\
                 Scorpions in a bottle \\
                 Fallout",
}


bibtype: book
filename: master.bib
label: Conant:2009:IRD
author: Jennet Conant
title: The Irregulars: Roald Dahl and the British Spy Ring in Wartime Washington
publisher: pub-SIMON-SCHUSTER
address: pub-SIMON-SCHUSTER:adr
pages: xxii + 391
year: 2009
LCCN: M10.F03629
bibdate: Mon Oct 25 10:46:47 MDT 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; library.ox.ac.uk:210/ADVANCE
bibtimestamp: 2010.10.25 10:46:47 MDT
remark: Originally published in 2008.
acknowledgement: ack-nhfb
rawauthor: Jennet Conant
rawtitle: The Irregulars: {Roald Dahl} and the {British} Spy Ring in Wartime {Washington}
ISBN:
0-7432-9458-0 (hardcover), 0-7432-9459-9 (paperback) OR 0743294580 (hardcover), 0743294599 (paperback)

ISBN13:
978-0-7432-9458-4 (hardcover), 978-0-7432-9459-1 (paperback) OR 9780743294584 (hardcover), 9780743294591 (paperback)

subject:
Dahl, Roald; career in espionage; World War, 1939--1945; Secret Service; Great Britain; United States; propaganda; propaganda, British

TOC:
1: The usual drill 2: Piece of cake 3: Enthusiastic amateurs 4: Special relationships 5: Buffers 6: One long loaf 7: The war in Washington 8: Dirty work 9: Good value 10: Enemy maneuvers 11: The glamour set 12: Full lives

rawTOC:
1: The usual drill \\ 2: Piece of cake \\ 3: Enthusiastic amateurs \\ 4: Special relationships \\ 5: Buffers \\ 6: One long loaf \\ 7: The war in Washington \\ 8: Dirty work \\ 9: Good value \\ 10: Enemy maneuvers \\ 11: The glamour set \\ 12: Full lives

entry:
@Book{Conant:2009:IRD,
  author =       "Jennet Conant",
  title =        "The Irregulars: {Roald Dahl} and the {British} Spy
                 Ring in Wartime {Washington}",
  publisher =    pub-SIMON-SCHUSTER,
  address =      pub-SIMON-SCHUSTER:adr,
  pages =        "xxii + 391",
  year =         "2009",
  ISBN =         "0-7432-9458-0 (hardcover), 0-7432-9459-9 (paperback)",
  ISBN-13 =      "978-0-7432-9458-4 (hardcover), 978-0-7432-9459-1
                 (paperback)",
  LCCN =         "M10.F03629",
  bibdate =      "Mon Oct 25 10:46:47 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  acknowledgement = ack-nhfb,
  remark =       "Originally published in 2008.",
  subject =      "Dahl, Roald; career in espionage; World War,
                 1939--1945; Secret Service; Great Britain; United
                 States; propaganda; propaganda, British",
  tableofcontents = "1: The usual drill \\
                 2: Piece of cake \\
                 3: Enthusiastic amateurs \\
                 4: Special relationships \\
                 5: Buffers \\
                 6: One long loaf \\
                 7: The war in Washington \\
                 8: Dirty work \\
                 9: Good value \\
                 10: Enemy maneuvers \\
                 11: The glamour set \\
                 12: Full lives",
}


bibtype: book
filename: master.bib
label: Conant:2020:GSC
author: Jennet Conant
title: The Great Secret: the Classified World War II Disaster That Launched the War on Cancer
publisher: W. W. Norton and Company, Inc.
address: New York, NY
pages: xviii + 380 + 8
year: 2020
LCCN: RM260 .C63 2020; RM261 .C66 2020
bibdate: Tue Dec 21 10:49:39 MST 2021
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 2021.12.21 10:49:39 MST
acknowledgement: ack-nhfb
rawauthor: Jennet Conant
rawtitle: The Great Secret: the Classified {World War II} Disaster That Launched the War on Cancer
ISBN:
0-393-86843-5 (paperback), 1-324-00250-6 (hardcover), 1-324-00251-4 (e-book) OR 0393868435 (paperback), 1324002506 (hardcover), 1324002514 (ebook)

ISBN13:
978-0-393-86843-2 (paperback), 978-1-324-00250-5 (hardcover), 978-1-324-00251-2 (e-book) OR 9780393868432 (paperback), 9781324002505 (hardcover), 9781324002512 (ebook)

abstract:
On the night of December 2, 1943, the Luftwaffe bombed a critical Allied port in Bari, Italy, sinking seventeen ships and killing over a thousand servicemen and hundreds of civilians. Caught in the surprise air raid was the John Harvey, an American Liberty ship carrying a top-secret cargo of 2,000 mustard bombs to be used in retaliation if the Germans resorted to gas warfare. After young sailors began suddenly dying with mysterious symptoms, Lieutenant Colonel Stewart Alexander, a doctor and chemical weapons expert, was dispatched to investigate. He quickly diagnosed mustard gas exposure, which both Churchill and Eisenhower denied. But Alexander's breakthrough observations about the toxic effects of mustard on white blood cells, as well as the heroic perseverance of Colonel Cornelius P. Rhoads --- a researcher and doctor as brilliant as he was arrogant and self-destructive --- were instrumental in ushering in a new era of cancer research led by the Sloan Kettering Institute.

subject:
Chemotherapy; History; Cancer; Treatment; Research; Mustard gas; Toxicology; World War, 1939-1945; Health aspects; Drug Therapy; Neoplasms; therapy; HISTORY / Military / World War II.; MEDICAL / Chemotherapy.; MEDICAL / History.; Toxicology.; Chemotherapy.; Treatment.; Research.; Chemotherapy.; Treatment.; Research.

TOC:
Prologue: ``Little Pearl Harbor'' / ix 1: ``A Regiment Of Wizards'' / 1 2: ``The Die Is Cast'' / 36 3: ``Angels In Long Underwear'' / 60 4: ``Journey Into The Nightmare'' / 74 5: ``A Special Affinity'' / 99 6: ``Recommendation To Secrecy'' / 125 7: ``Magnum Opus'' / 149 8: ``Forgotten Front'' / 174 9: ``A Riddle Wrapped In A Mystery'' / 194 10: ``Frontal Attack'' / 213 11: Trials And Tribulations / 236 12: ``The Sword And The Ploughshare'' / 250 Epilogue: Belated justice / 292

rawabstract:
On the night of December 2, 1943, the Luftwaffe bombed a critical Allied port in Bari, Italy, sinking seventeen ships and killing over a thousand servicemen and hundreds of civilians. Caught in the surprise air raid was the John Harvey, an American Liberty ship carrying a top-secret cargo of 2,000 mustard bombs to be used in retaliation if the Germans resorted to gas warfare. After young sailors began suddenly dying with mysterious symptoms, Lieutenant Colonel Stewart Alexander, a doctor and chemical weapons expert, was dispatched to investigate. He quickly diagnosed mustard gas exposure, which both Churchill and Eisenhower denied. But Alexander's breakthrough observations about the toxic effects of mustard on white blood cells, as well as the heroic perseverance of Colonel Cornelius P. Rhoads --- a researcher and doctor as brilliant as he was arrogant and self-destructive --- were instrumental in ushering in a new era of cancer research led by the Sloan Kettering Institute.

rawTOC:
Prologue: ``Little Pearl Harbor'' / ix \\ 1: ``A Regiment Of Wizards'' / 1 \\ 2: ``The Die Is Cast'' / 36 \\ 3: ``Angels In Long Underwear'' / 60 \\ 4: ``Journey Into The Nightmare'' / 74 \\ 5: ``A Special Affinity'' / 99 \\ 6: ``Recommendation To Secrecy'' / 125 \\ 7: ``Magnum Opus'' / 149 \\ 8: ``Forgotten Front'' / 174 \\ 9: ``A Riddle Wrapped In A Mystery'' / 194 \\ 10: ``Frontal Attack'' / 213 \\ 11: Trials And Tribulations / 236 \\ 12: ``The Sword And The Ploughshare'' / 250 \\ Epilogue: Belated justice / 292

entry:
@Book{Conant:2020:GSC,
  author =       "Jennet Conant",
  title =        "The Great Secret: the Classified {World War II}
                 Disaster That Launched the War on Cancer",
  publisher =    "W. W. Norton and Company, Inc.",
  address =      "New York, NY",
  pages =        "xviii + 380 + 8",
  year =         "2020",
  ISBN =         "0-393-86843-5 (paperback), 1-324-00250-6 (hardcover),
                 1-324-00251-4 (e-book)",
  ISBN-13 =      "978-0-393-86843-2 (paperback), 978-1-324-00250-5
                 (hardcover), 978-1-324-00251-2 (e-book)",
  LCCN =         "RM260 .C63 2020; RM261 .C66 2020",
  bibdate =      "Tue Dec 21 10:49:39 MST 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/master.bib",
  abstract =     "On the night of December 2, 1943, the Luftwaffe bombed
                 a critical Allied port in Bari, Italy, sinking
                 seventeen ships and killing over a thousand servicemen
                 and hundreds of civilians. Caught in the surprise air
                 raid was the John Harvey, an American Liberty ship
                 carrying a top-secret cargo of 2,000 mustard bombs to
                 be used in retaliation if the Germans resorted to gas
                 warfare. After young sailors began suddenly dying with
                 mysterious symptoms, Lieutenant Colonel Stewart
                 Alexander, a doctor and chemical weapons expert, was
                 dispatched to investigate. He quickly diagnosed mustard
                 gas exposure, which both Churchill and Eisenhower
                 denied. But Alexander's breakthrough observations about
                 the toxic effects of mustard on white blood cells, as
                 well as the heroic perseverance of Colonel Cornelius P.
                 Rhoads --- a researcher and doctor as brilliant as he
                 was arrogant and self-destructive --- were instrumental
                 in ushering in a new era of cancer research led by the
                 Sloan Kettering Institute.",
  acknowledgement = ack-nhfb,
  subject =      "Chemotherapy; History; Cancer; Treatment; Research;
                 Mustard gas; Toxicology; World War, 1939-1945; Health
                 aspects; Drug Therapy; Neoplasms; therapy; HISTORY /
                 Military / World War II.; MEDICAL / Chemotherapy.;
                 MEDICAL / History.; Toxicology.; Chemotherapy.;
                 Treatment.; Research.; Chemotherapy.; Treatment.;
                 Research.",
  tableofcontents = "Prologue: ``Little Pearl Harbor'' / ix \\
                 1: ``A Regiment Of Wizards'' / 1 \\
                 2: ``The Die Is Cast'' / 36 \\
                 3: ``Angels In Long Underwear'' / 60 \\
                 4: ``Journey Into The Nightmare'' / 74 \\
                 5: ``A Special Affinity'' / 99 \\
                 6: ``Recommendation To Secrecy'' / 125 \\
                 7: ``Magnum Opus'' / 149 \\
                 8: ``Forgotten Front'' / 174 \\
                 9: ``A Riddle Wrapped In A Mystery'' / 194 \\
                 10: ``Frontal Attack'' / 213 \\
                 11: Trials And Tribulations / 236 \\
                 12: ``The Sword And The Ploughshare'' / 250 \\
                 Epilogue: Belated justice / 292",
}


bibtype: book
filename: master.bib
label: Conrac:1985:RGH
author: Conrac Division
title: Raster Graphics Handbook
publisher: pub-VAN-NOSTRAND-REINHOLD
address: pub-VAN-NOSTRAND-REINHOLD:adr
pages: v + 345
year: 1985
ISBN: 0-442-21608-4 OR 0442216084
ISBN13: 978-0-442-21608-5 OR 9780442216085
LCCN: T385 .C64 1985
bibdate: Tue Dec 14 22:44:38 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1993.12.14 22:44:38 ???
acknowledgement: ack-nhfb
rawauthor: {Conrac Division}
rawtitle: Raster Graphics Handbook
entry:
@Book{Conrac:1985:RGH,
  author =       "{Conrac Division}",
  title =        "Raster Graphics Handbook",
  publisher =    pub-VAN-NOSTRAND-REINHOLD,
  address =      pub-VAN-NOSTRAND-REINHOLD:adr,
  pages =        "v + 345",
  year =         "1985",
  ISBN =         "0-442-21608-4",
  ISBN-13 =      "978-0-442-21608-5",
  LCCN =         "T385 .C64 1985",
  bibdate =      "Tue Dec 14 22:44:38 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Conway:1996:BN
author: John H. Conway and Richard K. Guy
title: The Book of Numbers
publisher: pub-COPERNICUS
address: pub-COPERNICUS:adr
pages: ix + 310
year: 1996
ISBN: 0-387-97993-X OR 038797993X
ISBN13: 978-0-387-97993-9 OR 9780387979939
LCCN: QA241 .C6897 1996
MRclass: 00A08, 00A05
bibdate: Mon Dec 06 15:47:43 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.12.06 15:47:43 ???
acknowledgement: ack-nhfb
rawauthor: John H. Conway and Richard K. Guy
rawtitle: The Book of Numbers
abstract:
Journey through the world of numbers with the foremost authorities and writers in the field. John Horton Conway and Richard K. Guy are two of the most accomplished, creative, and engaging number theorists any mathematically minded reader could hope to encounter. In this book, Conway and Guy lead the reader on an imaginative, often astonishing tour of the landscape of numbers. The Book of Numbers is just that --- an engagingly written, heavily illustrated introduction to the fascinating, sometimes surprising properties of numbers and number patterns. The book opens up a world of topics, theories, and applications, exploring intriguing aspects of real numbers, systems, arrays and sequences, and much more. Readers will be able to use figures to figure out figures, rub elbows with famous families of numbers, prove the primacy of primes, fathom the fruitfulness of fractions, imagine imaginary numbers, investigate the infinite and infinitesimal and more.

TOC:
1 The Romance of Numbers 2 Figures from Figures: Doing Arithmetic and Algebra by Geometry 3 What Comes Next? 4 Famous Families of Numbers 5 The Primacy of Primes 6 Further Fruitfulness of Fractions 7 Geometric Problems and Algebraic Numbers 8 Imagining Imaginary Numbers 9 Some Transcendental Numbers 10 Infinite and Infinitesimal Numbers

rawabstract:
Journey through the world of numbers with the foremost authorities and writers in the field. John Horton Conway and Richard K. Guy are two of the most accomplished, creative, and engaging number theorists any mathematically minded reader could hope to encounter. In this book, Conway and Guy lead the reader on an imaginative, often astonishing tour of the landscape of numbers. The Book of Numbers is just that --- an engagingly written, heavily illustrated introduction to the fascinating, sometimes surprising properties of numbers and number patterns. The book opens up a world of topics, theories, and applications, exploring intriguing aspects of real numbers, systems, arrays and sequences, and much more. Readers will be able to use figures to figure out figures, rub elbows with famous families of numbers, prove the primacy of primes, fathom the fruitfulness of fractions, imagine imaginary numbers, investigate the infinite and infinitesimal and more.

rawTOC:
1 The Romance of Numbers \\ 2 Figures from Figures: Doing Arithmetic and Algebra by Geometry \\ 3 What Comes Next? \\ 4 Famous Families of Numbers \\ 5 The Primacy of Primes \\ 6 Further Fruitfulness of Fractions \\ 7 Geometric Problems and Algebraic Numbers \\ 8 Imagining Imaginary Numbers \\ 9 Some Transcendental Numbers \\ 10 Infinite and Infinitesimal Numbers

entry:
@Book{Conway:1996:BN,
  author =       "John H. Conway and Richard K. Guy",
  title =        "The Book of Numbers",
  publisher =    pub-COPERNICUS,
  address =      pub-COPERNICUS:adr,
  pages =        "ix + 310",
  year =         "1996",
  ISBN =         "0-387-97993-X",
  ISBN-13 =      "978-0-387-97993-9",
  LCCN =         "QA241 .C6897 1996",
  MRclass =      "00A08, 00A05",
  bibdate =      "Mon Dec 06 15:47:43 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  price =        "US\$35.00",
  abstract =     "Journey through the world of numbers with the foremost
                 authorities and writers in the field. John Horton
                 Conway and Richard K. Guy are two of the most
                 accomplished, creative, and engaging number theorists
                 any mathematically minded reader could hope to
                 encounter. In this book, Conway and Guy lead the reader
                 on an imaginative, often astonishing tour of the
                 landscape of numbers. The Book of Numbers is just that
                 --- an engagingly written, heavily illustrated
                 introduction to the fascinating, sometimes surprising
                 properties of numbers and number patterns. The book
                 opens up a world of topics, theories, and applications,
                 exploring intriguing aspects of real numbers, systems,
                 arrays and sequences, and much more. Readers will be
                 able to use figures to figure out figures, rub elbows
                 with famous families of numbers, prove the primacy of
                 primes, fathom the fruitfulness of fractions, imagine
                 imaginary numbers, investigate the infinite and
                 infinitesimal and more.",
  acknowledgement = ack-nhfb,
  tableofcontents = "1 The Romance of Numbers \\
                 2 Figures from Figures: Doing Arithmetic and Algebra by
                 Geometry \\
                 3 What Comes Next? \\
                 4 Famous Families of Numbers \\
                 5 The Primacy of Primes \\
                 6 Further Fruitfulness of Fractions \\
                 7 Geometric Problems and Algebraic Numbers \\
                 8 Imagining Imaginary Numbers \\
                 9 Some Transcendental Numbers \\
                 10 Infinite and Infinitesimal Numbers",
}


bibtype: article
filename: master.bib
label: Coonen:fps-guide
author: Jerome T. Coonen
title: An Implementation Guide to a Proposed Standard for Floating Point Arithmetic
journal: j-COMPUTER
volume: 13
number: 1
pages: 68--79
month: jan
monthnumber: 1
year: 1980
bibdate: Sun May 2 07:47:54 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:47:54 ???
note: See errata in cite Coonen:fps-guide-errata. See cite IEEE:p754.
acknowledgement: ack-nhfb
rawauthor: Jerome T. Coonen
rawnote: See errata in \cite{Coonen:fps-guide-errata}. See \cite{IEEE:p754}.
rawtitle: An Implementation Guide to a Proposed Standard for Floating Point Arithmetic
entry:
@Article{Coonen:fps-guide,
  author =       "Jerome T. Coonen",
  title =        "An Implementation Guide to a Proposed Standard for
                 Floating Point Arithmetic",
  journal =      j-COMPUTER,
  volume =       "13",
  number =       "1",
  pages =        "68--79",
  month =        jan,
  year =         "1980",
  bibdate =      "Sun May 2 07:47:54 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See errata in \cite{Coonen:fps-guide-errata}. See
                 \cite{IEEE:p754}.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Coonen:fps-guide-errata
author: Jerome T. Coonen
title: Errata: An Implementation Guide to a Proposed Standard for Floating Point Arithmetic
journal: j-COMPUTER
volume: 14
number: 3
pages: 62
month: mar
monthnumber: 3
year: 1981
bibdate: Sun May 2 07:47:35 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:47:35 ???
note: See also cite Coonen:fps-guide,IEEE:p754.
acknowledgement: ack-nhfb
rawauthor: Jerome T. Coonen
rawnote: See also \cite{Coonen:fps-guide,IEEE:p754}.
rawtitle: Errata: An Implementation Guide to a Proposed Standard for Floating Point Arithmetic
entry:
@Article{Coonen:fps-guide-errata,
  author =       "Jerome T. Coonen",
  title =        "Errata: An Implementation Guide to a Proposed Standard
                 for Floating Point Arithmetic",
  journal =      j-COMPUTER,
  volume =       "14",
  number =       "3",
  pages =        "62",
  month =        mar,
  year =         "1981",
  bibdate =      "Sun May 2 07:47:35 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See also \cite{Coonen:fps-guide,IEEE:p754}.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: master.bib
label: Coonen:ufl-denorm
author: Jerome T. Coonan
title: Underflow and the Denormalized Numbers
journal: j-COMPUTER
volume: 14
number: 3
pages: 75--87
month: mar
monthnumber: 3
year: 1981
bibdate: Sun May 2 07:48:05 1999
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib
bibtimestamp: 1999.05.02 07:48:05 ???
note: See cite IEEE:p754.
acknowledgement: ack-nhfb
rawauthor: Jerome T. Coonan
rawnote: See \cite{IEEE:p754}.
rawtitle: Underflow and the Denormalized Numbers
entry:
@Article{Coonen:ufl-denorm,
  author =       "Jerome T. Coonan",
  title =        "Underflow and the Denormalized Numbers",
  journal =      j-COMPUTER,
  volume =       "14",
  number =       "3",
  pages =        "75--87",
  month =        mar,
  year =         "1981",
  bibdate =      "Sun May 2 07:48:05 1999",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "See \cite{IEEE:p754}.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: master.bib
label: Cooper:2004:EC
author: Keith D. (Keith Daniel) Cooper and Linda Torczon
title: Engineering a Compiler
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adr
pages: xxx + 801
year: 2004
ISBN: 1-55860-698-X (paperback) OR 155860698X (paperback)
ISBN13: 978-1-55860-698-2 (paperback) OR 9781558606982 (paperback)
LCCN: QA76.76.C65 C675 2005
bibdate: Sat Nov 5 12:24:42 MST 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.11.05 12:24:42 MST
subject: Compilers (Computer programs)
acknowledgement: ack-nhfb
rawauthor: Keith D. (Keith Daniel) Cooper and Linda Torczon
rawtitle: Engineering a Compiler
URL:
ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/; http://www.loc.gov/catdir/description/els051/2004268209.html; http://www.mkp.com/engineeringacompiler/

abstract:
The proliferation of processors, environments, and constraints on systems has cast compiler technology into a wider variety of settings, changing the compiler and compiler writer's role. No longer is execution speed the sole criterion for judging compiled code. Today, code might be judged on how small it is, how much power it consumes, how well it compresses, or how many page faults it generates. In this evolving environment, the task of building a successful compiler relies upon the compiler writer's ability to balance and blend algorithms, engineering insights, and careful planning. Today's compiler writer must choose a path through a design space that is filled with diverse alternatives, each with distinct costs, advantages, and complexities. Engineering a Compiler explores this design space by presenting some of the ways these problems have been solved, and the constraints that made each of those solutions attractive. By presenting the parameters of the problem and their impact on compiler design, the authors convey both the depth of the problems and the breadth of possible solutions. Their goal is to show readers that real tradeoffs exist, and that the impact of those choices can be both subtle and far-reaching.

TOC:
1: Overview of Compilation 2: Scanning 3: Parsing 4: Context-Sensitive Analysis 5: Intermediate Representations 6: The Procedure Abstraction 7: Code Shape 8: Introduction to Code Optimization 9: Data-Flow Analysis 10: Scalar Optimizations 11: Instruction Selection 12: Instruction Scheduling 13: Register Allocation Appendix A: ILOC

rawabstract:
The proliferation of processors, environments, and constraints on systems has cast compiler technology into a wider variety of settings, changing the compiler and compiler writer's role. No longer is execution speed the sole criterion for judging compiled code. Today, code might be judged on how small it is, how much power it consumes, how well it compresses, or how many page faults it generates. In this evolving environment, the task of building a successful compiler relies upon the compiler writer's ability to balance and blend algorithms, engineering insights, and careful planning. Today's compiler writer must choose a path through a design space that is filled with diverse alternatives, each with distinct costs, advantages, and complexities. Engineering a Compiler explores this design space by presenting some of the ways these problems have been solved, and the constraints that made each of those solutions attractive. By presenting the parameters of the problem and their impact on compiler design, the authors convey both the depth of the problems and the breadth of possible solutions. Their goal is to show readers that real tradeoffs exist, and that the impact of those choices can be both subtle and far-reaching.

rawTOC:
1: Overview of Compilation \\ 2: Scanning \\ 3: Parsing \\ 4: Context-Sensitive Analysis \\ 5: Intermediate Representations \\ 6: The Procedure Abstraction \\ 7: Code Shape \\ 8: Introduction to Code Optimization \\ 9: Data-Flow Analysis \\ 10: Scalar Optimizations \\ 11: Instruction Selection \\ 12: Instruction Scheduling \\ 13: Register Allocation \\ Appendix A: ILOC

entry:
@Book{Cooper:2004:EC,
  author =       "Keith D. (Keith Daniel) Cooper and Linda Torczon",
  title =        "Engineering a Compiler",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xxx + 801",
  year =         "2004",
  ISBN =         "1-55860-698-X (paperback)",
  ISBN-13 =      "978-1-55860-698-2 (paperback)",
  LCCN =         "QA76.76.C65 C675 2005",
  bibdate =      "Sat Nov 5 12:24:42 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
                 http://www.loc.gov/catdir/description/els051/2004268209.html;
                 http://www.mkp.com/engineeringacompiler/",
  abstract =     "The proliferation of processors, environments, and
                 constraints on systems has cast compiler technology
                 into a wider variety of settings, changing the compiler
                 and compiler writer's role. No longer is execution
                 speed the sole criterion for judging compiled code.
                 Today, code might be judged on how small it is, how
                 much power it consumes, how well it compresses, or how
                 many page faults it generates. In this evolving
                 environment, the task of building a successful compiler
                 relies upon the compiler writer's ability to balance
                 and blend algorithms, engineering insights, and careful
                 planning. Today's compiler writer must choose a path
                 through a design space that is filled with diverse
                 alternatives, each with distinct costs, advantages, and
                 complexities. Engineering a Compiler explores this
                 design space by presenting some of the ways these
                 problems have been solved, and the constraints that
                 made each of those solutions attractive. By presenting
                 the parameters of the problem and their impact on
                 compiler design, the authors convey both the depth of
                 the problems and the breadth of possible solutions.
                 Their goal is to show readers that real tradeoffs
                 exist, and that the impact of those choices can be both
                 subtle and far-reaching.",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Compilers (Computer programs)",
  tableofcontents = "1: Overview of Compilation \\
                 2: Scanning \\
                 3: Parsing \\
                 4: Context-Sensitive Analysis \\
                 5: Intermediate Representations \\
                 6: The Procedure Abstraction \\
                 7: Code Shape \\
                 8: Introduction to Code Optimization \\
                 9: Data-Flow Analysis \\
                 10: Scalar Optimizations \\
                 11: Instruction Selection \\
                 12: Instruction Scheduling \\
                 13: Register Allocation \\
                 Appendix A: ILOC",
}


bibtype: book
filename: master.bib
label: Cooper:2011:EC
author: Keith D. (Keith Daniel) Cooper and Linda Torczon
title: Engineering a compiler
publisher: pub-MORGAN-KAUFMANN
address: pub-MORGAN-KAUFMANN:adr
edition: Second
pages: xxiii + 800
year: 2011
ISBN: 0-12-088478-X OR 012088478X
ISBN13: 978-0-12-088478-0 OR 9780120884780
LCCN: QA76.76.C65 C675 2011
bibdate: Sat Nov 5 12:24:42 MST 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2005.11.05 12:24:42 MST
URL: http://mkp.com/news/engineering-a-compiler-2nd-edition
subject: Compilers (Computer programs)
acknowledgement: ack-nhfb
rawauthor: Keith D. (Keith Daniel) Cooper and Linda Torczon
rawtitle: Engineering a compiler
TOC:
CHAPTER 1 Overview of Compilation 1.1 Introduction 1.2 Compiler Structure 1.3 Overview of Translation 1.4 Summary and Perspective CHAPTER 2 Scanners 2.1 Introduction 2.2 Recognizing Words 2.3 Regular Expressions 2.4 From Regular Expression to Scanner 2.5 Implementing Scanners 2.6 Advanced Topics 2.7 Chapter Summary and Perspective CHAPTER 3 Parsers 3.1 Introduction 3.2 Expressing Syntax 3.3 Top-Down Parsing 3.4 Bottom-Up Parsing 3.5 Practical Issues 3.6 Advanced Topics 1 3.7 Summary and Perspective CHAPTER 4 Context-Sensitive Analysis 4.1 Introduction 4.2 An Introduction to Type Systems 4.3 The Attribute-Grammar Framework 4.4 Ad Hoc Syntax-Directed Translation 4.5 Advanced Topics 4.6 Summary and Perspective CHAPTER 5 Intermediate Representations 5.1 Introduction 5.2 Graphical IRs 5.3 Linear IRs 5.4 Mapping Values to Names 5.5 Symbol Tables 5.6 Summary and Perspective CHAPTER 6 The Procedure Abstraction 6.1 Introduction 6.2 Procedure Calls 6.3 Name Spaces 2 6.4 Communicating Values Between Procedures 6.5 Standardized Linkages 6.6 Advanced Topics 6.7 Summary and Perspective CHAPTER 7 Code Shape 7.1 Introduction 7.2 Assigning Storage Locations 7.3 Arithmetic Operators 7.4 Boolean and Relational Operators 7.5 Storing and Accessing Arrays 7.6 Character Strings 7.7 Structure References 7.8 Control-Flow Constructs 7.9 Procedure Calls

rawTOC:
CHAPTER 1 Overview of Compilation \\ 1.1 Introduction \\ 1.2 Compiler Structure \\ 1.3 Overview of Translation \\ 1.4 Summary and Perspective \\ \\ CHAPTER 2 Scanners \\ 2.1 Introduction \\ 2.2 Recognizing Words \\ 2.3 Regular Expressions \\ 2.4 From Regular Expression to Scanner \\ 2.5 Implementing Scanners \\ 2.6 Advanced Topics \\ 2.7 Chapter Summary and Perspective \\ \\ CHAPTER 3 Parsers \\ 3.1 Introduction \\ 3.2 Expressing Syntax \\ 3.3 Top-Down Parsing \\ 3.4 Bottom-Up Parsing \\ 3.5 Practical Issues \\ 3.6 Advanced Topics 1 \\ 3.7 Summary and Perspective \\ \\ CHAPTER 4 Context-Sensitive Analysis \\ 4.1 Introduction \\ 4.2 An Introduction to Type Systems \\ 4.3 The Attribute-Grammar Framework \\ 4.4 Ad Hoc Syntax-Directed Translation \\ 4.5 Advanced Topics \\ 4.6 Summary and Perspective \\ \\ CHAPTER 5 Intermediate Representations \\ 5.1 Introduction \\ 5.2 Graphical IRs \\ 5.3 Linear IRs \\ 5.4 Mapping Values to Names \\ 5.5 Symbol Tables \\ 5.6 Summary and Perspective \\ \\ CHAPTER 6 The Procedure Abstraction \\ 6.1 Introduction \\ 6.2 Procedure Calls \\ 6.3 Name Spaces 2 \\ 6.4 Communicating Values Between Procedures \\ 6.5 Standardized Linkages \\ 6.6 Advanced Topics \\ 6.7 Summary and Perspective \\ \\ CHAPTER 7 Code Shape \\ 7.1 Introduction \\ 7.2 Assigning Storage Locations \\ 7.3 Arithmetic Operators \\ 7.4 Boolean and Relational Operators \\ 7.5 Storing and Accessing Arrays \\ 7.6 Character Strings \\ 7.7 Structure References \\ 7.8 Control-Flow Constructs \\ 7.9 Procedure Calls

entry:
@Book{Cooper:2011:EC,
  author =       "Keith D. (Keith Daniel) Cooper and Linda Torczon",
  title =        "Engineering a compiler",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  edition =      "Second",
  pages =        "xxiii + 800",
  year =         "2011",
  ISBN =         "0-12-088478-X",
  ISBN-13 =      "978-0-12-088478-0",
  LCCN =         "QA76.76.C65 C675 2011",
  bibdate =      "Sat Nov 5 12:24:42 MST 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://mkp.com/news/engineering-a-compiler-2nd-edition",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Compilers (Computer programs)",
  tableofcontents = "CHAPTER 1 Overview of Compilation \\
                 1.1 Introduction \\
                 1.2 Compiler Structure \\
                 1.3 Overview of Translation \\
                 1.4 Summary and Perspective \\
                 \\
                 CHAPTER 2 Scanners \\
                 2.1 Introduction \\
                 2.2 Recognizing Words \\
                 2.3 Regular Expressions \\
                 2.4 From Regular Expression to Scanner \\
                 2.5 Implementing Scanners \\
                 2.6 Advanced Topics \\
                 2.7 Chapter Summary and Perspective \\
                 \\
                 CHAPTER 3 Parsers \\
                 3.1 Introduction \\
                 3.2 Expressing Syntax \\
                 3.3 Top-Down Parsing \\
                 3.4 Bottom-Up Parsing \\
                 3.5 Practical Issues \\
                 3.6 Advanced Topics 1 \\
                 3.7 Summary and Perspective \\
                 \\
                 CHAPTER 4 Context-Sensitive Analysis \\
                 4.1 Introduction \\
                 4.2 An Introduction to Type Systems \\
                 4.3 The Attribute-Grammar Framework \\
                 4.4 Ad Hoc Syntax-Directed Translation \\
                 4.5 Advanced Topics \\
                 4.6 Summary and Perspective \\
                 \\
                 CHAPTER 5 Intermediate Representations \\
                 5.1 Introduction \\
                 5.2 Graphical IRs \\
                 5.3 Linear IRs \\
                 5.4 Mapping Values to Names \\
                 5.5 Symbol Tables \\
                 5.6 Summary and Perspective \\
                 \\
                 CHAPTER 6 The Procedure Abstraction \\
                 6.1 Introduction \\
                 6.2 Procedure Calls \\
                 6.3 Name Spaces 2 \\
                 6.4 Communicating Values Between Procedures \\
                 6.5 Standardized Linkages \\
                 6.6 Advanced Topics \\
                 6.7 Summary and Perspective \\
                 \\
                 CHAPTER 7 Code Shape \\
                 7.1 Introduction \\
                 7.2 Assigning Storage Locations \\
                 7.3 Arithmetic Operators \\
                 7.4 Boolean and Relational Operators \\
                 7.5 Storing and Accessing Arrays \\
                 7.6 Character Strings \\
                 7.7 Structure References \\
                 7.8 Control-Flow Constructs \\
                 7.9 Procedure Calls",
}


bibtype: book
filename: master.bib
label: Copeland:2012:ATE
editor: B. Jack Copeland
booktitle: Alan Turing's Electronic Brain: the Struggle to Build the ACE, the World's Fastest Computer
title: Alan Turing's Electronic Brain: the Struggle to Build the ACE, the World's Fastest Computer
publisher: pub-OXFORD
address: pub-OXFORD:adr
pages: xxi + 553
year: 2012
ISBN: 0-19-960915-2 (paperback) OR 0199609152 (paperback)
ISBN13: 978-0-19-960915-4 (paperback) OR 9780199609154 (paperback)
bibdate: Tue Jun 19 14:37:17 MDT 2012
bibtimestamp: 2012.06.19 14:37:17 MDT
subject: Turing, Alan Mathison; Computers; Great Britain; History; Computer engineering
acknowledgement: ack-nhfb
subjectdates: 1912--1954
rawbooktitle: {Alan Turing}'s Electronic Brain: the Struggle to Build the {ACE}, the World's Fastest Computer
raweditor: B. Jack Copeland
rawtitle: {Alan Turing}'s Electronic Brain: the Struggle to Build the {ACE}, the World's Fastest Computer
bibsource:
https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib; https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; library.ox.ac.uk:210/ADVANCE

abstract:
The mathematical genius Alan Turing, now well known for his crucial wartime role in breaking the ENIGMA code, was the first to conceive of the fundamental principle of the modern computer-the idea of controlling a computing machine's operations by means of a program of coded instructions, stored in the machine's `memory'. In 1945 Turing drew up his revolutionary design for an electronic computing machine-his Automatic Computing Engine ('ACE'). A pilot model of the ACE ran its first program in 1950 and the production version, the `DEUCE', went on to become a cornerstone of the fledgling British computer industry. The first `personal' computer was based on Turing's ACE. Alan Turing's Automatic Computing Engine describes Turing's struggle to build the modern computer. The first detailed history of Turing's contributions to computer science, this text is essential reading for anyone interested in the history of the computer and the history of mathematics. It contains first hand accounts by Turing and by the pioneers of computing who worked with him. As well as relating the story of the invention of the computer, the book clearly describes the hardware and software of the ACE-including the very first computer programs. The book is intended to be accessible to everyone with an interest in computing, and contains numerous diagrams and illustrations as well as original photographs. The book contains chapters describing Turing's path-breaking research in the fields of Artificial Intelligence (AI) and Artificial Life (A-Life). The book has an extensive system of hyperlinks to The Turing Archive for the History of Computing, an on-line library of digital facsimiles of typewritten documents by Turing and the other scientists who pioneered the electronic computer.

TOC:
List of Photographs / xvi Contributors / xvii Introduction / B. Jack Copeland / 1 Part I: The National Physical Laboratory and the ACE Project 1: The National Physical Laboratory / Eileen Magnello / 15 2: The creation of the NPL Mathematics Division / Mary Croarken / 23 3: The origins and development of the ACE project / B. Jack Copeland / 37 4: The Pilot ACE at the National Physical Laboratory / James H. Wilkinson / 93 Part II: Turing and the History of Computing 5: Turing and the computer / B. Jack Copeland and Diane Proudfoot / 107 6: The ACE and the shaping of British computing / Martin Campbell Kelly / 149 7: From Turing machine to 'electronic brain' / Teresa Numerico / 173 8: Computer architecture and the ACE computers / Robert Doran / 193 Part III: The ACE Computers 9: The Pilot ACE instruction format / Henry John Norton / 209 10: Programming the Pilot ACE / J. G. Hayes / 215 11: The Pilot ACE: from concept to reality / Robin A. Vowels / 223 72: Applications of the Pilot ACE and the DEUCE / Tom Vickers / 265 13: The ACE Test Assembly, the Pilot ACE, the Big ACE, and the Bendix G15 / Harry D. Huskey / 281 14: The DEUCE --- a user's view / Robin A. Vowels / 297 15: The ACE Simulator and the Cybernetic Model / Michael Woodger / 331 16: The Pilot Model and the Big ACE on the web / Benjamin Wells / 335 Part IV: Electronics How valves work / David O. Clayden / 341 18: Recollections of early vacuum tube circuits / Maurice Wilkes / 345 19: Circuit design of the Pilot ACE and the Big ACE / David O. Clayden / 349 Part V: Technical Reports and Lectures on the ACE 1945--47 20: Proposed electronic calculator (1945) / Alan M. Turing / 369 27: Notes on memory (1945) / Alan M. Turing / 455 22: The Turing--Wilkinson lecture series (1946--7) (edited with an introduction by B. Jack Copeland) / Alan M. Turing and James H. Wilkinson / 459 23: The state of the art in electronic digital computing in Britain and the United States (1947) / Harry D. Huskey / 529 Index / / 541

rawabstract:
The mathematical genius Alan Turing, now well known for his crucial wartime role in breaking the ENIGMA code, was the first to conceive of the fundamental principle of the modern computer-the idea of controlling a computing machine's operations by means of a program of coded instructions, stored in the machine's `memory'. In 1945 Turing drew up his revolutionary design for an electronic computing machine-his Automatic Computing Engine ('ACE'). A pilot model of the ACE ran its first program in 1950 and the production version, the `DEUCE', went on to become a cornerstone of the fledgling British computer industry. The first `personal' computer was based on Turing's ACE. Alan Turing's Automatic Computing Engine describes Turing's struggle to build the modern computer. The first detailed history of Turing's contributions to computer science, this text is essential reading for anyone interested in the history of the computer and the history of mathematics. It contains first hand accounts by Turing and by the pioneers of computing who worked with him. As well as relating the story of the invention of the computer, the book clearly describes the hardware and software of the ACE-including the very first computer programs. The book is intended to be accessible to everyone with an interest in computing, and contains numerous diagrams and illustrations as well as original photographs. The book contains chapters describing Turing's path-breaking research in the fields of Artificial Intelligence (AI) and Artificial Life (A-Life). The book has an extensive system of hyperlinks to The Turing Archive for the History of Computing, an on-line library of digital facsimiles of typewritten documents by Turing and the other scientists who pioneered the electronic computer.

rawTOC:
List of Photographs / xvi \\ Contributors / xvii \\ Introduction / B. Jack Copeland / 1 \\ Part I: The National Physical Laboratory and the ACE Project \\ 1: The National Physical Laboratory / Eileen Magnello / 15 \\ 2: The creation of the NPL Mathematics Division / Mary Croarken / 23 \\ 3: The origins and development of the ACE project / B. Jack Copeland / 37 \\ 4: The Pilot ACE at the National Physical Laboratory / James H. Wilkinson / 93 \\ Part II: Turing and the History of Computing \\ 5: Turing and the computer / B. Jack Copeland and Diane Proudfoot / 107 \\ 6: The ACE and the shaping of British computing / Martin Campbell Kelly / 149 \\ 7: From Turing machine to 'electronic brain' / Teresa Numerico / 173 \\ 8: Computer architecture and the ACE computers / Robert Doran / 193 \\ Part III: The ACE Computers \\ 9: The Pilot ACE instruction format / Henry John Norton / 209 \\ 10: Programming the Pilot ACE / J. G. Hayes / 215 \\ 11: The Pilot ACE: from concept to reality / Robin A. Vowels / 223 \\ 72: Applications of the Pilot ACE and the DEUCE / Tom Vickers / 265 \\ 13: The ACE Test Assembly, the Pilot ACE, the Big ACE, and the Bendix G15 / Harry D. Huskey / 281 \\ 14: The DEUCE --- a user's view / Robin A. Vowels / 297 \\ 15: The ACE Simulator and the Cybernetic Model / Michael Woodger / 331 \\ 16: The Pilot Model and the Big ACE on the web / Benjamin Wells / 335 \\ Part IV: Electronics \\ How valves work / David O. Clayden / 341 \\ 18: Recollections of early vacuum tube circuits / Maurice Wilkes / 345 \\ 19: Circuit design of the Pilot ACE and the Big ACE / David O. Clayden / 349 \\ Part V: Technical Reports and Lectures on the ACE 1945--47 \\ 20: Proposed electronic calculator (1945) / Alan M. Turing / 369 \\ 27: Notes on memory (1945) / Alan M. Turing / 455 \\ 22: The Turing--Wilkinson lecture series (1946--7) (edited with an introduction by B. Jack Copeland) / Alan M. Turing and James H. Wilkinson / 459 \\ 23: The state of the art in electronic digital computing in Britain and the United States (1947) / Harry D. Huskey / 529 \\ Index / / 541

entry:
@Book{Copeland:2012:ATE,
  editor =       "B. Jack Copeland",
  booktitle =    "{Alan Turing}'s Electronic Brain: the Struggle to
                 Build the {ACE}, the World's Fastest Computer",
  title =        "{Alan Turing}'s Electronic Brain: the Struggle to
                 Build the {ACE}, the World's Fastest Computer",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xxi + 553",
  year =         "2012",
  ISBN =         "0-19-960915-2 (paperback)",
  ISBN-13 =      "978-0-19-960915-4 (paperback)",
  LCCN =         "????",
  bibdate =      "Tue Jun 19 14:37:17 MDT 2012",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 library.ox.ac.uk:210/ADVANCE",
  price =        "UK \pounds 14.99",
  abstract =     "The mathematical genius Alan Turing, now well known
                 for his crucial wartime role in breaking the ENIGMA
                 code, was the first to conceive of the fundamental
                 principle of the modern computer-the idea of
                 controlling a computing machine's operations by means
                 of a program of coded instructions, stored in the
                 machine's `memory'. In 1945 Turing drew up his
                 revolutionary design for an electronic computing
                 machine-his Automatic Computing Engine ('ACE'). A pilot
                 model of the ACE ran its first program in 1950 and the
                 production version, the `DEUCE', went on to become a
                 cornerstone of the fledgling British computer industry.
                 The first `personal' computer was based on Turing's
                 ACE. Alan Turing's Automatic Computing Engine describes
                 Turing's struggle to build the modern computer. The
                 first detailed history of Turing's contributions to
                 computer science, this text is essential reading for
                 anyone interested in the history of the computer and
                 the history of mathematics. It contains first hand
                 accounts by Turing and by the pioneers of computing who
                 worked with him. As well as relating the story of the
                 invention of the computer, the book clearly describes
                 the hardware and software of the ACE-including the very
                 first computer programs. The book is intended to be
                 accessible to everyone with an interest in computing,
                 and contains numerous diagrams and illustrations as
                 well as original photographs. The book contains
                 chapters describing Turing's path-breaking research in
                 the fields of Artificial Intelligence (AI) and
                 Artificial Life (A-Life). The book has an extensive
                 system of hyperlinks to The Turing Archive for the
                 History of Computing, an on-line library of digital
                 facsimiles of typewritten documents by Turing and the
                 other scientists who pioneered the electronic
                 computer.",
  acknowledgement = ack-nhfb,
  subject =      "Turing, Alan Mathison; Computers; Great Britain;
                 History; Computer engineering",
  subject-dates = "1912--1954",
  tableofcontents = "List of Photographs / xvi \\
                 Contributors / xvii \\
                 Introduction / B. Jack Copeland / 1 \\
                 Part I: The National Physical Laboratory and the ACE
                 Project \\
                 1: The National Physical Laboratory / Eileen Magnello /
                 15 \\
                 2: The creation of the NPL Mathematics Division / Mary
                 Croarken / 23 \\
                 3: The origins and development of the ACE project / B.
                 Jack Copeland / 37 \\
                 4: The Pilot ACE at the National Physical Laboratory /
                 James H. Wilkinson / 93 \\
                 Part II: Turing and the History of Computing \\
                 5: Turing and the computer / B. Jack Copeland and Diane
                 Proudfoot / 107 \\
                 6: The ACE and the shaping of British computing /
                 Martin Campbell Kelly / 149 \\
                 7: From Turing machine to 'electronic brain' / Teresa
                 Numerico / 173 \\
                 8: Computer architecture and the ACE computers / Robert
                 Doran / 193 \\
                 Part III: The ACE Computers \\
                 9: The Pilot ACE instruction format / Henry John Norton
                 / 209 \\
                 10: Programming the Pilot ACE / J. G. Hayes / 215 \\
                 11: The Pilot ACE: from concept to reality / Robin A.
                 Vowels / 223 \\
                 72: Applications of the Pilot ACE and the DEUCE / Tom
                 Vickers / 265 \\
                 13: The ACE Test Assembly, the Pilot ACE, the Big ACE,
                 and the Bendix G15 / Harry D. Huskey / 281 \\
                 14: The DEUCE --- a user's view / Robin A. Vowels / 297
                 \\
                 15: The ACE Simulator and the Cybernetic Model /
                 Michael Woodger / 331 \\
                 16: The Pilot Model and the Big ACE on the web /
                 Benjamin Wells / 335 \\
                 Part IV: Electronics \\
                 How valves work / David O. Clayden / 341 \\
                 18: Recollections of early vacuum tube circuits /
                 Maurice Wilkes / 345 \\
                 19: Circuit design of the Pilot ACE and the Big ACE /
                 David O. Clayden / 349 \\
                 Part V: Technical Reports and Lectures on the ACE
                 1945--47 \\
                 20: Proposed electronic calculator (1945) / Alan M.
                 Turing / 369 \\
                 27: Notes on memory (1945) / Alan M. Turing / 455 \\
                 22: The Turing--Wilkinson lecture series (1946--7)
                 (edited with an introduction by B. Jack Copeland) /
                 Alan M. Turing and James H. Wilkinson / 459 \\
                 23: The state of the art in electronic digital
                 computing in Britain and the United States (1947) /
                 Harry D. Huskey / 529 \\
                 Index / / 541",
}


bibtype: book
filename: master.bib
label: Cormen:1990:IA
author: Thomas H. Cormen and Charles E. (Eric) Leiserson and Ronald L. Rivest
title: Introduction to Algorithms
publisher: pub-MIT
address: pub-MIT:adr
pages: xvii + 1028
year: 1990
ISBN: 0-262-03141-8, 0-07-013143-0 (McGraw-Hill) OR 0262031418, 0070131430 (McGrawHill)
ISBN13: 978-0-262-03141-7, 978-0-07-013143-9 (McGraw-Hill) OR 9780262031417, 9780070131439 (McGrawHill)
LCCN: QA76.6 .C662 1990
bibdate: Tue Oct 11 06:42:43 2005
bibtimestamp: 2005.10.11 06:42:43 ???
subject: Computer programming; Computer algorithms
acknowledgement: ack-nhfb
rawauthor: Thomas H. Cormen and Charles E. (Eric) Leiserson and Ronald L. Rivest
rawtitle: Introduction to Algorithms
bibsource:
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib

TOC:
Growth of functions Summations Recurrences Sets, etc. Counting and probability Heapsort Quicksort Sorting in linear time Medians and order statistics Elementary data structures Hash tables Binary search trees Red-black trees Augmenting data structures Dynamic programming Greedy algorithms Amortized analysis B-trees Binomial heaps Fibonacci heaps Data structures for disjoint sets Elementary graph algorithms Minimum spanning trees Single-source shortest paths All-pairs shortest paths Maximum flow Sorting networks Arithmetic circuits Algorithms for parallel computers Matrix operations Polynomials and the FFT Number-theoretic algorithms String matching Computational geometry NP-completeness Approximation algorithms

rawTOC:
Growth of functions \\ Summations \\ Recurrences \\ Sets, etc. \\ Counting and probability \\ Heapsort \\ Quicksort \\ Sorting in linear time \\ Medians and order statistics \\ Elementary data structures \\ Hash tables \\ Binary search trees \\ Red-black trees \\ Augmenting data structures \\ Dynamic programming \\ Greedy algorithms \\ Amortized analysis \\ B-trees \\ Binomial heaps \\ Fibonacci heaps \\ Data structures for disjoint sets \\ Elementary graph algorithms \\ Minimum spanning trees \\ Single-source shortest paths \\ All-pairs shortest paths \\ Maximum flow \\ Sorting networks \\ Arithmetic circuits \\ Algorithms for parallel computers \\ Matrix operations \\ Polynomials and the FFT \\ Number-theoretic algorithms \\ String matching \\ Computational geometry \\ NP-completeness \\ Approximation algorithms

entry:
@Book{Cormen:1990:IA,
  author =       "Thomas H. Cormen and Charles E. (Eric) Leiserson and
                 Ronald L. Rivest",
  title =        "Introduction to Algorithms",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xvii + 1028",
  year =         "1990",
  ISBN =         "0-262-03141-8, 0-07-013143-0 (McGraw-Hill)",
  ISBN-13 =      "978-0-262-03141-7, 978-0-07-013143-9 (McGraw-Hill)",
  LCCN =         "QA76.6 .C662 1990",
  bibdate =      "Tue Oct 11 06:42:43 2005",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "Computer programming; Computer algorithms",
  tableofcontents = "Growth of functions \\
                 Summations \\
                 Recurrences \\
                 Sets, etc. \\
                 Counting and probability \\
                 Heapsort \\
                 Quicksort \\
                 Sorting in linear time \\
                 Medians and order statistics \\
                 Elementary data structures \\
                 Hash tables \\
                 Binary search trees \\
                 Red-black trees \\
                 Augmenting data structures \\
                 Dynamic programming \\
                 Greedy algorithms \\
                 Amortized analysis \\
                 B-trees \\
                 Binomial heaps \\
                 Fibonacci heaps \\
                 Data structures for disjoint sets \\
                 Elementary graph algorithms \\
                 Minimum spanning trees \\
                 Single-source shortest paths \\
                 All-pairs shortest paths \\
                 Maximum flow \\
                 Sorting networks \\
                 Arithmetic circuits \\
                 Algorithms for parallel computers \\
                 Matrix operations \\
                 Polynomials and the FFT \\
                 Number-theoretic algorithms \\
                 String matching \\
                 Computational geometry \\
                 NP-completeness \\
                 Approximation algorithms",
}


bibtype: book
filename: master.bib
label: Cormen:2001:IA
author: Thomas H. Cormen and Charles E. (Eric) Leiserson and Ronald L. Rivest
title: Introduction to Algorithms
publisher: pub-MIT
address: pub-MIT:adr
edition: Second
pages: xxi + 1180
year: 2001
LCCN: QA76.6 .I5858 2001
bibdate: Sat Jan 26 12:46:16 MST 2013
bibtimestamp: 2013.01.26 12:46:16 MST
remark: MIT Press 2001, McGraw-Hill 2002 (third printing), McGraw-Hill 2003 (fourth printing)
subject: Computer programming; Computer algorithms
acknowledgement: ack-ds
rawauthor: Thomas H. Cormen and Charles E. (Eric) Leiserson and Ronald L. Rivest
rawtitle: Introduction to Algorithms
ISBN:
0-262-53196-8 (paperback), 0-262-03293-7 (hardcover), 0-07-013151-1 (McGraw-Hill), 0-07-297054-5 (McGraw-Hill with CD-ROM) OR 0262531968 (paperback), 0262032937 (hardcover), 0070131511 (McGrawHill), 0072970545 (McGrawHill with CDROM)

ISBN13:
978-0-262-53196-2 (paperback), 978-0-262-03293-3 (hardcover), 978-0-07-013151-4 (McGraw-Hill), 978-0-07-297054-8 (McGraw-Hill with CD-ROM) OR 9780262531962 (paperback), 9780262032933 (hardcover), 9780070131514 (McGrawHill), 9780072970548 (McGrawHill with CDROM)

bibsource:
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager

abstract:
This title covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. This second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

TOC:
Preface / xiii I Foundations Introduction / 3 1 The Role of Algorithms in Computing / 5 1.1 Algorithms / 5 1.2 Algorithms as a technology / 10 2 Getting Started / 75 2.1 Insertion sort / 15 2.2 Analyzing algorithms / 21 2.3 Designing algorithms / 27 3 Growth of Functions / 41 3.1 Asymptotic notation / 41 3.2 Standard notations and common functions / 51 4 Recurrences / 62 4.1 The substitution method / 63 4.2 The recursion-tree method / 67 4.3 The master method / 73 4.4 Proof of the master theorem / 76 5 Probabilistic Analysis and Randomized Algorithms / 91 5.1 The hiring problem / 91 5.2 Indicator random variables / 94 5.3 Randomized algorithms / 99 5.4 Probabilistic analysis and further uses of indicator random variables / 106 II Sorting and Order Statistics Introduction / 123 6 Heapsort / 127 6.1 Heaps / 127 6.2 Maintaining the heap property / 130 6.3 Building a heap / 132 6.4 The heapsort algorithm / 135 6.5 Priority queues / 138 7 Quicksort / 145 7.1 Description of quicksort / 145 7.2 Performance of quicksort / 149 7.3 A randomized version of quicksort / 153 7.4 Analysis of quicksort / 755 8 Sorting in Linear Time / 165 8.1 Lower bounds for sorting / 765 8.2 Counting sort / 168 8.3 Radix sort / 770 8.4 Bucket sort / 174 9 Medians and Order Statistics / 183 9.1 Minimum and maximum / 184 9.2 Selection in expected linear time / 785 9.3 Selection in worst-case linear time / 189 III Data Structures Introduction / 197 10 Elementary Data Structures / 200 10.1 Stacks and queues / 200 10.2 Linked lists / 204 10.3 Implementing pointers and objects / 209 10.4 Representing rooted trees / 214 11 Hash Tables / 221 11.1 Direct-address tables / 222 11.2 Hash tables / 224 11.3 Hash functions / 229 11.4 Open addressing / 237 11.5 Perfect hashing / 245 12 Binary Search Trees / 253 12.1 What is a binary search tree? / 253 12.2 Querying a binary search tree / 256 12.3 Insertion and deletion / 261 12.4 Randomly built binary search trees / 265 13 Red--Black Trees / 273 13.1 Properties of red-black trees / 273 13.2 Rotations / 277 13.3 Insertion / 280 13.4 Deletion / 288 14 Augmenting Data Structures / 302 14.1 Dynamic order statistics / 302 14.2 How to augment a data structure / 308 14.3 Interval trees / 311 IV Advanced Design and Analysis Techniques Introduction / 321 15 Dynamic Programming / 323 15.1 Assembly-line scheduling / 324 15.2 Matrix-chain multiplication / 331 15.3 Elements of dynamic programming / 339 15.4 Longest common subsequence / 350 15.5 Optimal binary search trees / 356 16 Greedy Algorithms / 370 16.1 An activity-selection problem / 377 16.2 Elements of the greedy strategy / 379 16.3 Huffman codes / 385 * 16.4 Theoretical foundations for greedy methods / 393 * 16.5 A task-scheduling problem / 399 17 Amortized Analysis / 405 17.1 Aggregate analysis / 406 17.2 The accounting method / 470 17.3 The potential method / 412 17.4 Dynamic tables / 476 V Advanced Data Structures Introduction / 431 18 B-Trees / 434 18.1 Definition of B-trees / 438 18.2 Basic operations on B-trees / 441 18.3 Deleting a key from -tree / 449 19 Binomial Heaps / 455 19.1 Binomial trees and binomial heaps / 457 19.2 Operations on binomial heaps / 461 20 Fibonacci Heaps / 476 20.1 Structure of Fibonacci heaps / 477 20.2 Mergeable-heap operations / 479 20.3 Decreasing a key and deleting a node / 489 20.4 Bounding the maximum degree / 493 21 Data Structures for Disjoint Sets / 498 21.1 Disjoint-set operations / 498 21.2 Linked-list representation of disjoint sets / 501 21.3 Disjoint-set forests / 505 * 21.4 Analysis of union by rank with path compression / 509 VI Graph Algorithms Introduction / 525 22 Elementary Graph Algorithms / 527 22.1 Representations of graphs / 527 22.2 Breadth-first search / 531 22.3 Depth-first search / 540 22.4 Topological sort / 549 22.5 Strongly connected components / 552 23 Minimum Spanning Trees / 561 23.1 Growing a minimum spanning tree / 562 23.2 The algorithms of Kruskal and Prim / 567 24 Single-Source Shortest Paths / 580 24.1 The Bellman--Ford algorithm / 588 24.2 Single-source shortest paths in directed acyclic graphs / 592 24.3 Dijkstra's algorithm / 595 24.4 Difference constraints and shortest paths / 607 24.5 Proofs of shortest-paths properties / 607 25 All-Pairs Shortest Paths / 620 25.1 Shortest paths and matrix multiplication / 622 25.2 The Floyd--Warshall algorithm / 629 25.3 Johnson's algorithm for sparse graphs / 636 26 Maximum Flow / 643 26.1 Flow networks / 644 26.2 The Ford--Fulkerson method / 657 26.3 Maximum bipartite matching / 664 * 26.4 Push-relabel algorithms / 669 26.5 The relabel-to-front algorithm / 681 VII Selected Topics Introduction / 701 27 Sorting Networks / 704 21 Comparison networks / 704 27.2 The zero-one principle / 709 21.3 A bitonic sorting network / 712 21.4 A merging network / 716 27.5 A sorting network / 719 28 Matrix Operations / 725 28.1 Properties of matrices / 725 28.2 Strassen's algorithm for matrix multiplication / 735 28.3 Solving systems of linear equations / 742 28.4 Inverting matrices / 755 28.5 Symmetric positive-definite matrices and least-squares approximation / 760 29 Linear Programming / 770 29.1 Standard and slack forms / 777 29.2 Formulating problems as linear programs / 785 29.3 The simplex algorithm / 790 29.4 Duality / 804 29.5 The initial basic feasible solution Si / 7 30 Polynomials and the FFT / 822 30.1 Representation of polynomials / 824 30.2 The DFT and FFT / 830 30.3 Efficient FFT implementations / 839 31 Number-Theoretic Algorithms / 849 31.1 Elementary number-theoretic notions / 850 31.2 Greatest common divisor / 856 31.3 Modular arithmetic / 862 31.4 Solving modular linear equations / 869 31.5 The Chinese remainder theorem / 873 31.6 Powers of an element / 876 31.7 The RSA public-key cryptosystem / 881 31.8 Primality testing / 887 31.9 Integer factorization / 896 32 String Matching / 906 32.1 The naive string-matching algorithm / 909 32.2 The Rabin--Karp algorithm / 911 32.3 String matching with finite automata / 976 32.4 The Knuth--Morris--Pratt algorithm / 923 33 Computational Geometry / 933 33.1 Line-segment properties / 934 33.2 Determining whether any pair of segments intersects / 940 33.3 Finding the convex hull / 947 33.4 Finding the closest pair of points / 957 34 NP-Completeness / 966 34.1 Polynomial time / 971 34.2 Polynomial-time verification / 979 34.3 NP-completeness and reducibility / 984 34.4 NP-completeness proofs / 995 34.5 NP-complete problems / 1003 35 Approximation Algorithms / 1022 35.1 The vertex-cover problem / 1024 35.2 The traveling-salesman problem / 7027 35.3 The set-covering problem / 1033 35.4 Randomization and linear programming / 7039 35.5 The subset-sum problem / 1043 VIII Appendix: Mathematical Background Introduction / 1057 A Summations / 1058 A.1 Summation formulas and properties / 1058 A.2 Bounding summations / 1062

rawabstract:
This title covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. This second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

shortTOC:
1: The Role of Algorithms in Computing 2: Getting Started 3: Growth of Functions 4: Recurrences 5: Probabilistic Analysis and Randomized Algorithms 6: Heapsort 7: Quicksort 8: Sorting in Linear Time 9: Medians and Order Statistics 10: Elementary Data Structures 11: Hash Tables 12: Binary Search Trees 13: Red-Black Trees 14: Augmenting Data Structures 15: Dynamic Programming 16: Greedy Algorithms 17: Amortized Analysis 18: B-Trees 19: Binomial Heaps 20: Fibonacci Heaps 21: Data Structures for Disjoint Sets 22: Elementary Graph Algorithms 23: Minimum Spanning Trees 24: Single-Source Shortest Paths 25: All-Pairs Shortest Paths 26: Maximum Flow 27: Sorting Networks 28: Matrix Operations 29: Linear Programming 30: Polynomials and the FFT 31: Number-Theoretic Algorithms 32: String Matching 33: Computational Geometry 34: NP-Completeness 35: Approximation Algorithms A: Summations B: Sets, etc. C: Counting and probability

rawshortTOC:
1: The Role of Algorithms in Computing \\ 2: Getting Started \\ 3: Growth of Functions \\ 4: Recurrences \\ 5: Probabilistic Analysis and Randomized Algorithms \\ 6: Heapsort \\ 7: Quicksort \\ 8: Sorting in Linear Time \\ 9: Medians and Order Statistics \\ 10: Elementary Data Structures \\ 11: Hash Tables \\ 12: Binary Search Trees \\ 13: Red-Black Trees \\ 14: Augmenting Data Structures \\ 15: Dynamic Programming \\ 16: Greedy Algorithms \\ 17: Amortized Analysis \\ 18: B-Trees \\ 19: Binomial Heaps \\ 20: Fibonacci Heaps \\ 21: Data Structures for Disjoint Sets \\ 22: Elementary Graph Algorithms \\ 23: Minimum Spanning Trees \\ 24: Single-Source Shortest Paths \\ 25: All-Pairs Shortest Paths \\ 26: Maximum Flow \\ 27: Sorting Networks \\ 28: Matrix Operations \\ 29: Linear Programming \\ 30: Polynomials and the FFT \\ 31: Number-Theoretic Algorithms \\ 32: String Matching \\ 33: Computational Geometry \\ 34: NP-Completeness \\ 35: Approximation Algorithms \\ A: Summations \\ B: Sets, etc. \\ C: Counting and probability

rawTOC:
Preface / xiii \\ I Foundations \\ Introduction / 3 \\ 1 The Role of Algorithms in Computing / 5 \\ 1.1 Algorithms / 5 \\ 1.2 Algorithms as a technology / 10 \\ 2 Getting Started / 75 \\ 2.1 Insertion sort / 15 \\ 2.2 Analyzing algorithms / 21 \\ 2.3 Designing algorithms / 27 \\ 3 Growth of Functions / 41 \\ 3.1 Asymptotic notation / 41 \\ 3.2 Standard notations and common functions / 51 \\ 4 Recurrences / 62 \\ 4.1 The substitution method / 63 \\ 4.2 The recursion-tree method / 67 \\ 4.3 The master method / 73 \\ 4.4 Proof of the master theorem / 76 \\ 5 Probabilistic Analysis and Randomized Algorithms / 91 \\ 5.1 The hiring problem / 91 \\ 5.2 Indicator random variables / 94 \\ 5.3 Randomized algorithms / 99 \\ 5.4 Probabilistic analysis and further uses of indicator random variables / 106 \\ II Sorting and Order Statistics \\ Introduction / 123 \\ 6 Heapsort / 127 \\ 6.1 Heaps / 127 \\ 6.2 Maintaining the heap property / 130 \\ 6.3 Building a heap / 132 \\ 6.4 The heapsort algorithm / 135 \\ 6.5 Priority queues / 138 \\ 7 Quicksort / 145 \\ 7.1 Description of quicksort / 145 \\ 7.2 Performance of quicksort / 149 \\ 7.3 A randomized version of quicksort / 153 \\ 7.4 Analysis of quicksort / 755 \\ 8 Sorting in Linear Time / 165 \\ 8.1 Lower bounds for sorting / 765 \\ 8.2 Counting sort / 168 \\ 8.3 Radix sort / 770 \\ 8.4 Bucket sort / 174 \\ 9 Medians and Order Statistics / 183 \\ 9.1 Minimum and maximum / 184 \\ 9.2 Selection in expected linear time / 785 \\ 9.3 Selection in worst-case linear time / 189 \\ III Data Structures \\ Introduction / 197 \\ 10 Elementary Data Structures / 200 \\ 10.1 Stacks and queues / 200 \\ 10.2 Linked lists / 204 \\ 10.3 Implementing pointers and objects / 209 \\ 10.4 Representing rooted trees / 214 \\ 11 Hash Tables / 221 \\ 11.1 Direct-address tables / 222 \\ 11.2 Hash tables / 224 \\ 11.3 Hash functions / 229 \\ 11.4 Open addressing / 237 \\ 11.5 Perfect hashing / 245 \\ 12 Binary Search Trees / 253 \\ 12.1 What is a binary search tree? / 253 \\ 12.2 Querying a binary search tree / 256 \\ 12.3 Insertion and deletion / 261 \\ 12.4 Randomly built binary search trees / 265 \\ 13 Red--Black Trees / 273 \\ 13.1 Properties of red-black trees / 273 \\ 13.2 Rotations / 277 \\ 13.3 Insertion / 280 \\ 13.4 Deletion / 288 \\ 14 Augmenting Data Structures / 302 \\ 14.1 Dynamic order statistics / 302 \\ 14.2 How to augment a data structure / 308 \\ 14.3 Interval trees / 311 \\ IV Advanced Design and Analysis Techniques \\ Introduction / 321 \\ 15 Dynamic Programming / 323 \\ 15.1 Assembly-line scheduling / 324 \\ 15.2 Matrix-chain multiplication / 331 \\ 15.3 Elements of dynamic programming / 339 \\ 15.4 Longest common subsequence / 350 \\ 15.5 Optimal binary search trees / 356 \\ 16 Greedy Algorithms / 370 \\ 16.1 An activity-selection problem / 377 \\ 16.2 Elements of the greedy strategy / 379 \\ 16.3 Huffman codes / 385 \\ * 16.4 Theoretical foundations for greedy methods / 393 \\ * 16.5 A task-scheduling problem / 399 \\ 17 Amortized Analysis / 405 \\ 17.1 Aggregate analysis / 406 \\ 17.2 The accounting method / 470 \\ 17.3 The potential method / 412 \\ 17.4 Dynamic tables / 476 \\ V Advanced Data Structures \\ Introduction / 431 \\ 18 B-Trees / 434 \\ 18.1 Definition of B-trees / 438 \\ 18.2 Basic operations on B-trees / 441 \\ 18.3 Deleting a key from -tree / 449 \\ 19 Binomial Heaps / 455 \\ 19.1 Binomial trees and binomial heaps / 457 \\ 19.2 Operations on binomial heaps / 461 \\ 20 Fibonacci Heaps / 476 \\ 20.1 Structure of Fibonacci heaps / 477 \\ 20.2 Mergeable-heap operations / 479 \\ 20.3 Decreasing a key and deleting a node / 489 \\ 20.4 Bounding the maximum degree / 493 \\ 21 Data Structures for Disjoint Sets / 498 \\ 21.1 Disjoint-set operations / 498 \\ 21.2 Linked-list representation of disjoint sets / 501 \\ 21.3 Disjoint-set forests / 505 \\ * 21.4 Analysis of union by rank with path compression / 509 \\ VI Graph Algorithms \\ Introduction / 525 \\ 22 Elementary Graph Algorithms / 527 \\ 22.1 Representations of graphs / 527 \\ 22.2 Breadth-first search / 531 \\ 22.3 Depth-first search / 540 \\ 22.4 Topological sort / 549 \\ 22.5 Strongly connected components / 552 \\ 23 Minimum Spanning Trees / 561 \\ 23.1 Growing a minimum spanning tree / 562 \\ 23.2 The algorithms of Kruskal and Prim / 567 \\ 24 Single-Source Shortest Paths / 580 \\ 24.1 The Bellman--Ford algorithm / 588 \\ 24.2 Single-source shortest paths in directed acyclic graphs / 592 \\ 24.3 Dijkstra's algorithm / 595 \\ 24.4 Difference constraints and shortest paths / 607 \\ 24.5 Proofs of shortest-paths properties / 607 \\ 25 All-Pairs Shortest Paths / 620 \\ 25.1 Shortest paths and matrix multiplication / 622 \\ 25.2 The Floyd--Warshall algorithm / 629 \\ 25.3 Johnson's algorithm for sparse graphs / 636 \\ 26 Maximum Flow / 643 \\ 26.1 Flow networks / 644 \\ 26.2 The Ford--Fulkerson method / 657 \\ 26.3 Maximum bipartite matching / 664 \\ * 26.4 Push-relabel algorithms / 669 \\ 26.5 The relabel-to-front algorithm / 681 \\ VII Selected Topics \\ Introduction / 701 \\ 27 Sorting Networks / 704 \\ 21 Comparison networks / 704 \\ 27.2 The zero-one principle / 709 \\ 21.3 A bitonic sorting network / 712 \\ 21.4 A merging network / 716 \\ 27.5 A sorting network / 719 \\ 28 Matrix Operations / 725 \\ 28.1 Properties of matrices / 725 \\ 28.2 Strassen's algorithm for matrix multiplication / 735 \\ 28.3 Solving systems of linear equations / 742 \\ 28.4 Inverting matrices / 755 \\ 28.5 Symmetric positive-definite matrices and least-squares approximation / 760 \\ 29 Linear Programming / 770 \\ 29.1 Standard and slack forms / 777 \\ 29.2 Formulating problems as linear programs / 785 \\ 29.3 The simplex algorithm / 790 \\ 29.4 Duality / 804 \\ 29.5 The initial basic feasible solution Si / 7 \\ 30 Polynomials and the FFT / 822 \\ 30.1 Representation of polynomials / 824 \\ 30.2 The DFT and FFT / 830 \\ 30.3 Efficient FFT implementations / 839 \\ 31 Number-Theoretic Algorithms / 849 \\ 31.1 Elementary number-theoretic notions / 850 \\ 31.2 Greatest common divisor / 856 \\ 31.3 Modular arithmetic / 862 \\ 31.4 Solving modular linear equations / 869 \\ 31.5 The Chinese remainder theorem / 873 \\ 31.6 Powers of an element / 876 \\ 31.7 The RSA public-key cryptosystem / 881 \\ 31.8 Primality testing / 887 \\ 31.9 Integer factorization / 896 \\ 32 String Matching / 906 \\ 32.1 The naive string-matching algorithm / 909 \\ 32.2 The Rabin--Karp algorithm / 911 \\ 32.3 String matching with finite automata / 976 \\ 32.4 The Knuth--Morris--Pratt algorithm / 923 \\ 33 Computational Geometry / 933 \\ 33.1 Line-segment properties / 934 \\ 33.2 Determining whether any pair of segments intersects / 940 \\ 33.3 Finding the convex hull / 947 \\ 33.4 Finding the closest pair of points / 957 \\ 34 NP-Completeness / 966 \\ 34.1 Polynomial time / 971 \\ 34.2 Polynomial-time verification / 979 \\ 34.3 NP-completeness and reducibility / 984 \\ 34.4 NP-completeness proofs / 995 \\ 34.5 NP-complete problems / 1003 \\ 35 Approximation Algorithms / 1022 \\ 35.1 The vertex-cover problem / 1024 \\ 35.2 The traveling-salesman problem / 7027 \\ 35.3 The set-covering problem / 1033 \\ 35.4 Randomization and linear programming / 7039 \\ 35.5 The subset-sum problem / 1043 \\ VIII Appendix: Mathematical Background \\ Introduction / 1057 \\ A Summations / 1058 \\ A.1 Summation formulas and properties / 1058 \\ A.2 Bounding summations / 1062

entry:
@Book{Cormen:2001:IA,
  author =       "Thomas H. Cormen and Charles E. (Eric) Leiserson and
                 Ronald L. Rivest",
  title =        "Introduction to Algorithms",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Second",
  pages =        "xxi + 1180",
  year =         "2001",
  ISBN =         "0-262-53196-8 (paperback), 0-262-03293-7 (hardcover),
                 0-07-013151-1 (McGraw-Hill), 0-07-297054-5 (McGraw-Hill
                 with CD-ROM)",
  ISBN-13 =      "978-0-262-53196-2 (paperback), 978-0-262-03293-3
                 (hardcover), 978-0-07-013151-4 (McGraw-Hill),
                 978-0-07-297054-8 (McGraw-Hill with CD-ROM)",
  LCCN =         "QA76.6 .I5858 2001",
  bibdate =      "Sat Jan 26 12:46:16 MST 2013",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "This title covers a broad range of algorithms in
                 depth, yet makes their design and analysis accessible
                 to all levels of readers. Each chapter is relatively
                 self-contained and can be used as a unit of study. The
                 algorithms are described in English and in a pseudocode
                 designed to be readable by anyone who has done a little
                 programming. The explanations have been kept elementary
                 without sacrificing depth of coverage or mathematical
                 rigor. This second edition features new chapters on the
                 role of algorithms, probabilistic analysis and
                 randomized algorithms, and linear programming, as well
                 as extensive revisions to virtually every section of
                 the book. In a subtle but important change, loop
                 invariants are introduced early and used throughout the
                 text to prove algorithm correctness. Without changing
                 the mathematical and analytic focus, the authors have
                 moved much of the mathematical foundations material
                 from Part I to an appendix and have included additional
                 motivational material at the beginning.",
  acknowledgement = ack-ds # " and " # ack-nhfb,
  libnote =      "Not yet in my library.",
  rawdata =      "Cormen, Thomas H., Charles E. Leiserson, Ronald L.
                 Rivest and Clifford Stein (2001) {\it Introduction to
                 Algorithms}, 2nd Edition, MIT Press and McGraw-Hill.",
  remark =       "MIT Press 2001, McGraw-Hill 2002 (third printing),
                 McGraw-Hill 2003 (fourth printing)",
  shorttableofcontents = "1: The Role of Algorithms in Computing \\
                 2: Getting Started \\
                 3: Growth of Functions \\
                 4: Recurrences \\
                 5: Probabilistic Analysis and Randomized Algorithms \\
                 6: Heapsort \\
                 7: Quicksort \\
                 8: Sorting in Linear Time \\
                 9: Medians and Order Statistics \\
                 10: Elementary Data Structures \\
                 11: Hash Tables \\
                 12: Binary Search Trees \\
                 13: Red-Black Trees \\
                 14: Augmenting Data Structures \\
                 15: Dynamic Programming \\
                 16: Greedy Algorithms \\
                 17: Amortized Analysis \\
                 18: B-Trees \\
                 19: Binomial Heaps \\
                 20: Fibonacci Heaps \\
                 21: Data Structures for Disjoint Sets \\
                 22: Elementary Graph Algorithms \\
                 23: Minimum Spanning Trees \\
                 24: Single-Source Shortest Paths \\
                 25: All-Pairs Shortest Paths \\
                 26: Maximum Flow \\
                 27: Sorting Networks \\
                 28: Matrix Operations \\
                 29: Linear Programming \\
                 30: Polynomials and the FFT \\
                 31: Number-Theoretic Algorithms \\
                 32: String Matching \\
                 33: Computational Geometry \\
                 34: NP-Completeness \\
                 35: Approximation Algorithms \\
                 A: Summations \\
                 B: Sets, etc. \\
                 C: Counting and probability",
  subject =      "Computer programming; Computer algorithms",
  tableofcontents = "Preface / xiii \\
                 I Foundations \\
                 Introduction / 3 \\
                 1 The Role of Algorithms in Computing / 5 \\
                 1.1 Algorithms / 5 \\
                 1.2 Algorithms as a technology / 10 \\
                 2 Getting Started / 75 \\
                 2.1 Insertion sort / 15 \\
                 2.2 Analyzing algorithms / 21 \\
                 2.3 Designing algorithms / 27 \\
                 3 Growth of Functions / 41 \\
                 3.1 Asymptotic notation / 41 \\
                 3.2 Standard notations and common functions / 51 \\
                 4 Recurrences / 62 \\
                 4.1 The substitution method / 63 \\
                 4.2 The recursion-tree method / 67 \\
                 4.3 The master method / 73 \\
                 4.4 Proof of the master theorem / 76 \\
                 5 Probabilistic Analysis and Randomized Algorithms / 91
                 \\
                 5.1 The hiring problem / 91 \\
                 5.2 Indicator random variables / 94 \\
                 5.3 Randomized algorithms / 99 \\
                 5.4 Probabilistic analysis and further uses of
                 indicator random variables / 106 \\
                 II Sorting and Order Statistics \\
                 Introduction / 123 \\
                 6 Heapsort / 127 \\
                 6.1 Heaps / 127 \\
                 6.2 Maintaining the heap property / 130 \\
                 6.3 Building a heap / 132 \\
                 6.4 The heapsort algorithm / 135 \\
                 6.5 Priority queues / 138 \\
                 7 Quicksort / 145 \\
                 7.1 Description of quicksort / 145 \\
                 7.2 Performance of quicksort / 149 \\
                 7.3 A randomized version of quicksort / 153 \\
                 7.4 Analysis of quicksort / 755 \\
                 8 Sorting in Linear Time / 165 \\
                 8.1 Lower bounds for sorting / 765 \\
                 8.2 Counting sort / 168 \\
                 8.3 Radix sort / 770 \\
                 8.4 Bucket sort / 174 \\
                 9 Medians and Order Statistics / 183 \\
                 9.1 Minimum and maximum / 184 \\
                 9.2 Selection in expected linear time / 785 \\
                 9.3 Selection in worst-case linear time / 189 \\
                 III Data Structures \\
                 Introduction / 197 \\
                 10 Elementary Data Structures / 200 \\
                 10.1 Stacks and queues / 200 \\
                 10.2 Linked lists / 204 \\
                 10.3 Implementing pointers and objects / 209 \\
                 10.4 Representing rooted trees / 214 \\
                 11 Hash Tables / 221 \\
                 11.1 Direct-address tables / 222 \\
                 11.2 Hash tables / 224 \\
                 11.3 Hash functions / 229 \\
                 11.4 Open addressing / 237 \\
                 11.5 Perfect hashing / 245 \\
                 12 Binary Search Trees / 253 \\
                 12.1 What is a binary search tree? / 253 \\
                 12.2 Querying a binary search tree / 256 \\
                 12.3 Insertion and deletion / 261 \\
                 12.4 Randomly built binary search trees / 265 \\
                 13 Red--Black Trees / 273 \\
                 13.1 Properties of red-black trees / 273 \\
                 13.2 Rotations / 277 \\
                 13.3 Insertion / 280 \\
                 13.4 Deletion / 288 \\
                 14 Augmenting Data Structures / 302 \\
                 14.1 Dynamic order statistics / 302 \\
                 14.2 How to augment a data structure / 308 \\
                 14.3 Interval trees / 311 \\
                 IV Advanced Design and Analysis Techniques \\
                 Introduction / 321 \\
                 15 Dynamic Programming / 323 \\
                 15.1 Assembly-line scheduling / 324 \\
                 15.2 Matrix-chain multiplication / 331 \\
                 15.3 Elements of dynamic programming / 339 \\
                 15.4 Longest common subsequence / 350 \\
                 15.5 Optimal binary search trees / 356 \\
                 16 Greedy Algorithms / 370 \\
                 16.1 An activity-selection problem / 377 \\
                 16.2 Elements of the greedy strategy / 379 \\
                 16.3 Huffman codes / 385 \\
                 * 16.4 Theoretical foundations for greedy methods / 393
                 \\
                 * 16.5 A task-scheduling problem / 399 \\
                 17 Amortized Analysis / 405 \\
                 17.1 Aggregate analysis / 406 \\
                 17.2 The accounting method / 470 \\
                 17.3 The potential method / 412 \\
                 17.4 Dynamic tables / 476 \\
                 V Advanced Data Structures \\
                 Introduction / 431 \\
                 18 B-Trees / 434 \\
                 18.1 Definition of B-trees / 438 \\
                 18.2 Basic operations on B-trees / 441 \\
                 18.3 Deleting a key from -tree / 449 \\
                 19 Binomial Heaps / 455 \\
                 19.1 Binomial trees and binomial heaps / 457 \\
                 19.2 Operations on binomial heaps / 461 \\
                 20 Fibonacci Heaps / 476 \\
                 20.1 Structure of Fibonacci heaps / 477 \\
                 20.2 Mergeable-heap operations / 479 \\
                 20.3 Decreasing a key and deleting a node / 489 \\
                 20.4 Bounding the maximum degree / 493 \\
                 21 Data Structures for Disjoint Sets / 498 \\
                 21.1 Disjoint-set operations / 498 \\
                 21.2 Linked-list representation of disjoint sets / 501
                 \\
                 21.3 Disjoint-set forests / 505 \\
                 * 21.4 Analysis of union by rank with path compression
                 / 509 \\
                 VI Graph Algorithms \\
                 Introduction / 525 \\
                 22 Elementary Graph Algorithms / 527 \\
                 22.1 Representations of graphs / 527 \\
                 22.2 Breadth-first search / 531 \\
                 22.3 Depth-first search / 540 \\
                 22.4 Topological sort / 549 \\
                 22.5 Strongly connected components / 552 \\
                 23 Minimum Spanning Trees / 561 \\
                 23.1 Growing a minimum spanning tree / 562 \\
                 23.2 The algorithms of Kruskal and Prim / 567 \\
                 24 Single-Source Shortest Paths / 580 \\
                 24.1 The Bellman--Ford algorithm / 588 \\
                 24.2 Single-source shortest paths in directed acyclic
                 graphs / 592 \\
                 24.3 Dijkstra's algorithm / 595 \\
                 24.4 Difference constraints and shortest paths / 607
                 \\
                 24.5 Proofs of shortest-paths properties / 607 \\
                 25 All-Pairs Shortest Paths / 620 \\
                 25.1 Shortest paths and matrix multiplication / 622 \\
                 25.2 The Floyd--Warshall algorithm / 629 \\
                 25.3 Johnson's algorithm for sparse graphs / 636 \\
                 26 Maximum Flow / 643 \\
                 26.1 Flow networks / 644 \\
                 26.2 The Ford--Fulkerson method / 657 \\
                 26.3 Maximum bipartite matching / 664 \\
                 * 26.4 Push-relabel algorithms / 669 \\
                 26.5 The relabel-to-front algorithm / 681 \\
                 VII Selected Topics \\
                 Introduction / 701 \\
                 27 Sorting Networks / 704 \\
                 21 Comparison networks / 704 \\
                 27.2 The zero-one principle / 709 \\
                 21.3 A bitonic sorting network / 712 \\
                 21.4 A merging network / 716 \\
                 27.5 A sorting network / 719 \\
                 28 Matrix Operations / 725 \\
                 28.1 Properties of matrices / 725 \\
                 28.2 Strassen's algorithm for matrix multiplication /
                 735 \\
                 28.3 Solving systems of linear equations / 742 \\
                 28.4 Inverting matrices / 755 \\
                 28.5 Symmetric positive-definite matrices and
                 least-squares approximation / 760 \\
                 29 Linear Programming / 770 \\
                 29.1 Standard and slack forms / 777 \\
                 29.2 Formulating problems as linear programs / 785 \\
                 29.3 The simplex algorithm / 790 \\
                 29.4 Duality / 804 \\
                 29.5 The initial basic feasible solution Si / 7 \\
                 30 Polynomials and the FFT / 822 \\
                 30.1 Representation of polynomials / 824 \\
                 30.2 The DFT and FFT / 830 \\
                 30.3 Efficient FFT implementations / 839 \\
                 31 Number-Theoretic Algorithms / 849 \\
                 31.1 Elementary number-theoretic notions / 850 \\
                 31.2 Greatest common divisor / 856 \\
                 31.3 Modular arithmetic / 862 \\
                 31.4 Solving modular linear equations / 869 \\
                 31.5 The Chinese remainder theorem / 873 \\
                 31.6 Powers of an element / 876 \\
                 31.7 The RSA public-key cryptosystem / 881 \\
                 31.8 Primality testing / 887 \\
                 31.9 Integer factorization / 896 \\
                 32 String Matching / 906 \\
                 32.1 The naive string-matching algorithm / 909 \\
                 32.2 The Rabin--Karp algorithm / 911 \\
                 32.3 String matching with finite automata / 976 \\
                 32.4 The Knuth--Morris--Pratt algorithm / 923 \\
                 33 Computational Geometry / 933 \\
                 33.1 Line-segment properties / 934 \\
                 33.2 Determining whether any pair of segments
                 intersects / 940 \\
                 33.3 Finding the convex hull / 947 \\
                 33.4 Finding the closest pair of points / 957 \\
                 34 NP-Completeness / 966 \\
                 34.1 Polynomial time / 971 \\
                 34.2 Polynomial-time verification / 979 \\
                 34.3 NP-completeness and reducibility / 984 \\
                 34.4 NP-completeness proofs / 995 \\
                 34.5 NP-complete problems / 1003 \\
                 35 Approximation Algorithms / 1022 \\
                 35.1 The vertex-cover problem / 1024 \\
                 35.2 The traveling-salesman problem / 7027 \\
                 35.3 The set-covering problem / 1033 \\
                 35.4 Randomization and linear programming / 7039 \\
                 35.5 The subset-sum problem / 1043 \\
                 VIII Appendix: Mathematical Background \\
                 Introduction / 1057 \\
                 A Summations / 1058 \\
                 A.1 Summation formulas and properties / 1058 \\
                 A.2 Bounding summations / 1062",
}


bibtype: book
filename: master.bib
label: Cormen:2009:IA
editor: Thomas H. Cormen and Charles Eric Leiserson and Ronald L. Rivest and Clifford Stein
title: Introduction to Algorithms
publisher: pub-MIT
address: pub-MIT:adr
edition: Third
pages: xix + 1292
year: 2009
LCCN: QA76.6 .C662 2009
bibdate: Thu Sep 9 14:42:33 MDT 2010
bibsource: https://www.math.utah.edu/pub/tex/bib/master.bib; z3950.loc.gov:7090/Voyager
bibtimestamp: 2010.09.09 14:42:33 MDT
subject: Computer programming; Computer algorithms
acknowledgement: ack-nhfb
raweditor: Thomas H. Cormen and Charles Eric Leiserson and Ronald L. Rivest and Clifford Stein
rawtitle: Introduction to Algorithms
ISBN:
0-262-03384-4 (hardcover), 0-262-53305-7 (paperback) OR 0262033844 (hardcover), 0262533057 (paperback)

ISBN13:
978-0-262-03384-8 (hardcover), 978-0-262-53305-8 (paperback) OR 9780262033848 (hardcover), 9780262533058 (paperback)

abstract:
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called ``Divide-and-Conquer''). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition.

TOC:
I. Foundations The role of algorithms in computing Getting started Growth of functions Divide-and-conquer Probabilistic analysis and randomized algorithms II. Sorting and order statistics Heapsort Quicksort Sorting in linear time Medians and order statistics III. Data structures Elementary data structures Hash tables Binary search trees Red--black trees Augmenting data structures IV. Advanced design and analysis techniques Dynamic programming Greedy algorithms Amortized analysis V. Advanced data structures B-trees Fibonacci heaps van Emde Boas trees Data structures for disjoint sets VI. Graph algorithms Elementary graph algorithms Minimum spanning trees Single-source shortest paths All-pairs shortest paths Maximun flow VII. Selected topics Multithreaded algorithms Matrix operations Linear programming Polynomials and the FFT Number-theoretic algorithms String matching Computational geometry NP-completeness Approximation algorithms VIII. Appendix: Mathematical background Summations Sets, etc. Counting and probability Matrices

rawabstract:
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called ``Divide-and-Conquer''). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition.

rawTOC:
I. Foundations \\ The role of algorithms in computing \\ Getting started \\ Growth of functions \\ Divide-and-conquer \\ Probabilistic analysis and randomized algorithms \\ II. Sorting and order statistics \\ Heapsort \\ Quicksort \\ Sorting in linear time \\ Medians and order statistics \\ III. Data structures \\ Elementary data structures \\ Hash tables \\ Binary search trees \\ Red--black trees \\ Augmenting data structures \\ IV. Advanced design and analysis techniques \\ Dynamic programming \\ Greedy algorithms \\ Amortized analysis \\ V. Advanced data structures \\ B-trees \\ Fibonacci heaps \\ van Emde Boas trees \\ Data structures for disjoint sets \\ VI. Graph algorithms \\ Elementary graph algorithms \\ Minimum spanning trees \\ Single-source shortest paths \\ All-pairs shortest paths \\ Maximun flow \\ VII. Selected topics \\ Multithreaded algorithms \\ Matrix operations \\ Linear programming \\ Polynomials and the FFT \\ Number-theoretic algorithms \\ String matching \\ Computational geometry \\ NP-completeness \\ Approximation algorithms \\ VIII. Appendix: Mathematical background \\ Summations \\ Sets, etc. \\ Counting and probability \\ Matrices

entry:
@Book{Cormen:2009:IA,
  editor =       "Thomas H. Cormen and Charles Eric Leiserson and Ronald
                 L. Rivest and Clifford Stein",
  title =        "Introduction to Algorithms",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Third",
  pages =        "xix + 1292",
  year =         "2009",
  ISBN =         "0-262-03384-4 (hardcover), 0-262-53305-7 (paperback)",
  ISBN-13 =      "978-0-262-03384-8 (hardcover), 978-0-262-53305-8
                 (paperback)",
  LCCN =         "QA76.6 .C662 2009",
  bibdate =      "Thu Sep 9 14:42:33 MDT 2010",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/master.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Some books on algorithms are rigorous but incomplete;
                 others cover masses of material but lack rigor.
                 Introduction to Algorithms uniquely combines rigor and
                 comprehensiveness. The book covers a broad range of
                 algorithms in depth, yet makes their design and
                 analysis accessible to all levels of readers. Each
                 chapter is relatively self-contained and can be used as
                 a unit of study. The algorithms are described in
                 English and in a pseudocode designed to be readable by
                 anyone who has done a little programming. The
                 explanations have been kept elementary without
                 sacrificing depth of coverage or mathematical rigor.
                 The first edition became a widely used text in
                 universities worldwide as well as the standard
                 reference for professionals. The second edition
                 featured new chapters on the role of algorithms,
                 probabilistic analysis and randomized algorithms, and
                 linear programming. The third edition has been revised
                 and updated throughout. It includes two completely new
                 chapters, on van Emde Boas trees and multithreaded
                 algorithms, and substantial additions to the chapter on
                 recurrences (now called ``Divide-and-Conquer''). It
                 features improved treatment of dynamic programming and
                 greedy algorithms and a new notion of edge-based flow
                 in the material on flow networks. Many new exercises
                 and problems have been added for this edition.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer programming; Computer algorithms",
  tableofcontents = "I. Foundations \\
                 The role of algorithms in computing \\
                 Getting started \\
                 Growth of functions \\
                 Divide-and-conquer \\
                 Probabilistic analysis and randomized algorithms \\
                 II. Sorting and order statistics \\
                 Heapsort \\
                 Quicksort \\
                 Sorting in linear time \\
                 Medians and order statistics \\
                 III. Data structures \\
                 Elementary data structures \\
                 Hash tables \\
                 Binary search trees \\
                 Red--black trees \\
                 Augmenting data structures \\
                 IV. Advanced design and analysis techniques \\
                 Dynamic programming \\
                 Greedy algorithms \\
                 Amortized analysis \\
                 V. Advanced data structures \\
                 B-trees \\
                 Fibonacci heaps \\
                 van Emde Boas trees \\
                 Data structures for disjoint sets \\
                 VI. Graph algorithms \\
                 Elementary graph algorithms \\
                 Minimum spanning trees \\
                 Single-source shortest paths \\
                 All-pairs shortest paths \\
                 Maximun flow \\
                 VII. Selected topics \\
                 Multithreaded algorithms \\
                 Matrix operations \\
                 Linear programming \\
                 Polynomials and the FFT \\
                 Number-theoretic algorithms \\
                 String matching \\
                 Computational geometry \\
                 NP-completeness \\
                 Approximation algorithms \\
                 VIII. Appendix: Mathematical background \\
                 Summations \\
                 Sets, etc. \\
                 Counting and probability \\
                 Matrices",
}


