The true highlight of the conference happened a day earlier with the Turing award lectures of Silvio Micali and Shafi Goldwasser, two of the better Turing award lectures I've seen in a while. Silvio talked about the nature of proofs and Shafi showed the connections between cryptographic principles and their applications in the broader community. For example, the Goldreich-Levin hard-core bit led to list-decodable codes. The ACM taped both lectures and they should be on-line soon.
Notes from the business meeting
- 372 conference attendees, 46% students. A great attendance.
- 322 submissions, 91 accepts.
- Best Paper: "The matching polytope has exponential extension complexity" by Thomas Rothvoss
- Student Paper: "Online learning of local structure via semidefinite programming" by Paul Christiano
- Gödel Prize (to be awarded at ICALP): "Optimal Aggregation Algorithms for Middleware" by Ronald Fagin, Amnon Lotem and Moni Naor
- Future Conferences:
- FOCS 2014 October 18-21 in Philadelphia. There will be a workshop to discuss ideas for STOC and FOCS moving forward.
- ITCS 2015 January 11-13 at the Weizmann Institute in Israel (CFP)
- STOC 2015 as part of FCRC in Portland, Oregon
- STOC 2016 in Boston likely co-located with SoCG
- Potential federated theory conference in 2017
- 2012 Funding: Algorithmic Foundations 52 Smalls, 9 Mediums, 2 Large, 11 CAREER
- New programs (theorists wanted): Brain Initiative, CISE Research Initiation Initiative, XPS
- Keep abreast of new opportunities at Theory Matters
- New ACM Book Series