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.


Shaolei Ren, Yuxiong He, and Kathryn 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

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

Yoram Bachrach, Vasilis Syrgkanis, Eva Tardos, and Milan Vojnovic, Strong Price of Anarchy, Utility Games and Coalitional Dynamics, in SAGT 2014, Springer, September 2014

Dan Alistarh, James Aspnes, Valerie King, and Jared Saia, Communication-Efficient Randomized Consensus, no. MSR-TR-2014-15, September 2014

Florian Bourse, Marc Lelarge, and Milan Vojnovic, Balanced Graph Edge Partition, in ACM KDD 2014, ACM – Association for Computing Machinery, August 2014

More publications...