Algorithms and Theory

Exploring game theory, market equilibriums, efficient algorithms

We are working in emerging fields within theoretical computer science, including privacy in statistical databases, and quantum computing. We also investigate algorithms and mathematics for the Internet, including web search, social-network analysis, spam fighting, and web security.

Classical areas of interest include complexity, cryptology (foundations of cryptography and cryptanalysis), algebraic computation, random structures, and spectral methods for data analysis. We strive to develop scalable algorithms for learning and data mining, cryptographic algorithms, graph algorithms, synchronization algorithms, networking algorithms, and sampling algorithms. We also look at problems at the intersection of systems, networking, and algorithms research: We study the algorithmic foundations of the systems that drive today’s computing—such as cloud computing, data centers, large-scale distributed systems, and mobile computing—and we apply our expertise in practice to advance the state of the art in applied algorithm design and to deliver highly efficient, scalable, robust solutions.

We also conduct research in several theoretical areas in mathematics and physics that are beyond the traditional scope of computer science but are closely connected. Researchers actively work on combinatorics, geometry and topology, probability theory, statistical physics, number theory, and functional analysis.


Abhimanyu Das, Sreenivas Gollapudi, Arindam Khan, and Renato Paes Leme, Role of Conformity in Opinion Dynamics in Social Networks, Proc. Intl. Conference on Social Networks (COSN), 1 October 2014

Shaolei Ren, Yuxiong He, and Kathryn S. McKinley, A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive Applications, in International Symposium on Distributed Computing (DISC), European Association for Theoretical Computer Science, October 2014

Dahlia Malkhi and Markus Weimer, REEFU: A Logging Service for Cluster Applications,, October 2014

Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, and Yoav Tzur, Probe Scheduling for Efficient Detection of Silent Failures, no. MSR-TR-2014-113, October 2014

Kshipra Bhawalkar, Sreenivas Gollapudi, and Debmalya Panigrahi, Online Set Cover with Set Requests, in APPROX 2014, Leibniz International Proceedings in Informatics , 4 September 2014

More publications...