Skip to main content
Accessibility
login
home
About
TOC Calendar
Contact
People
Faculty
Research Scientists
lecturers
Postdocs
Students
Visitors
Support Staff
Alumni
Research Groups
Algorithms
Complexity Theory
Complexity Theory Courses
Computation and Economics
Cryptography and Information Security
Theory of Distributed Systems
Parallel Computing
Applied Computing
Supertech Research
Quantum Information Science
Computation & Biology
Computational Connectomics
Learning-Augmented Algorithms
Multicore Algorithmics
Sublinear Algorithms
Theory of Machine Learning
Seminars
Theory of Computation Colloquium
Algorithms and Complexity Seminars
Theory of Distributed Systems (TDS)
CRYPTOGRAPHY AND INFORMATION SECURITY (CIS) SEMINARS
Bioinformatics Seminars
TCS+
Theory Reading Group
News/Events/Blogs
New Student Blog: Not so Great Ideas in Theoretical Computer Science
TOC People in the News: 2009-2012
Awards
Algorithms Office Hours
Courses
Course Calendar
Course Descriptions
Who is Teaching What for Spring 2023
Fun Photos
Celebrations
Photo's of TOC People - Past (and some Present)
New algorithm can dramatically streamline solutions to the ‘max flow’ problem
Thu, 01/09/2014
MIT News Article
- Jon Kelner, MIT January 2014
