Computational geometry

- Pseudorandomness and derandomization
- Computational geometry
- Generating random combinatorial structures
- Random walks and Markov chains
- Expander graphs and randomness extractors
- Error-correcting codes
- Random projections and metric embeddings
- Random network models
- Random search heuristics

University of Michigan - Ann Arbor

- Models of computation
- Formal languages and automata theory
- Computational complexity and cryptography
- Logic
- Design and analysis of algorithms
- Randomness, geometry and discrete structures
- Theory and algorithms for application domains
- Semantics and reasoning

Theory of computation in ACM Computing Classification

[dl.acm.org/ccs](https://dl.acm.org/ccs) 

Learn Before

Related

Learn After