Last active
March 31, 2020 05:16
-
-
Save equwal/27c4e2be235f6ce9525b2fdefdb4ae8b to your computer and use it in GitHub Desktop.
A large number of bibliography entries from my experiences.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| @String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"} | |
| @String{pub-AW:adr = "Reading, MA, USA"} | |
| @xdata{els, | |
| journaltitle = "European Lisp Symposium", | |
| organization = "European Lisp Symposium", | |
| shortjournal = "ELS" | |
| } | |
| @xdata{els18, | |
| xdata = {els}, | |
| issuetitle = "11th European Lisp Symposium", | |
| booktitle = "11th European Lisp Symposium", | |
| date = {2018-04-16/2018-04-17}, | |
| editor = {Cooper, Dave}, | |
| isbn = {9782955747421}, | |
| venue = {Marbella, Spain} | |
| } | |
| @xdata{els19, | |
| xdata = {els}, | |
| issuetitle = "12th European Lisp Symposium", | |
| booktitle = "12th European Lisp Symposium", | |
| isbn = {9782955747438}, | |
| editor = "Neuss, Nicolas", | |
| date = {2019-04-01/2019-04-02}, | |
| venue = {Genova, Italy} | |
| } | |
| @xdata{iaeng, | |
| organization = {International Association of Engineers} | |
| } | |
| @xdata{pacmpl, | |
| organization = {[A]ssociation of [C]omputing [M]achinery}, | |
| journal = {Proceedings of the {ACM} on Programming Languages}, | |
| shortjournal = {PACMPL}, | |
| issn = {2475-1421} | |
| } | |
| @xdata{iaengcsonline, | |
| issn = {18199224}, | |
| xdata = {iaeng}, | |
| journal = {IAENG Journal of Computer Science}, | |
| shortjournal = {IJCS} | |
| } | |
| @xdata{leitaoname, | |
| author = {Leit\~ao, Ant\'onio Paulo Teles de Menezes Correia}, | |
| shortauthor = {Leit\~ao, Ant\'onio Menezes} | |
| } | |
| @inproceedings{heisig18, | |
| xdata = {els18}, | |
| author = {Marco Heisig}, | |
| title = {A {C}ommon {L}isp Library for Data Parallel Programming}, | |
| pages = {4--11}, | |
| pagetotal = 8 | |
| } | |
| @inproceedings{culpepper19, | |
| xdata = {els19}, | |
| author = {Culpepper, Ryan}, | |
| title = {Pattern-Based {S}-Expression Rewriting in {E}macs}, | |
| pages = {8--10}, | |
| pagetotal = {3} | |
| } | |
| @inproceedings{newton19, | |
| xdata = {els19}, | |
| author = {Newton, Jim E and Verna, Didier}, | |
| title = {Finite Automata Theory Based Optimization | |
| of Conditional Variable Binding}, | |
| pages = {26--33}, | |
| pagetotal = {7} | |
| } | |
| @inproceedings{letiao19, | |
| xdata = {els19}, | |
| xdata = {leitaoname}, | |
| title = {Plagiarism Detection for {L}isp}, | |
| pages = {46--53}, | |
| pagetotal = {8} | |
| } | |
| @inproceedings{durand19, | |
| xdata = {els19}, | |
| author = {Durand, Ir\`ene and Strandh, Robert}, | |
| title = {Bootstrapping {C}ommon {L}isp using {C}ommon {L}isp}, | |
| pages = {56--63}, | |
| pagetotal = {7} | |
| } | |
| @inproceedings{goldman19, | |
| xdata = {els19}, | |
| author = {Goldman, Robert P and Kuter, Ugur}, | |
| title = {Hierarchical Task Network Planning in {C}ommon {L}isp}, | |
| subtitle = {the case of {SHOP3}}, | |
| pages = {73--80}, | |
| pagetotal = {8} | |
| } | |
| @inproceedings{stalla19, | |
| xdata = {els19}, | |
| author = {Stalla, Alessio}, | |
| title = {Symbols as Namespaces in {C}ommon {L}isp}, | |
| pages = {84--88}, | |
| pagetotal = {5} | |
| } | |
| @inproceedings{verna19, | |
| author = {Didier Verna}, | |
| title = {Parallelizing Quickref}, | |
| booktitle = {booktitle}, | |
| pages = {89--96}, | |
| pagetotal = {8} | |
| } | |
| @inproceedings{heisig19, | |
| xdata = {els19}, | |
| author = {Heisig, Marco}, | |
| title = {Lazy, parallel multiple value reductions in {C}ommon {L}isp}, | |
| pagetotal = {6}, | |
| } | |
| @inproceedings{neuss19, | |
| xdata = {els19}, | |
| title = {Interactive flow simulation with {C}ommon {L}isp}, | |
| author = {Neuss, Nicolas}, | |
| pagetotal = {2}, | |
| pages = {78--79} | |
| } | |
| @inproceedings{hafner19, | |
| xdata = {els19}, | |
| author = {Hafner, Nicolas}, | |
| title = {{O}bject {O}riented {S}hader {C}omposition {U}sing {CLOS}}, | |
| pagetotal = {3}, | |
| pages = {80--83} | |
| } | |
| @article{verna06, | |
| xdata = {iaengcsonline}, | |
| author = {Verna, Didier}, | |
| title = {How to make {LISP} go faster than {C}}, | |
| year = 2006, | |
| volume = 32, | |
| number = 7, | |
| pagetotal = 6 | |
| } | |
| @inproceedings{rajesh19, | |
| xdata = {els19}, | |
| author = {Jayaprakash, Rajesh}, | |
| title = {{p}{L}isp: {A} {F}riendly {L}isp {IDE} for {B}eginners}, | |
| pages = {66--67}, | |
| pagetotal = 2 | |
| } | |
| @misc{amsterdam89, | |
| author = {Jonathan Amsterdam}, | |
| title = "The Iterate Manual and Paper", | |
| year = 1989, | |
| pagetotal = 43, | |
| } | |
| @article{amsterdam90, | |
| author = {Jonathan Amsterdam}, | |
| title = {Don't Loop, {I}terate}, | |
| journal = {MIT Artificial Intelligence Laboratory}, | |
| year = 1990, | |
| month = may, | |
| pagetotal = 8 | |
| } | |
| @book{barski11, | |
| author = {Conrad Barski}, | |
| title = {Land of Lisp}, | |
| subtitle = {Learn to Program in {L}isp, One Game at a Time\!}, | |
| publisher = {No Starch Press}, | |
| year = 2011, | |
| address = {Canada}, | |
| isbn = 9781593272814, | |
| note = {Contains the Periodic Table of the Loop Macro} | |
| } | |
| @article{stamour17, | |
| xdata = {pacmpl}, | |
| author = {{Vincent St-Amour} and | |
| Feltey, Daniel and | |
| Forence, Spencer P and | |
| You, Shu-Hung and | |
| Findler, Robert Bruce}, | |
| title = {{H}erbarium {R}acketensis}, | |
| subtitle = {A Stroll through the Woods (Functional Pearl)}, | |
| year = {2017}, | |
| volume = {1}, | |
| number = {1}, | |
| issue = {icfp}, | |
| pagetotal = {15}, | |
| doi = {10.1145/3110245}, | |
| month = {8}, | |
| note = {Lindenmayer systems in {R}acket} | |
| } | |
| @book{halloway09, | |
| author = {Halloway, Stuart}, | |
| title = {Programming Clojure}, | |
| publisher = {Pragmatic Bookshelf}, | |
| year = 2009, | |
| month = 05, | |
| isbn = 9781934356333 | |
| } | |
| @book{steele90, | |
| title = {{C}ommon {L}isp the Language}, | |
| author = {Steele, Guy L}, | |
| publisher = {Digital Press}, | |
| location = {Woburn, Massachusetts}, | |
| year = 1990, | |
| pagetotal = 1029, | |
| publisher = {Digital press}, | |
| isbn = 1555580416 | |
| } | |
| @book{lipovaca11, | |
| author = {Miran Lipova\vc}, | |
| title = {Learn You a {H}askell for Great Good\!}, | |
| publisher = {No Starch Press}, | |
| year = 2011, | |
| month = 04, | |
| pagetotal = 400, | |
| isbn = 9781593272838 | |
| } | |
| @phdthesis{leitao00, | |
| xdata = {leitaoname}, | |
| title = {Reengenharia de Programas}, | |
| school = {Universidade T\'ecnica de Lisboa | |
| Instituto Superior T\'ecnico}, | |
| year = 2000, | |
| month = 02, | |
| language = {Portuguese}, | |
| note = {Abstract translated into English inside} | |
| } | |
| @misc{leitao, | |
| xdata = {leitaoname}, | |
| title = {A Formal Pattern Language for Refactoring {L}isp Programs}, | |
| pagetotal = 7 | |
| } | |
| @book{drummond11, | |
| options = {usetranslator=true}, | |
| translator = {Chase, Drummond P[ercy]}, | |
| title = {The Nicomachean Ethics of Aristotle}, | |
| publisher = {Everyman'{s} Library}, | |
| year = {1911}, | |
| address = {London}, | |
| } | |
| @inproceedings{hornby06, | |
| author = {Hornby, Gregory S and | |
| Al Globus and | |
| Linden, Derek S and | |
| Lohn, Jason D}, | |
| title = {Automated Antenna Designwith Evolutionary Algorithms}, | |
| booktitle = {AIAA Space}, | |
| year = 2006, | |
| pagetotal = 8, | |
| pages = {19--21}, | |
| doi = {10.2514/6.2006-7242}, | |
| note = {Flight antennae for NASA's ST5 mission} | |
| } | |
| @online{raymond00, | |
| author = {Eric S. Raymond}, | |
| title = {{H}omesteading the {N}oosphere}, | |
| year = {2000}, | |
| version = {{3.0}}, | |
| url = {http://www.catb.org/~esr/writings/cathedral-bazaar/homesteading/}, | |
| urldate = {2020}, | |
| } | |
| @online{raymond02, | |
| author = {Raymond, Eric S}, | |
| title = {The {C}athedral and the {B}azaar}, | |
| year = {2000}, | |
| version = {{3.0}}, | |
| url = {http://www.catb.org/~esr/writings/cathedral-bazaar/cathedral-bazaar/}, | |
| urldate = {2020}, | |
| } | |
| @book{friedl06, | |
| abstract = {Regular expressions are an extremely powerful tool for manipulating text and data. They are now standard features in a wide range of languages and popular tools, including Perl, Python, Ruby, Java, VB.NET and C-Sharp (and any language using the .NET Framework), PHP, and MySQL. If you don't use regular expressions yet, you will discover in this book a whole new world of mastery over your data. If you already use them, you'll appreciate this book's unprecedented detail and breadth of coverage. If you think you know all you need to know about regular expressions, this book is a stunning eye-opener. As this book shows, a command of regular expressions is an invaluable skill. Regular expressions allow you to code complex and subtle text processing that you never imagined could be automated. Regular expressions can save you time and aggravation. They can be used to craft elegant solutions to a wide range of problems. Once you've mastered regular expressions, they'll become an invaluable part of your toolkit. You will wonder how you ever got by without them. Yet despite their wide availability, flexibility, and unparalleled power, regular expressions are frequently underutilized. Yet what is power in the hands of an expert can be fraught with peril for the unwary. Mastering Regular Expressions will help you navigate the minefield to becoming an expert and help you optimize your use of regular expressions. Mastering Regular Expressions, Third Edition, now includes a full chapter devoted to PHP and its powerful and expressive suite of regular expression functions, in addition to enhanced PHP coverage in the central "core" chapters. Furthermore, this edition has been updated throughout to reflect advances in other languages, including expanded in-depth coverage of Sun's java.util.regex package, which has emerged as the standard Java regex implementation.}, | |
| author = {Friedl, Jeffrey E F}, | |
| edition = {3rd}, | |
| isbn = {9780596528126}, | |
| publisher = {{O}'{R}eilly}, | |
| title = {Mastering Regular Expressions}, | |
| year = 2006 | |
| } | |
| @book{hoyte10, | |
| author = {Doug Hoyte}, | |
| title = {Let Over Lambda}, | |
| subtitle = {50 Years of {L}isp}, | |
| publisher = {Doug Hoyte}, | |
| year = 2010, | |
| isbn = 9781435712751 | |
| } | |
| @book{queinnec96, | |
| author = {Christian Queinnec}, | |
| title = {Lisp in Small Pieces}, | |
| publisher = {Ecole Polytechnique}, | |
| year = 1996, | |
| isbn = 9781139172974, | |
| address = {Paris} | |
| } | |
| @book{wall12, | |
| author = {Christiansen, Tom and | |
| {{b}rian {d} {f}oy} and | |
| Wall, Larry and | |
| Schwartz, Randall L and | |
| Orwant, Jon}, | |
| title = {Programming Perl}, | |
| shortitle = {The Camel Book}, | |
| subtitle = {Unmatched power for text processing and scripting}, | |
| publisher = {O'Reilly Media}, | |
| year = 2012, | |
| edition = {Fourth}, | |
| month = 03, | |
| pagetotal = 1176, | |
| isbn = 9780596004927, | |
| } | |
| @book{graham95, | |
| author = {Paul Graham}, | |
| title = {ANSI Common Lisp}, | |
| publisher = {Prentice Hall}, | |
| year = 1995, | |
| isbn = 0133708756, | |
| } | |
| @book{graham93, | |
| author = {Paul Graham}, | |
| title = {On Lisp}, | |
| publisher = {Prentice Hall}, | |
| year = 1993, | |
| isbn = 0130305529, | |
| } | |
| @book{kernighan88, | |
| author = {Kernighan, Brian and Ritchie, Dennis}, | |
| publisher = {Prentice Hall}, | |
| title = {The C Programming Language}, | |
| shorttitle = {The K\&R}, | |
| year = 1988, | |
| volume = {volume}, | |
| edition = {Second}, | |
| month = 04, | |
| isbn = 9780131101630, | |
| note = {note} | |
| } | |
| @misc{kaczynski95, | |
| author = "Theodore Kaczynski", | |
| year = 1995, | |
| title = "Industrial Society and Its Future", | |
| } | |
| @article{kahneman96, | |
| author = "Kahneman, Daniel and Tversky, Amos", | |
| year = 1996, | |
| title = "On the Reality of Cognitive Illusions", | |
| journal = "Psychological Review", | |
| volume = "103.3", | |
| pages = "582--591" | |
| } | |
| @article{kahneman06, | |
| year = 2006, | |
| month = jun, | |
| title = "Would You Be Happier If You Were Richer? A Focusing Illusion", | |
| journal = "Science", | |
| author = {Kahneman, Daniel and | |
| Krueger, Alan B and | |
| Schkade, David and | |
| Schwarz, Norbert and | |
| Stone, Arthur A}, | |
| volume = 312 | |
| } | |
| @book{kahneman11, | |
| author = "Kahneman, Daniel", | |
| year = 2011, | |
| title = "Thinking Fast and Slow", | |
| publisher = "Farrar, Straus and Giroux" | |
| } | |
| @book{norvig91, | |
| author = {Norvig, Peter}, | |
| title = {Paradigms of Artificial Intelligence Programming}, | |
| subtitle = {Case Studies in Common Lisp}, | |
| year = 1991, | |
| publisher = {Morgan Kaufmann}, | |
| edition = {First}, | |
| month = 10, | |
| isbn = 9781558601918 | |
| } | |
| @book{seibel12, | |
| author = {Peter Seibel}, | |
| title = {Practical Common Lisp}, | |
| publisher = {Apress}, | |
| year = 2012, | |
| volume = {volume}, | |
| series = {Expert's voice in Programming Languages}, | |
| edition = {First}, | |
| month = 06, | |
| isbn = 9781430242901 | |
| } | |
| @book{kiczales91, | |
| address = {Cambridge}, | |
| author = {Kiczales, Gregor and des Rivi\`eres, Jim and Bobrow, Daniel G.}, | |
| isbn = 9780262610742, | |
| keywords = {CLOS Lisp MOP MetaProgramming}, | |
| publisher = {The MIT Press}, | |
| title = {The Art of the Metaobject Protocol}, | |
| year = 1991 | |
| } | |
| @book{abelson96, | |
| author = {Abelson, Harold and Sussman, Gerald J. and Sussman, Julie}, | |
| day = 25, | |
| edition = {Second}, | |
| isbn = 0262011530, | |
| month = 6, | |
| publisher = {{MIT} Press}, | |
| title = {Structure and Interpretation of Computer Programs}, | |
| url = {http://mitpress.mit.edu/sicp/full-text/book/book.html}, | |
| year = 1996 | |
| } | |
| @book{daniel96, | |
| author = {Friedman, Daniel P. and Felleisen, Matthias}, | |
| isbn = 9780262560993, | |
| publisher = {MIT Press}, | |
| edition = {fourth}, | |
| title = {The Little Schemer}, | |
| year = 1996 | |
| } | |
| @manual{r7rssmall, | |
| editor = {Shinn, Alex and Cowan, John and Gleckler, Arthur A}, | |
| title = {Revised^7 Report on the Algorithmic Language Scheme}, | |
| date = {2013-06-06}, | |
| series = 7, | |
| pagetotal = 88 | |
| } | |
| @manual{r6rs, | |
| editor = {Sperber, Michael and | |
| Dybvig, Kent R and | |
| Flatt, Matthew and | |
| {Van Straaten}, Anton and | |
| Findler, Robert Bruce and | |
| Matthews, Jacob}, | |
| title = {Revised^6 Report on the Algorithmic Language Scheme}, | |
| date = {2007-09-26}, | |
| pagetotal = 90, | |
| series = 6, | |
| } | |
| @article{grin05, | |
| author = {Grin, {Franc\,cois}}, | |
| title = {L'enseignement des langues \'etrang\`eres comme politiue publique}, | |
| journal = {Haut Conseil de L'\'evaluation de L'\'ecole}, | |
| year = 2005, | |
| number = 19, | |
| month = 9 | |
| } | |
| @book{barendregt84, | |
| author = {Barendregt, [H]endrik [P]ieter}, | |
| title = {The lambda calculus}, | |
| subtitle = {Its syntax and semantics}, | |
| publisher = {North\nbhyphen Holland}, | |
| year = {1984}, | |
| edition = {Revised}, | |
| isbn = {9780444875082} | |
| } | |
| @book{saracino08, | |
| title = {Abstract Algebra}, | |
| author = {Dan Saracino}, | |
| edition = {Second}, | |
| publisher = {Weveland Press}, | |
| year = {2008}, | |
| pagecount = {313}, | |
| isbn = {9781577665366} | |
| } | |
| @book{schmidth86, | |
| title = {Denotational Semantics}, | |
| subtitle = {the {S}cott-{S}trachey approach to | |
| programming language theory}, | |
| author = {David A. Schmidt}, | |
| year = 1986, | |
| pagecount = 331, | |
| publisher = "Allyn and Bacon", | |
| location = "boston", | |
| isbn = 9780205089741 | |
| } | |
| @book{thomas20, | |
| title = {The Pragmatic Programmer}, | |
| subtitle = {from journeyman to master}, | |
| publisher = pub-AW, | |
| address = pub-AW:adr, | |
| author = {David Thomas and Andrew Hunt}, | |
| year = {2000}, | |
| isbn = {9780135956977}, | |
| notes = {20th anniversary edition} | |
| } | |
| @Book{knuth97, | |
| author = "Donald E. Knuth", | |
| title = "Fundamental Algorithms", | |
| volume = "1", | |
| publisher = pub-AW, | |
| address = pub-AW:adr, | |
| edition = "Third", | |
| pages = "xix + 650", | |
| year = "1997", | |
| ISBN = "0-201-89683-4", | |
| ISBN-13 = "978-0-201-89683-1", | |
| LCCN = "QA76.6 .K64 1997", | |
| bibdate = "Fri Jul 11 15:41:22 1997", | |
| bibsource = "http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; | |
| http://www.math.utah.edu/pub/tex/bib/fibquart.bib; | |
| http://www.math.utah.edu/pub/tex/bib/master.bib; | |
| http://www.math.utah.edu/pub/tex/bib/texbook2.bib", | |
| price = "US\$49.50", | |
| series = "The Art of Computer Programming", | |
| keywords = "computer algorithms; electronic digital computers -- | |
| programming", | |
| tableofcontents = "1: Basic Concepts / 1 \\ | |
| 1.1. Algorithms / 1 \\ | |
| 1.2. Mathematical Preliminaries / 10 \\ | |
| 1.2.1. Mathematical Induction / 11 \\ | |
| 1.2.2. Numbers, Powers, and Logarithms / 21 \\ | |
| 1.2.3. Sums and Products / 27 \\ | |
| 1.2.4. Integer Functions and Elementary Number Theory / | |
| 39 \\ | |
| 1.2.5. Permutations and Factorials / 45 \\ | |
| 1.2.6. Binomial Coefficients / 52 \\ | |
| 1.2.7. Harmonic Numbers / 75 \\ | |
| 1.2.8. Fibonacci Numbers / 79 \\ | |
| 1.2.9. Generating Functions / 87 \\ | |
| 1.2.10. Analysis of an Algorithm / 96 \\ | |
| * 1.2.11. Asymptotic Representations / 107 \\ | |
| *1.2.11.1. The $O$-notation / 107 \\ | |
| *1.2.11.2. Euler's summation formula / 111 \\ | |
| *1.2.11.3. Some asymptotic calculations / 116 \\ | |
| 1.3. MIX / 124 \\ | |
| 1.3.1. Description of MIX / 124 \\ | |
| 1.3.2. The MIX Assembly Language / 144 \\ | |
| 1.3.3. Applications to Permutations / 164 \\ | |
| 1.4. Some Fundamental Programming Techniques / 186 \\ | |
| 1.4.1. Subroutines / 186 \\ | |
| 1.4.2. Coroutines / 193 \\ | |
| 1.4.3. Interpretive Routines / 200 \\ | |
| 1.4.3.1. A MIX simulator / 202 \\ | |
| *1.4.3.2. Trace routines / 212 \\ | |
| 1.4.4. Input and Output / 215 \\ | |
| 1.4.5. History and Bibliography / 229 \\ | |
| 2: Information Structures / 232 \\ | |
| 2.1. Introduction / 232 \\ | |
| 2.2. Linear Lists / 238 \\ | |
| 2.2.1. Stacks, Queues, and Deques / 238 \\ | |
| 2.2.2. Sequential Allocation / 244 \\ | |
| 2.2.3. Linked Allocation / 254 \\ | |
| 2.2.4. Circular Lists / 273 \\ | |
| 2.2.5. Doubly Linked Lists / 280 \\ | |
| 2.2.6. Arrays and Orthogonal Lists / 298 \\ | |
| 2.3. Trees / 308 \\ | |
| 2.3.1. Traversing Binary Trees / 318 \\ | |
| 2.3.2. Binary Tree Representation of Trees / 334 \\ | |
| 2.3.3. Other Representations of Trees / 348 \\ | |
| 2.3.4. Basic Mathematical Properties of Trees / 362 \\ | |
| 2.3.4.1. Free trees / 363 \\ | |
| 2.3.4.2. Oriented trees / 372 \\ | |
| *2.3.4.3. The ``infinity lemma'' / 382 \\ | |
| *2.3.4.4. Enumeration of trees / 386 \\ | |
| 2.3.4.5. Path length / 399 \\ | |
| *2.3.4.6. History and bibliography / 406 \\ | |
| 2.3.5. Lists and Garbage Collection / 408 \\ | |
| 2.4. Multilinked Structures / 424 \\ | |
| 2.5. Dynamic Storage Allocation / 435 \\ | |
| 2.6. History and Bibliography / 457 \\ | |
| Answers to Exercises / 466 \\ | |
| Appendix A: Tables of Numerical Quantities / 619 \\ | |
| 1. Fundamental Constants (decimal) / 619 \\ | |
| 2. Fundamental Constants (octal) / 620 \\ | |
| 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci | |
| Numbers / 621 \\ | |
| Appendix B: Index to Notations / 623 \\ | |
| Appendix C: Index to Algorithms and Theorems / 628 \\ | |
| Index and Glossary / 630", | |
| } | |
| @Book{knuth98, | |
| author = "Donald E. Knuth", | |
| title = "Seminumerical Algorithms", | |
| volume = "2", | |
| publisher = pub-AW, | |
| address = pub-AW:adr, | |
| edition = "Third", | |
| pages = "xiii + 762", | |
| year = "1998", | |
| ISBN = "0-201-89684-2", | |
| ISBN-13 = "978-0-201-89684-8", | |
| LCCN = "QA76.6 .K64 1997", | |
| bibdate = "Fri Jul 11 15:41:22 1997", | |
| bibsource = "http://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib; | |
| http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg-2ed.bib; | |
| http://www.math.utah.edu/pub/tex/bib/benfords-law.bib; | |
| http://www.math.utah.edu/pub/tex/bib/css.bib; | |
| http://www.math.utah.edu/pub/tex/bib/fparith.bib; | |
| http://www.math.utah.edu/pub/tex/bib/master.bib; | |
| http://www.math.utah.edu/pub/tex/bib/prng.bib; | |
| http://www.math.utah.edu/pub/tex/bib/texbook2.bib", | |
| price = "US\$52.75", | |
| series = "The Art of Computer Programming", | |
| tableofcontents = "3: Random Numbers / 1 \\ | |
| 3.1. Introduction / 1 \\ | |
| 3.2. Generating Uniform Random Numbers / 10 \\ | |
| 3.2.1. The Linear Congruential Method / 10 \\ | |
| 3.2 1.1. Choice of modulus / 12 \\ | |
| 3.2.1.2 Choice of multiplier / 16 \\ | |
| 3.2.1.3. Potency / 23 \\ | |
| 3.2.2. Other Methods / 26 \\ | |
| 3.3. Statistical Tests / 41 \\ | |
| 3.3.1. General Test Procedures for Studying Random Data | |
| / 41 \\ | |
| 3.3.2. Empirical Tests / 61 \\ | |
| *3.3.3. Theoretical Tests / 80 \\ | |
| 3.3.4. The Spectral Test / 93 \\ | |
| 3.4. Other Types of Random Quantities / 119 \\ | |
| 3.4 1. Numerical Distributions / 119 \\ | |
| 3.4.2. Random Sampling and Shuffling / 142 \\ | |
| *3.5. What Is a Random Sequence? / 149 \\ | |
| 3.6. Summary / 184 \\ | |
| 4: Arithmetic / 194 \\ | |
| 4.1. Positional Number Systems / 195 \\ | |
| 4.2. Floating Point Arithmetic / 214 \\ | |
| 4.2.1. Single-Precision Calculations / 214 \\ | |
| 4.2 2. Accuracy of Floating Point Arithmetic / 229 \\ | |
| *4.2.3. Double-Precision Calculations / 246 \\ | |
| 4.2.4. Distribution of Floating Point Numbers / 253 \\ | |
| 4.3 Multiple Precision Arithmetic / 265 \\ | |
| 4.3.1. The Classical Algorithms / 265 \\ | |
| *4.3.2. Modular Arithmetic / 284 \\ | |
| *4.3.3. How Fast Can We Multiply? / 294 \\ | |
| 4.4. Radix Conversion / 319 \\ | |
| 4.5. Rational Arithmetic / 330 \\ | |
| 4.5.1. Fractions / 330 \\ | |
| 4.5.2. The Greatest Common Divisor / 333 \\ | |
| *4.5.3. Analysis of Euclid's Algorithm / 356 \\ | |
| 4.5.4. Factoring into Primes / 379 \\ | |
| 4.6. Polynomial Arithmetic / 418 \\ | |
| 4.6.1. Division of Polynomials / 420 \\ | |
| *4.6.2. Factorization of Polynomials / 439 \\ | |
| 4.6.3. Evaluation of Powers / 461 \\ | |
| 4.6.4. Evaluation of Polynomials / 485 \\ | |
| *4.7. Manipulation of Power Series / 525 \\ | |
| Answers to Exercises / 538 \\ | |
| Appendix A: Tables of Numerical Quantities / 726 \\ | |
| 1. Fundamental Constants (decimal) / 726 \\ | |
| 2; Fundamental Constants ( octal) / 727 \\ | |
| 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci | |
| Numbers / 728 \\ | |
| Appendix B: Index to Notations / 730 \\ | |
| Index and Glossary / 735", | |
| } | |
| @Book{knuth98, | |
| author = "Donald E. Knuth", | |
| title = "Sorting and Searching", | |
| volume = "3", | |
| publisher = pub-AW, | |
| address = pub-AW:adr, | |
| edition = "Second", | |
| pages = "xiv + 780", | |
| year = "1998", | |
| ISBN = "0-201-89685-0", | |
| ISBN-13 = "978-0-201-89685-5", | |
| LCCN = "QA76.6.K64 1997", | |
| bibdate = "Sat Feb 27 11:11:53 1999", | |
| bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib; | |
| http://www.math.utah.edu/pub/tex/bib/string-matching.bib; | |
| http://www.math.utah.edu/pub/tex/bib/texbook2.bib", | |
| price = "US\$49.95", | |
| series = "The Art of Computer Programming", | |
| tableofcontents = "5: Sorting / 1 \\ | |
| *5.1. Combinatorial Properties of Permutations / 11 \\ | |
| *5.1.1. Inversions / 11 \\ | |
| *5.1.2. Permutations of a Multiset / 22 \\ | |
| *5.1.3. Runs / 35 \\ | |
| *5.1.4 Tableaux and Involutions / 47 \\ | |
| 5.2. Internal sorting / 73 \\ | |
| 5.2 l. Sorting by Insertion / 80 \\ | |
| 5.2.2. Sorting by Exchanging / 105 \\ | |
| 5.2.3. Sorting by Selection / 138 \\ | |
| 5.2.4 Sorting by Merging / 158 \\ | |
| 5.2 5. Sorting by Distribution / 168 \\ | |
| 5.3. Optimum Sorting / 180 \\ | |
| 5.3 l. Minimum-Comparison Sorting / 180 \\ | |
| *5.3.2. Minimum-Comparison Merging / 197 \\ | |
| *5.3.3. Minimum-Comparison Selection / 207 \\ | |
| *5.3.4. Networks for Sorting / 219 \\ | |
| 5.4. External Sorting / 248 \\ | |
| 5.4.1. Multiway Merging and Replacement Selection / 252 | |
| \\ | |
| *5.4.2. The Polyphase Merge / 267 \\ | |
| *5.4.3 The Cascade Merge / 288 \\ | |
| *5.4.4. Reading Tape Backwards / 299 \\ | |
| *5.4.5. The Oscillating Sort / 311 \\ | |
| *5.4.6. Practical Considerations for Tape Merging / 317 | |
| \\ | |
| *5.4.7. External Radix Sorting / 343 \\ | |
| *5.4.8. Two-Tape Sorting / 348 \\ | |
| *5.4.9 Disks and Drums / 356 \\ | |
| 5.5. Summary, History, and Bibliography / 380 \\ | |
| 6: Searching / 392 \\ | |
| 6.1. Sequential Searching / 396 \\ | |
| 6.2. Searching by Comparison of Keys / 409 \\ | |
| 6.2.1. Searching an Ordered Table / 409 \\ | |
| 6.2.2 Binary Tree Searching / 426 \\ | |
| 6.2.3. Balanced Trees / 458 \\ | |
| 6.2.4. Multiway Trees / 481", | |
| } | |
| @Book{knuth05a, | |
| author = "Donald E. Knuth", | |
| title = "The Art of Computer Programming: Volume 1, Fascicle 1. | |
| {MMIX}, a {RISC} Computer for the New Millennium", | |
| publisher = pub-AW, | |
| address = pub-AW:adr, | |
| pages = "v + 134", | |
| year = "2005", | |
| ISBN = "0-201-85392-2", | |
| ISBN-13 = "978-0-201-85392-6", | |
| LCCN = "QA76.6 .K64 2005", | |
| MRclass = "68-02 (68M01 68N15)", | |
| MRnumber = "MR2245382 (2007f:68004a)", | |
| bibdate = "Tue Oct 11 05:24:35 MDT 2005", | |
| bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib; | |
| http://www.math.utah.edu/pub/tex/bib/texbook2.bib; | |
| z3950.loc.gov:7090/Voyager", | |
| subject = "Computer programming; Computer algorithms", | |
| tableofcontents = "1: Basic Concepts / 1 \\ | |
| 1.3'. MMIX / 2 \\ | |
| 1.3.1'. Description of MMIX / 2 \\ | |
| 1.3.2'. The MMIX Assembly Language / 28 \\ | |
| 1.3.3'. Applications to Permutations / 51 \\ | |
| 1.4'. Some Fundamental Programming Techniques / 52 \\ | |
| 1.4.1' Subroutines / 52 \\ | |
| 1.4.2' Coroutines / 66 \\ | |
| 1.4.3'. Interpretive Routines / 73 \\ | |
| Answers to Exercises / 94 \\ | |
| Index and Glossary / 127", | |
| } | |
| @Book{knuth05b, | |
| author = "Donald E. Knuth", | |
| title = "The Art of Computer Programming: Volume 4, Fascicle 3. | |
| Generating All Combinations and Partitions", | |
| publisher = pub-AW, | |
| address = pub-AW:adr, | |
| pages = "iv + 150", | |
| year = "2005", | |
| ISBN = "0-201-85394-9", | |
| ISBN-13 = "978-0-201-85394-0", | |
| LCCN = "QA76.6 .K64 2005", | |
| bibdate = "Tue Oct 11 05:24:35 MDT 2005", | |
| bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib; | |
| http://www.math.utah.edu/pub/tex/bib/string-matching.bib; | |
| http://www.math.utah.edu/pub/tex/bib/texbook2.bib; | |
| z3950.loc.gov:7090/Voyager", | |
| subject = "Computer programming; Computer algorithms", | |
| tableofcontents = "7: Combinatorial Searching / 0 \\ | |
| 7.2. Generating All Possibilities / 0 \\ | |
| 7.2.1. Generating Basic Combinatorial Patterns / 0 \\ | |
| 7.2.1.1. Generating all n-tuples / 0 \\ | |
| 7.2.1.2. Generating all permutations / 0 \\ | |
| 7.2.1.3. Generating all combinations / 1 \\ | |
| 7.2.1.4. Generating all partitions / 36 \\ | |
| 7.2.1.5. Generating all set partitions / 61 \\ | |
| Answers to Exercises / 87 \\ | |
| Index and Glossary / 144", | |
| } | |
| @book{knuth08, | |
| author = "Donald E. Knuth", | |
| title = "The Art of Computer Programming: Volume 4, Fascicle 0. | |
| Introduction to Combinatorial Algorithms and {Boolean} | |
| Functions", | |
| publisher = pub-AW, | |
| address = pub-AW:adr, | |
| pages = "ix + 216", | |
| year = "2008", | |
| ISBN = "0-321-53496-4", | |
| ISBN-13 = "978-0-321-53496-5", | |
| LCCN = "QA76.6 .K64 2005", | |
| bibdate = "Fri Jun 12 07:16:46 2009", | |
| bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib; | |
| http://www.math.utah.edu/pub/tex/bib/texbook2.bib", | |
| series = "The art of computer programming", | |
| tableofcontents = "7: Combinatorial Searching / 1 \\ | |
| 7.1. Zeros and Ones / 47 \\ | |
| 7.1.1. Boolean Basics / 47 \\ | |
| 7.1.2 Boolean Evaluation / 96 \\ | |
| Answers to Exercises / 134 \\ | |
| Index and Glossary / 201" | |
| } | |
| @book{knuth09, | |
| author = "Donald E. Knuth", | |
| title = "The Art of Computer Programming: Volume 4, Fascicle 1. | |
| {Bitwise} Tricks and Techniques. {Binary} Decision | |
| Diagrams", | |
| publisher = pub-AW, | |
| address = pub-AW:adr, | |
| pages = "vii + 260", | |
| year = "2009", | |
| ISBN = "0-321-58050-8", | |
| ISBN-13 = "978-0-321-58050-4", | |
| LCCN = "QA76.6 .K64 2009", | |
| bibdate = "Fri Jun 12 07:20:05 2009", | |
| bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib; | |
| http://www.math.utah.edu/pub/tex/bib/texbook2.bib", | |
| series = "The art of computer programming", | |
| tableofcontents = "7: Combinatorial Searching / 1 \\ | |
| 7 1. Zeros And Ones / 1 \\ | |
| 7.1.1. Boolean Basics / 1 \\ | |
| 7.1.2. Boolean Evaluation / 1 \\ | |
| 7.1.3. Bitwise Tricks and Techniques / 1 \\ | |
| 7.1.4. Binary Decision Diagrams / 70 \\ | |
| Answers to Exercises / 149 \\ | |
| Index and Glossary / 244", | |
| } | |
| @book{knuth11, | |
| author = "Donald E. Knuth", | |
| title = "The Art of Computer Programming: Volume 4, | |
| {Combinatorial} algorithms. {Part 1}", | |
| volume = "4A", | |
| publisher = pub-AW, | |
| address = pub-AW:adr, | |
| pages = "xv + 883", | |
| year = "2011", | |
| ISBN = "0-201-03804-8", | |
| ISBN-13 = "978-0-201-03804-0", | |
| LCCN = "QA76.6 2005", | |
| bibdate = "Fri Mar 4 17:53:38 MST 2011", | |
| bibsource = "http://www.math.utah.edu/pub/tex/bib/master.bib; | |
| http://www.math.utah.edu/pub/tex/bib/sigact.bib; | |
| z3950.gbv.de:20011/gvk", | |
| series = "The art of computer programming", | |
| remark = "Also issued from 2005 to 2010 in four fascicles prior | |
| to this complete edition.", | |
| tableofcontents = "7: Combinatorial Searching \\ | |
| 7.1. Zeros and Ones \\ | |
| 7.1.1. Boolean Baiscs \\ | |
| 7.1.2. Boolean Evaluation \\ | |
| 7.1.3. Bitwise Tricks and Techniques \\ | |
| 7.1.4. Binary Decision Diagrams \\ | |
| 7.2. Generating All Possibilities \\ | |
| 7.2.1. Generating Basic Cambinatorial Patterns \\ | |
| 7.2.1.1. Generating all n-Tuples \\ | |
| 7.2.1.2. Generating all Permutations \\ | |
| 7.2.1.3. Generating all Combinations \\ | |
| 7.2.1.4. Generating all Partitions \\ | |
| 7.2.1.5. Generating all Set Partitions \\ | |
| 7.2.1.6. Generating all Trees \\ | |
| 7.2.1.7. History and Further References \\ | |
| Answers to Exercises \\ | |
| Appendix A. Tables of Numerical Quantities \\ | |
| 1. Fundamental Constants (decimal) \\ | |
| 2. Fundamental Constants (hexadecimal) \\ | |
| 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci | |
| Numbers \\ | |
| Appendix B. Index to Notations \\ | |
| Appendix C. Index to Algorithms and Theorems \\ | |
| Appendix D. Index to Combinatorial Problems \\ | |
| Index and Glossary", | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment