2000
Jan Feb Mar Apr

May June July Aug

Sept Oct Nov Dec

February 2000

Date	Location	Event
2/1	Rutgers University	DIMACS Discrete Math--Theory of Computing Seminar Speaker: Andrew Yao, Princeton University Title: Quantum bit escrow 4:30-5:30, CORE Building, Room 431, Rutgers University
2/2	Rutgers University	Computational Intractability Reading Seminar Paper: Collision-free Hashing from Lattice Problems by O. Goldreich, S. Goldwasser, and S. Halevi. Chief Reader: Richard Beigel. 1:30 - 2:45. DIMACS Center, CoRE 431, Rutgers University, Piscataway, NJ See: http://dimacs.rutgers.edu/~dieter/Seminar/
2/8	Rutgers University	DIMACS Discrete Math--Theory of Computing Seminar Speaker: Avi Widgerson, Institute for Advanced Study Title: a strongly polynomial deterministic algorithm for matrix scaling and approximate permanents 4:30-5:30, CORE Building, Room 431, Rutgers University
2/9	Rutgers University	Computational Intractability Reading Seminar Paper: Applications of lattices in modular equations and factoring. by: Nick Howgrave-Graham 1:30 - 2:45. DIMACS Center, CoRE 431, Rutgers University, Piscataway, NJ See: http://dimacs.rutgers.edu/~dieter/Seminar/
2/15	Rutgers University	DIMACS Discrete Math--Theory of Computing Seminar Speaker: Yuval Rabani, The Technion, Haifa, Israel Title: Tighter lower bounds for nearest neighbor search and related problems in the cell probe model 4:30-5:30, CORE Building, Room 431, Rutgers University
2/16	Rutgers University	Computational Intractability Reading Seminar Paper: The Shortest Vector Problem is NP-hard to Approximate within some Constant by: D. Micciancio Chief Reader: Dieter van Melkebeek. 1:30 - 2:45. DIMACS Center, CoRE 431, Rutgers University, Piscataway, NJ See: http://dimacs.rutgers.edu/~dieter/Seminar/
2/20-2/22	Princeton, NJ	Workshop: Computing Approximate Solutions to NP-hard Problems Nassau Inn, Princeton, NJ See: http://dimacs.rutgers.edu/Workshops/Approx/
2/23-2/24	Princeton, NJ	Mini-Workshop: Faster Exact Solutions for NP Hard Problems Nassau Inn, Princeton, NJ See: http://dimacs.rutgers.edu/Workshops/Faster/
2/29	Rutgers University	DIMACS Discrete Math--Theory of Computing Seminar Speaker: Uri Feige, Weizmann Institute Title: Approximation Algorithms for Grapg Bisection 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 February 25, 2000.