# People

USC has a strong and active Theory and Algorithms group, with research spanning a broad range of topics within theoretical computer science. Our group has made significant contributions to algorithmic game theory, algorithmic number theory, biological computing, computational geometry, cryptography, graph theory, learning theory, numerical analysis, optimization, privacy, quantum computing, social network analysis and the theory of computing. A large, active, and collaborative student body makes USC a vibrant and welcoming environment in which to conduct world-class research in theoretical computer science.

## Faculty

Len Adleman |
Ilias Diakonikolas |
Shaddin Dughmi |

Ming-Deh Huang |
David Kempe |
Aleksandra Korolova |

Haipeng Luo |
Hamid Nazerzadeh |
Ben Reichardt |

Shang-Hua Teng |

## Students

- Brendan Avent
- Joseph Bebel
- Hsing-Hau Chen
- Yu Cheng
- Ho Yee Cheung
- Ehsan Emamjomeh-Zadeh
- Li Han
- Xinran He
- Lian Liu
- Ruixin Qiang
- Alana Shine
- Anastasia Voloshinov
- Haifeng Xu

Research Interests:

Spectral Graph Theory,

Smoothed Analysis,

Algorithmic Game Theory & Economics,

Computational Geometry,

and Scientific Computing

Awards:

ACM Godel Prize, Fulkerson Prize,

ACM Fellow, Sloan Fellow

Spectral Graph Theory,

Smoothed Analysis,

Algorithmic Game Theory & Economics,

Computational Geometry,

and Scientific Computing

Awards:

ACM Godel Prize, Fulkerson Prize,

ACM Fellow, Sloan Fellow

Research Interests:

Algorithmic Game Theory,

Approximation Algorithms,

Combinatorial Optimization.

Awards:

NSF CAREER Award,

ACM EC Best Student Paper Award

Algorithmic Game Theory,

Approximation Algorithms,

Combinatorial Optimization.

Awards:

NSF CAREER Award,

ACM EC Best Student Paper Award

Research Interests:

DNA Computing,

Cryptography,

Computational Number Theory,

Complex Analysis.

Awards:

ACM Turing Award, National Academy of Science,

National Academy of Engineering, American Academy of Arts and Sciences.

DNA Computing,

Cryptography,

Computational Number Theory,

Complex Analysis.

Awards:

ACM Turing Award, National Academy of Science,

National Academy of Engineering, American Academy of Arts and Sciences.

Research Interests:

Computational Number Theory,

Quantum Computing, Cryptography

Awards:

NSF Presidential Young Investigator Award

Computational Number Theory,

Quantum Computing, Cryptography

Awards:

NSF Presidential Young Investigator Award

Research Interests:

Network Sciences, Optimization,

Algorithmic Game Theory

Awards:

NSF CAREER Award, ONR Young Investigator Award, Sloan Fellow

Network Sciences, Optimization,

Algorithmic Game Theory

Awards:

NSF CAREER Award, ONR Young Investigator Award, Sloan Fellow

Research Interests:

Data privacy, privacy-preserving algorithms and technologies,

Dig data applications, large-scale data mining of social and information networks

Data privacy, privacy-preserving algorithms and technologies,

Dig data applications, large-scale data mining of social and information networks

Research Interests:

Mechanism design, Optimization and

their applications in the design and operation of online markets

Mechanism design, Optimization and

their applications in the design and operation of online markets

Research Interests:

Quantum algorithms, Fault-tolerant quantum computation,

Cryptography, Quantum information theory,

Geometry of minimal surfaces.

Quantum algorithms, Fault-tolerant quantum computation,

Cryptography, Quantum information theory,

Geometry of minimal surfaces.

Research Interests:

Algorithms, learning, statistics, and applied probability,

Big data algorithmics for machine learning,

Optimization and game theory.

Algorithms, learning, statistics, and applied probability,

Big data algorithmics for machine learning,

Optimization and game theory.

Research Interests:

Online learning, Bandits,

Boosting, Optimization,

Game theory

Online learning, Bandits,

Boosting, Optimization,

Game theory