Monday, January 18

Session 21
Computational Geometry IV

1:30 PM-2:50 PM
Room: Liberty A
Chair: Craig Benham, Mount Sinai School of Medicine

1:30-1:47 Minimizing Wirelength in Zero and Bounded Skew Clock Trees
Moses Charikar, Stanford University; Jon Kleinberg, Cornell University; Ravi Kumar, Sridhar Rajagopalan, and Andrew Tomkins, IBM Almaden Research Center; and Amit Sahai, Massachusetts Institute of Technology
1:50-2:07 Computing Nearest Neighbors for Moving Points and Applications to Clustering
Tapas Kanungo and David M. Mount, University of Maryland, College Park; Nathan Netanyahu, University of Maryland, College Park and CESDIS, NASA Goddard Space Flight Center; Christine Piatko, Johns Hopkins University; Ruth Silverman, University of the District of Columbia; and Angela Y. Wu, The American University
2:10-2:27 Certified Computation of the Sign of a Matrix Determinant
Victor Y. Pan and Yanqiang Yu, Lehman College, City University of New York
2:30-2:47 A Simple Provable Algorithm for Curve Reconstruction
Tamal K. Dey, Max-Planck Institut für Informatik, Saarbrücken, Germany; and Piyush Kumar, Indian Institute of Technology Karagpur, India

SODA'99 Home


Program Updates

Author Index




tjf, 9/12/98, MMD, 11/2/98