Computer scientists at Carnegie Mellon University have devised an algorithm that might be able to solve a certain class of linear systems much more quickly than today's fastest solvers.
http://cacm.acm.org/magazines/2011/9/122799-a-breakthrough-in-algorithm-design/fulltext
http://www.cc.gatech.edu/~ninamf/papers/md_ml_jcss.pdf
http://theory.cs.cmu.edu/
CM Rwanda?
http://www.cmu.edu/news/stories/archives/2011/september/sept15_rwanda.html
http://cacm.acm.org/magazines/2011/9/122806-quantitative-analysis-of-real-time-systems-using-priced-timed-automata/fulltext
http://cacm.acm.org/magazines/2011/9/122799-a-breakthrough-in-algorithm-design/fulltext
http://www.cc.gatech.edu/~ninamf/papers/md_ml_jcss.pdf
http://theory.cs.cmu.edu/
CM Rwanda?
http://www.cmu.edu/news/stories/archives/2011/september/sept15_rwanda.html
Quantitative Analysis of Real-Time Systems Using Priced Timed Automata
http://cacm.acm.org/magazines/2011/9/122806-quantitative-analysis-of-real-time-systems-using-priced-timed-automata/fulltext
