Study programme
Classes
- Automata and Computational ComplexityNMMB415 | Faculty of Mathematics and Physics
- Data Structures 1NTIN066 | 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
- Introduction to Information Transmission and ProcessingNTIN100 | Faculty of Mathematics and Physics
- Seminar on theory of computingNTIN102 | Faculty of Mathematics and Physics
Publications
- Barrington Plays Cards: The Complexity of Card-Based Protocols2021 | Faculty of Mathematics and Physics
- Improved Bounds on Fourier Entropy and Min-entropy2021 | Faculty of Mathematics and Physics
- Improved Bounds on Fourier Entropy and Min-Entropy2020 | Faculty of Mathematics and Physics
- Simulation Theorems via Pseudo-random Properties2019 | Faculty of Mathematics and Physics
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity2018 | Faculty of Mathematics and Physics
- Simulation beats richness: new data-structure lower bounds2018 | Faculty of Mathematics and Physics
- Lower Bounds for Elimination via Weak Regularity2017 | Faculty of Mathematics and Physics
- A Communication Game Related to the Sensitivity Conjecture2017 | Faculty of Mathematics and Physics
- The Big Match in Small Space (Extended Abstract)2016 | Faculty of Mathematics and Physics
- Towards a Reverse Newman's Theorem in Interactive Information Complexity2016 | Faculty of Mathematics and Physics
Loading network view...