World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
53
Citations
9462
World Ranking
4892
National Ranking
2271

Research.com Recognitions

  • 2020 - ACM Distinguished Member
  • 2014 - ACM Senior Member

Overview

Michael A. Bender is affiliated with Stony Brook University in the United States. Their research primarily focuses on multiple areas within computer science, including algorithms and data compression, caching and content delivery, advanced data storage technologies, graph theory and algorithms, cloud computing and resource management, parallel computing and optimization techniques, and optimization and search problems.

Their recent publications reflect ongoing contributions to these fields. Notable papers include:

  • Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once, 2023, Journal of the ACM
  • Online List Labeling: Breaking the log2n Barrier, 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • IcebergHT: High Performance Hash Tables Through Stability and Low Associativity, 2023, Proceedings of the ACM on Management of Data
  • GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams, 2022, Proceedings of the 2022 International Conference on Management of Data
  • External-memory Dictionaries in the Affine and PDAM Models, 2021, ACM Transactions on Parallel Computing

Michael A. Bender collaborates frequently with a group of scholars, including Martı́n Farach-Colton, William Kuszmaul, Alex Conway, Guido Tagliavini, and Rob Johnson. These collaborations have resulted in numerous co-authored works in their areas of interest.

The scientist publishes regularly in several academic venues. Key publication venues include:

  • arXiv (Cornell University)
  • Proceedings of the ACM on Management of Data
  • ACM Transactions on Database Systems
  • ACM Transactions on Algorithms
  • Journal of the ACM

Michael A. Bender's work is classified broadly under computer science, with a significant number of publications also categorized in several specific subfields such as computer networks and communications, artificial intelligence, computer vision and pattern recognition, computational theory and mathematics, and information systems.

Awards recognizing Michael A. Bender include distinctions from the Association for Computing Machinery (ACM), such as ACM Senior Member awarded in 2014 and ACM Distinguished Member awarded in 2020.

Best Publications

  • The LCA Problem Revisited

    Michael A. Bender;Martin Farach-Colton

  • Cache-Oblivious B-Trees

    Michael A. Bender;Erik D. Demaine;Martin Farach-Colton

  • Flow and stretch metrics for scheduling continuous job streams

    Michael A. Bender;Soumen Chakrabarti;S. Muthukrishnan

  • Lowest common ancestors in trees and directed acyclic graphs

    Michael A. Bender;Martín Farach-Colton;Giridhar Pemmasani;Steven Skiena

  • The level ancestor problem simplified

    Michael A. Bender;Martín Farach-Colton

  • The power of team exploration: two robots can learn unlabeled directed graphs

    M.A. Bender;D.K. Slonim

  • Don't thrash: how to cache your hash on flash

    Michael A. Bender;Martin Farach-Colton;Rob Johnson;Russell Kraner

  • The power of a pebble: exploring and mapping directed graphs

    Michael A. Bender;Antonio Fernández;Dana Ron;Amit Sahai

  • Two simplified algorithms for maintaining order in a list

    Michael A. Bender;Richard Cole;Erik D. Demaine;Martin Farach-Colton

  • Cache-oblivious streaming B-trees

    Michael A. Bender;Martin Farach-Colton;Jeremy T. Fineman;Yonatan R. Fogel

  • Don't thrash: how to cache your hash on flash

    Michael A. Bender;Martin Farach-Colton;Rob Johnson;Bradley C. Kuszmaul

  • A locality-preserving cache-oblivious dynamic dictionary

    Michael A. Bender;Ziyang Duan;John Iacono;Jing Wu

  • High-Performance Streaming Dictionary

    Michael A. Bender;Martin Farach-Colton;Yonatan R. Fogel;Zardosht Kasheff

  • A General-Purpose Counting Filter: Making Every Bit Count

    Prashant Pandey;Michael A. Bender;Rob Johnson;Rob Patro

  • TEASAR: tree-structure extraction algorithm for accurate and robust skeletons

    M. Sato;I. Bitter;M.A. Bender;A.E. Kaufman

  • Cache-oblivious priority queue and graph algorithm applications

    Lars Arge;Michael A. Bender;Erik D. Demaine;Bryan Holland-Minkley

  • Optimal Covering Tours with Turn Costs

    Esther M. Arkin;Michael A. Bender;Erik D. Demaine;Sándor P. Fekete

  • Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments

    Tien-Ruey Hsiang;Esther M. Arkin;Michael A. Bender;Sándor P. Fekete

  • Adversarial contention resolution for simple channels

    Michael A. Bender;Martin Farach-Colton;Simai He;Bradley C. Kuszmaul

  • Concurrent cache-oblivious b-trees

    Michael A. Bender;Jeremy T. Fineman;Seth Gilbert;Bradley C. Kuszmaul

Frequent Co-Authors

Seth Gilbert
Seth Gilbert National University of Singapore
Joseph S. B. Mitchell
Joseph S. B. Mitchell Stony Brook University
Cynthia A. Phillips
Cynthia A. Phillips Sandia National Laboratories
Steven Skiena
Steven Skiena Stony Brook University
Sándor P. Fekete
Sándor P. Fekete Technische Universität Braunschweig
Seth Pettie
Seth Pettie University of Michigan–Ann Arbor
Richard Cole
Richard Cole New York University
Gerth Stølting Brodal
Gerth Stølting Brodal Aarhus University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science opens up diverse online education and career opportunities. For those seeking quick entry into the tech workforce, 1 year associate degree programs online can provide a strong foundation in essential IT and computing skills—often in less time and at lower cost.

If you want to upskill or advance your career quickly, consider enrolling in a fastest online master's degree in fields like computer science, data analytics, or cybersecurity. These accelerated programs are designed to help you graduate sooner and start benefiting from advanced credentials.

For long-term career growth, it’s important to choose qualifications that lead to roles employers are actively seeking. Some of the most in demand masters degrees include AI, software engineering, and information systems—all crucial areas in tech today.

Additionally, earning relevant certifications for jobs can offer a fast track to high-paying positions. These credentials focus on current skillsets that many employers prioritize, making them a smart addition to your academic pathway.

Best Scientists Citing Michael A. Bender

Trending Scientists

Recently Published Articles