List of Invited Participants
Allan Borodin, Organizer, University of Toronto
Paul Beame, University of Washington
Stephen J. Bellantoni, Scotia Capital Inc.
Daniel Brand, T.J. Watson Research Center, IBM
Sam Buss, University of California, San Diego
Alan Cobham, Weslyan University
Patrick Dymond, York University
Arvind Gupta, Simon Fraser University
Jim Hoover, University of Alberta
Russell Impagliazzo, University of California, San Diego
Valentine Kabanets, University of Toronto
Bruce Kapron, University of Victoria
Jan Krajicek, Academy of Sciences, Prague
Anna Lubiw, University of Waterloo
Pierre McKenzie, University of Montreal
Silvio Micali, Massachusetts Institute of Technology
Nicholas Pippenger, University of British Columbia
Toniann Pitassi, University of Arizona
Bob Reckhow, Zyqux
Steven Rudich, Carnegie Mellon University
Walter Savitch, University of California, San Diego
Iannis Tourlakis, University of Toronto
Les Valiant, Harvard University
Avi Wigderson, IAS & The Hebrew University
Tomoyuki Yamakami, University of Ottawa
Speakers
Paul Beame, University of Washington
"Superlinear timespace tradeoff lower bounds for randomized computation"
Stephen J. Bellantoni, Scotia Capital Inc.
"Diagonalizing NC along the delta axis"
Sam Buss, University of California, San Diego
"Ordinal Notations and WellOrderings in Bounded Arithmetic"
Daniel Brand, T.J. Watson Research Center, IBM
"Theorem proving for software analysis"
Russell Impagliazzo, University of California, San Diego
"Which Problems have Strongly Exponential Complexity?"
Valentine Kabanets, University of Toronto
"Circuit Minimization Problem"
Bruce Kapron, University of Victoria
"An Induction Principle for Computational Indistinguishability"
Jan Krajicek, Academy of Sciences, Prague
"Tautologies from pseudorandom generators, AC^0 cardinality,
and other bounded arithmetic"
Silvio Micali, Massachusetts Institute of Technology
Nicholas Pippenger, University of British Columbia
"Quantum Circuits"
Toniann Pitassi, University of Arizona
"A New Proof of the Weak Pigeonhole Principle"
Steven Rudich, Carnegie Mellon University
"A High Level Summary of Approaches for the P Versus NP Question"
Iannis Tourlakis, University of Toronto
"Timespace tradeoffs for SAT on nonuniform machines"
Les Valiant, Harvard University
"Robust Logic"
Avi Wigderson, IAS & The Hebrew University
"Pseudorandom Generators in Propositional Proof Complexity"
Tomoyuki Yamakami, University of Ottawa
"A Computational Approach Toward Realistic Quantum Logic"
