IEEE Conference on Computational Complexity 2001: Call For Papers
Call for Papers
Computational Complexity
Sixteenth Annual IEEE Conference
June 18-21, 2001
Chicago, Illinois, USA
Conference Committee
  Lance Fortnow (chair), NEC Research
  Eric Allender, Rutgers Univ.
  Harry Buhrman, CWI, Amsterdam
  Russell Impagliazzo, U. C. San Diego
  Luc Longpr√©, U. of Texas at El Paso
  Jack Lutz, Iowa State Univ.
  Pierre McKenzie, U. Montr√©al
  Alexander Razborov, Steklov Math. Inst.
  Madhu Sudan, MIT
Program Committee
  Madhu Sudan (chair), MIT
  Richard Cleve, Univ. of Calgary
  Uriel Feige, Weizmann Inst.
  Anna Gal, U. of Texas at Austin
  Peter Bro Miltersen, U. of Aarhus
  Toniann Pitassi, U. Toronto
  Rainer Schuler, U. Ulm
  D. Sivakumar, IBM Almaden Res. Center
  Salil Vadhan, IAS & Harvard U.
Important Dates
Submissions Due: Dec. 8, 2000
Notification: Feb. 19, 2001
Final Copies Due: Apr. 6, 2001
Local Arrangements
  John Rogers, DePaul U.
Further Information
The conference seeks original research papers in all areas of computational complexity theory. We also encourage results from other areas of computer science and mathematics motivated by topics in complexity theory.

The following list of possible topics is not exhaustive:

Complexity classes Reducibility
Algebraic complexity Communication complexity
Proof complexity Complexity and logic
Interactive proof systems Nonapproximability
Circuits and other concrete Cryptographic complexity
      computational models Complexity and learning
Kolmogorov complexity Quantum computation

Submissions must be received by December 8th, 2000, 5pm EST, for consideration. The paper should not exceed 10 pages. See submission instructions on the next page.

Authors of accepted papers are expected to present their work at the conference. The program committee will determine time allocations for presentations (between 15 and 45 minutes). Conference proceedings will be published by the IEEE Computer Society. Publication in the conference proceedings does not preclude subsequent journal publication.

Sponsors   The conference is sponsored by the DePaul School of Computer Science, Telecommunications and Information Systems and by the IEEE Computer Society Technical Committee for Mathematical Foundations of Computing in cooperation with ACM SIGACT and EATCS.

For More Information   Get more information through our complexity web site, or at this year's conference web site, both listed on the left. You may also contact the publicity chair: Luc Longpr\'{e}; Computer Science Department, University of Texas at El Paso, El Paso, TX 79968, USA; E-mail:

The next page has more details.