------------------------------------------------------------------- Speaker: Professor Ed Coffmann Dept of EE Columbia University Topic: "The Dyadic Stream Merging Algorithm" Date: Friday, 22 March 2002 Time: 12 noon - 1:00pm Venue: Room 3006 (Phase I, via lift no. 3) HKUST Abstract: This talk will chronicle the experiences of performance modelers responding to a problem in multimedia stream merging posed by Richard Ladner. The new dyadic stream merging algorithm will be introduced and its average-case analysis worked out in detail. A proof of the near-optimality of this algorithm will also be presented. This work, joint with P. Jelenkovic and P. Momcilovic, appears to be the first rigorous average-case analysis of stream merging. *************** Biography: Professor Coffman rejoined the Columbia University E.E. faculty in the summer of 2000. During most of the period since his first appointment at Columbia, he spent 20 years at Bell Labs in Murray Hill, NJ. He is an IEEE Fellow, an ACM Fellow, and a Distinguished Member of Technical Staff (ret.) at Bell Labs. He is currently an editor for the Journal of Interconnection Networks, the Journal of Algorithms, and the Journal of Scheduling. In the past, he has also served as an editor for the Journal of the ACM and the SIAM Journal of Computing, among others. He has written well over 200 papers with well over 100 different collaborators. As one of the builders of the SDC/ARPA time-sharing system, which became fully operational at about the same time as the CTSS system at MIT, he qualifies as one of the many co-inventors of general purpose time-shared computers. His work on the same system, which created the first computer network, also makes him one of several co-inventors of computer networking. For enquiry, please call 2358 7008 ** All are Welcome ** --------------------------------------------------------------------------