15-453 Formal Languages, Automata and Computation Fall 2005, TTH 12:00-1:20, HBH 1002 What's new? The Wiki for FSM's with lots of neat links (thanks to Bren Meeder). Mor Harchol-Balter's notes on applying to grad school in computer science. Electronic version of the proceedings of STOC Electronic version of the proceedings of FOCS. Below are some papers that would be very nice class projects. PRIMES is in P. This is probably the most important result in theoretical computer science over the last few years, and it's not very difficult! Hardness Amplification Within NP. How Bad is selfish Routing. © 2005 Carnegie Mellon University, all rights reserved.