News

2020

Aug PhD student Zach Langley and Profs. Sepehr Assadi and Aaron Bernstein receive the Best Paper Award at DISC 2020 for their paper “Improved Bounds for Distributed Load Balancing.”
May 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 PhD student Aditya Potukuchi receives the Best Student Paper Award at ICALP 2020 for his paper “A Spectral Bound on Hypergraph Discrepancy.”
Jan Prof. Aaron Bernstein receives an NSF CAREER Award for his project titled “Sublinear Graph Algorithms: New Insights for Foundation Problems.”

2019

Nov Prof. Shubhangi Saraf is serving as the Program Committee Chair for CCC 2020.
Nov Prof. Martín Farach-Colton is serving as a Program Committee Co-Chair for SOSA 2020 and FUN 2020.
Nov 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.
Jan 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.

2018

Oct 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 Prof. Eric Allender is elected SIGACT Member-at-Large and Treasurer 2018-2021.
Mar Prof. Eric Allender is a co-organizer of a Clay Mathematics Institute workshop on Complexity Theory at Oxford.
Feb Prof. Shubhangi Saraf receives a 2018 Alfred P. Sloan Research Fellowship.
Jan 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.

2016

Dec Prof. Mike Saks is named an ACM Fellow for “contributions to computational complexity, theory of distributed computing, and design and analysis of algorithms.”

2014

Aug Prof. Eric Allender and DIMACS postdoc Bireswar Das receive the Best Paper Award at MFCS 2014 for their paper “Zero Knowledge and Circuit Minimization.”

2013

Jun PhD students Luke Friedman and Yixin Xu receive the Best Student Paper Award at CSR 2013 for their paper “Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams.”

2012

May Prof. Endre Szemerédi is awarded the Abel Prize “for his fundamental contributions to discrete mathematics and theoretical computer science, and in recognition of the profound and lasting impact of these contributions on additive number theory and ergodic theory.”

2010

Aug Prof. Eric Allender becomes Editor-in-Chief of ACM Transactions on Computation Theory.
May Prof. Endre Szemerédi is elected into the National Academy of Sciences.

2008

Jun Prof. Endre Szemerédi receives the Rolf Shock Prize in Mathematics of the Swedish Royal Academy of Sciencies “for his deep and pioneering work from 1975 on arithmetic progressions in subsets of the integers, which has led to great progress and discoveries in several branches of mathematics.”
Jan Prof. Endre Szemerédi receives the Leroy P. Steele Prize for Seminal Contribution to Research. He is honored for his paper “On Sets of Integers Containing No $k$ Elements in Arithmetic Progression.”

2006

Dec Prof. Eric Allender was named an ACM Fellow for “contributions to computational complexity theory.”

2005

May Prof. Mario Szegedy wins the Gödel prize for his foundational contributions to streaming algorithms.

2004

Apr Prof. Mike Saks wins the Gödel prize for his work on applications of topology to the theory of distributed computing.

2001

Jul Prof. Mario Szegedy wins the Gödel prize for his work on probabilistically checkable proofs.