Mathematics for Computer Science

“mcs” — 2017/3/3 — 11:21 — page 963 — #971
963
Bibliography
[1] Martin Aigner and Günter M. Proofs from The Book. Springer-Verlag, 1999.
MR1723092. 4, 19
[2] Eric Bach and Jeffrey Shallit. Efficient Algorithms, volume 1 of Algorithmic
Number Theory. The MIT Press, 1996. 329
[3] John Beam. A powerful method of proof. College Mathematics Journal,
48(1), 2017. 83
[4] Edward A. Bender and S. Gill Williamson. A Short Course in Discrete Mathematics.
Dover Publications, 2005.
[5] Arthur T. Benjamin and Jennifer J. Quinn. Proofs That Really Count: The Art
of Combinatorial Proof. The Mathematical Association of America, 2003.
637
[6] P. J. Bickel1, E. A. Hammel1, and J. W. O’Connell1. Sex bias in graduate
admissions: Data from berkeley. Science, 187(4175):398–404, 1975. 762
[7] Norman L. Biggs. Discrete Mathematics. Oxford University Press, second
edition, 2002.
[8] Béla Bollobás. Modern Graph Theory, volume 184 of Graduate Texts in
Mathematics. Springer-Verlag, 1998. MR1633290. 478
[9] Miklós Bóna. Introduction to Enumerative Combinatorics. Walter Rudin
Student Series in Advanced Mathematics. McGraw Hill Higher Education,
2007. MR2359513. 694
[10] Timothy Y. Chow. The surprise examination or unexpected hanging paradox.
American Mathematical Monthly, pages 41–51, 1998.
[11] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford
Stein. Introduction to Algorithms. The MIT Press, third edition, 2009.
[12] Antonella Cupillari. The Nuts and Bolts of Proofs. Academic Press, fourth
edition, 2012. MR1818534. 4, 19
[13] Reinhard Diestel. Graph Theory. Springer-Verlag, second edition, 2000. 478
[14] Michael Paterson et al. Maximum overhang. MAA Monthly, 116:763–787,
2009. 564