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

2000 | |||
---|---|---|---|

Jan | Feb | Mar | Apr |

May | June | July | Aug |

Sept | Oct | Nov | Dec |

Date |
Location |
Event |

3/1 | Rutgers University | Computational Intractability Reading Seminar- Paper: The Quantum Communication Complexity of Sampling
- by: A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani and A. Wigderson
- Chief Reader: Ashwin Nayak.
See: http://dimacs.rutgers.edu/~dieter/Seminar/ |

3/4 | Rutgers University | DIMACS Research and Education Institute 1999 (DREI) Follow Up IISee: http://dimacs.rutgers.edu/drei/index.html DIMACS Center, Rutgers University, Piscataway, NJ |

3/6-3/7 | Rutgers University | Workshop: Data Processing on the Web: A look into the FutureSee: http://dimacs.rutgers.edu/Workshops/Processing/ CoRE Building, Rutgers University, Piscataway, NJ |

3/8 | Rutgers University | DIMACS Graduate Student Organization: COmbinatorics, Complexity, Optimization and Algorithms (COCOA)Seminar Series Presents: Speaker: Stefan Langerman, Rutgers UniversityTitle: An Optimal Algorithm for Hyperplane Depth in the Plane 11:30am (lunch will be served), CoRE 401, Rutgers University See: http://dimacs.rutgers.edu/COCOA/talks.html |

3/8 | Rutgers University | Computational Intractability Reading Seminar- Paper: The Quantum Communication Complexity of Sampling
- by A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani and A. Wigderson.
- Chief Reader: Ashwin Nayak.
See: http://dimacs.rutgers.edu/~dieter/Seminar/ |

3/9 | Rutgers University | DIMACS Discrete Math--Theory of Computing SeminarSpeaker: Satya Lokam, Loyola UniversityTitle: Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function 4:30-5:30, CORE Building, Room 431, Rutgers University |

3/15 | Rutgers University | Computational Intractability Reading Seminar- Paper: The Quantum Communication Complexity of Sampling
- by A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson.
- Chief Reader: Ashwin Nayak.
See: http://dimacs.rutgers.edu/~dieter/Seminar/ |

3/20-3/22 | Rutgers University | Workshop: Cryptography and IntractabilitySee: http://dimacs.rutgers.edu/Workshops/CryptIntract/ CoRE Building, Rutgers University, Piscataway, NJ |

3/28 | Rutgers University | DIMACS Discrete Math--Theory of Computing SeminarSpeaker: Stefan Schmidt, MITTitle: Codes Over Rings--some Combinatorial Aspects 4:30-5:30, CORE Building, Room 431, Rutgers University |

3/29 | Rutgers University | Computational Intractability Reading Seminar- Paper: Quantum Lower Bounds by Quantum Arguments
- by A. Ambainis.
See: http://dimacs.rutgers.edu/~dieter/Seminar/ |

3/30 | Rutgers University | DIMACS Discrete Math--Theory of Computing SeminarSpeaker: Martin Strauss, AT&T Bell LabsTitle: Approximate L^p-difference algorithms for massive data streams 4:30-5:30, CORE Building, Room 431, Rutgers University *PLEASE NOTE: THIS IS NOT THE USUAL TUESDAY MEETING TIME. |

DIMACS home page

Contacting the Center

Document last modified on March 23, 2000.