• Kunal Agrawal, Charles E. Leiserson, and Jim Sukha. Executing Task Graphs Using Work-Stealing, Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS), April 19-23, 2010. Atlanta, GA, USA.
• Kunal Agrawal, Charles E. Leiserson, and Jim Sukha. Helper Locks for Fork-Join Parallel Programming, Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), January 9-14, 2010, Bangalore, India.
• K. Agrawal, M. A. Bender, and J. T. Fineman. The Worst Page-Replacement Policy, Theory of Computing Systems. 2009, Vol 44 p. 175. (Special Issue on FUN '07, 44(2): 175-185, 2009)
• M. A. Bender, G. S. Brodal, R. Fagerberg, R. Jacob, and E. Vicari. "Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model." Theory of Computing Systems, Special Issue on SPAA '07, 47(4): 934-962, 2010. [PDF] [postscript]
• M. A. Bender, B. C. Kuszmaul, S.-H. Teng, and K. Wang. "Optimal Cache-Oblivious Mesh Layouts." Theory of Computing Systems, 48(2): 269-296, 2011. [PDF] [postscript]
• E. M. Arkin, M. A. Bender, J. S. B. Mitchell and V. Polishchuk. The Snowblower Problem. International Joint Conferences on Artificial Intelligence 2010 In press.
• Bender, M. A.; Fekete, S. P.; Kamphans, T., and Schweer, N. Maintaining Arrays of Contiguous Objects. Proceedings of the 17th International Symposium on the Fundamentals of Computation Theory (FCT)} 2009. LLNCS Volume 6599, pages 14--25.
• Bender, M. A.; Hu, H.; and Kuszmaul, B. C. Performance Guarantees for B-trees with Different-Sized Atomic Keys. Proceedings of the 29th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) 2010.
• Mitrofanova, A.; Farach-Colton, M.; and Mishra, B. Efficient and Robust Prediction Algorithms for Protein Complexes using Gomory-Hu Tree. Pacific Symposium on Biocomputing (PSB '09).
• Bradley C. Kuszmaul, Brief Announcement: TeraByte TokuSampleSort Sorts 1TB in 197s. 21st ACM Symposium on Parallelism in Algorithms and Architectures, Aug 11-13, 2009 SPAA'09: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, pp. 127-129, 2009.
• M. Frigo, P. Halpern, C. E. Leiserson, and S. Lewin-Berlin. Reducers and Other Cilk plus plus Hyperobjects. 21st ACM Symposium on Parallelism in Algorithms and Architectures, Aug 11-13, 2009 SPAA'09: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, pp.79--, 2009.
• A. Buluc, J.T. Fineman, M.Frigo, J.R. Gilbert, and C.E.Leiserson. Parallel Sparse Matrix-Vector and Matrix-Transpose-Vector Multiplication Using Compressed Sparse Blocks. 21st ACM Symposium on Parallelism in Algorithms and Architectures, Aug 11-13, 2009 SPAA'09: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, pp.233--, 2009.
• J. Sukha. Brief Announcement: A Lower Bound for Depth-Restricted Work Stealing. 21st ACM Symposium on Parallelism in Algorithms and Architectures, Aug 11-13, 2009 SPAA'09: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, pp.124-126, 2009.
• Kunal Agrawal, I-Ting Angelina Lee, and Jim Sukha. Serial-Parallel Reciprocity in Dynamic Multithreaded Languages (Brief Announcement). Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 186-188, 2010}
• I-Ting Angelina Lee, Silas Boyd-Wickizer, Zhiyi Huang, and Charles E. Leiserson. Using Memory Mapping to Support Cactus Stacks in Work-Stealing Runtime Systems Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques (PACT), 2010. 
• M. A. Bender, G. S. Brodal, R. Fagerberg, D. Ge, S. He, H. Hu, J. Iacono, and A. López-Ortiz. "The Cost of Cache-Oblivious Searching." Algorithmica, 2011. In press. [PDF] [postscript]
• M. A. Bender, M. Farach-Colton, R. Johnson, B. C. Kuszmaul, D. Medjedovic, P. Montes, P. Shetty, R. P. Spillane, and E. Zadok. "Don't Thrash: How to Cache Your Hash on Flash." Proceedings of the 3rd USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage), 2011. [PDF] [postscript]
• M. A. Bender and S. Gilbert. "Mutual Exclusion with O(log^2 log n) Amortized Work." Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2011. To appear. [PDF] [postscript]

Selected Talks

• Michael A. Bender.  Performance of Fractal-Tree Databases. ScalPerf '09, September 20-25, 2009. Bertinoro (Forlì-Cesena), Italy. 
• Bradley C. Kuszmaul. Using Obliviousness to Achieve High Performance. ScalPerf '09, September 20-25, 2009. Bertinoro (Forlì-Cesena), Italy. 
• Bradley C. Kuszmaul. What is a Performance Model for SSD? High Performance Transaction Systems (HPTS), October 25-28, 2009, Asilomar, Pacific Grove, CA. (Note: A video of a shortened version of this talk is available at http://www.youtube.com/watch?v=z-_qlqb-O0Q.)
• Michael A. Bender. Performance of Fractal-Tree Databases. February 2010. Brookhaven National Laboratory. 
• Bradley C. Kuszmaul. How Fractal Trees Work, OpenSQL Camp 2009, Portland, OR USA. (Note: An expanded version was presented at the MySQL User Conference, Santa Clara, CA April 2010.)
• Bradley C. Kuszmaul. An Open-Source Storage Engine API, OpenSQL Camp 2009, Portland, OR USA.
• Michael A. Bender and Martin Farach-Colton. Fractal Tree Databases: Data Structures for Fun and Profit. March 2010. Dagstuhl Seminar on Data Structures. Dagstuhl, Germany.