Michael A. Bender
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
123
Venues
28
Active years
1994–2026
Best venue rank
A*
Where they publish
- BSPAA28 papers
- A*SODA19 papers
- A*FOCS12 papers
- A*STOC8 papers
- AESA7 papers
- A*PODS6 papers
- AFAST5 papers
- A*SIGMOD4 papers
- BLATIN4 papers
- BWADS4 papers
- NationalFUN3 papers
- A*ICALP3 papers
- AALENEX2 papers
- A*PODC2 papers
- BEuroPar2 papers
- CWAFR2 papers
- A*ASPLOS1 paper
- BECRTS1 paper
- AEuroSys1 paper
- BRECOMB1 paper
- AUSENIX1 paper
- BISAAC1 paper
- NationalCOCOON1 paper
- BFCT1 paper
- BCPM1 paper
- CCLUSTER1 paper
- Journal PublishedPG1 paper
- BIPCO1 paper
Papers
123 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SODA | History-Independent Load Balancing. | Michael A. Bender, William Kuszmaul, Elaine Shi, Rose Silver |
| 2026 | SPAA | The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically. | Michael A. Bender, Philip Bille, Martn Farach-Colton, Jeremy T. Fineman, Inge Li Grtz, Michael T. Goodrich, Hanna Komls, Bradley C. Kuszmaul, William Kuszmaul, Rose Silver, Todd Veldhuizen, Renfei Zhou |
| 2026 | SPAA | Fast Concurrent Primitives Despite Contention. | Michael A. Bender, Guy E. Blelloch, Martin Farach-Colton, Yang Hu, Rob Johnson, Rotem Oshman, Renfei Zhou |
| 2025 | ALENEX | Exploring the Landscape of Distributed Graph Sketching. | David Tench, Evan T. West, Kenny Zhang, Michael A. Bender, Daniel DeLayo, Martn Farach-Colton, Gilvir Gill, Tyler Seip, Victor Zhang |
| 2025 | STOC | History-Independent Concurrent Hash Tables. | Hagit Attiya, Michael A. Bender, Martn Farach-Colton, Rotem Oshman, Noa Schiller |
| 2025 | STOC | Optimal Non-oblivious Open Addressing. | Michael A. Bender, William Kuszmaul, Renfei Zhou |
| 2025 | SPAA | Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only). | Kunal Agrawal, Michael A. Bender, Kirk Pruhs, Benjamin Moseley, Clifford Stein |
| 2025 | SPAA | Don't Melt Your Cache: Low-Associativity with Heat-Sink. | Michael A. Bender, Alex Conway, Daniel DeLayo, Martin Farach-Colton, Jaehyun Han, Linfeng He, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Donald E. Porter, Evan West |
| 2024 | FOCS | Nearly Optimal List Labeling. | Michael A. Bender, Alex Conway, Martn Farach-Colton, Hanna Komls, Michal Kouck, William Kuszmaul, Michael E. Saks |
| 2024 | FOCS | Tight Bounds for Classical Open Addressing. | Michael A. Bender, William Kuszmaul, Renfei Zhou |
| 2024 | PODC | History-Independent Concurrent Objects. | Hagit Attiya, Michael A. Bender, Martn Farach-Colton, Rotem Oshman, Noa Schiller |
| 2024 | PODC | Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, John Kuszmaul, Maxwell Young |
| 2023 | ASPLOS | Mosaic Pages: Big TLB Reach with Small Pages. | Krishnan Gosakan, Jaehyun Han, William Kuszmaul, Ibrahim N. Mubarek, Nirjhar Mukherjee, Karthik Sriram, Guido Tagliavini, Evan West, Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Jayneel Gandhi, Rob Johnson, Sudarsun Kannan, Donald E. Porter |
| 2023 | ECRTS | The Safe and Effective Use of Low-Assurance Predictions in Safety-Critical Systems. | Kunal Agrawal, Sanjoy K. Baruah, Michael A. Bender, Alberto Marchetti-Spaccamela |
| 2023 | SODA | Tiny Pointers. | Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini |
| 2023 | SPAA | An Associativity Threshold Phenomenon in Set-Associative Caches. | Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini |
| 2023 | SPAA | Increment - and - Freeze: Every Cache, Everywhere, All of the Time. | Michael A. Bender, Daniel DeLayo, Bradley C. Kuszmaul, William Kuszmaul, Evan West |
| 2022 | ESA | When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. | Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender |
| 2022 | EuroSys | BetrFS: a compleat file system for commodity SSDs. | Yizheng Jiao, Simon Bertron, Sagar Patel, Luke Zeller, Rory Bennett, Nirjhar Mukherjee, Michael A. Bender, Michael Condict, Alex Conway, Martin Farach-Colton, Xiongzi Ge, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan |
| 2022 | FOCS | Online List Labeling: Breaking the log | Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komls, William Kuszmaul, Nicole Wein |
| 2022 | SIGMOD | GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. | David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, J. Ahmed Dellas, Martin Farach-Colton, Tyler Seip, Kenny Zhang |
| 2022 | STOC | On the optimal time/space tradeoff for hash tables. | Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu |
| 2022 | SPAA | Online Parallel Paging with Optimal Makespan. | Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato |
| 2022 | SPAA | Contention Resolution for Coded Radio Networks. | Michael A. Bender, Seth Gilbert, Fabian Kuhn, John Kuszmaul, Muriel Mdard |
| 2022 | SPAA | Automatic HBM Management: Models and Algorithms. | Daniel DeLayo, Kenny Zhang, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Rathish Das, Benjamin Moseley, Cynthia A. Phillips |
| 2021 | ESA | Incremental Edge Orientation in Forests. | Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein |
| 2021 | FOCS | Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering. | Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul |
| 2021 | SIGMOD | Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design. | Prashant Pandey, Alex Conway, Joe Durie, Michael A. Bender, Martin Farach-Colton, Rob Johnson |
| 2021 | SODA | Tight Bounds for Parallel Paging and Green Paging. | Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato |
| 2021 | SODA | Randomized Cup Game Algorithms Against Strong Adversaries. | Michael A. Bender, William Kuszmaul |
| 2021 | SPAA | Paging and the Address-Translation Problem. | Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Donald E. Porter, Guido Tagliavini, Janet Vorobyeva, Evan West |
| 2020 | FAST | How to Copy Files. | Yang Zhan, Alexander Conway, Yizheng Jiao, Nirjhar Mukherjee, Ian Groombridge, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan |
| 2020 | LATIN | Batched Predecessor and Sorting with Size-Priced Information in External Memory. | Michael A. Bender, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Kostas Tsichlas |
| 2020 | SIGMOD | Timely Reporting of Heavy Hitters using External Memory. | Prashant Pandey, Shikha Singh, Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Cynthia A. Phillips |
| 2020 | SODA | Flushing Without Cascades. | Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul |
| 2020 | STOC | Contention resolution without collision detection. | Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie |
| 2020 | SPAA | Green Paging and Parallel Paging. | Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato |
| 2020 | SPAA | Contention Resolution with Message Deadlines. | Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young |
| 2020 | SPAA | Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. | Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu |
| 2020 | SPAA | How to Manage High-Bandwidth Memory Automatically. | Rathish Das, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Benjamin Moseley, Cynthia A. Phillips |
| 2019 | SODA | Optimal Ball Recycling. | Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai |
| 2019 | STOC | Achieving optimal backlog in multi-processor cup games. | Michael A. Bender, Martin Farach-Colton, William Kuszmaul |
| 2019 | SPAA | Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design. | Michael A. Bender, Alex Conway, Martin Farach-Colton, William Jannen, Yizheng Jiao, Rob Johnson, Eric Knorr, Sara McAllister, Nirjhar Mukherjee, Prashant Pandey, Donald E. Porter, Jun Yuan, Yang Zhan |
| 2018 | FAST | The Full Path to Full-Path Indexing. | Yang Zhan, Alexander Conway, Yizheng Jiao, Eric Knorr, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan |
| 2018 | FOCS | Bloom Filters, Adaptivity, and the Dictionary Problem. | Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh |
| 2018 | RECOMB | Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index. | Prashant Pandey, Fatemeh Almodaresi, Michael A. Bender, Michael Ferdman, Rob Johnson, Rob Patro |
| 2017 | FAST | File Systems Fated for Senescence? Nonsense, Says Science! | Alexander Conway, Ainesh Bakshi, Yizheng Jiao, William Jannen, Yang Zhan, Jun Yuan, Michael A. Bender, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Martin Farach-Colton |
| 2017 | PODS | Write-Optimized Skip Lists. | Michael A. Bender, Martin Farach-Colton, Rob Johnson, Simon Mauras, Tyler Mayer, Cynthia A. Phillips, Helen Xu |
| 2017 | SIGMOD | A General-Purpose Counting Filter: Making Every Bit Count. | Prashant Pandey, Michael A. Bender, Rob Johnson, Rob Patro |
| 2017 | SODA | Cross-Referenced Dictionaries and the Limits of Write Optimization. | Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai |
| 2017 | SODA | File Maintenance: When in Doubt, Change the Layout! | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montes |
| 2016 | FAST | Optimizing Every Operation in a Write-optimized File System. | Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter |
| 2016 | FUN | Resource Optimization for Program Committee Members: A Subreview Article. | Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh, Frdric Vivien |
| 2016 | LATIN | The I/O Complexity of Computing Prime Tables. | Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton, Pramod Ganapathi, Rob Johnson, Samuel McCauley, Bertrand Simon, Shikha Singh |
| 2016 | PODS | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries. | Michael A. Bender, Jonathan W. Berry, Rob Johnson, Thomas M. Kroeger, Samuel McCauley, Cynthia A. Phillips, Bertrand Simon, Shikha Singh, David Zage |
| 2016 | SODA | How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young |
| 2016 | STOC | Contention resolution with log-logstar channel accesses. | Michael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young |
| 2016 | USENIX | Optimizing Every Operation in a Write-optimized File System. | Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter |
| 2016 | SPAA | Cache-Adaptive Analysis. | Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley |
| 2015 | FAST | BetrFS: A Right-Optimized Write-Optimized File System. | William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter |
| 2015 | ISAAC | Run Generation Revisited: What Goes Up May or May Not Come Down. | Michael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh, Hoa T. Vu |
| 2015 | SPAA | Cost-Oblivious Reallocation for Scheduling and Planning. | Michael A. Bender, Martin Farach-Colton, Sndor P. Fekete, Jeremy T. Fineman, Seth Gilbert |
| 2014 | COCOON | The Range 1 Query (R1Q) Problem. | Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang |
| 2014 | ESA | The Batched Predecessor Problem in External Memory. | Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai |
| 2014 | PODS | Cost-oblivious storage reallocation. | Michael A. Bender, Martin Farach-Colton, Sndor P. Fekete, Jeremy T. Fineman, Seth Gilbert |
| 2014 | SODA | Dynamic Task Allocation in Asynchronous Shared Memory. | Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert |
| 2014 | SODA | Cache-Adaptive Algorithms. | Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley |
| 2013 | SPAA | Efficient scheduling to minimize calibrations. | Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, Cynthia A. Phillips |
| 2013 | SPAA | Reallocation problems in scheduling. | Michael A. Bender, Martin Farach-Colton, Sndor P. Fekete, Jeremy T. Fineman, Seth Gilbert |
| 2012 | FOCS | How to Allocate Tasks Asynchronously. | Dan Alistarh, Michael A. Bender, Seth Gilbert, Rachid Guerraoui |
| 2012 | FUN | The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. | Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley |
| 2011 | FOCS | Mutual Exclusion with O(log^2 Log n) Amortized Work. | Michael A. Bender, Seth Gilbert |
| 2010 | PODS | Performance guarantees for B-trees with different-sized atomic keys. | Michael A. Bender, Haodong Hu, Bradley C. Kuszmaul |
| 2009 | FCT | Maintaining Arrays of Contiguous Objects. | Michael A. Bender, Sndor P. Fekete, Tom Kamphans, Nils Schweer |
| 2009 | SODA | A new approach to incremental topological ordering. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert |
| 2007 | FUN | The Worst Page-Replacement Policy. | Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman |
| 2007 | SPAA | Optimal sparse matrix dense vector multiplication in the I/O-model. | Michael A. Bender, Gerth Stlting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari |
| 2007 | SPAA | Cache-oblivious streaming B-trees. | Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson |
| 2007 | SPAA | Scheduling DAGs on asynchronous processors. | Michael A. Bender, Cynthia A. Phillips |
| 2006 | ESA | Contention Resolution with Heterogeneous Job Sizes. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert |
| 2006 | EuroPar | Topic 3: Scheduling and Load Balancing. | Michael A. Bender, Dror G. Feitelson, Allan Gottlieb, Uwe Schwiegelshohn |
| 2006 | PODS | Cache-oblivious string B-trees. | Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul |
| 2006 | PODS | An adaptive packed-memory array. | Michael A. Bender, Haodong Hu |
| 2006 | WAFR | The Snowblower Problem. | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk |
| 2005 | EuroPar | Topic 3 Scheduling and Load-Balancing. | Denis Trystram, Michael A. Bender, Uwe Schwiegelshohn, Lus Paulo Santos |
| 2005 | SPAA | Concurrent cache-oblivious b-trees. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul |
| 2005 | SPAA | Adversarial contention resolution for simple channels. | Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson |
| 2005 | WADS | Communication-Aware Processor Allocation for Supercomputers. | Michael A. Bender, David P. Bunde, Erik D. Demaine, Sndor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips |
| 2004 | ALENEX | The Robustness of the Sum-of-Squares Algorithm for Bin Packing. | Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt |
| 2004 | CPM | Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. | Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter |
| 2004 | SODA | Improved bounds on sorting with length-weighted reversals. | Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan |
| 2004 | SPAA | On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson |
| 2003 | FOCS | The Cost of Cache-Oblivious Searching. | Michael A. Bender, Gerth Stlting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro Lpez-Ortiz |
| 2003 | SPAA | Improved approximation algorithms for the freeze-tag problem. | Esther M. Arkin, Michael A. Bender, Dongdong Ge |
| 2002 | CLUSTER | Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies. | Vitus J. Leung, Esther M. Arkin, Michael A. Bender, David P. Bunde, Jeanette Johnston, Alok Lal, Joseph S. B. Mitchell, Cynthia A. Phillips, Steven S. Seiden |
| 2002 | ESA | Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. | Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton |
| 2002 | ESA | Two Simplified Algorithms for Maintaining Order in a List. | Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito |
| 2002 | ESA | Efficient Tree Layout in a Multilevel Memory Hierarchy. | Michael A. Bender, Erik D. Demaine, Martin Farach-Colton |
| 2002 | ICALP | Exponential Structures for Efficient Cache-Oblivious Algorithms. | Michael A. Bender, Richard Cole, Rajeev Raman |
| 2002 | LATIN | The Level Ancestor Problem Simplified. | Michael A. Bender, Martin Farach-Colton |
| 2002 | SODA | The freeze-tag problem: how to wake up a swarm of robots. | Esther M. Arkin, Michael A. Bender, Sndor P. Fekete, Joseph S. B. Mitchell, Martin Skutella |
| 2002 | SODA | A locality-preserving cache-oblivious dynamic dictionary. | Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu |
| 2002 | SODA | Improved algorithms for stretch scheduling. | Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman |
| 2002 | STOC | Cache-oblivious priority queue and graph algorithm applications. | Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro |
| 2002 | WAFR | Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments. | Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sndor P. Fekete, Joseph S. B. Mitchell |
| 2001 | SODA | Optimal covering tours with turn costs. | Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sndor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia |
| 2001 | SODA | Finding least common ancestors in directed acyclic graphs. | Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin |
| 2001 | WADS | When Can You Fold a Map? | Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena |
| 2000 | FOCS | Cache-Oblivious B-Trees. | Michael A. Bender, Erik D. Demaine, Martin Farach-Colton |
| 2000 | ICALP | Testing Acyclicity of Directed Graphs in Sublinear Time. | Michael A. Bender, Dana Ron |
| 2000 | LATIN | The LCA Problem Revisited. | Michael A. Bender, Martin Farach-Colton |
| 2000 | PG | TEASAR: Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons. | Mie Sato, Ingmar Bitter, Michael A. Bender, Arie E. Kaufman, Masayuki Nakajima |
| 2000 | SPAA | Scheduling Cilk multithreaded parallel programs on processors of different speeds. | Michael A. Bender, Michael O. Rabin |
| 1999 | WADS | The Lazy Bureaucrat Scheduling Problem. | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena |
| 1999 | WADS | Performance Guarantees for the TSP with a Parameterized Triangle Inequality. | Michael A. Bender, Chandra Chekuri |
| 1998 | IPCO | An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. | Chandra Chekuri, Michael A. Bender |
| 1998 | SODA | Flow and Stretch Metrics for Scheduling Continuous Job Streams. | Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan |
| 1998 | STOC | The Power of a Pebble: Exploring and Mapping Directed Graphs. | Michael A. Bender, Antonio Fernndez, Dana Ron, Amit Sahai, Salil P. Vadhan |
| 1996 | FOCS | New Algorithms for the Disk Scheduling Problem. | Matthew Andrews, Michael A. Bender, Lisa Zhang |
| 1996 | FOCS | Fault Tolerant Data Structures. | Yonatan Aumann, Michael A. Bender |
| 1996 | ICALP | Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. | Yonatan Aumann, Michael A. Bender |
| 1996 | SPAA | Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. | Yonatan Aumann, Michael A. Bender, Lisa Zhang |
| 1994 | FOCS | The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs | Michael A. Bender, Donna K. Slonim |