1999
Jan Feb Mar Apr

May June July Aug

Sept Oct Nov Dec

November 1999

Date	Location	Event
11/1-11/3	Rutgers University	Workshop: Probabilistic Analysis of Algorithms for Hard Problems See: http://dimacs.rutgers.edu/Workshops/ProbAnal/ Fiber Optic Materials Research Building, Rutgers University, Piscataway, NJ
11/4	Rutgers University	DIMACS Discrete Math--Theory of Computing Seminar Speaker: Italo Dejter, University of Puerto Rico Title: Efficient Dominating Sets in Cayley Graphs 3:00-4:00, CORE Building, Room 431, Rutgers University
11/4	Rutgers University	Computational Intractability Reading Seminar Papers: "Time-Space Tradeoffs for Branching Programs" by P. Beame, M. Saks and J. Thatachar and "Determinism versus Non-Determinism for Linear Time RAMSs" by M. Ajtai. Chief Readers: Mike Saks and Xiaodong Sun. 1:30 - 2:45, CoRE Building, Room 431, Rutgers University, Piscataway, NJ See: http://dimacs.rutgers.edu/~dieter/Seminar/
11/4	Princeton University	Princeton Discrete Math Seminar Speaker: Matthew Devos, Princeton Title: Nowhere-zero flows in birected graphs 1:30 in Fine Hall 214
11/9-11/12	Rutgers University	Workshop: Codes and Association Schemes See: http://dimacs.rutgers.edu/Workshops/AssociationSchemes/ DIMACS Center, Rutgers University, Piscataway, NJ
11/10	Rutgers University	Computational Intractability Reading Seminar Paper: "Determinism versus Non-Determinism for Linear Time RAMSs and A Non-linear Time Lower Bound for Boolean Branching Programs" by M. Ajtai. Chief Reader: Xiaodong Sun. 1:30 - 2:45, (note room change) Hill Center, Room 705, Rutgers University, Piscataway, NJ See: http://dimacs.rutgers.edu/~dieter/Seminar/
11/11	Princeton University	Princeton Discrete Math Seminar Speaker: Dieter Rautenbach, CNRS (Paris) Title: Packing odd cycles in graphs of large connectivity 1:30 in Fine Hall 214, Princeton University, Princeton, NJ
11/16	Rutgers University	DIMACS Discrete Math--Theory of Computing Seminar Speaker: Alexander Razborov, Steklov Mathematical Institute and Princeton University Title: Space Complexity in Propositional Calculus 4:30-5:30, CORE Building, Room 431, Rutgers University
11/17	Rutgers University	Computational Intractability Reading Seminar Papers: Determinism versus Non-Determinism for Linear Time RAMSs and A Non-linear Time Lower Bound for Boolean Branching Programs by M. Ajtai. Chief Reader: Xiaodong Sun. 1:30 - 2:45. CoRE Building, Room 431, Rutgers University, Piscataway, NJ See: http://dimacs.rutgers.edu/~dieter/Seminar/
11/18	Princeton University	Princeton Discrete Math Seminar Speaker: Bruce Reed, CNRS (Paris) Title: How tall is a tree? 1:30 in Fine Hall 224, Princeton University, Princeton, NJ
11/19	Rutgers University	Workshop: Protein Structure and Function See: http://dimacs.rutgers.edu/Workshops/ProteinStructure/ DIMACS Center, Rutgers University, Piscataway, NJ
11/22	Rutgers University	Computational Intractability Reading Seminar Paper: Complexity of k-SAT by R. Impagliazzo and R. Paturi (building upon Which Problems have Strongly Exponential Complexity? by R. Impagliazzo, R. Paturi, and F. Zane). Speaker: Mohan Paturi. 1:30 - 2:45. CoRE Building, Room 431, Rutgers University, Piscataway, NJ See: http://dimacs.rutgers.edu/~dieter/Seminar/
11/23	Rutgers University	DIMACS Discrete Math--Theory of Computing Seminar Speaker: Bruce Reed, CNRS, Paris Title: Graph coloring via the probabilistic method 4:30-5:30, CORE Building, Room 431, Rutgers University
11/30	Rutgers University	DIMACS Discrete Math--Theory of Computing Seminar Speaker: Ronitt Rubinfeld, NEC Institute, Princeton Title: Oblivious function evaluation with sub-linear complexity 4:30-5:30, CORE Building, Room 431, Rutgers University

Wondering who's visiting DIMACS? Have a look at the Visitors list

.

DIMACS home page

Contacting the Center
Document last modified on November 29, 1999.