Study programme
Classes
- Automata and Computational ComplexityNMMB415 | Faculty of Mathematics and Physics
- Computational complexity and interactive protocolsNTIN081 | Faculty of Mathematics and Physics
- Nonuniform computational modelsNTIN082 | Faculty of Mathematics and Physics
- Selected Topics in Computational Complexity INTIN085 | Faculty of Mathematics and Physics
- Selected Topics in Computational Complexity IINTIN086 | Faculty of Mathematics and Physics
- Seminar on theory of computingNTIN102 | Faculty of Mathematics and Physics
- Data Structures 1NTIN066 | Faculty of Mathematics and Physics
- Introduction to Information Transmission and ProcessingNTIN100 | Faculty of Mathematics and Physics
Publications
- Barrington Plays Cards: The Complexity of Card-Based Protocols2021 | Faculty of Mathematics and Physics
- SORTING SHORT INTEGERS: THE EXPOSITION2021 | Faculty of Mathematics and Physics
- High Entropy Random Selection Protocols2021 | Faculty of Mathematics and Physics
- Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time2020 | Faculty of Mathematics and Physics
- Approximate Online Pattern Matching in Sublinear Time2019 | Faculty of Mathematics and Physics, Central Library of Charles University
- Stronger Lower Bounds for Online ORAM2019 | Faculty of Mathematics and Physics
- Cover time and mixing time of random walks on dynamic graphs2018 | Faculty of Mathematics and Physics
- Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time2018 | Faculty of Mathematics and Physics
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity2018 | Faculty of Mathematics and Physics
- Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication2018 | Faculty of Mathematics and Physics
Loading network view...