Tuesday, January 19
Session 43
Parallel
Computation
3:00 PM-4:00 PM
Room: Carroll
Chair: Robert E. Tarjan, Princeton University
- 3:00-3:17
Moved
to Session 4
- Emulations Between QSM, BSP and LogP: A Framework for
General-Purpose Parallel Algorithm Design
- Vijaya Ramachandran, Brian Grayson, and Michael D. Dahlin,
University of Texas, Austin
- 3:20-3:37 Parallel Integer Sorting Is More Efficient than
Parallel Comparison Sorting on Exclusive Write PRAMs
- Yijie Han, Electronic Data Systems, Inc.; and Xiaojun Shen,
University of Missouri, Kansas City
- 3:40-3:57 On the Parallel Time Complexity of Undirected
Connectivity and Minimum Spanning Trees
- Ka Wong Chong, Max-Planck Institut für Informatik,
Saarbrücken, Germany; Yijie Han, Electronic Data Systems, Inc.;
and Tak Wah Lam, University of Hong Kong, China
tjf, 9/14/98, MMD, 12/4/98