A Conference At TTIC
Adam Tauman Kalai is one of the speakers at the 20th Annual Conference at the Toyota Technological Institute at Chicago this November 9-10. You are welcome to register for the conference at 20th Annual Conference at TTIC.
Adam is one of the top researchers in the world. He scored a hat-trick in my book already over twenty years ago:
- He found something original to say about factoring.
- He got the paper into SODA — SODA 2003, and
- He matched the great Leonid Levin’s feat of a top-conference paper being just one page.
There are two significant differences and one non-difference between that and the 2003 journal version, which runs to a profligate three pages:
- The journal version removes a cryptic diagram in regard to primality tests.
- Neither version, however, knows about the AKS primality test, which appeared around the same time (note also this).
- Both versions acknowledge Manuel Blum, Michael Rabin, and Doug Rohde. But the journal version acknowledges a fourth person, Yael Tauman. Who shortly became Yael Tauman Kalai. And has her own superpowers.
The Talks
Here is the whole tentative schedule of speakers and activities:
Thursday (11/9):
8:30-9:00 Breakfast
9:00-9:30 Welcome and History of TTIC
9:30-10:00 Karthik Sridharan
10:00-10:30 Sepideh Mahabadi
10:30-11:00 Break
11:00-11:30 Karen Livescu
11:30-12:00 Mohit Bansal
12:00-1:30 Lunch
1:30-2:00 Matt Walter
2:00-2:30 Suriya Gunasekar
2:30-3:00 Adam Kalai
3:00-3:30 Break
3:30-4:30 Panel Discussion [career issues / life after TTIC]
4:30+ Pizza and Posters
Friday (11/10):
8:30-9:00 Breakfast
9:00-9:30 Audrey Sedal
9:30-10:00 Harald Racke
10:00-10:30 Break
10:30-11:00 Aly Azeem Khan
11:00-11:30 Qixing Huang
11:30-12:30 Lunch
12:30-1:30 David McAllester
1:30-2:00 Break
2:00-2:30 Shubham Toshniwal
2:30-3:00 Thatchaphol Saranurak
3:00-3:30 Break
3:30-4:30 Panel Discussion [The future of AI / what will we be talking about at the 30th anniversary?]
Open Problems
If we say, “hope to see you there,” does “there” mean “there” like it used to?
Are you referring to Yamnitsky and Levin’s “An old linear programming algorithm runs in polynomial time”? It’s one-and-a-quarter page, but still pretty impressive.
What most springs to mind is Levin’s STOC 1984 paper, “Problems, complete in ‘average’ instance”, which occupied page 465 of the proceedings.