1999-2001 Special Year on Computational Intractability
Calendar of Events
See
1999-2001 Special Year on Computational Intractability for additional information
on the special year.
In addition to the workshops listed below, we are running a weekly informal
reading seminar.
- Workshop: Pseudorandomness and Explicit Combinatorial Constructions
- Date: October 12 - 15, 1999
- Location: CoRE Building, Rutgers University
- Organizers:
- David Zuckerman, University of Texas and UC Berkeley
- Russell Impagliazzo, University of California at San Diego
- Amnon Ta-Shma, International Computer Sciences Institute
- Email: diz@cs.berkeley.edu
- Workshop: Cryptography and Intractability
- Date: March 20 - 22, 2000
- Location: CoRE Building, Rutgers University
- Organizers:
- Moni Naor, Weizmann Institute of Science
- Joe Kilian, NEC Research Institute
- Shafi Goldwasser, MIT and Weizmann Institute of Science
- Email: naor@wisdom.weizmann.ac.il
- Workshop: Intrinsic Complexity of Computation
- Date: April 10 - 13, 2000
- Location: CoRE Building, Rutgers University
- Organizers:
- Paul Beame, University of Washington
- Steven Rudich, Carnegie Mellon University
- Andrew Yao, Princeton University
- Email: beame@cs.washington.edu, rudich+@cs.cmu.edu, yao@cs.princeton.edu
- Workshop: Sublinear Algorithms
- Date: September 24 - 27, 2000
- Location: Nassau Inn, Princeton, New Jersey
- Organizers: Shafi Goldwasser, MIT; Prabhakar Raghavan, Verity; Ronitt Rubinfeld, NEC Research Institute; Martin Strauss, AT&T Labs - Research
- Email: shafi@theory.lcs.mit.edu, pragh@verity.com, ronitt@research.nec.nj.com, mstrauss@research.att.com
- Presented Under the Auspices of the Special Year on Massive Data Sets, the Special Year on Computational Intractability and Exploratory Workshops/Special Programs.
Go to Computational Intractability Index
DIMACS Home Page
Alphabetical Index of DIMACS Web Pages
Contacting the Center
Document last modified on September 12, 2000.