Michael A. Bender

Rank/Position Title:

Associate Professor

Home Page:

http://www.cs.sunysb.edu/~bender

Date of original appointment to this faculty, followed by dates and ranks of advancement:

• Assistant Professor (September 1998-August 2004)
• Associate Professor (September 2004-present)

Degrees:

Conferences, workshops, and professional development:

• 5th Workshop on Algorithm Engineering and Experiments (ALENEX), January 2003, Baltimore, MD
• 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2003, Baltimore, MD
• 35th Annual ACM Symposium on Theory of Computing (STOC), June 2003, San Diego, CA
• DOE SCaLeS "Science Case for Large Scale Simulation" Workshop, 2003, Washington, DC
• 44th Annual Symposium on Foundations of Computer Science (FOCS), Cambridge, MA, October 2003
• 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, January 2004
• 6th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, January 2004
• SIAM Conference on Parallel Processing for Scientific Computing (SIAM PP04), February 2004, San Francisco, CA
• SIAM Workshop on Combinatorial Scientific Computing, February 2004, San Francisco, CA
• 6th Symposium on Latin American Theoretical INformatics (LATIN), April 2004, Buenos Aires, Argentina

Other related computing experience:

VISITING POSITIONS

• Visiting Research Fellow: Dept of Computer Science, Kings College London, 2004-present
• Visiting Scientist. Computer Science and AI Laboratory, MIT, 2003-2004.
• Research Associate. Bell Laboratories, Lucent Technologies, Murray Hill, summer 1996.

TEACHING AWAY FROM STONY BROOK

• MIT 6.895 Theory of Parallel Systems, Fall 2003. Approximately 20 students.
• MIT 6.896 Theory of Parallel Hardware, Spring 2004. Approximately 20 students.
• Advanced Topics in Data Structures (in Spanish), July 1999. Escuela de Ciencias Informaticas, U Buenos Aires, Argentina. Approximately 110 students.
• Data Structures and Algorithms for Massive Data Sets (in Spanish), July 2005 (anticipated). Escuela de Ciencias Informaticas, U Buenos Aires, Argentina.

OTHER SELECTED PROFESSION ACTIVITIES

• Co-organizer. Dagstuhl Seminar 04301: Cache-Oblivious and Cache-Aware Algorithms, 2004.
• Publicity Chair. Symposium on Parallelism in Algorithms and Architectures (SPAA), 2000-2005.
• Guest editor. Journal of Algorithms Special Issue on SODA 2004.
• Editor. Journal of Discrete Algorithms, 2004-present.

Department, college, and/or university committee membership:

• Member, Graduate Admissions Committee, 1998-2002
• Member, School of Engineering Scholarship Committee, 2001
• Organizer, Theory Qualifier, 1999, 2003
• CS Representative, Women in Science and Engineering (WISE), Course Counseling, 2002
• Host, Distinguished Lecturers (Bentley, Farach-Colton, Hart, Leiserson), 2001-2003
• CS Representative, Strategic Plan Advisory and Coordinating Committee (SPACC), 2002
• Chair, Visibility/PR Committee, 2003-2004
• Member, CEWIT Building Committee, 2003
• Founder, Research Lunches, 2003
• Judge, Graduate Student Research Conference, 2003

Principal publications of the last five years.

REFEREED JOURNAL PUBLICATIONS IN LAST FIVE YEARS

• C. Chekuri and M. A. Bender. An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. Journal of Algorithms, 41:212-224, 2001.
• M. A. Bender and D. Ron. Testing Properties of Directed Graphs: Acyclicity and Connectivity. Random Structures and Algorithms, 20(2): 184-205, 2002.
• M. Andrews, M. A. Bender, and L. Zhang. New Algorithms for the Disk Scheduling Problem. Algorithmica, 32(2): 277-301, 2002.
• 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.
• M. A. Bender, A. Fernandez, 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.
• 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.
• C. M. Bender, M. A. Bender, E. D. Demaine, S. P. Fekete. What is the Optimal Shape of a City? Journal of Physics A: Mathematical and General, 37:147-159, 2004.
• 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.
• E. M. 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? 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.
• 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.

Other scholarly activity: grants, sabbaticals, software development, etc.:

• CoPI: "Algorithms in Support of Scalable Tactical Imagery eXploitation," subcontract from ISX Corporation on a grant from DARPA. $40,000 (with E. M. Arkin, AMS, and J. Mitchell, AMS).Award effective: 8/1/99-12/25/00.
• CoPI: "Algorithms in Support of Pheromone Robotics,"subcontract from HRL Laboratories on a grant from DARPA. $171,062 (with E. M. Arkin, AMS, and J. Mitchell, AMS). Award effective: 9/1/99-9/1/2002.
• CoPI: "ITR/SY(CISE): Cache-Oblivious Data Structures,"National Science Foundation (with L. Arge, Duke, and E. Demaine, MIT). $449,571, $161,529 SUNY portion. Award effective: 9/1/2001-8/31/2004.
• PI: "Algorithmic Support for Cplant Scheduling," Sandia National Laboratories. $46,132 (with E. M. Arkin, AMS). Award effective: 6/11/01-9/28/01.
• CoPI: "Nanoscale Single Electron Switching Arrays for Self-Evolving Neuromorphic Networks," National Science Foundation. $599,980 (with K. Likarev, Physics, J. Lukens, Physics, and A. Mayr, Physics). Award effective: 7/01/01-6/30/03.
• PI: "Data Structures and Algorithms for Maintaining Data Locality," National Science Foundation. $149,937. Award effective: 7/15/2002-6/30/2005.
• PI: "Algorithmic Support for Cplant Scheduling," Sandia National Laboratories. $20,351. Award effective: 6/11/02-9/20/02.
• PI: "Algorithmic Support for Cplant Scheduling," Sandia National Laboratories. $34,680. Award effective: 5/1/03-1/1/03.
• CoPI: "ITR: Transactions Everywhere," (with B. Kuszmaul, MIT, and C. Leiserson, MIT). $650,000, $100,000 SUNY portion. Award effective: 9/03-8/05.
• VIDEO PRODUCT   In ACM Symposium on Computational Geometry (SoCG), Video/DVD. http://www.cs.sunysb.edu/~bender/pub/SoCG03-video/SoCG03-video.mov.   SOFTWARE: The processor-allocation algorithms in the system software of Cplant, a supercomputer family at Sandia National Laboratories.   See V. Leung, E. M. Arkin, M. A. Bender, D. Bunde, J. Johnston, A. Lal, J. S. B. 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.   Cache-Oblivious Search Tree Software.M. A. Bender, M. Farach-Colton, B. Kuszmaul. This software will be made publically available on http://www.cs.sunysb.edu/~bender/and will be described in a publication to be submitted during Spring 2005.  

Scientific, professional, and honor societies of which you are a member:

• ACM
• SIGACT

Honors and awards:

• Graduate Teaching Award, Dept of Computer Science, SUNY Stony Brook, 2000.
• Rotary Fellowship at the Ecole Normale Supérieure de Lyon, France, 1992-1993.

Courses taught this and last academic year term-by-term section of the same course separately.

Academic advising:

Assigned advisor for 18 undergraduate students during 2004/2005 academic year

Brief description of major research and scholarly activities:

ALGORITHMS FOR MASSIVE DATA

• cache-oblivious algorithms and data structures

SCHEDULING AND RESOURCE ALLOCATION:

• - supercomputers
• - contention resolution
• - heterogeneous/homogeneous parallel systems
• - disks

PARALLEL COMPUTING

• - supercomputers
• - heterogeneous/homogeneous parallel systems
• - transactional memory

ALGORITHMS FOR ROBOT SWARMS AND SENSOR NETWORKS

• - pheromone robotics