This is the open source alternative to the notes used by Professor Bertille and Professor Joos for the course of Discrete Structures 1 at University of Heidelberg. I came up with the idea of making my ...

This course introduces mathematical tools required in the study of computer science. Topics include: (1) Logic and proof techniques: propositions, conditionals, quantifications. (2) Relations and ...

Discrete structures are omnipresent in mathematics, computer science, statistical physics, optimisation and models of natural phenomena. For instance, complex random graphs serve as a model for social ...

Abstract: A significant area of contemporary mathematics is Discrete Mathematics, which is the field of mathematics that examines the structure of discrete quantities and their interactions. The study ...

Combinatorics and discrete mathematics form a vibrant and expansive branch of modern mathematics, dedicated to the study of finite or countable structures and the methods used to count, classify, and ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

This workshop studies the relationship between local, or small-scale, and global, or large-scale, properties of t.d.l.c. groups, which is more subtle than for Lie groups. Small-scale structure, which ...

The School of Computer Science is committed to ensuring that our students are provided with a high standard of teaching excellence. Part of this commitment is the distribution of Teaching Assistant ...