Rutgers University has an accomplished and active group of researchers in the area of theoretical computer science. Specific research interests include the design and analysis of algorithms, algorithms for massive data, combinatorial optimization, complexity theory, machine learning, computational biology, algebraic methods, discrete math, graph theory, and computational geometry. Many members of the group are also associated with Rutgers’ Department of Mathematics, the Rutgers Center for Operations Research (RUTCOR), and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS).

Recent News

May 2020 Prof. Mario Szegedy is awarded the ACM Paris Kanellakis Theory and Practice Award for “seminal work on the foundations of streaming algorithms and their application to large-scale data analytics.”
May 2020 Aditya Potukuchi receives the Best Student Paper Award at ICALP 2020 for his paper “A Spectral Bound on Hypergraph Discrepancy.”
Jan 2020 Prof. Aaron Bernstein receives an NSF CAREER Award for his project titled “Sublinear Graph Algorithms: New Insights for Foundation Problems.”
Nov 2019 Prof. Martín Farach-Colton is serving as the Steering Committee Chair for APoCS 2020, a new conference for algorithms papers strongly motivated by computer systems.
Nov 2019 Prof. Martín Farach-Colton is serving as a Program Committee Co-Chair for SOSA 2020 and FUN 2020.
Nov 2019 Prof. Shubhangi Saraf is serving as the Program Committee Chair for CCC 2020.
Jan 2019 Prof. Sepehr Assadi receives the Best Paper Award at SODA 2019 for his paper “Sublinear Algorithms for $(\Delta + 1)$ Vertex Coloring” with Yu Chen and Sanjeev Khanna.
Oct 2018 Prof. Mike Saks and Rutgers alumnus Michal Koucký receive the Best Paper Award at FOCS 2018 for their paper “Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time” with Diptarka Chakraborty, Debarati Das, and Elazar Goldenberg.
Jul 2018 Prof. Eric Allender is elected SIGACT Member-at-Large and Treasurer 2018-2021.
Mar 2018 Prof. Eric Allender is a co-organizer of a Clay Mathematics Institute workshop on Complexity Theory at Oxford.
Feb 2018 Prof. Shubhangi Saraf receives a 2018 Alfred P. Sloan Research Fellowship.
Jan 2018 Prof. Aaron Bernstein receives the Best Paper Award at SODA 2018 for his paper “Online Bipartite Matching with Amortized $O(\log^2{n})$ Replacements” with Jacob Holm and Eva Rotenberg.

To see less recent news too, click here.