RECEPTION: 4:00-5:00 PM
TALK: 5:00-6:00 PM
I will discuss what I believe are the biggest insights in computer science
theory. They are not the obvious ones---at least not all are obvious. The
talk should be accessible to almost anyone. Although some experts may
disagree with my list of insights. I will also make an attempt to outline
what I see as the future of computer science theory: what will happen
in the next five, ten, and twenty years.
here is a brief bio for Dick Lipton.
Richard Jay Lipton is a Computer Scientist of wide ranging interest.
He has made multifaceted contributions
to the foundation of Theoretical Computer Science.
With Tarjan, he proved the planar separator theorem which
is applied everywhere. With Karp, he proved a fundamental theorem
in circuit complexity showing that NP-complete problems are unlikely
to be efficiently solved by the best of algorithms even with specially-designed
hardware. He also proved the enormous applicability of random walks,
showing that on an arbitrary graph and starting at an arbitrary point,
a random walk will visit every point in no more than O(n^3) steps
with high probability. His contributions also extend into program testing
and software engineering. Along with Adleman, Lipton is considered
one of the original pioneers of DNA computing.
Lipton is the Frederick G. Storey Chair in the College of Computing at
Georgia Tech. Previously he held faculty positions at Yale, Berkeley, and Princeton.
A winner of the Knuth Prize, he is a member of National Academy of Engineering,
and a fellow of the American Academy of Arts and Sciences.
Reception, with food and beverages, is in Mesozoic Garden East from 4:00-5:00 PM
Talk is from 5:00-6:00 PM