A list of active members and alumni of the Theory of Computing group
CS-4391
bach@cs.wisc.edu
Computational number theory and algebra, analysis of randomized and quantum algorithms, cryptography.
CS-4393
jyc@cs.wisc.edu
Complexity theory of counting problems: Classification Program for partition functions of Graph Homomorphisms, Spin Systems, Counting Constraint Satisfaction Problems, and Holant Problems.
CS-4387
ilias@cs.wisc.edu
Algorithms, Learning Theory, Machine Learning, Applied Probability
CS-4373
rishab.goyal@wisc.edu
Cryptography and Computer Security
CS-9999
khodak@cs.wisc.edu
Theory of Metalearning, Learning-augmented algorithms
CS-4390
dieter@cs.wisc.edu
Complexity theory: lower bounds for NP-complete problems, pseudorandomness and derandomization, quantum computing.
CS-4375
silwal@cs.wisc.edu
Sublinear, streaming and data-driven algorithms, Machine learning theory.
CS-4385
vlatakis@wisc.edu
Game Theory, Optimization, Beyond Worst-Case Analysis of Algorithms & Multi-Agent Learning Theory.
Algorithms for combinatorial, stochastic, and online optimization
Data processing, data pricing, and managing data under uncertainty
Computability theory and applications to model theory
Applied probability, statistics
skarmalkar@wisc.edu
jasper.lee@wisc.edu
gergatsouli@wisc.edu
kontonis@wisc.edu
jmcmahan@wisc.edu
rmoreno@wisc.edu
jongho.park@wisc.edu
pittas@wisc.edu
sdroievski@wisc.edu
yxsun@cs.wisc.edu
zarifis@wisc.edu
Thesis: Lower Bounds Related to Polynomial Identity Testing, Circuit Minimization, and Inversion Minimization
Advisor: Dieter van Melkebeek
Thesis: The Power of Simple Pricings for Revenue and Welfare Maximization
Advisor: Shuchi Chawla
Thesis: Approximate Complexity in Statistical Mechanics: Counting and Sampling in the Six- and Eight-Vertex Models
Advisor: Jin-Yi Cai
Thesis: Complexity and Expressibility of Counting Graph Homomorphism Problems
Thesis: Complexity Classification of Counting Problems on Boolean Variables
Advisor: Ilias Diakonikolas
Thesis: Simple and Robust Mechanism Design
Thesis: Derandomizing Isolation and Polynomial Identity Testing
Thesis: A Study of the NEXP vs. P/poly Problem and its Variants
Advisor: Eric Bach
Thesis: Complexity Classification of Exact and Approximate Counting Problems
Thesis: Towards a Unified Analysis Framework for Online Network Design
Thesis: Advances in the Computational Complexity of Holant Problems
Thesis: The Artin-Mazur Zeta Function of a Rational Map in Positive Characteristic
Thesis: Approximations in Bayesian mechanism design for multi-parameter settings
Thesis: Prior Robust Optimization
Thesis: Approximation Algorithms for Network Design and Partitioning Problems
Thesis: Advancing Algebraic and Logical Approaches to Circuit Lower Bounds
Thesis: Dichotomy Theorems for Holant Problems
Thesis: Deterministic Simulations and Hierarchy Theorems for Randomized Algorithms
Thesis: Time-Space Lower Bounds for Satisfiability and Related Problems on Randomized Machines
Thesis: Two Number-Theoretic Algorithms that Illustrate the Power and Limitations of Randomness
Thesis: Computational Aspects of Modular Forms and Elliptic Curves
Thesis: On Some Computational Problems in Randomization, Interaction and Inapproximability
