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
- Computing with a full memory: catalytic space2014 | Faculty of Mathematics and Physics
- Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance2023 | Faculty of Mathematics and Physics
- Locally Consistent Decomposition of Strings with Applications to Edit Distance Sketching2023 | Faculty of Mathematics and Physics
- Streaming k-Edit Approximate Pattern Matching via String Decomposition2023 | Faculty of Mathematics and Physics
- 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
- SORTING SHORT INTEGERS: THE EXPOSITION2021 | Faculty of Mathematics and Physics
- A SEPARATOR THEOREM FOR HYPERGRAPHS AND A CSP-SAT ALGORITHM2021 | Faculty of Mathematics and Physics
- Sorting Short Integers2021 | Faculty of Mathematics and Physics
- Data Structures Lower Bounds and Popular Conjectures2021 | Faculty of Mathematics and Physics
Loading network view...