1994 | 1995 | 1996 | 1997 | 1998 | 1999 | 2000 | 2001 | 2002 | 2003 | 2004 |

1999 | |||
---|---|---|---|

Jan | Feb | Mar | Apr |

May | June | July | Aug |

Sept | Oct | Nov | Dec |

Date |
Location |
Event |

11/1-11/3 | Rutgers University | Workshop: Probabilistic Analysis of Algorithms for Hard ProblemsSee: 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 SeminarSpeaker: Italo Dejter, University of Puerto RicoTitle: Efficient Dominating Sets in Cayley Graphs 3:00-4:00, CORE Building, Room 431, Rutgers University |

11/4 | Rutgers University | Computational Intractability Reading SeminarPapers: - "Time-Space Tradeoffs for Branching Programs"
by P. Beame, M. Saks and J. Thatacharand - "Determinism versus Non-Determinism for Linear Time RAMSs"
by M. Ajtai.
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 SeminarSpeaker: Matthew Devos, PrincetonTitle: Nowhere-zero flows in birected graphs 1:30 in Fine Hall 214 |

11/9-11/12 | Rutgers University | Workshop: Codes and Association SchemesSee: 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.
See: http://dimacs.rutgers.edu/~dieter/Seminar/ |

11/11 | Princeton University | Princeton Discrete Math SeminarSpeaker: 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 SeminarSpeaker: Alexander Razborov, Steklov Mathematical Institute and Princeton UniversityTitle: 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.
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 SeminarSpeaker: 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 FunctionSee: http://dimacs.rutgers.edu/Workshops/ProteinStructure/ DIMACS Center, Rutgers University, Piscataway, NJ |

11/22 | Rutgers University | Computational Intractability Reading SeminarPaper: 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 |

11/23 | Rutgers University | DIMACS Discrete Math--Theory of Computing SeminarSpeaker: Bruce Reed, CNRS, ParisTitle: 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 SeminarSpeaker: Ronitt Rubinfeld, NEC Institute, PrincetonTitle: Oblivious function evaluation with sub-linear complexity 4:30-5:30, CORE Building, Room 431, Rutgers University |

DIMACS home page

Contacting the Center

Document last modified on November 29, 1999.