8. SEA 2009:
: Parallelism in Current and Future Processors - Challenges and Support for Designing Optimal Algorithms.
Michael A. Bender
: From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering.
: Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays.
, Anand Srivastav
: Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.