Monteverde Cloud Forest, Costa Rica

Michael A. Bender Associate Professor Head, Computer Science Honors Program Department of Computer Science State University of New York at Stony Brook Stony Brook, NY 11794-4400  USA Tel.: +1 631-632-7835  Fax: +1 631-632-8334  E-mail: bendercssunysbedu

Education

Harvard University.  PhD 1998 and SM 1995 in Computer Science.
Advisor: M. Rabin.
Thesis: New Algorithms and Metrics for Scheduling.

Ecole Normale Supérieure de Lyon, France.  Diplôme d'Etudes Approfondies (DEA) d'Informatique Fondamentale and Magistère d'Informatique et de Modelisation. Mention bien, 1993.

Harvard University. BA Magna Cum Laude with Highest Honors in Applied Mathematics, 1992.

Teaching

• CSE 350  Theory of Computation: Honors (Spring 2007)
• CSE 638  Advanced Graduate Analysis of Algorithms (Spring 2007)
• CSE 642  Algorithms Seminar (Spring 2007)

Past Teaching

• CSE 150  Honors Foundations of Computer Science (Fall 2006, Fall 2005)
• CSE 350  Theory of Computation: Honors (Spring 2006)
• CSE 303  Introduction to the Theory of Computation (Spring 2005)
• CSE 373  Undergraduate Analysis of Algorithms (Spring 2005,Spring 2002, Spring 2001, Spring 1999)
• CSE 548  Graduate Analysis of Algorithms  (Fall 2002, Fall 2001, Fall 2000, Fall 1999, Fall 1998)
• CSE 638  Advanced Graduate Analysis of Algorithms  (Fall 2006, Spring 2005; as CSE 648: Spring 2003, Spring 2002, Spring 2000)
• CSE 642  Algorithms Reading Group (Spring 2005; as CSE 652: Spring 2003, Fall 2003, Spring 2002, Fall 2001, Spring 2001, Fall 2000, Spring 2000, Fall 1999)
• MIT 6.895  Theory of Parallel Systems (Fall 2003)
• MIT 6.896  Theory of Parallel Hardware (Spring 2004)

Awards

1. Undergraduate Teaching Award, Dept of Computer Science, SUNY Stony Brook, 2006.

2. R&D; 100 Award for Compute Process Allocator, 2006. Joint award with V. Leung (Sandia Labs), D. Bunde (UIUC), K. Pedretti (Sandia Labs), C. Phillips (Sandia Labs).

3. PODS Best Newcomer Award, 2006.
4. Dean's Award for Excellence in Graduate Teaching by a Faculty Member, SUNY Stony Brook, 2005.
5. Graduate Teaching Award, Dept of Computer Science, SUNY Stony Brook, 2000.

Startup

• I have a startup called Tokutek, along with Tokutek co-founder Martin Farach-Colton, Tokutek co-founder Tokutek co-founder Bradley Kuszmaul, and Tokutek co-founder Dave Wells.

Program Committees

1. 10th Annual Fall Workshop on Computational Geometry 2000
2. Genetic and Evolutionary Computation COnference (GECCO) 2001
3. 1st International Workshop on Efficient Algorithms (WEA) 2001
4. Latin American Theoretical INformatics (LATIN) 2002
5. Genetic and Evolutionary Computation COnference (GECCO) 2002
6. 5th Workshop on Algorithm Engineering and Experiments (ALENEX) 2003
7. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2003
8. 10th International Conference on High Performance Computing (HiPC) 2003
9. Latin American Theoretical INformatics (LATIN) 2004
10. 3rd International Conference on FUN with Algorithms (FUN) 2004
11. 11th International Conference on High Performance Computing (HiPC) 2004
12. Genetic and Evolutionary Computation COnference (GECCO) 2004
13. 15th Annual International Symposium on Algorithms and Computation (ISAAC) 2004
14. 10th Annual International Computing and Combinatorics Conference (COCOON) 2004
15. 13th Annual European Symposium on Algorithms (ESA) 2005
16. 2nd Multidisciplinary International Conference on Scheduling (MISTA) 2005
17. 12th International Conference on High Performance Computing (HiPC) 2005 (Vice-Chair, Algorithms Track)
18. 11th European Conference on Parallel Processing (Euro-Par) 2005 (Vice-Chair, Scheduling and Load Balancing)
19. 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS) 2006
20. 12th International Conference on Parallel and Distributed Systems (ICPADS), 2006
21. 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2006
22. 13th String Processing and Information Retrieval (SPIRE) 2006
23. 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS) 2007
24. Workshop on Programming Models for Grid Computing (PMGC) 2007

Other Selected Professional Activities

1. Publicity Chair. Symposium on Parallelism in Algorithms and Architectures (SPAA), 2000-present.
2. Co-organizer. Dagstuhl Seminar 04301: Cache-Oblivious and Cache-Aware Algorithms, July 18-23, 2004.
3. Co-organizer. CIRM Center at Marseille-Luminy: Scheduling Algorithms for New Emerging Applications, May 29-June 2, 2006.

Patents

• 6,112,221. "A System and Method for Scheduling Webservers with a Quality-of-Service Guarantee for Each User." M. A. Bender, S. Chakrabarti, and S. Muthukrishnan.
• United States Patent Application Serial No. 11/110,466. Fault Tolerant, Deadlock-Free Routing, and Routing-Based Processor Allocation in a Multiple Processor Computing Apparatus. V. J Leung, M. A. Bender, D. P. Bunde, and C. A. Phillips.

Refereed Journal Publications

1. M. A. Bender and H. A. Stone. "An Integral Equation Approach to the Study of the Steady-State Current at Surface Microelectrodes." Journal of Electroanalytical Chemistry and Interfacial Chemistry, 351:29-55, 1993.
2. M. A. Bender, M. Gastaldo, and M. Morvan. "Parallel Interval Order Recognition and Construction of Interval Representations." Theoretical Computer Science, 143(1):73-91, 1995.
3. Y. Aumann, M. A. Bender, and L. Zhang. "Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems." Information and Computation, 139(1):1-16, 1997. Online publication.
4. M. A. Bender and C. Chekuri. "Performance Guarantees for the TSP with a Parameterized Triangle Inequality." Information Processing Letters, 73:17-21, 2000. Online publication.
5. M. Sato, I. Bitter, M. A. Bender, A. E. Kaufman, and M. Nakajima. "Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons" (in Japanese). The Journal of the Institute of Image Information and Television Engineers, 2000.
6. C. Chekuri and M. A. Bender. "An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines." Journal of Algorithms, 41:212-224, 2001.
7. M. A. Bender and D. Ron. "Testing Properties of Directed Graphs: Acyclicity and Connectivity." Random Structures and Algorithms, 20(2): 184-205, 2002. Online publication.
8. M. Andrews, M. A. Bender, and L. Zhang. "New Algorithms for the Disk Scheduling Problem." Algorithmica, 32(2): 277-301, 2002. Online publication.
9. M. A. Bender and M. O. Rabin. "Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk." Theory of Computing Systems Special Issue on SPAA '00, 35: 289-304, 2002. Online publication.
10. M. A. Bender, A. Fernández, D. Ron, A. Sahai, and S. Vadhan. "The Power of a Pebble: Exploring and Mapping Directed Graphs. Information and Computation, 176(1):1-21, 2002. Online publication.
11. E. M. Arkin, M. A. Bender, J. S. B. Mitchell, and S. S. Skiena. "The Lazy Bureaucrat Scheduling Problem." Information and Computation, 184 (1):129-146, 2003. Online publication.
12. C. M. Bender, M. A. Bender, E. Demaine, and S. Fekete. "What Is the Optimal Shape of a City?" Journal of Physics A: Mathematical and General, 37(1):147-159, 2004. Online publication.
    Journal of Physics A: Mathematical and General #1 Most Downloaded Article in 2004.
    See Kuro5him a popular description of this paper.
13. M. A. Bender and M. Farach-Colton. "The Level Ancestor Problem Simplified." Theoretical Computer Science Special Issue on LATIN '02, 321(1):5-12, 2004. Online publication.
14. E. Arkin, M. A. Bender, E. Demaine, M. Demaine, J. Mitchell, S. Sethia, and S. Skiena. "When Can You Fold a Map?" Computational Geometry: Theory and Applications (CGTA), 29(1):23-46, 2004. Special issue of selected papers from the 10th Annual Fall Workshop on Computational Geometry, 2000.
15. M. Sztainberg, E. M. Arkin, M. A. Bender, and J. S. B. Mitchell. "Theoretical and Experimental Analysis of Heuristics for the Freeze-Tag Robot Awakening Problem." IEEE Transactions on Robotics and Automation, 20(4):691-701, 2004.
16. M. A. Bender, S. Muthukrishnan, and R. Rajaraman. "Approximation Algorithms for Average Stretch Scheduling." Journal of Scheduling Special Issue on SODA 02, 7(3):195-222, 2004.
17. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. "A Locality-Preserving Cache-Oblivious Dynamic Dictionary." Journal of Algorithms, 3(2):115-136, 2004. Online publication.
    Journal of Algorithms Hottest Article, #1 Most Downloaded in 2004. Hottest article.
18. M. A. Bender, S. Sethia, and S. Skiena. "Data Structures for Maintaining Set Partitions." Random Structures and Algorithms, 25:43-67, 2004.
19. Y. Aumann and M. A. Bender. "Efficient Low-Contention Asynchronous Consensus with the Value-Oblivious Adversary Scheduler." Distributed Computing, 17(3): 191-207, 2005.
20. M. A. Bender, E. Demaine, and M. Farach-Colton. "Cache-Oblivious B-Trees." SIAM Journal on Computing, 35(2):341-358, 2005.
21. E. M. Arkin, M. A. Bender, E. D. Demaine, S.P. Fekete, J. S. B. Mitchell, and S. Sethia. "Optimal Covering Tours with Turn Costs." SIAM Journal on Computing, 35(3): 531-566, 2005.
22. M. A. Bender, M. Farach-Colton, G. Pemmasani, S. S. Skiena, P. Sumazin. "Lowest common ancestors in trees and directed acyclic graphs." Journal of Algorithms, 57(2): 75-94, 2005.
23. M. A. Bender, M. Farach-Colton, and M. Mosteiro. "Insertion Sort is O(n log n)." Theory of Computing Systems, 39(3): 391-397, 2006. Special Issue on LATIN '04.
24. E. M. Arkin, M. A. Bender, S. P. Fekete, J. S. B. Mitchell, and M. Skutella. "The Freeze-Tag Problem: How to Wake Up a Swarm of Robots." To appear in Algorithmica, 2007.
25. L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. "Cache-Oblivious Priority Queue and Graph Algorithm Applications." SIAM Journal on Computing, 36(6): 1672--1695, 2007.
26. M. A. Bender, B. Bradley, G. Jagannathan, and K. Pillaipakkamnatt. "Sum-of-Squares Heuristics for Bin Packing and Memory Allocation." To appear in Journal of Experimental Algorithms, 2007.
27. C. M. Bender and M. A. Bender. "Optimal Shape of a Blob." Journal of Mathematical Physics, 2007. 48, 073518, 2007.
28. M. A. Bender, D. P. Bunde, E. D. Demaine, S. P. Fekete, V. J. Leung, H. Meijer, and C. A. Phillips. "Communication-Aware Processor Allocation for Supercomputers." Algorithmica Special Issue on WADS '05, 2007. To appear.
29. M. A. Bender, R. Clifford, and K. Tsichlas. "Scheduling Algorithms for Procrastinators." Journal of Scheduling, 2007. To appear.
30. M. A. Bender, D. Ge, S. He, H. Hu, R. Pinter, S. Skiena, and F. Swidan. " Improved Bounds on Sorting with Length-Weighted Reversals." Journal of Computer and Systems Sciences, 2007. To appear.
31. M. A. Bender and H. Hu. "An Adaptive Packed-Memory Array." Transactions on Database Systems Special Issue on PODS '06, 2007. To appear.

Refereed Conference Publications

32. M. A. Bender and D. K. Slonim. "The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs." Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 75-85, 1994.
33. Y. Aumann and M. A. Bender. "Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler." Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP), pages 622-633, 1996.
34. M. Andrews, M. A. Bender, and L. Zhang. "New Algorithms for the Disk Scheduling Problem." Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), pages 580-589, 1996.
35. Y. Aumann and M. A. Bender. "Fault Tolerant Data Structures." Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), pages 580-589, 1996.
36. Y. Aumann, M. A. Bender, and L. Zhang. "Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems." Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 270-276, 1996.
37. M. A. Bender, S. Chakrabarti, and S. Muthukrishnan. "Flow and Stretch Metrics for Scheduling Continuous Job Streams." Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 270-279, 1998.
38. M. A. Bender, A. Fernández, D. Ron, A. Sahai, and S. Vadhan. "The Power of a Pebble: Exploring and Mapping Directed Graphs." Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), pages 269-278, 1998.
39. C. Chekuri and M. Bender. "An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines." Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 383-393. 1998.
40. E. M. Arkin, M. A. Bender, J. S. B. Mitchell, and S. S. Skiena. "The Lazy Bureaucrat Scheduling Problem." Proceedings of the 6th Workshop on Discrete Algorithms (WADS), pages 80-85, 1999.
41. M. A. Bender and C. Chekuri. "Performance Guarantees for the TSP with a Parameterized Triangle Inequality." Proceedings of the 6th Workshop on Discrete Algorithms (WADS), pages 122-133, 1999.
42. M. A. Bender and M. Farach-Colton. "The LCA Problem Revisited." LATIN, pages 88-94, 2000.
43. M. A. Bender, S. Sethia, and S. Skiena. "Data Structures for Maintaining Set Partitions." Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT), pages 83-96, 2000.
44. M. A. Bender and D. Ron. "Testing Acyclicity of Directed Graphs in Sublinear Time." Proceedings of the 27th International Colloquium on Automata, Languages, and Programming (ICALP), pages 809-820, 2000.
45. M. A. Bender and M. O. Rabin. "Scheduling Cilk Multithreaded Parallel Programs on Processors of Different Speeds." Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 13-21, 2000.
46. I. Bitter, M. Sato, M. A. Bender, K. T. McDonnell, A. Kaufman, and M. Wan. "CEASAR: A Smooth, Accurate, and Robust Centerline Extraction Algorithm." IEEE Visualization 2000, pages 45-52, October 2000.
47. M. Sato, I. Bitter, M. A. Bender, and A. Kaufman. "TEASAR: Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons." Proceedings of the 8th Pacific Conference on Computer Graphics and Applications Graphics, pages 281-287, 2000.
48. M. A. Bender, E. Demaine, and M. Farach-Colton. "Cache-Oblivious B-Trees." Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 399-409, 2000.
49. E. Arkin, M. A. Bender, E. Demaine, S. P. Fekete, J. S. B. Mitchell, and S. Sethia. "Optimal Covering Tours with Turn Costs." Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 138-147, 2001.
50. M. A. Bender, G. Pemmasani, P. Sumazin, and S. Skiena. "Least Common Ancestors in Directed Acyclic Graphs." Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 845-854, 2001. Code for finding LCA in trees and DAGS.
51. E. Arkin, M. A. Bender, E. D. Demaine, M. L. Demaine, J. S. B. Mitchell, S. Sethia, and S. Skiena. "When Can You Fold a Map?" Proceedings of the 7th Workshop on Discrete Algorithms (WADS), pages 401-413, 2001.
52. E. Arkin, M. A. Bender, S. Fekete, J. Mitchell, and M. Skutella. "The Freeze-Tag Problem:  How to Wake Up a Swarm of Robots." Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 568-577, 2002.
53. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. "A Locality-Preserving Cache-Oblivious Dynamic Dictionary." Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 29-38, 2002.
54. M. A. Bender, S. Muthukrishnan, and R. Rajaraman. "Improved Algorithms for Stretch Scheduling." Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 762-771, 2002.
55. M. A. Bender and M. Farach-Colton. "The Level Ancestor Problem Simplified." LATIN, pages 508-515, 2002.
56. L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. "Cache-Oblivious Priority Queue and Graph Algorithm Applications." Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 268-276, 2002.
57. M. A. Bender, R. Cole, and R. Raman. "Exponential Structures for Cache-Oblivious Algorithms." Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP), 2002.
58. M. Sztainberg, E. M. Arkin, M. A. Bender, and J. S. B. Mitchell. "Analysis of Heuristics for the Freeze-Tag Problem." Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT), pages 270-279, 2002.
59. M. A. Bender, R. Cole, E. Demaine, and M. Farach-Colton. "Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy." Proceedings of the 10th European Symposium on Algorithms (ESA), pages 139-151, 2002.
60. M. A. Bender, R. Cole, E. Demaine, M. Farach-Colton, and J. Zito. "Two Simplified Algorithms for Maintaining Order in a List." Proceedings of the 10th European Symposium on Algorithms (ESA), pages 152-164, 2002.
61. M. A. Bender, E. Demaine, and M. Farach-Colton. "Efficient Tree Layout in a Multilevel Memory Hierarchy." Proceedings of the 10th European Symposium on Algorithms (ESA), pages 165-173, 2002. Full Version.
62. V. Leung, E. Arkin, M. A. Bender, D. Bunde, J. Johnston, A. Lal, J. Mitchell, C. Phillips, and S. Seiden. "Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies." Proceedings of the 4th IEEE International Conference on Cluster Computing (CLUSTER), pages 296-304, 2002. Full Version as Sandia Report SAND2002-1488.
63. T.-R. Hsiang, E. Arkin, M. A. Bender, S. Fekete, and J. Mitchell. "Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments." Proceedings of the 5th Workshop on Algorithmic Foundations of Robotics (WAFR), 77-94, 2002.
64. T.-R. Hsiang, E. Arkin, M. A. Bender, S. Fekete, and J. Mitchell. "Online Dispersion Algorithms for Swarms of Robots." Proceedings of the 19th Annual ACM Symposium on Computational Geometry (SoCG), Video/DVD, pp. 382-383, 2003. [MPEG-1] [QuickTime] [Windows Media]
65. E. Arkin, M. A. Bender, D. Ge, S. He, and J. Mitchell. "Improved Approximation Algorithms for the Freeze-Tag Problem." Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 295-303, 2003.
66. 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." Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS), pages 271-280, 2003.
67. M. A. Bender, D. Ge, S. He, H. Hu, R. Pinter, S. Skiena, and F. Swidan. "Improved Bounds on Sorting with Length-Weighted Reversals." Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 912-921, 2004.
68. M. A. Bender, B. Bradley, G. Jagannathan, and K. Pillaipakkamnatt. "The Robustness of the Sum-of-Squares Algorithm for Bin Packing." Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX), 2004.
69. M. A. Bender, J. T. Fineman, S. Gilbert, and C. E. Leiserson. "On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs." Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 133-144, 2004.
70. M. A. Bender, M. Farach-Colton, and M. Mosteiro. "Insertion Sort is O(n log n)." Proceedings of the 3rd International Conference on Fun with Algorithms (FUN), pages 16-23, 2004.
71. F. Swidan, M. A. Bender, D. Ge, S. He, H. Hu, and R. Pinter. "Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity." Proceedings of the 15th Annual Combinatorial Pattern Matching Symposium (CPM), volume 3109 of Lecture Notes in Computer Science, pages 32-46, 2004.
72. M. A. Bender, J. T. Fineman, S. Gilbert, and B. C. Kuszmaul. "Concurrent Cache-Oblivious Search Trees." Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 228-237, 2005.
73. M. A. Bender, M. Farach-Colton, S. He, B. C. Kuszmaul, and C. E. Leiserson. "Adversarial Contention Resolution for Simple Channels." Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 325-332, 2005.
74. M. A. Bender, D. P. Bunde, E. D. Demaine, S. P. Fekete, V. J. Leung, and H. Meijer. "Communication-Aware Processor Allocation for Supercomputers." Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS), pages 169-181, 2005.
75. M. A. Bender and H. Hu. "An Adaptive Packed-Memory Array." Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pages 20-29, 2006.
    Winner: Best Newcomer Award.
76. M. A. Bender, M. Farach-Colton, B. C. Kuszmaul. "Cache-Oblivious String B-Trees." Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pages 233-242 2006.
77. E. M. Arkin, M. A. Bender, J. S. B. Mitchell, V. Polishchuk. "The Snowblower Problem." Proceedings of the 7th Workshop on Algorithmic Foundations of Robotics (WAFR), 2006.
78. M. A. Bender, J. T. Fineman, and S. Gilbert. "Contention Resolution with Heterogeneous Job Sizes." Proceedings of the 14th Annual European Symposium on Algorithms (ESA), pages 112-123, 2006.
79. M. A. Bender, G. S. Brodal, R. Fagerberg, R. Jacob, and E. Vicari. "Optimal Sparse Matrix Dense Vector Multiplication in the {I/O}-Model." To appear in Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2007.
80. M. A. Bender, M. Farach-Colton, J. T. Fineman, Y. Fogel, B. C. Kuszmaul, and J. Nelson. "Cache-Oblivious Streaming B-Trees." To appear in Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2007.
81. M. A. Bender and C. A. Phillips. "Scheduling DAGs on Asynchronous Processors." To appear in Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2007.