Monday Afternoon, January 29, 1996
Sherwood Room

Session 8

Chair: Satish B. Rao, NEC Research Institute
9:00-9:20 Matching Nuts and Bolts in O(n log n) Time
Janos Komlos, Rutgers University; Yuan Ma, Stanford University; and Endre Szemeredi, Rutgers University
9:25-9:45 Depth Optimal Sorting Networks Resistant to k Passive Faults
Marek Piotrow, University of Wroclaw, Poland
9:50-10:10 Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations
Mordecai J. Golin, Hong Kong University of Science and Technology, Hong Kong
10:15-10:35 An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs
Andrei Z. Broder, Digital Systems Research Center; Alan M. Frieze and Stephen Suen, Carnegie Mellon University; and Eli Upfal, IBM Almaden Research Center and The Weizmann Institute of Science, Israel

Registration | Hotel Information | Transportation | Author Index