Email the Author
You can use this page to email Marie Brodsky, Alexander Golovnev, Alexander S. Kulikov, Vladimir Podolskii, and Alexander Shen about Discrete Mathematics for Computer Science.
About the Book
The book supplements the Introduction to Discrete Mathematics for Computer Science specialization at Coursera and contains many interactive puzzles, automatically graded quizzes, and code snippets. They are intended to help you to discover important ideas in discrete mathematics on your own, and to show you corresponding applications of these ideas in computer science.
This book contains material corresponding to three courses in the associated specialization at Coursera: Mathematical Thinking in Computer Science, Combinatorics and Probability, and Number Theory and Cryptography. Future editions will cover the remaining two courses: Graph Theory and Delivery Problem.
This book was last updated on April 11, 2023. There are 374 problems and 191 code snippets in the book. Most of the problems come with solutions, and 165 of them are graded automatically (allowing you to get instant feedback). We’re constantly working on extending and improving the book. Please ask questions, report typos, and suggest improvements through this form.
See more on the book webpage.
About the Authors
Alexander Golovnev is an Assistant Professor at Georgetown University. Prior to this, he worked at Harvard University, Columbia University, and Yahoo Research. Alexander works and teaches mainly in the area of Theoretical Computer Science.
Alexander S. Kulikov is a senior research fellow at Steklov Mathematical Institute of the Russian Academy of Sciences, Saint Petersburg, Russia and a lecturer at the Department of Computer Science and Engineering at University of California, San Diego, USA. He also directs the Computer Science Center in Saint Petersburg that provides free advanced computer science courses complementing the standard university curricula. Alexander holds a Ph. D. from Steklov Mathematical Institute. His research interests include algorithms and complexity theory. He co-authored online courses "Data Structures and Algorithms" and "Introduction to Discrete Mathematics for Computer Science" that are available at Coursera and edX.
Vladimir V. Podolskii is a senior research fellow at Steklov Institute of Mathematics in Moscow and an associate professor at Computer Science Department of Higher School of Economics in Moscow. His scientific interests lie in the field of Computational Complexity and related fields of Computer Science and Mathematics.
Researcher, LIRMM CNRS and University of Montpellier, France, originally from Moscow (where I've studied in the Moscow State Lomonosov University, worked at Institure of Information Transmission Problems, taught in mathematical schools #91, #57, and Independent University of Moscow). Author of several textbooks in Russian and English for high school and undergraduate students. See https://www.lirmm.fr/~ashen or https://mccme.ru/shen