Current Faculty

Dhruv Mubayi

Dhruv Mubayi works primarily on extremal and structural questions on graphs and hypergraphs, with applications to computer science. Much of his work involves the use of probabilistic and algebraic methods. His focus in the past five years lies in Turan and Ramsey type questions, particularly on hypergraphs. Specific recent projects include: the forbidden intersection problem in extremal set theory, the supersaturation phenomenon in extremal graph and hypergraph theory, extending the spectral theory of quasirandom graphs to hypergraphs, and using semi-random, or nibble methods in hypergraph coloring.

Will Perkins

Will Perkins works in computer science, probability theory, and combinatorics, on topics related to the interplay between randomness and computation. His work involves random graphs, random computational problems, and models and techniques from statistical physics. Specific recent projects include work on the cavity method for the stochastic block model, sphere packings in high dimensions, extremal problems for sparse graphs, and threshold phenomena in random geometric graphs.

Lev Reyzin

Lev Reyzin's work focuses on foundational questions in computational and statistical learning theory, but he is more broadly interested a variety of topics, ranging from practical issues in machine learning to theoretical computer science. His research also intersects with various areas of combinatorics and optimization. Specific recent projects include work on adaptive data analysis, noise-tolerant algorithms, active and interactive learning, network optimization, boosting and ensemble methods, and multiarmed bandits.

György Turán

Gyorgy Turan works in theoretical computer science, artificial intelligence and related areas in discrete mathematics and logic. Recently he worked on combinatorial, probabilistic, algorithmic and belief revision aspects of propositional Horn formulas, and on experimental aspects of commonsense reasoning. In the past he also worked on complexity theory (circuit complexity, decision trees, proof complexity) and computational learning theory (query learning, theory revision, learnability in logic).

Jan Verschelde

Jan Verschelde's research interests are mainly computational algebraic geometry, with a focus on numerical and symbolic methods to solve polynomial systems. He is also interested in mathematical software, parallel algorithms, and supercomputing.

UIC Faculty with Related Interests

Name (Department)Research interests
Tanya Y. Berger-Wolf (CS) application of discrete modelling and analysis techniques to various areas of computational biology
Daniel J. Bernstein (CS) computational number theory, computational commutative algebra, cryptography, computer security
Bhaskar DasGupta (CS) bioinformatics, computational biology, neural networks, machine learning, optical networks, combinatorial algorithms
Piotr Gmytrasiewicz (CS) artificial intelligence, multi-agent systems, intelligent agents, knowledge representation, uncertainty reasoning, automated decision-making, decision and game theories, intelligent coordination and communication, cognitive modeling
Vijay Kamble (IDS) market design and decision-making under uncertainty, algorithmic research at various intersections of pricing, matching, learning, and reputation in online markets and service platforms
Ian Kash (CS) economics and computer science, machine learning
Anastasios Sidiropoulos (CS) algorithms, computational geometry, optimization, discrete mathematics, algorithmic graph theory, computational complexity
Robert H. Sloan (CS) algorithms and complexity theory, especially applied to artificial intelligence problems, security, computer science education
Negar Soheili Azad (IDS) design and analysis of algorithms, algorithms for convex optimization, optimization in machine learning, complexity and computation
Xiaorui Sun (CS) algorithmic graph theory, massively parallel computing, machine learning theory
Theja Tulabandhula (IDS) artificial intelligence, operations research and their applications to multiple scientific and business domains
Xinhua Zhang (CS) convex models for learning predictive representations
Brian Ziebart (CS) statistical machine learning, robotics, artificial intelligence, assistive technologies

Faculty Emeriti

NameResearch interests
Shmuel Friedland tensors and applications, matrices, quantum information, mathematical biology, dynamical systems
Floyd B. Hanson computational stochastic control, computational finance, computational biomedicine, stochastic manufacturing systems, scientific supercomputing, stochastic bioeconomics, asymptotics, industrial mathematics, numerical analysis
Richard G. Larson applications of Hopf algebras to control theory and data mining, structure of Hopf algebras and quantum groups, apptrcations of algebra to computer science
Glenn K. Manacher computer algorithms, computer language design
Vera Pless coding theory, combinatorics

Current and Former Postdocs

NameYears at UICPresent position
Li Wang2015 - 2017 Assistant Professor at UT Arlington
John Lenz 2011 - 2016 Consultant at CMS Research
Sonja Petrović 2008 - 2011 Associate Professor at IIT
Vladimir Trifonov 2007 - 2008 Research Investigator at GNF
Amitava Bhattacharya 2005 - 2008 Fellow at the Tata Institute
Anton Leykin 2003 - 2006 Associate Professor at Georgia Tech
Yi Zhao 2002 - 2005 Professor at Georgia State
Keith Mellinger 2001 - 2004 Professor at University of Mary Washington
Jennifer Wagner 2000 - 2003 Professor at Washburn University

Former Faculty

NameYears at UICPresent position
Martin Grohe 2000 - 2001 Professor at RWTH Aachen
Robert Grossman 1988 - 2010 Professor at the University of Chicago
Jeffrey Leon 1971 - 2008 deceased
Wolfgang Maass 1982 - 1993 Professor at Technische Universität Graz
Uri Peled 1984 - 2009 deceased
Andrew Suk 2014 - 2017 Assistant Professor at UC San Diego
Jeremy Teitelbaum 1990 - 2008 Interim Provost, EVP, and Professor at the University of Connecticut