This time, the Úmluva will happen virtually. On 2023-09-25, a list of courses will appear here, together with a voting form, where you can express your interest and time preferences. On 2023-09-29 09:00, we will tally the votes and schedule the classes. The time-space coordinates of classes will appear in the SIS.
Voting is over, you will find the scheduled lectures in SIS.
SIS code | Name | Lecturer / instructor | Scheduled | Note |
---|---|---|---|---|
NSWI181 |
Code optimization in production compilers 2
Optimalizace kódu produkčních překladačů 2 |
J. Hubička | SIS | |
Second part of lecture on compilers. We will discuss loop optimization, inter-procedural optimization and code generation. |
||||
NDMI060 |
Coloring of Graphs and Other Combinatorial Structures
Barevnost grafů a kombinatorických struktur |
Z. Dvořák | SIS | |
A systematic introduction to the graph coloring theory, including some of the recent developments.
|
||||
NDMI073 |
Combinatorics and Graph Theory III
Kombinatorika a grafy III |
Z. Dvořák / G. Aubian | SIS | |
An advanced course in graph theory and combinatorics. Includes topics from:
|
||||
NOPT060 |
Cooperative game theory seminar
Seminář z kooperativní teorie her |
M. Černý, D. Ryzák | SIS | |
Cílem semináře je dát dohromady studenty a vyučující, kteří mají zájem o kooperativní teorii her. Slouží především jako platforma pro vznik nových témat a formulaci zajímavých problémů, které následně diskutujeme a řešíme. Seminář je směřovaný tím, co jeho účastníky baví a zajímá. Chceme vybudovat kolektiv a propojit mezi sebou lidi, kteří mohou spolupracovat i nad rámec samotného semináře. Studenti si mohou také prostřednictvím semináře vyzkoušet, co obnáší výzkum v matematice, otestovat své schopnosti a na základě této zkušenosti na seminář i navázat prostřednictvím bakalářské/magisterské práce. |
||||
NDMI067 |
Flows, paths and cuts
Toky, cesty a řezy |
P. Kolman | SIS | |
Algorithms for different types of flows and cuts, as well as their interrelations, have proven to be invaluable tools for addressing a wide range of graph-related problems (e.g., graph drawing, VLSI design, routing in networks, to name a few). In this course, we will
|
||||
NTIN104 |
Foundations of Theoretical Cryptography
Foundations of Theoretical Cryptography |
P. Hubáček / P. Hubáček | SIS | |
NMAI065 |
Fundamentals of Category Theory for Computer Scientists
Základy teorie kategorií pro informatiky |
A. Pultr | SIS | |
NDMI037 |
Geometric Representations of Graphs 1
Geometrické reprezentace grafů 1 |
J. Kratochvíl | SIS | |
Special graph classes, in this course mainly defined as intersection graphs of geometrical objects in the plane, are intensively studied both for their applied motivation and interesting algorithmic properties. We will see interval graphs, chordal graphs, comparability graphs, and others, their structural characterizations, recognition algorithms as well as algorithms for basic optimization problems that run in polynomial time on graphs from these classes. |
||||
NDMI010 |
Graph algorithms
Grafové algoritmy |
M. Mareš | SIS | |
The lecture covers advanced algorithms for shortest paths, network flows, minimum spanning trees, and some other graph problems. Several graph data structures will be mentioned, too. Knowledge of Bachelor-level Algorithms and Data Structures 1+2 is assumed. |
||||
NMAI074 |
Infinite sets
Nekonečné množiny |
J. Kynčl | SIS | |
NOPT051 |
Interval Methods
Intervalové metody |
M. Hladík / M. Hladík | SIS | |
NTIN103 |
Introduction to Parameterized Algorithms
Úvod do parametrizované složitosti |
J. Fiala, M. Koutecký / Tung Anh Vu | SIS | |
Parameterized algorithmics analyzes the runtime in finer detail than classical complexity theory: instead of expressing the runtime as a function of the input size only, the dependence on a parameter of the input is taken into account. The aim is to isolate any fast growth of the runtime to a parameter, while the remaining growth of the time is kept low. Apart from giving a deeper theoretical understanding of the complexity of a problem, this can also lead to efficient (practical) algorithms if the parameter describes a property of the inputs, for which the parameter is typically small. See also video trailer. |
||||
NMAI072 |
Linear algebra 3
Lineární algebra 3 |
M. Hladík | SIS | |
NOPT021 |
Modern algorithmic game theory
Algoritmy moderní teorie her |
M. Schmid | SIS | |
NDMI118 |
Programming in ChatGPT
Programování v ChatGPT |
M. Černý, M. Lorenc, D. Sychrovský | SIS | |
Cílem semináře je otestovat možnosti a hranice práce s ChatGPT a do příštích let položit základy pro výuku "plnokrevné" přednášky na toto téma. Studenti mají příležitost se kromě osvojení tohoto nástroje aktivně podílet na obsahu semináře a směru, kterým se bude (především ve své druhé polovině) odvíjet. Z důvodu povahy předmětu je kapacita omezena. |
||||
NDMI055 |
Selected chapter in combinatorics
Vybrané kapitoly z kombinatoriky |
J. Hubička, J. Nešetřil | SIS | |
This year we will focus on Ramsey theory. There are no prerequirements for this course. |
||||
NTIN110 |
Selected Topics in Data Structures
Vybrané kapitoly z datových struktur |
M. Mareš, L. Ondráček | SIS | |
A series of lectures on advanced data structures, which extends Master-level Data structures 1 and 2. You can take this course repeatedly, we tackle different topics each year. |
||||
NPRG015
no voting |
Seminar for preparing students for contests in programming
Praktikum řešení programátorských úloh |
Z. Dvořák | SIS | Příprava na soutěže v programování. Koná se jednou za 14 dní. |
Training for programming competitions, especially International Collegiate Programming Contest (ICPC). Practice contests and tutorials on important techniques and problem types. Held once every two weeks for 3 hours. |
||||
NDMI052 |
Seminar on Combinatorial Problems
Problémový seminář z kombinatoriky |
P. Valtr, J. Kynčl | SIS | |
The students will collaborate on solving open combinatorial problems, which are easily formulated and do not require deep background knowledge. We attempt to choose problems of medium difficulty. |
||||
NDMI022 |
Seminar on Combinatorics
Kombinatorický seminář |
I. Penev, M. Tancer | SIS | |
Seminar on Combinatorics is a seminar for students interested in combinatorics. The assumed knowledge corresponds to the first year lectures (Discrete Mathematics and Combinatorics and Graphs I). Therefore, the seminar is especially suitable for students of the 2nd year of Bachelor's studies and older but interested students of the first year are also very welcome. Main contents of the seminar is that the students present papers on Combinatorics. This means that you will learn something new as well as you will train how to explain some ideas to other students. Seminar covers several subtopics in Combinatrics including (but not limited to): Combinatorial structures, graph theory, combinatorial geometry, probability, game theory, etc. Participants of the seminar are invited to the Spring school of Combinatorics. |
||||
NTIN102
no voting |
Seminar on theory of computing
Seminář z teoretické informatiky |
Koucký, Čepek, Hubáček, Kolman, Sgall | SIS | Already scheduled. |
Also known as the pizza seminar. Come enjoy a slice of pizza and a talk on current topics in theoretical computer science. |
||||
NMMB453
no voting |
Student logic seminar
Studentský logický seminář |
O. Ježil, M. Narusevych | SIS | Already scheduled. |
Imagine a true statement about finite objects, how can a formal proof of such a statement look? Can it be short? This semester's topic will be about basic propositional proof systems studied in proof complexity (namely Resolution, Frege system, and some algebraic and geometric systems). During the seminars, which will be as interactive as possible, we will work on various exercises which will guide us through the feel of proving something in those proof systems. We will also focus on studying classic lower bounds for those systems. In the later parts of the semester, the students will be free to pick a topic to present, but active participation will be enough to obtain the credit (zápočet). No prior knowledge is assumed, everything is to be explained on the seminar. |