This is the website of the CS Theory group at Tufts University. Our research area covers various topics in theoretical computer science, including algorithms, computational complexity, cryptography, quantum computations, computational geometry.
Megumi Ando
Theoretical foundations of anonymous communications
Lenore Cowen
Data science, graph algorithms, approximate routing, classification and clustering for high-dimensional data, coloring and its generalizations, computational molecular biology
Saeed Mehraban
Quantum information and computation, quantum complexity theory, quantum pseudo-randomness
Daniel Mitropolsky (starting Fall 2026)
Mathematical models of the brain, complexity theory, computational linguistics
Vladimir Podolskii
Computational complexity, ontology-mediated queries, min-plus geometry
Diane Souvaine
Computational geometry, design and analysis of algorithms, computational complexity
Prosenjit Bose
Вiscrete and computational geometry, algorithms, data structures, graph theory
Peter Love
Quantum algorithms, quantum simulation
Kasso Okoudjou
Applied and computational harmonic analysis, cpectral analysis of Laplacian-based operators on graphs and fractals, quantum walks on graphs and fractals
Samantha Petti
Computational biology, probability and statistical inference, design and analysis of algorithms
Csaba D. Tóth
Discrete and computational geometry, combinatorial algorithms
Anselm Blumer
Machine learning, information theory, data compression, string algorithms, computational biology
Dale Jacobs
John Jeang
Michael Joseph
Hannah Marsh
Arsalan Motamedi
Morgan Prior
Christopher Ratigan
Michael J. Rivera Lazú
Aleksei Slizkov
Jocelyn Zonnefeld
Mingqian Chen
Fall 2024 time: Wednesday 1:30-2:30PM. Please contact Vladimir Podolskii to join mailing list.
Fall 2024 time: Monday 10-12AM. Please contact Saeed Mehraban to join mailing list.
Fall 2024 time: TBA. Please contact Diane Souvaine to join mailing list.
Introduction to Computational Complexity. Fridays 8:30-10am.
Summer 2024: Boolean Fourier Analysis.