Computability, Complexity, Logic, Programming

• M. R. Garey and D. S. Johnson
  Computers and Intractability: A Guide to the Theory of NP-Completeness
  W. H. Freeman, 1979
• Christos H. Papadimitriou
  Computational Complexity
  Addison Wesley, 1st edition, 1993
• Michael Sipser
  Introduction to the Theory of Computation
  Course Technology, 2nd edition, 2005
• Heribert Vollmer
  Introduction to Circuit Complexity: A Uniform Approach
  Springer, 1st edition, 1999
• Ingo Wegener
  The Complexity of Boolean Functions
  John Wiley and Sons, 1991
• Ingo Wegener
  Branching Programs and Binary Decision Diagrams
  Society for Industrial and Applied Mathematics, 2000
• Eyal Kushilevitz and Noam Nisan
  Communication Complexity
  Cambridge University Press, Reissue edition, 2006
• Peter Burgisser, Michael Clausen, Mohammad A. Shokrollahi
  Algebraic Complexity Theory
  Springer, 1st edition, 1997
• Michael J. Kearns and Umesh V. Vazirani
  An Introduction to Computational Learning Theory
  The MIT Press, 1994
• Ming Li and Paul Vitanyi
  An Introduction to Kolmogorov Complexity and Its Applications
  Springer, 2nd edition, 1997
• Michael A. Nielsen and Isaac L. Chuang
  Quantum Computation and Quantum Information
  Cambridge University Press, 2000
• Phillip Kaye, Raymond Laflamme and Michele Mosca
  An Introduction to Quantum Computing
  Oxford University Press, 1st edition, 2007
• Jan Krajicek
  Bounded Arithmetic, Propositional Logic, And Complexity Theory
  Cambridge University Press, 1995
• Piergiorgio Odifreddi
  Classical Recursion Theory
  Elsevier, Reprint edition, 1992
• Joseph R. Shoenfield
  Mathematical Logic
  AK Peters, Ltd., 2Rev Ed edition, 2001
• Dirk van Dalen
  Logic and Structure
  Springer, 4th edition, 2008
• Neil D. Jones
  Computability and Complexity: From a Programming Perspective
  The MIT Press, 1997
• Harold Abelson, Gerald Jay Sussman
  Structure and Interpretation of Computer Programs
  The MIT Press, 2nd edition, 1996

Algorithm, Data Structure, Optimization

• Donald E. Knuth
  The Art of Computer Programming
  Addison-Wesley Professional
• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
  Introduction to Algorithms
  The MIT Press, 2nd edition, 2001
• Jon Kleinberg and Eva Tardos
  Algorithm Design
  Addison Wesley, United States Ed edition, 2005
• Juraj Hromkovic
  Algorithmics for Hard Problems
  Springer, 2nd edition, 2002
• Joseph Jaja
  An Introduction to Parallel Algorithms
  Addison-Wesley Professional, 1992
• Frank Thomson Leighton
  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
  Morgan Kaufmann Publishers, 1991
• Eric Bach, Jeffrey Shallit
  Algorithmic Number Theory, Vol. 1: Efficient Algorithms
  The MIT Press, 1996
• Jon Lee
  A First Course in Combinatorial Optimization
  Cambridge University Press, 2004
• Christos H. Papadimitriou and Kenneth Steiglitz
  Combinatorial Optimization: Algorithms and Complexity
  Dover Publications, Unabridged edition, 1998
• Martin Grotschel, Laszlo Lovasz, and Alexander Schrijver
  Geometric Algorithms and Combinatorial Optimization
  Springer, 2nd Crrctd edition, 1993
• Vasek Chvatal
  Linear Programming
  W. H. Freeman, 1983
• Alexander Schrijver
  Theory of Linear and Integer Programming
  John Wiley and Sons, New Ed edition, 1998
• James G. Oxley
  Matroid Theory
  Oxford University Press, USA, New Ed edition, 2006
• Mark de Berg, M. van Krefeld, M. Overmars, and O. Schwarzkopf
  Computational Geometry: Algorithms and Applications
  Springer, 2nd edition, 2000
• Michael Mitzenmacher and Eli Upfal
  Probability and Computing: Randomized Algorithms and Probabilistic Analysis
  Cambridge University Press, 2005
• Rajeev Motwani and Prabhakar Raghavan
  Randomized Algorithms
  Cambridge University Press, 1995
• G. Ausiello, P. Crescenzi, V. Kann, Giorgio Gambosi, Alberto Marchetti-Spaccamela, M.Protasi
  Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
  Springer, 1st edition, 2003
• Vijay V. Vazirani
  Approximation Algorithms
  Springer, 1st edition, 2004
• Allan Borodin and Ran El-Yaniv
  Online Computation and Competitive Analysis
  Cambridge University Press, 2005
• Peter Brucker
  Scheduling Algorithms
  Springer, 4th edition, 2006
• Tim Roughgarden
  Selfish Routing and the Price of Anarchy
  The MIT Press, 2005

Cryptography, Coding, Information Theory

• Oded Goldreich
  Foundations of Cryptography: Volume 1, 2
  Cambridge University Press
• J. H. van Lint
  Introduction to Coding Theory
  Springer, 3rd edition, 1998
• Ron Roth
  Introduction to Coding Theory
  Cambridge University Press, 2006
• F.J. MacWilliams and N.J.A. Sloane
  The Theory of Error-Correcting Codes
  North Holland, Student R.e. edition, 1983
• Thomas M. Cover and Joy A. Thomas
  Elements of Information Theory
  Wiley-Interscience, 2nd edition, 2006

Combinatorics, Graph, Probability

• Ronald L. Graham, Donald E. Knuth, and Oren Patashnik
  Concrete Mathematics: A Foundation for Computer Science
  Addison-Wesley Professional, 2nd edition, 1994
• Laszlo Lovasz
  Combinatorial Problems and Exercises
  American Mathematical Society, 2nd edition, 2007
• Jiri Matousek and Jaroslav Nesetril
  Invitation to Discrete Mathematics
  Oxford University Press, USA, 1998
• J. H. van Lint and R. M. Wilson
  Course in Combinatorics
  Cambridge University Press, 2nd edition, 2001
• Bela Bollobas
  Modern Graph Theory
  Springer, 1st edition, 2002
• Reinhard Diestel
  Graph Theory
  Springer, 3rd edition, 2006
• Morris H. DeGroot and Mark J. Schervish
  Probability and Statistics
  Addison Wesley, 3rd edition, 2001
• William Feller
  An Introduction to Probability Theory and Its Applications: Volume 1
  Wiley, 3rd edition, 1968
• Geoffrey R. Grimmett, David R. Stirzaker
  Probability and Random Processes
  Oxford University Press, USA, 3rd edition, 2001

Topics

Analytical

• Noga Alon and Joel H. Spencer
  The Probabilistic Method
  Wiley-Interscience, 3rd edition, 2008
• Bela Bollobas
  Random Graphs
  Cambridge University Press, 2nd edition, 2001
• Svante Janson, Andrzej Rucinski, Tomasz Luczak
  Random Graphs
  John Wiley and Sons, 1st edition, 2000
• Michael Molloy, Bruce Reed
  Graph Colouring and the Probabilistic Method
  Springer, 1st edition, 2001
• Terence Tao and Van H. Vu
  Additive Combinatorics
  Cambridge University Press, 1st edition, 2006
• G. H. Hardy, J. E. Littlewood, G. Polya
  Inequalities
  Cambridge University Press, 2nd edition, 2001
• J. Michael Steele
  The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities
  Cambridge University Press, 2004
• Audrey Terras
  Fourier Analysis on Finite Groups and Applications
  Cambridge University Press, 2005

Algebraic

• Laszlo Babai and Peter Frankl
  Linear Algebra Methods in Combinatorics with Applications to Geometry and Computer Science
  Preliminary Version 2, 1992
• Norman Biggs
  Algebraic Graph Theory
  Cambridge University Press, 2nd edition, 1994
• Chris Godsil and Gordon Royle
  Algebraic Graph Theory
  Springer, 1st edition, 2001
• Chris Godsil
  Algebraic Combinatorics
  Chapman and Hall/CRC, 1993
• Richard P. Stanley
  Enumerative Combinatorics: Volume 1, 2
  Cambridge University Press
• Rudolf Lidl and Harald Niederreiter
  Introduction to Finite Fields and Their Applications
  Cambridge University Press, 2nd edition, 2002

Geometric

• Peter Dembowski
  Finite Geometries
  Springer, 1st edition, 1997
• Lynn Margaret Batten
  Combinatorics of Finite Geometries
  Cambridge University Press, 2nd Edition, 1997
• Jiri Matousek
  Lectures on Discrete Geometry
  Springer, 1st edition, 2002
• Janos Pach and Pankaj K. Agarwal
  Combinatorial Geometry
  John Wiley and Sons, Inc., 1st edition, 1995
• Gunter M. Ziegler
  Lectures on Polytopes
  Springer, 1st edition, 1994
• Bojan Mohar and Carsten Thomassen
  Graphs on Surfaces
  The Johns Hopkins University Press, 2001

Other combinatorial

• Bela Bollobas
  Extremal Graph Theory
  Dover Publications, Dover Edition edition, 2004
• Stasys Jukna
  Extremal Combinatorics: With Applications in Computer Science
  Springer, 1st edition , 2001
• Wolfgang Ebeling and Friedrich Hirzebruch
  Lattices and Codes
  Friedrich Vieweg & Sohn Verlag, 2002
• G. Cohen, I. Honkala, S. Litsyn, A. Lobstein
  Covering Codes
  North Holland, 1997
• Thomas Beth, D. Jungnickel, and H. Lenz
  Design Theory
  Cambridge University Press, 2nd edition, 2000
• Douglas R. Stinson
  Combinatorial Designs: Construction and Analysis
  Springer, 1st edition, 2003
• Martin Aigner, Gunter M. Ziegler, and K.H. Hofmann
  Proofs from THE BOOK
  Springer, 3rd edition, 2003

Handbook

• Vera Pless, W. C. Huffman, and Richard A. Brualdi (Editor)
  Handbook of Coding Theory: Volume I, II
  North Holland, 1998
• Ronald L. Graham, Martin Grotschel, and Laszlo Lovasz (Editor)
  Handbook of Combinatorics: Volume I, II
  North Holland, 1995
• S. Rajasekaran, P.M. Pardalos, J.H. Reif, and J.D. Rolim (Editor)
  Handbook of Randomized Computing: Volumes I, II
  Springer, 1st edition, 2001
• Jan van Leeuwen (Editor)
  Handbook of Theoretical Computer Science: Vol. A, B
  The MIT Press, 1994

Copyright © 2007-2018 Suguru Tamaki. All Rights Reserved.