Berk Birand received the Best Theory Session Talk award at the ACM S3’2010 workshop co-located with ACM MobiCom and ACM MobiHoc 2010.

He presented his paper entitled “Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory” co-authored with Maria Chudnovsky, Bernard Ries, Paul Seymour, Gil Zussman, and Yori Zwols. The paper focuses on identifying graph topologies for which distributed scheduling algorithms are optimal. It also improves the known bounds for the performance of greedy scheduling algorithms operating in input-queued switches. The paper was also presented in IEEE Infocom’10 where it was one of 8 papers nominated for a best paper award.