Seminar on Discrete Algorithms

Interested in constraints & optimization, data compression, or sequence analysis? There is room in a seminar focusing on these topics: (see Materials section for topics / literarature).

Topics to choose from include Local search for bit-precise reasoning, Computational mathematics: determining Schur Number Five using SAT solvers, Verification of deep neural networks (reserved), Constraint acquisition, The stable matching problem with couples, Software model synthesis / learning finite-state automata, Knowledge compilation: sentential decision diagrams, Model counting, Constraint integer programming, The exponential time hypothesis and lower bounds for polynomial-time problems, Compression by Substring Enumeration & Synchronization Codes, String Attractors, Succinct Data Structures Library, Succinct Range Minimum Queries (reserved), Min-Hashing, Minimizers, Bloom filters & de Bruijn graphs, Compression & colored/weighted de Bruijn graphs, and Alignments on Graphs.

Please contact one of lecturers if you are interested.




16.01.2018 - 13:59 Veli Mäkinen
16.01.2018 - 13:03 Veli Mäkinen