Bibliography for the Writing Projects

• [AlSp] Noga Alon and Joel H. Spencer, The Probabilistic Method, with an Appendix on Open Problems by Paul Erdos (Wiley, 1982)

• [ApHa] K. Appel and W. Haken, "The solution of the four-color-map problem," Scientific American 237,4 (1977) 108-121

• [Ap] Krzysztof R. Apt, From Logic Programming to Prolog (Prentice-Hall, 1997)

• [Ba2] Paul Bachmann, Analytische Zahlentheorie (Leipzig, 1900)

• [Ba1] Roland C. Backhouse, Program Construction and Verification (Prentice-Hall, 1986)

• [BaGo] Hans Bandemer and Siegfried Gottwald, Fuzzy Sets, Fuzzy Logic, Fuzzy Methods with Applications (Wiley, 1995)

• [BeCo] Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy, Winning Ways for Your Mathematical Plays, in two volumes (Academic Press, 1982)

• [Be] Albrecht Beutelspacher, Cryptology (Mathematical Association of America, 1994)

• [BiLl] Norman L. Biggs, E. Keith Lloyd, and Robin J. Wilson, Graph Theory 1736-1936 (Clarendon Press, 1976)

• [Bo1] Kenneth P. Bogart, Introductory Combinatorics, second edition (Harcourt Brace, 1990)

• [BoDo] Kenneth P. Bogart and Peter G. Doyle, "Nonsexist solution of the menage problem," The American Mathematical Monthly 93 (1986) 514-519

• [Bo2] Bela Bollobas, Random Graphs (Academic Press, 1985)

• [Bo3] Bela Bollobas, "Random graphs," in Bela Bollobas, ed., Probabilistic Combinatorics and Its Applications, Proceedings of Symposia in Applied Mathematics 44 (American Mathematical Society, 1991) 1-20

• [BoMu] John A. Bondy and U. S. R. Murty, Graph Theory with Application (American Elsevier, 1976)

• [Bo4] Carl B. Boyer, A History of Mathematics, second edition (Wiley, 1991)

• [BrBr] Gilles Brassard and Paul Bratley, Algorithmics: Theory and Practice (Prentice-Hall, 1988)

• [BrBr2] Gilles Brassard and Paul Bratley, Fundamentals of Algorithms (Prentice-Hall, 1995)

• [Br1] J. Glenn Brookshear, Theory of Computation: Formal Languages, Automata, and Complexity (Prentice-Hall, 1988)

• [Br2] Richard A. Brualdi, Introductory Combinatorics, third edition (Prentice-Hall, 1999)

• [Ca1] Lewis Carroll, Lewis Carroll's Symbolic Logic (Crown, 1977)

• [Ca2] Lewis Carroll, Mathematical Recreations of Lewis Carroll (Dover, 1958)

• [Ca3] Lewis Carroll, Symbolic Logic and the Game of Logic (Dover, 1958)

• [ChLe] Gary Chartrand and Linda Lesniak, Graphs and Digraphs, third edition (Chapman and Hall, 1996)

• [ChOe] Gary Chartrand and Ortrud R. Oellermann, Applied and Algorithmic Graph Theory (McGraw-Hill, 1993)

• [Ch] Paul M. Chirlian, Analysis and Design of Integrated Electronic Circuits, second edition (Wiley, 1987)

• [Co] Daniel I. A. Cohen, Introduction to Computer Theory, second edition (Wiley, 1996)

• [CoLe] Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms (MIT Press/McGraw-Hill, 1990)

• [Da1] C. J. Date, An Introduction to Database Systems (Addison-Wesley, 1990)

• [Da2] Karl David, "Rencontres reencountered," The College Mathematics Journal 19 (1988) 139-148

• [DaHe] Philip J. Davis and Reuben Hersh, The Mathematical Experience (Birkhauser, 1995; paperback, 1999)

• [De1] Dorothy Elizabeth Robling Denning, Cryptography and Data Security (Addison-Wesley, 1982)

• [DeDe] Peter J. Denning, Jack B. Dennis, and Joseph E. Qualitz, Machines, Languages, and Computation (Prentice-Hall, 1978)

• [De2] A. K. Dewdney, The New Turing Omnibus: 66 Excursions in Computer Science (Freeman, 1993)

• [Di] Edsger W. Dijkstra, A Discipline of Programming (Prentice-Hall, 1976)

• [DuPr] Didier Dubois, Henri Prade, and Ronald R. Yager, eds., Fuzzy Information Engineering: A Guided Tour of Applications (Wiley, 1997)

• [Du] David A. Duffy, Principles of Automated Theorem Proving (Wiley, 1991)

• [EaTa] P. Eades and R. Tamassia, Algorithms for Drawing Graphs: An Annotated Bibliography, Technical Report CS-89-09 (Department of Computer Science, Brown University, Providence, RI, 1989)

• [Ev1] Shimon Even, Algorithmic Combinatorics (Macmillan, 1973)

• [Ev2] Shimon Even, Graph Algorithms (Computer Science Press, 1979)

• [Ev3] Howard Eves, An Introduction to the History of Mathematics, sixth edition (Saunders, 1990)

• [Fr] Roger L. Freeman, ed., Reference Manual for Telecommunications Engineering (Wiley, 1994; see also yearly updates)

• [FrFr] Rudolf Fritsch, Gerda Fritsch, and J. Peschke (Translator), The Four-Color Theorem : History, Topological Foundations, and Idea of Proof (Springer-Verlag, 1998)

• [Ga1] Martin Gardner, Logic Machines and Diagrams (McGraw-Hill, 1958)

• [Ga2] Martin Gardner, Wheels, Life and Other Mathematical Amusements (Freeman, 1983)

• [GaJo] Michael R. Garey and David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979)

• [GaSp] Simson Garfinkel and Gene Spafford, Practical UNIX and Internet Security, second edition (O'Reilly & Associates, 1996)

• [Gi] Alan M. Gibbons, Efficient Parallel Algorithms (Cambridge University Press, 1988)

• [Go1] Solomon W. Golomb, Polyominoes: Puzzles, Patterns, Problems, and Packings, second edition (Princeton University Press, 1994; paperback, 1996)

• [GoBa] Gaston Gonnet and Ricardo Baeza-Yates, editors, Handbook of Algorithms and Data Structures in Pascal and C, (Addison-Wesley, 1991)

• [Go2] Ronald J. Gould, "Updating the Hamiltonian problem -- a survey," Journal of Graph Theory 15 (1991) 121-151

• [GrHe] Ronald L. Graham and Pavol Hell, "On the history of the minimum spanning tree problem," Annals of the History of Computing 7 (1985) 43-57

• [GrKn] Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete Mathematics: A Foundation for Computer Science, second edition (Addison-Wesley, 1994)

• [GrRo] Ronald L. Graham, Bruce L. Rothschild, and Joel H. Spencer, Ramsey Theory, second edition (Wiley, 1990)

• [Gr1] George Gratzer, Lattice Theory: First Concepts and Distributive Lattices (Freeman, 1971)

• [GrHa] G. R. H. Greaves, G. Harman, and M. N. Huxley, Sieve Methods, Exponential Sums, and Their Applications in Number Theory, Proceedings of the symposium held in Cardiff, July 17-21, 1995 (Cambridge University Press, 1997)

• [GrYe] Jonathan Gross and Jay Yellen, Graph Theory and Its Applications (CRC Press, 1999)

• [Gr2] Jerrold W. Grossman, Discrete Mathematics: An Introduction to Concepts, Methods, and Applications (Macmillan/Prentice-Hall, 1990)

• [GrZe] Jerrold W. Grossman and R. Suzanne Zeitman, "An inherently iterative computation of Ackermann's function," Theoretical Computer Science 57 (1988) 327-330

• [GrSh] Branko Grunbaum and G. C. Shephard, Tilings and Patterns (Freeman, 1987)

• [Gu] Richard K. Guy, Unsolved Problems in Number Theory, second edition (Springer-Verlag, 1994)

• [HaRi] H. Halberstam and H.-E. Richert, Sieve Methods (Academic Press, 1974)

• [Ha1] Paul R. Halmos, Naive Set Theory (Springer-Verlag, 1974)

• [HaMa] Frank Harary and John S. Maybee, eds., Graphs and Applications: Proceedings of the First Colorado Symposium on Graph Theory (Wiley, 1985)

• [Ha2] David Harel, Algorithmics: The Spirit of Computing, second edition (Addison-Wesley, 1992)

• [HiPe1] Frederick J. Hill and Gerald R. Peterson, Computer Aided Logical Design with Emphasis on VLSI, fourth edition (Wiley, 1993)

• [HiPe2] Peter Hilton and Jean Pedersen, "Catalan numbers, their generalization, and their uses," The Mathematical Intelligencer 13,2 (1991) 64-75

• [Ho1] C. A. R. Hoare, "An axiomatic basis for computer programming," Communications of the Association for Computing Machinery 12 (1969) 576-580, 583

• [Ho2] John Hogger, Essentials of Logic Programming (Oxford University Press, 1990)

• [Ho3] Gerard J. Holzmann, Design and Validation of Computer Protocols (Prentice-Hall, 1990)

• [HoUl] John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, 1979)

• [Ka] Abraham Kandel, Fuzzy Mathematical Techniques with Applications (Addison-Wesley, 1986)

• [Kn] Donald E. Knuth, The Art of Computer Programming, volumes I (third edition, 1997), II (third edition, 1997), III (second edition, 1998), (Addison-Wesley)

• [KoSc] Johannes Kobler, Uwe Schoning, and Jacobo Toran, The Graph Isomorphism Problem: Its Structural Complexity (Birkhauser, 1993)

• [Ko1] Zvi Kohavi, Switching and Finite Automata Theory, second edition (McGraw-Hill, 1986)

• [Ko2] Israel Koren, Computer Arithmetic Algorithms (Prentice-Hall, 1993)

• [Ko3] Bart Kosko, Fuzzy Thinking: The New Science of Fuzzy Logic (Hyperion, 1993)

• [Kr] Robert L. Kruse, Data Structures and Program Design, second edition (Prentice-Hall, 1996)

• [La1] Jeffrey Lagarias, "Pseudorandom number generators," in Carl Pomerance, ed., Cryptology and Computational Number Theory, Proceedings of Symposia in Applied Mathematics 42 (American Mathematical Society, 1990) 115-143

• [La2] Clement W. H. Lam, "How reliable is a computer-based proof?" The Mathematical Intelligencer 12,1 (1990) 8-12

• [La3] Eugene L. Lawler et al., eds., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, 1985)

• [Le1] D. H. Lehmer, "The machine tools of combinatorics," in E. F. Beckenbach, ed., Applied Combinatorial Mathematics (Wiley, 1964)

• [Le2] F. Thomson Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kaufman, 1992)

• [Le3] Arjen K. Lenstra, "Primality testing," in Carl Pomerance, ed., Cryptology and Computational Number Theory, Proceedings of Symposia in Applied Mathematics 42 (American Mathematical Society, 1990) 13-26

• [LePa] Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation, second edition (Prentice-Hall, 1997)

• [Ma1] David Maier, The Theory of Relational Databases (Computer Science Press, 1983)

• [Ma2] Udi Manber, Introduction to Algorithms (Addison-Wesley, 1989)

• [Ma3] Eli Maor, e: The Story of a Number (Princeton University Press, 1994; paperback 1998)

• [Ma4] Eli Maor, To Infinity and Beyond (Birkhauser, 1987; Princeton University Press, 1991)

• [Ma5] Thomas Maufer, Deploying IP Multicast in the Enterprise (Prentice-Hall, 1998)

• [Mc] James A. McHugh, Algorithmic Graph Theory (Prentice-Hall, 1990)

• [McCh] L. E. McMahon, L. L. Cherry, and R. Morris, "Statistical text processing," Bell System Technical Journal 57 (1978) 2137-2154

• [McFr] Daniel McNeill and Paul Freiberger, Fuzzy Logic: The Revolutionary Computer Technology That Is Changing Our World (Simon and Schuster, 1993; Touchstone, 1994)

• [MeOo] Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone, Handbook of Applied Cryptography (CRC Press, 1996)

• [Me] W. Meyer, "Huffman codes and data compression," UMAP Journal 5 (1984) 278-296

• [MiRo] John G. Michaels and Kenneth H. Rosen, Applications of Discrete Mathematics (McGraw-Hill, 1991)

• [Mi] J. Mitchem, "On the history and solution of the four-color map problem," Two-Year College Mathematics Journal 12 (1981) 108-112

• [Mo] Joseph J. Moder, Cecil R. Phillips, and Edward W. Davis, Project Management with CPM, PERT, and Precedence Diagramming, third edition (Blitz, 1995)

• [Ne] James R. Newman, The World of Mathematics, in four volumes (Simon and Schuster, 1956)

• [Ni] Ivan Niven, Irrational Numbers (Wiley, 1956)

• [Pa] Edgar M. Palmer, Graphical Evolution (Wiley, 1985)

• [PeWi] Marko Petkovsek, Herbert S. Wilf, and Doron Zeilberger, A = B (A. K. Peters, 1996)

• [Pf] Charles P. Pfleeger, Security in Computing, second edition (Prentice-Hall, 1996)

• [Po] Carl Pomerance, "Factoring," in Carl Pomerance, ed., Cryptology and Computational Number Theory, Proceedings of Symposia in Applied Mathematics 42 (American Mathematical Society, 1990) 27-47

• [PrDu] Kendall Preston, Jr., and Michael J. B. Duff, Modern Cellular Automata: Theory and Applications (Plenum Press, 1984)

• [Ra] Anthony Ralston, "De Bruijn sequences -- a model example of the intersection of discrete mathematics and computer science," Mathematics Magazine 55 (1982) 131-143

• [ReNi] Edward M. Reingold, Jurg Nievergelt, and Narsingh Deo, Combinatorial Algorithms: Theory and Practice (Prentice-Hall, 1977)

• [Ri1] Paulo Ribenboim, The New Book of Prime Number Records (Springer-Verlag, 1996)

• [Ri2] John Riordan, Combinatorial Identities (Wiley, 1968)

• [Ro1] Fred S. Roberts, Applied Combinatorics (Prentice-Hall, 1984)

• [Ro2] Fred S. Roberts, Discrete Mathematical Models, with Applications to Social, Biological, and Environmental Problems (Prentice-Hall, 1976)

• [Ro4] Fred S. Roberts, Graph Theory and Its Applications to Problems of Society (S.I.A.M., 1978)

• [Ro3] Kenneth H. Rosen, Number Theory and Its Applications, third edition (Addison-Wesley, 1993)

• [Ru] Rudy Rucker, Infinity and the Mind (Birkhauser, 1982; Princeton University Press, 1995)

• [Ru2] Walter Rudin, Principles of Mathematical Analysis, third edition (McGraw-Hill, 1976)

• [SaKa] Thomas L. Saaty and Paul C. Kainen, The Four-Color Problem: Assaults and Conquest (McGraw-Hill, 1977; Dover, 1986)

• [Sa] Patrick Saint-Dizier, An Introduction to Programming in Prolog (Springer-Verlag, 1990)

• [Sa2] John E. Savage, Models of Computation: Exploring the Power of Computing (Addison-Wesley, 1998)

• [Si] Michael Sipser, An Introduction to the Theory of Computation (PWS, 1997)

• [Sk] Steven Skiena, Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica (Addison-Wesley, 1990)

• [Sl] N. J. A. Sloane and Simon Plouffe, Encyclopedia of Integer Sequences (Academic Press, 1995)

• [Sm] Jeffrey D. Smith, Design and Analysis of Algorithms (PWS-Kent, 1989)

• [So] Thomas Sowell, Fuzzy Logic for "Just Plain Folks" (Tesco, 1998)

• [St] Thomas A. Standish, Data Structures, Algorithms, and Software Principles (Addison-Wesley, 1994)

• [St2] Douglas R. Stinson, Cryptography: Theory and Practice (CRC Press, 1995)

• [Sw] Edward R. Swart, "The philosophical implications of the four-color problem," The American Mathematical Monthly 87 (1980) 697-707

• [Ta] R. Gregory Taylor, Models of Computation and Formal Languages (Oxford University Press, 1998)

• [Ti] G. Tinhofer, "Generating graphs uniformly at random," in G. Tinhofer et al., eds., Computational Graph Theory, Computing Supplementum (Springer-Verlag, 1990) 235-255

• [Tu1] Alan Tucker, Applied Combinatorics, third edition (Wiley, 1995)

• [Tu2] Alan M. Turing, "On computable numbers with an application to the Entscheidungsproblem," Proceedings of the London Mathematical Society 2 (1936) 230-265

• [Ty1] Thomas Tymoczko, "Computers, proofs and mathematics: a philosophical investigation of the four-color problem," Mathematics Magazine 53 (1980) 131-138

• [Ty2] Thomas Tymoczko, "The four-color problem and its philosophical significance," Journal of Philosophy 76 (1979) 57-83

• [Ty3] Thomas Tymoczko, ed., New Directions in the Philosophy of Mathematics : An Anthology (Princeton University Press, 1998)

• [We] Douglas B. West, Introduction to Graph Theory (Prentice-Hall, 1996)

• [WhCl] J. R. C. White and M. J. Clugston, "The enumeration of isomers -- with special reference to the stereoisomers of Decane," Journal of Chemical Education 70 (1993) 874-876

• [Wi1] Raymond Wilder, The Foundations of Mathematics, second edition (Wiley, 1965)

• [Wi2] Herbert Wilf, generatingfunctionology (Academic Press, 1990)

• [WoWi] D. R. Woodall and Robin J. Wilson, "The Appel-Haken proof of the four-color problem," in Lowell W. Beineke and Robin J. Wilson, eds., Selected Topics in Graph Theory (Academic Press, 1978) 83-101

• [Zi] H.-J. Zimmermann, Fuzzy Set Theory and Its Applications (Kluwer, 1991)