BIBLIOGRAPHY896
[15] Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe T. Vardi.Rea-
soning About Knowledge. MIT Press, 1995. 19
[16] William Feller. An Introduction to Probability Theory and Its Applications.
Vol. I. John Wiley & Sons Inc., New York, third edition, 1968. MR0228020.
690
[17] Philippe Flajolet and Robert Sedgewick.Analytic Combinatorics. Cambridge
Univ. Press, 2009. 502, 646
[18] Michael Garey and David Johnson.tba. tba, 1970. 61
[19] A. Gelfond. Sur le septieme probleme de hilbert. Bulletin de l’Academie des ́
Sciences de l’URSS, 4:623–634, 1934. 19
[20] Judith L. Gersting.Mathematical Structures for Computer Science: A Mod-
ern Treatement of Discrete Mathematics. W. H. Freeman and Company, fifth
edition, 2003.
[21] Edgar G. Goodaire and Michael M. Parmenter. Discrete Mathematics with
Graph Theory. Prentice Hall, second edition, 2001. 433
[22] Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Math-
ematics: A Foundation for Computer Science. Addison-Wesley, second edi-
tion, 1994. 502, 646
[23] Charles M. Grinstead and J. Laurie Snell.Introduction to Probability. Amer-
ican Mathematical Society, second revised edition, 1997. 690
[24] Dan Gusfield and Robert W. Irving.The Stable Marriage Problem: Structure
and Algorithms. MIT Press, Cambridge, Massachusetts, 1989. 412, 433
[25] Gary Haggard, John Schlipf, and Sue Whitesides.Discrete Mathematics for
Computer Science. Brooks Cole, 2005.
[26] Nora Hartsfield and Gerhard Ringel.Pearls in Graph Theory: A Comprehen-
sive Introduction. Dover Publications, 2003. 433
[27] Gregory F. Lawler and Lester N. Coyle.Lectures on Contemporary Probabil-
ity. American Mathematical Society, 1999. 690
[28] Eric Lehman, Tom Leighton, and Albert R Meyer.Mathematics for Computer
Science. unpublished, 2015.