CATS 2008
Computing: The Australasian Theory Symposium

University of Wollongong, New South Wales, Australia

January 22-25, 2008

CATS Home | Paper Submission | Registration | Program Committee | Keynote Speaker | Schedule of Talks | Venue and Accommodation | Local Information

CATS Keynote Speaker

Eric Allender, Rutgers, New Jersey

Title

Chipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds ?

Abstract

Click here to obtain the abstract in PDF form.

Bio

Eric Allender received his B.A. degree from the University of Iowa in 1979, with a double major in Computer Science and Theatre. After a year traveling and working in Germany, he accepted a President's Fellowship at the Georgia Institute of Technology, and earned his Ph.D. from Georgia Tech in 1985. He has been at Rutgers University since that time, reaching the rank on full professor in 1997. He is a former director of the Rutgers graduate program in computer science, and has served as department chair since 2006. He has also held visiting positions at Princeton University, the universities of Wuerzburg and Tueubingen in Germany, and the Institute of Mathematical Sciences in India.

Eric Allender is widely recognized as a leading researcher in computational complexity theory. He has given numerous invited addresses at computer science symposia worldwide, and has served on the program committees of many conferences. He is a Fellow of the ACM, as well as being an ACM Distinguished Scientist. He is active on editorial boards (ACM Transactions on Computation Theory, Computational Complexity, Chicago Journal of Theoretical Computer Science, DIMACS/AMS Book Series), and he has served as guest editor for the Journal of Computer and System Sciences and SIAM Journal on Computation. He is the former editor of the Computational Complexity Column for the Bulletin of the European Association for Theoretical Computer Science, as well as the former chair of the Conference Committee for the annual IEEE Conference on Computational Complexity. He serves on the Scientific Board for the Electronic Colloquium on Computational Complexity (ECCC). He was the co-organizer of the 1995-1996 DIMACS Special Year on Logic and Algorithms, and has been co-organizer of other workshops at DIMACS and at Dagstuhl in Germany.

CATS 2008 Programme Committee Co-Chairs

James Harland, RMIT University, Australia
Prabhu Manyem, University of Ballarat, Australia

Email for James Harland:  firstName.familyName at rmit.edu.au
Email for Prabhu Manyem:  p.familyName at ballarat.edu.au