Theory Research

Theoretical computer science research at URCS focuses on algorithms, computational complexity, and randomness/pseudorandomness, and on their connections to and applications in a wide range of fields: combinatorics, computational social choice theory, cryptography, economics, Markov chains/counting, security, and much more.

Lane A. Hemaspaandra

Lane A. Hemaspaandra

Professor of Computer Science

Contact Information
Office
2317 Wegmans Hall
Research Interests
  • Computational social choice (elections, preference aggregation, power indices, etc.)
  • Computational complexity theory (counting-based computation, probabilistic computation, unambiguous computation, the importance of query order when accessing databases, the study of efficient algorithms for complex sets, complexity-theoretic aspects of security, fault-tolerance, and data compression, etc.)
Kaave Hosseini

Kaave Hosseini

Assistant Professor of Computer Science

Contact Information
Office
2507 Wegmans Hall
Research Interests
  • Theoretical computer science
  • Additive combinatorics
  • Pseudorandomness
  • Discrete Fourier analysis
Anson Kahng

Anson Kahng

Assistant Professor of Computer Science and Data Science

Contact Information
Office
2401 Wegmans Hall
Research Interests
  • Computational social choice
  • Democracy and computer science
  • Economics and computation
  • Artificial intelligence
  • Theoretical computer science
  • Algorithmic game theory
Andrew Read-McFarland

Andrew Read-McFarland

Assistant Professor of Computer Science (Instruction)

Contact Information
Office
2105 Wegmans Hall
Joel I. Seiferas

Joel I. Seiferas

Professor Emeritus of Computer Science

Contact Information
Research Interests
  • Theoretical computer science
  • Computational complexity
  • Algorithms
  • Automata
Daniel Stefankovic

Daniel Stefankovic

Professor of Computer Science

Contact Information
Office
2315 Wegmans Hall
Research Interests
  • Theoretical computer science: graph theory, combinatorics, Fourier transform, Markov chains/counting, learning theory, phylogeny, game theory, graph equations, routing
Muthuramakrishnan Venkitasubramaniam

Muthuramakrishnan Venkitasubramaniam

Visiting Research Associate Professor of Computer Science

Contact Information
Research Interests
  • Cryptography
  • Complexity Theory
Eustrat Zhupa

Eustrat Zhupa

Assistant Professor of Computer Science (Instruction)

Contact Information
Office
2107 Wegmans Hall
Telephone
(585) 275-9499