معرفی
Lubos Thoma is an Associate Professor in the Department of Mathematics and Applied Mathematical Sciences at the University of Rhode Island. He serves as the Graduate Program Director and is affiliated with the Discrete Mathematics Group at URI, with additional ties to the Center for Computational Research and the Data Science program.
- Ph.D. in Mathematics from Emory University (1996)
- Prior positions: Post-doctoral at DIMACS, Member at the Institute for Advanced Study, Zeev Nehari Visiting Assistant Professor at Carnegie Mellon University
His research focuses on discrete mathematics, particularly graph theory, hypergraph theory, probabilistic methods, extremal combinatorics, Ramsey theory, and finite model theory. He applies these techniques to network analysis, combinatorial optimization, and theoretical computer science.
Lubos Thoma has secured external, NSF, and internal grants for his research. He actively mentors graduate students, including Ph.D. candidates and honors program participants.
The Discrete Mathematics Group at URI, which he is part of, explores both pure and applied aspects of discrete structures, including network theory, analytic combinatorics, and combinatorial games.
