1  9
Number of results to display per page
1. The art of computer programming [1997  1998]
 Knuth, Donald Ervin, 1938
 3rd ed.  Reading, Mass. : AddisonWesley, c1997c1998.
 Description
 Book — v. : ill. ; 24 cm.
 Summary

 1. Basic Concepts. Algorithms. Mathematical Preliminaries. Mathematical Induction. Numbers, Powers, and Logarithms. Sums and Products. Integer Functions and Elementary Number Theory. Permutations and Factorials. Binomial Coefficients. Harmonic Numbers. Fibonacci Numbers. Generating Functions. Analysis of an Algorithm. Asymptotic Representations. MIX. Description of MIX. The MIX Assembly Language. Applications to Permutations. Some Fundamental Programming Techniques. Subroutines. Coroutines. Interpretive Routines. Input and Output. History and Bibliography.
 2. Information Structures. Introduction. Linear Lists. Stacks, Queues, and Deques. Sequential Allocation. Linked Allocation. Circular Lists. Doubly Linked Lists. Arrays and Orthogonal Lists. Trees. Traversing Binary Trees. Binary Tree Representation of Trees. Other Representations of Trees. Basic Mathematical Properties of Trees. Lists and Garbage Collection. Multilinked Structures. Dynamic Storage Allocation. History and Bibliography. Answers to Exercises. Appendix A. Tables of Numerical Quantities.
 1. Fundamental Constants (decimal).
 2. Fundamental Constants (octal).
 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B. Index to Notations. Index and Glossary. 0201896834T02272003.
 (source: Nielsen Book Data)
 3. Random Numbers. Introduction. Generating Uniform Random Numbers. The Linear Congruential Method. Other Methods. Statistical Tests. General Test Procedures for Studying Random Data. Empirical Tests. Theoretical Tests. The Spectral Test. Other Types of Random Quantities. Numerical Distributions. Random Sampling and Shuffling. What Is a Random Sequence? Summary.
 4. Arithmetic. Positional Number Systems. Floating Point Arithmetic. SinglePrecision Calculations. Accuracy of Floating Point Arithmetic. DoublePrecision Calculations. Distribution of Floating Point Numbers. Multiple Precision Arithmetic. The Classical Algorithms. Modular Arithmetic. How Fast Can We Multiply? Radix Conversion. Rational Arithmetic. Fractions. The Greatest Common Divisor. Analysis of Euclid's Algorithm. Factoring into Primes. Polynomial Arithmetic. Division of Polynomials. Factorization of Polynomials. Evaluation of Powers. Evaluation of Polynomials. Manipulation of Power Series. Answers to Exercises. Appendix A. Tables of Numerical Quantities. Fundamental Constants (decimal). Fundamental Constants (octal). Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B. Index to Notations. Index and Glossary. 0201896842T03062003.
 (source: Nielsen Book Data)
 5. Sorting. Combinatorial Properties of Permutations. Inversions. Permutations of a Multiset. Runs. Tableaux and Involutions. Internal sorting. Sorting by Insertion. Sorting by Exchanging. Sorting by Selection. Sorting by Merging. Sorting by Distribution. Optimum Sorting. MinimumComparison Sorting. MinimumComparison Merging. MinimumComparison Selection. Networks for Sorting. External Sorting. Multiway Merging and Replacement Selection. The Polyphase Merge. The Cascade Merge. Reading Tape Backwards. The Oscillating Sort. Practical Considerations for Tape Merging. External Radix Sorting. TwoTape Sorting. Disks and Drums. Summary, History, and Bibliography.
 6. Searching. Sequential Searching. Searching by Comparison of Keys. Searching an Ordered Table. Binary Tree Searching. Balanced Trees. Multiway Trees. Digital Searching. Hashing. Retrieval on Secondary Keys. Answers to Exercises. Appendix A: Tables of Numerical Quantities. Fundamental Constants (decimal). Fundamental Constants (octal). Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B: Index to Notations. Index and Glossary. 0201896850T04062001.
 (source: Nielsen Book Data)
 Preface Notes on the Exercises
 Chapter 7: Combinatorial Searching 1 7.1: Zeros and Ones 47 7.2: Generating All Possibilities 281 Answers to Exercises 514 Appendix A: Tables of Numerical Quantities 818 Appendix B: Index to Notations 822 Appendix C: Index to Algorithms and Theorems 828 Appendix D: Index to Combinatorial Problems 830 Index and Glossary 834.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home...and even at a Little League game when my son wasn't in the lineup. Charles Long If you think you're a really good programmer...read [Knuth's] Art of Computer Programming...You should definitely send me a resume if you can read the whole thing. Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. Jonathan Laventhol The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency.Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.
(source: Nielsen Book Data)
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home...and even at a Little League game when my son wasn't in the lineup. Charles Long If you think you're a really good programmer...read [Knuth's] Art of Computer Programming...You should definitely send me a resume if you can read the whole thing. Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis.Particularly noteworthy in this third edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series.
(source: Nielsen Book Data)
The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 Knuth's multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth's analysis, while practicing programmers have successfully applied his "cookbook" solutions to their daytoday problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient "review" of future volumes could almost be: "Knuth, Volume n has been published." Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this longawaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with wellchosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic stepbystep form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for selfstudy, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer's library. Finally, after a wait of more than thirtyfive years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1  4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http://msp.org The Art of Computer Programming, Volumes 14A Boxed Set, 3/e ISBN: 0321751043.
(source: Nielsen Book Data)
 Online
Engineering Library (Terman), SAL3 (offcampus storage), Science Library (Li and Ma)
Engineering Library (Terman)  Status 

Stacks  
QA76.6 .K64 1997 V.1  Inlibrary use 
QA76.6 .K64 1997 V.1  Unknown 
QA76.6 .K64 1997 V.2  Inlibrary use 
QA76.6 .K64 1997 V.2  Unknown 
QA76.6 .K64 1997 V.3  Inlibrary use 
QA76.6 .K64 1997 V.4A:PT.1  Inlibrary use 
SAL3 (offcampus storage)  Status 

Stacks

Request 
QA76.6 .K64 1997 V.1  Available 
QA76.6 .K64 1997 V.2  Available 
Science Library (Li and Ma)  Status 

Stacks


QA76.6 .K64 1997 V.4A:PT.1  Unknown 
2. The art of computer programming [1973  2011]
 Knuth, Donald Ervin, 1938
 Reading, Mass. : AddisonWesley Pub. Co., ©1973©1981.
 Description
 Book — 4 volumes : illustrations ; 25 cm.
 Summary

 3. Random Numbers. Introduction. Generating Uniform Random Numbers. The Linear Congruential Method. Other Methods. Statistical Tests. General Test Procedures for Studying Random Data. Empirical Tests. Theoretical Tests. The Spectral Test. Other Types of Random Quantities. Numerical Distributions. Random Sampling and Shuffling. What Is a Random Sequence? Summary.
 4. Arithmetic. Positional Number Systems. Floating Point Arithmetic. SinglePrecision Calculations. Accuracy of Floating Point Arithmetic. DoublePrecision Calculations. Distribution of Floating Point Numbers. Multiple Precision Arithmetic. The Classical Algorithms. Modular Arithmetic. How Fast Can We Multiply? Radix Conversion. Rational Arithmetic. Fractions. The Greatest Common Divisor. Analysis of Euclid's Algorithm. Factoring into Primes. Polynomial Arithmetic. Division of Polynomials. Factorization of Polynomials. Evaluation of Powers. Evaluation of Polynomials. Manipulation of Power Series. Answers to Exercises. Appendix A. Tables of Numerical Quantities. Fundamental Constants (decimal). Fundamental Constants (octal). Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B. Index to Notations. Index and Glossary. 0201896842T03062003.
 (source: Nielsen Book Data)
 5. Sorting. Combinatorial Properties of Permutations. Inversions. Permutations of a Multiset. Runs. Tableaux and Involutions. Internal sorting. Sorting by Insertion. Sorting by Exchanging. Sorting by Selection. Sorting by Merging. Sorting by Distribution. Optimum Sorting. MinimumComparison Sorting. MinimumComparison Merging. MinimumComparison Selection. Networks for Sorting. External Sorting. Multiway Merging and Replacement Selection. The Polyphase Merge. The Cascade Merge. Reading Tape Backwards. The Oscillating Sort. Practical Considerations for Tape Merging. External Radix Sorting. TwoTape Sorting. Disks and Drums. Summary, History, and Bibliography.
 6. Searching. Sequential Searching. Searching by Comparison of Keys. Searching an Ordered Table. Binary Tree Searching. Balanced Trees. Multiway Trees. Digital Searching. Hashing. Retrieval on Secondary Keys. Answers to Exercises. Appendix A: Tables of Numerical Quantities. Fundamental Constants (decimal). Fundamental Constants (octal). Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B: Index to Notations. Index and Glossary. 0201896850T04062001.
 (source: Nielsen Book Data)
 Preface Notes on the Exercises
 Chapter 7: Combinatorial Searching 1 7.1: Zeros and Ones 47 7.2: Generating All Possibilities 281
 Answers to Exercises 514
 Appendix A: Tables of Numerical Quantities 818 Appendix B: Index to Notations 822 Appendix C: Index to Algorithms and Theorems 828 Appendix D: Index to Combinatorial Problems 830
 Index and Glossary 834.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home...and even at a Little League game when my son wasn't in the lineup. Charles Long If you think you're a really good programmer...read [Knuth's] Art of Computer Programming...You should definitely send me a resume if you can read the whole thing. Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis.Particularly noteworthy in this third edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series.
(source: Nielsen Book Data)
The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 Knuth's multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth's analysis, while practicing programmers have successfully applied his "cookbook" solutions to their daytoday problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient "review" of future volumes could almost be: "Knuth, Volume n has been published." Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this longawaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with wellchosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic stepbystep form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for selfstudy, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer's library. Finally, after a wait of more than thirtyfive years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1  4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http://msp.org The Art of Computer Programming, Volumes 14A Boxed Set, 3/e ISBN: 0321751043 .
(source: Nielsen Book Data)
 Online
Marine Biology Library (Miller), SAL3 (offcampus storage), Science Library (Li and Ma)
Marine Biology Library (Miller)  Status 

Stacks


QA76.6 .K64 1973 V.1  Unknown 
SAL3 (offcampus storage)  Status 

Stacks

Request 
QA76.6 .K64 1973 V.1  Available 
QA76.6 .K64 1973 V.2  Available 
Science Library (Li and Ma)  Status 

Stacks


QA76.6 .K64 1973 V.1  Unknown 
QA76.6 .K64 1973 V.1  Unknown 
QA76.6 .K64 1973 V.1  Unknown 
QA76.6 .K64 1973 V.2  Unknown 
3. The art of computer programming [1968  1973]
 Knuth, Donald Ervin, 1938
 Reading, Mass., AddisonWesley Pub. Co. 19681973.
 Description
 Book — 3 v. illus. 25 cm.
 Summary

 v. 1. Fundamental algorithms.
 v. 2. Seminumerical algorithms.
 v. 3. Sorting and searching.
 Online
Engineering Library (Terman), SAL3 (offcampus storage), Science Library (Li and Ma)
Engineering Library (Terman)  Status 

Stacks


QA76.6 .K64 1968 V.1  Unknown 
QA76.6 .K64 1968 V.2  Unknown 
QA76.6 .K64 1968 V.3  Inlibrary use 
SAL3 (offcampus storage)  Status 

For use in Terman Library

Request onsite access 
QA76.6 .K64 1968 V.1  Inlibrary use 
Stacks

Request 
QA76.6 .K64 1968 V.2  Available 
QA76.6 .K64 1968 V.3  Available 
Science Library (Li and Ma)  Status 

Stacks


QA76.6 .K64 1968 V.3  Unknown 
QA76.6 .K64 1968 V.3  Unknown 
QA76.6 .K64 1968 V.3  Unknown 
 Graham, Ronald L., 1935
 2nd ed.  Reading, Mass. : AddisonWesley, c1994.
 Description
 Book — xiii, 657 p. : ill. ; 24 cm.
 Summary

 (Most chapters contain Exercises.)
 1. Recurrent Problems. The Tower of Hanoi. Lines in the Plane. The Josephus Problem. Exercises.
 2. Sums. Notation. Sums and Recurrences. Manipulation of Sums. Multiple Sums. General Methods. Finite and Infinite Calculus. Infinite Sums. Exercises.
 3. Integer Functions. Floors and Ceilings. Floor/Ceiling Applications. Floor/Ceiling Recurrences. 'mod': The Binary Operation. Floor/Ceiling Sums. Exercises.
 4. Number Theory. Divisibility. Factorial Factors. Relative Primality. 'mod': The Congruence Relation. Independent Residues. Additional Applications. Phi and Mu. Exercises.
 5. Binomial Coefficients. Basic Identities. Basic Practice. Tricks of the Trade. Generating Functions. Hypergeometric Functions. Hypergeometric Transformations. Partial Hypergeometric Sums. Mechanical Summation. Exercises.
 6. Special Numbers. Stirling Numbers. Eulerian Numbers. Harmonic Numbers. Harmonic Summation. Bernoulli Numbers. Fibonacci Numbers. Continuants. Exercises.
 7. Generating Functions. Domino Theory and Change. Basic Maneuvers. Solving Recurrences. Special Generating Functions. Convolutions. Exponential Generating Functions. Dirichlet Generating Functions. Exercises.
 8. Discrete Probability. Definitions. Mean and Variance. Probability Generating Functions. Flipping Coins. Hashing. Exercises.
 9. Asymptotics. A Hierarchy. O Notation. O Manipulation. Two Asymptotic Tricks. Euler's Summation Formula. Final Summations. Exercises. A. Answers to Exercises. B. Bibliography. C. Credits for Exercises. Index. List of Tables. 0201558025T04062001.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
SAL3 (offcampus storage), Science Library (Li and Ma)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA39.2 .G733 1994  Available 
Science Library (Li and Ma)  Status 

Stacks  
QA39.2 .G733 1994  Unknown 
5. Literate programming [1992]
 Knuth, Donald Ervin, 1938
 [Stanford, Calif.] : Center for the Study of Language and Information, 1992.
 Description
 Book — xv, 368 p. : ill. ; 24 cm.
 Summary

 1. Computer programming as an art
 2. Structured programming with go to statements
 3. A structured program to generate all topological sorting arrangements
 4. Literate programming
 5. Programming pearls: sampling
 6. Programming pearls, continued: common words
 7. How to read a WEB
 8. Excerpts from the programs for TEX and METAFONT
 9. Mathematical writing
 10. The errors of TEX
 11. The error log of TEX
 12. An example of CWEB Further reading Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage), Science Library (Li and Ma)
SAL3 (offcampus storage)  Status 

Stacks  Request 
P51 .C18 NO.27  Available 
Science Library (Li and Ma)  Status 

Stacks  
P51 .C18 NO.27  Unknown 
 Knuth, Donald Ervin, 1938
 Bedford, Mass. : Digital Press, c1979.
 Description
 Book — 362 p. in various pagings : ill. ; 21 cm.
 Online
SAL3 (offcampus storage), Science Library (Li and Ma)
SAL3 (offcampus storage)  Status 

Stacks  Request 
Z253.3 .K57  Available 
Science Library (Li and Ma)  Status 

Stacks  
Z253.3 .K57  Unknown 
7. TEX : the program [1986]
 Knuth, Donald Ervin, 1938
 Reading, Mass. : AddisonWesley Pub. Co., c1986.
 Description
 Book — xv, 594 p. : ill. ; 25 cm.
 Online
SAL3 (offcampus storage), Science Library (Li and Ma)
SAL3 (offcampus storage)  Status 

Stacks  Request 
Z253.4 .T47 K578 1986  Available 
Science Library (Li and Ma)  Status 

Stacks  
Z253.4 .T47 K578 1986  Unknown 
8. The TeXbook [1986]
 Knuth, Donald Ervin, 1938
 Reading, Mass. : AddisonWesley, c1986.
 Description
 Book — ix, 483 p. : ill. ; 24 cm.
 Summary

Here is the definitive guide to the use of TeX, written by the system's creator, Donald E. Knuth. TeX represents the state of the art in computer typesetting. It is particularly valuable where the document, article, or book to be produced contains a lot of mathematics, and where the user is concerned about typographic quality. TeX software offers both writers and publishers the opportunity to produce technical text of all kinds, in an attractive form, with the speed and efficiency of a computer system. Novice and expert users alike will gain from The TeXbook the level of information they seek. Knuth warns newcomers away from the more difficult areas, while he entices experienced users with new challenges. The novice need not learn much about TeX to prepare a simple manuscript with it. But for the preparation of more complex documents, The TeXbook contains all the detail required. Knuth's familiar wit, and illustrations specially drawn by Duane Bibby, add a light touch to an unusually readable software manual. The TeXbook is the first in a fivevolume series on Computers and Typesetting, all authored by Knuth. 0201134489B04262002.
(source: Nielsen Book Data)
 Online
Media & Microtext Center, SAL3 (offcampus storage), Science Library (Li and Ma)
Media & Microtext Center  Status 

Find it Ask at Media Microtext desk  Request 
ZMS 58 TEXT  Unknown 
SAL3 (offcampus storage)  Status 

Stacks  Request 
Z253.4 .T47 K58 1986  Available 
Z253.4 .T47 K58 1986  Available 
Science Library (Li and Ma)  Status 

Stacks  
Z253.4 .T47 K58 1986  Unknown 
9. The TeXbook [1984]
 Knuth, Donald Ervin, 1938
 Reading, MA : AddisonWesley Pub. Co., c1984.
 Description
 Book — ix, 483 p. : ill. ; 24 cm.
 Summary

Here is the definitive guide to the use of TeX, written by the system's creator, Donald E. Knuth. TeX represents the state of the art in computer typesetting. It is particularly valuable where the document, article, or book to be produced contains a lot of mathematics, and where the user is concerned about typographic quality. TeX software offers both writers and publishers the opportunity to produce technical text of all kinds, in an attractive form, with the speed and efficiency of a computer system. Novice and expert users alike will gain from The TeXbook the level of information they seek. Knuth warns newcomers away from the more difficult areas, while he entices experienced users with new challenges. The novice need not learn much about TeX to prepare a simple manuscript with it. But for the preparation of more complex documents, The TeXbook contains all the detail required. Knuth's familiar wit, and illustrations specially drawn by Duane Bibby, add a light touch to an unusually readable software manual. The TeXbook is the first in a fivevolume series on Computers and Typesetting, all authored by Knuth. 0201134489B04262002.
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage), Science Library (Li and Ma)
SAL3 (offcampus storage)  Status 

Stacks  Request 
Z253.4 .T47 K58 1984  Available 
Z253.4 .T47 K58 1984  Available 
Z253.4 .T47 K58 1984  Available 
Science Library (Li and Ma)  Status 

Stacks  
Z253.4 .T47 K58 1984  Unknown 
Z253.4 .T47 K58 1984  Unknown 
Z253.4 .T47 K58 1984  Unknown 