Mitigating False Positives in Filters: To Adapt or to Cache?

Michael A. Bender Michael Bender 0001 http://www.cs.sunysb.edu/~bender/ https://scholar.google.com/citations?user=B1_1mR8AAAAJ https://dl.acm.org/profile/81100458566 https://orcid.org/0000-0001-7639-530X https://www.wikidata.org/entity/Q130973752 https://www.wikidata.org/entity/Q102305807 https://en.wikipedia.org/wiki/Michael_A._Bender https://mathgenealogy.org/id.php?id=106329 Stony Brook University, NY, USA Michael Bender

Tianchi Mo Michael A. Bender Rathish Das Martin Farach-Colton David Tench Mitigating False Positives in Filters: To Adapt or to Cache? 2026 September 17:1-17:32 51 ACM Trans. Database Syst. 3 https://doi.org/10.1145/3786324 db/journals/tods/tods51.html#MoBDFT26 streams/journals/tods

Michael A. Bender William Kuszmaul Elaine Shi Rose Silver History-Independent Load Balancing. 1097-1127 2026 SODA https://doi.org/10.1137/1.9781611978971.44 conf/soda/2026 db/conf/soda/soda2026.html#BenderKSS26 Michael A. Bender Guy E. Blelloch Martin Farach-Colton Yang Hu Rob Johnson 0001 Rotem Oshman Renfei Zhou Fast Concurrent Primitives Despite Contention. 196-233 2026 SPAA https://doi.org/10.1145/3816782.3819207 conf/spaa/2026 db/conf/spaa/spaa2026.html#BenderBFHJOZ26 Michael A. Bender Philip Bille Martín Farach-Colton Jeremy T. Fineman Inge Li Gørtz Michael T. Goodrich Hanna Komlós Bradley C. Kuszmaul William Kuszmaul Rose Silver Todd Veldhuizen Renfei Zhou The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically. 405-415 2026 SPAA https://doi.org/10.1145/3816782.3819205 conf/spaa/2026 db/conf/spaa/spaa2026.html#BenderBFFGGKKKS26

Michael A. Bender William Kuszmaul Elaine Shi Rose Silver History-Independent Load Balancing. 2026 February abs/2602.11953 CoRR https://doi.org/10.48550/arXiv.2602.11953 db/journals/corr/corr2602.html#abs-2602-11953 streams/journals/corr

Michael A. Bender Aaron Bernstein Nairen Cao Alexander Conway 0001 Martín Farach-Colton Hanna Komlós Yarin Shechter Nicole Wein Bounding the Fragmentation of B-Trees Subject to Batched Insertions. 2026 March abs/2603.12211 CoRR https://doi.org/10.48550/arXiv.2603.12211 db/journals/corr/corr2603.html#abs-2603-12211 streams/journals/corr

Michael A. Bender Guy E. Blelloch Martin Farach-Colton Yang Hu Rob Johnson 0001 Rotem Oshman Renfei Zhou Fast Concurrent Primitives Despite Contention. 2026 April abs/2604.14530 CoRR https://doi.org/10.48550/arXiv.2604.14530 db/journals/corr/corr2604.html#abs-2604-14530 streams/journals/corr

Quinten De Man Gilvir Gill Michael A. Bender Laxman Dhulipala David Tench Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs. 2026 May abs/2605.15173 CoRR https://doi.org/10.48550/arXiv.2605.15173 db/journals/corr/corr2605.html#abs-2605-15173 streams/journals/corr

Kunal Agrawal 0001 Michael A. Bender Jeremy T. Fineman Seth Gilbert Maxwell Young Contention resolution with message deadlines. 337-355 2025 December 38 Distributed Comput. 4 https://doi.org/10.1007/s00446-025-00490-y db/journals/dc/dc38.html#AgrawalBFGY25 streams/journals/dc

Michael A. Bender Jeremy T. Fineman Seth Gilbert John Kuszmaul Maxwell Young Jamming-Resistant Backoff with Polylogarithmic Sending and Listening Cost. 1335-1385 2025 54 SIAM J. Comput. 5 https://doi.org/10.1137/24m1670743 db/journals/siamcomp/siamcomp54.html#BenderFGKY25 streams/journals/siamcomp

Michael A. Bender Alexander Conway 0001 Martín Farach-Colton Hanna Komlós William Kuszmaul Nicole Wein Online List Labeling: Breaking the \({\log^2 n}\) Barrier. S22-60 2025 54 SIAM J. Comput. 5 https://doi.org/10.1137/22m1534468 db/journals/siamcomp/siamcomp54.html#BenderCFKKW25 streams/journals/siamcomp

Michael A. Bender Martín Farach-Colton Michael T. Goodrich Hanna Komlós History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures. 17-26 2025 March 54 SIGMOD Rec. 1 https://doi.org/10.1145/3733620.3733625 db/journals/sigmod/sigmod54.html#BenderFGK25 streams/journals/sigmod

Michael A. Bender Alexander Conway 0001 Martín Farach-Colton William Kuszmaul Guido Tagliavini Tiny Pointers. 38:1-38:43 2025 October 21 ACM Trans. Algorithms 4 https://doi.org/10.1145/3700594 https://www.wikidata.org/entity/Q131124297 db/journals/talg/talg21.html#BenderCFKT25 streams/journals/talg

Michael A. Bender Abhishek Bhattacharjee Alexander Conway 0001 Martin Farach-Colton Rob Johnson 0001 Sudarsun Kannan William Kuszmaul Nirjhar Mukherjee Donald E. Porter Guido Tagliavini Janet Vorobyeva Evan West Paging and the Address-Translation Problem. 43:1-43:22 2025 October 21 ACM Trans. Algorithms 4 https://doi.org/10.1145/3737700 db/journals/talg/talg21.html#BenderBCFJKKMPTVW25 streams/journals/talg

Michael A. Bender Martín Farach-Colton Riko Jacob Hanna Komlós David Tench Evan T. West The Case for External Graph Sketching. 115-129 2025 ACDA https://doi.org/10.1137/1.9781611978759.9 conf/acda/2025 db/conf/acda/acda2025.html#BenderFJKTW25 David Tench Evan T. West Kenny Zhang Michael A. Bender Daniel DeLayo Martín Farach-Colton Gilvir Gill Tyler Seip Victor Zhang Exploring the Landscape of Distributed Graph Sketching. 133-146 2025 ALENEX https://doi.org/10.1137/1.9781611978339.11 conf/alenex/2025 db/conf/alenex/alenex2025.html#TenchWZBDFGSZ25 Kunal Agrawal 0001 Michael A. Bender Kirk Pruhs Benjamin Moseley Clifford Stein 0001 Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only). 171-180 2025 SPAA https://doi.org/10.1145/3694906.3743336 conf/spaa/2025 db/conf/spaa/spaa2025.html#0001BPM025 Michael A. Bender Alex Conway 0001 Daniel DeLayo Martin Farach-Colton Jaehyun Han Linfeng He Rob Johnson 0001 Sudarsun Kannan William Kuszmaul Donald E. Porter Evan West Don't Melt Your Cache: Low-Associativity with Heat-Sink. 555-565 2025 SPAA https://doi.org/10.1145/3694906.3743303 conf/spaa/2025 db/conf/spaa/spaa2025.html#Bender0DFHH0KKP25 Michael A. Bender William Kuszmaul Renfei Zhou Optimal Non-oblivious Open Addressing. 268-277 2025 STOC https://doi.org/10.1145/3717823.3718215 https://www.wikidata.org/entity/Q135685683 conf/stoc/2025 db/conf/stoc/stoc2025.html#BenderKZ25 Hagit Attiya Michael A. Bender Martín Farach-Colton Rotem Oshman Noa Schiller History-Independent Concurrent Hash Tables. 1283-1294 2025 STOC https://doi.org/10.1145/3717823.3718283 https://www.wikidata.org/entity/Q135685905 conf/stoc/2025 db/conf/stoc/stoc2025.html#AttiyaBFOS25

Michael A. Bender William Kuszmaul Renfei Zhou Optimal Non-Oblivious Open Addressing. 2025 March abs/2503.13628 CoRR https://doi.org/10.48550/arXiv.2503.13628 db/journals/corr/corr2503.html#abs-2503-13628 streams/journals/corr

Hagit Attiya Michael A. Bender Martín Farach-Colton Rotem Oshman Noa Schiller History-Independent Concurrent Hash Tables. 2025 March abs/2503.21016 CoRR https://doi.org/10.48550/arXiv.2503.21016 db/journals/corr/corr2503.html#abs-2503-21016 streams/journals/corr

Michael A. Bender Martín Farach-Colton Riko Jacob Hanna Komlós David Tench Evan West The Case for External Graph Sketching. 2025 April abs/2504.17563 CoRR https://doi.org/10.48550/arXiv.2504.17563 db/journals/corr/corr2504.html#abs-2504-17563 streams/journals/corr

Quinten De Man Qamber Jafri Daniel DeLayo Evan T. West Michael A. Bender David Tench Fast and Compact Sketch-Based Dynamic Connectivity. 2025 September abs/2509.14433 CoRR https://doi.org/10.48550/arXiv.2509.14433 db/journals/corr/corr2509.html#abs-2509-14433 streams/journals/corr

Michael A. Bender Alexander Conway 0001 Martín Farach-Colton Rob Johnson 0001 Prashant Pandey 0001 Time To Replace Your Filter: How Maplets Simplify System Design. 2025 October abs/2510.05518 CoRR https://doi.org/10.48550/arXiv.2510.05518 db/journals/corr/corr2510.html#abs-2510-05518 streams/journals/corr

Michael A. Bender John Iacono László Kozma 0002 Eva Rotenberg Justin Dallant Adaptive and Scalable Data Structures (Dagstuhl Seminar 25191). 1-20 2025 May 15 Dagstuhl Reports 5 https://doi.org/10.4230/DagRep.15.5.1 db/journals/dagstuhl-reports/dagstuhl-reports15.html#BenderIKRD25 streams/journals/dagstuhl-reports

Jaehyun Han Krishnan Gosakan William Kuszmaul Ibrahim N. Mubarek Nirjhar Mukherjee Karthik Sriram Guido Tagliavini Evan West Michael A. Bender Abhishek Bhattacharjee Alex Conway 0001 Martín Farach-Colton Jayneel Gandhi Rob Johnson 0001 Sudarsun Kannan Donald E. Porter Mosaic Pages: Big TLB Reach With Small Pages. 52-59 2024 July - August 44 IEEE Micro 4 https://doi.org/10.1109/MM.2024.3409181 db/journals/micro/micro44.html#HanGKMMSTWBBCFGJKP24 streams/journals/micro

Michael A. Bender Alex Conway 0001 Martin Farach-Colton Hanna Komlós William Kuszmaul Layered List Labeling. 101 2024 2 Proc. ACM Manag. Data 2 https://doi.org/10.1145/3651602 db/journals/pacmmod/pacmmod2.html#BenderCFKK24

Michael A. Bender Martín Farach-Colton Michael T. Goodrich Hanna Komlós History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures. 108 2024 2 Proc. ACM Manag. Data 2 https://doi.org/10.1145/3651609 db/journals/pacmmod/pacmmod2.html#BenderFGK24

Richard Wen Hunter McCoy David Tench Guido Tagliavini Michael A. Bender Alex Conway 0001 Martin Farach-Colton Rob Johnson 0001 Prashant Pandey 0001 Adaptive Quotient Filters. 192:1-192:28 2024 September 2 Proc. ACM Manag. Data 4 https://doi.org/10.1145/3677128 db/journals/pacmmod/pacmmod2.html#WenMTTBCFJP24 streams/journals/pacmmod

David Tench Evan West Victor Zhang Michael A. Bender Abiyaz Chowdhury Daniel DeLayo J. Ahmed Dellas Martín Farach-Colton Tyler Seip Kenny Zhang GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive). 9:1-9:31 2024 September 49 ACM Trans. Database Syst. 3 https://doi.org/10.1145/3643846 https://www.wikidata.org/entity/Q130973759 db/journals/tods/tods49.html#TenchWZBCDDFSZ24 streams/journals/tods

Michael A. Bender William Kuszmaul Renfei Zhou Tight Bounds for Classical Open Addressing. 636-657 2024 FOCS https://doi.org/10.1109/FOCS61266.2024.00047 conf/focs/2024 db/conf/focs/focs2024.html#BenderKZ24 Michael A. Bender Alex Conway 0001 Martín Farach-Colton Hanna Komlós Michal Koucký 0001 William Kuszmaul Michael E. Saks Nearly Optimal List Labeling. 2253-2274 2024 FOCS https://doi.org/10.1109/FOCS61266.2024.00132 conf/focs/2024 db/conf/focs/focs2024.html#Bender0FK0KS24 Hagit Attiya Michael A. Bender Martín Farach-Colton Rotem Oshman Noa Schiller History-Independent Concurrent Objects. 14-24 2024 PODC https://doi.org/10.1145/3662158.3662814 conf/podc/2024 db/conf/podc/podc2024.html#AttiyaBFOS24 Michael A. Bender Jeremy T. Fineman Seth Gilbert John Kuszmaul Maxwell Young Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution. 231-242 2024 PODC https://doi.org/10.1145/3662158.3662807 https://www.wikidata.org/entity/Q130994370 conf/podc/2024 db/conf/podc/podc2024.html#BenderFGKY24 Michael A. Bender Martín Farach-Colton John Kuszmaul William Kuszmaul Modern Hashing Made Simple. 363-373 2024 SOSA https://doi.org/10.1137/1.9781611977936.33 conf/sosa/2024 db/conf/sosa/sosa2024.html#BenderFKK24

Alex Conway 0001 Ainesh Bakshi Arghya Bhattacharya Rory Bennett Yizheng Jiao Eric Knorr Yang Zhan 0001 Michael A. Bender William Jannen Rob Johnson 0001 Bradley C. Kuszmaul Donald E. Porter Jun Yuan 0006 Martin Farach-Colton File System Aging. 2024 abs/2401.08858 CoRR https://doi.org/10.48550/arXiv.2401.08858 db/journals/corr/corr2401.html#abs-2401-08858

Hagit Attiya Michael A. Bender Martin Farach-Colton Rotem Oshman Noa Schiller History-Independent Concurrent Objects. 2024 abs/2403.14445 CoRR https://doi.org/10.48550/arXiv.2403.14445 db/journals/corr/corr2403.html#abs-2403-14445

Michael A. Bender Alex Conway 0001 Martin Farach-Colton Hanna Komlós William Kuszmaul Layered List Labeling. 2024 abs/2404.16623 CoRR https://doi.org/10.48550/arXiv.2404.16623 db/journals/corr/corr2404.html#abs-2404-16623

Michael A. Bender Alex Conway 0001 Martín Farach-Colton Hanna Komlós Michal Koucký 0001 William Kuszmaul Michael E. Saks Nearly Optimal List Labeling. 2024 abs/2405.00807 CoRR https://doi.org/10.48550/arXiv.2405.00807 db/journals/corr/corr2405.html#abs-2405-00807

Richard Wen Hunter McCoy David Tench Guido Tagliavini Michael A. Bender Alex Conway 0001 Martin Farach-Colton Rob Johnson 0001 Prashant Pandey 0001 Adaptive Quotient Filters. 2024 abs/2405.10253 CoRR https://doi.org/10.48550/arXiv.2405.10253 db/journals/corr/corr2405.html#abs-2405-10253

Michael A. Bender William Kuszmaul Renfei Zhou Tight Bounds for Classical Open Addressing. 2024 abs/2409.11280 CoRR https://doi.org/10.48550/arXiv.2409.11280 db/journals/corr/corr2409.html#abs-2409-11280 streams/journals/corr

David Tench Evan T. West Kenny Zhang Michael Bender 0001 Daniel DeLayo Martin Farach-Colton Gilvir Gill Tyler Seip Victor Zhang Exploring the Landscape of Distributed Graph Sketching. 2024 abs/2410.07518 CoRR https://doi.org/10.48550/arXiv.2410.07518 db/journals/corr/corr2410.html#abs-2410-07518 streams/journals/corr

Michael A. Bender Alex Conway 0001 Martin Farach-Colton William Kuszmaul Guido Tagliavini Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once. 40:1-40:51 2023 December 70 J. ACM 6 https://doi.org/10.1145/3625817 https://www.wikidata.org/entity/Q131129339 db/journals/jacm/jacm70.html#BenderCFKT23

Prashant Pandey 0001 Michael A. Bender Alex Conway 0001 Martin Farach-Colton William Kuszmaul Guido Tagliavini Rob Johnson 0001 IcebergHT: High Performance Hash Tables Through Stability and Low Associativity. 47:1-47:26 2023 1 Proc. ACM Manag. Data 1 https://doi.org/10.1145/3588727 db/journals/pacmmod/pacmmod1.html#0001BCFKTJ23

Krishnan Gosakan Jaehyun Han William Kuszmaul Ibrahim N. Mubarek Nirjhar Mukherjee Karthik Sriram Guido Tagliavini Evan West Michael A. Bender Abhishek Bhattacharjee Alex Conway 0001 Martin Farach-Colton Jayneel Gandhi Rob Johnson 0001 Sudarsun Kannan Donald E. Porter Mosaic Pages: Big TLB Reach with Small Pages. 433-448 2023 ASPLOS (3) https://doi.org/10.1145/3582016.3582021 https://www.wikidata.org/entity/Q130933012 conf/asplos/2023-3 db/conf/asplos/asplos2023-3.html#GosakanHKMMSTWB23 Kunal Agrawal 0001 Sanjoy K. Baruah Michael A. Bender Alberto Marchetti-Spaccamela The Safe and Effective Use of Low-Assurance Predictions in Safety-Critical Systems. 3:1-3:19 2023 ECRTS https://doi.org/10.4230/LIPIcs.ECRTS.2023.3 conf/ecrts/2023 db/conf/ecrts/ecrts2023.html#AgrawalBBM23 Michael A. Bender Alex Conway 0001 Martin Farach-Colton William Kuszmaul Guido Tagliavini Tiny Pointers. 477-508 2023 SODA https://doi.org/10.1137/1.9781611977554.ch21 conf/soda/2023 db/conf/soda/soda2023.html#BenderCFKT23 Michael A. Bender Rathish Das Martin Farach-Colton Guido Tagliavini An Associativity Threshold Phenomenon in Set-Associative Caches. 117-127 2023 SPAA https://doi.org/10.1145/3558481.3591084 conf/spaa/2023 db/conf/spaa/spaa2023.html#BenderDFT23 Michael A. Bender Daniel DeLayo Bradley C. Kuszmaul William Kuszmaul Evan West Increment - and - Freeze: Every Cache, Everywhere, All of the Time. 129-139 2023 SPAA https://doi.org/10.1145/3558481.3591085 conf/spaa/2023 db/conf/spaa/spaa2023.html#BenderDKKW23 Krishnan Gosakan Jaehyun Han William Kuszmaul Ibrahim N. Mubarek Nirjhar Mukherjee Karthik Sriram Guido Tagliavini Evan West Michael A. Bender Abhishek Bhattacharjee Alex Conway 0001 Martin Farach-Colton Jayneel Gandhi Rob Johnson 0001 Sudarsun Kannan Donald E. Porter Mosaic Pages: Big TLB Reach with Small Pages. 2023 January https://doi.org/10.5281/zenodo.7592601 Zenodo streams/repo/zenodo

Michael A. Bender Jeremy T. Fineman Seth Gilbert John Kuszmaul Maxwell Young Robust and Listening-Efficient Contention Resolution. 2023 abs/2302.07751 CoRR https://doi.org/10.48550/arXiv.2302.07751 db/journals/corr/corr2302.html#abs-2302-07751

Michael A. Bender Rathish Das Martin Farach-Colton Guido Tagliavini An Associativity Threshold Phenomenon in Set-Associative Caches. 2023 abs/2304.04954 CoRR https://doi.org/10.48550/arXiv.2304.04954 db/journals/corr/corr2304.html#abs-2304-04954

Janet Vorobyeva Daniel R. Delayo Michael A. Bender Martin Farach-Colton Prashant Pandey 0001 Cynthia A. Phillips Shikha Singh 0002 Eric D. Thomas Thomas M. Kroeger Using advanced data structures to enable responsive security monitoring. 2893-2914 2022 25 Clust. Comput. 4 https://doi.org/10.1007/s10586-021-03463-5 https://www.wikidata.org/entity/Q113444934 db/journals/cluster/cluster25.html#VorobyevaDBFPP022

Arghya Bhattacharya Abiyaz Chowdhury Helen Xu 0001 Rathish Das Rezaul Alam Chowdhury Rob Johnson 0001 Rishab Nithyanand Michael A. Bender When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. 16:1-16:17 2022 ESA https://doi.org/10.4230/LIPIcs.ESA.2022.16 conf/esa/2022 db/conf/esa/esa2022.html#BhattacharyaCXD22 Yizheng Jiao Simon Bertron Sagar Patel Luke Zeller Rory Bennett Nirjhar Mukherjee Michael A. Bender Michael Condict Alex Conway 0001 Martin Farach-Colton Xiongzi Ge William Jannen Rob Johnson 0001 Donald E. Porter Jun Yuan 0006 BetrFS: a compleat file system for commodity SSDs. 610-627 2022 EuroSys https://doi.org/10.1145/3492321.3519571 https://www.wikidata.org/entity/Q130955641 conf/eurosys/2022 db/conf/eurosys/eurosys2022.html#JiaoBPZBMBCCFGJ22 Michael A. Bender Alex Conway 0001 Martin Farach-Colton Hanna Komlós William Kuszmaul Nicole Wein Online List Labeling: Breaking the log<sup>2</sup>n Barrier. 980-990 2022 conf/focs/2022 FOCS https://doi.org/10.1109/FOCS54457.2022.00096 db/conf/focs/focs2022.html#BenderCFKKW22 Michael A. Bender Martin Farach-Colton William Kuszmaul What Does Dynamic Optimality Mean in External Memory? 18:1-18:23 2022 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2022.18 conf/innovations/2022 db/conf/innovations/innovations2022.html#BenderFK22 Michael Bender 0001 Michael Benedikt Sudeepa Roy 0001 2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award. 103-104 2022 PODS https://doi.org/10.1145/3517804.3526070 conf/pods/2022 db/conf/pods/pods2022.html#BenderBR22 David Tench Evan West Victor Zhang Michael A. Bender Abiyaz Chowdhury J. Ahmed Dellas Martin Farach-Colton Tyler Seip Kenny Zhang GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. 325-339 2022 SIGMOD Conference https://doi.org/10.1145/3514221.3526146 conf/sigmod/2022 db/conf/sigmod/sigmod2022.html#TenchWZBCDFSZ22 Michael A. Bender Seth Gilbert Fabian Kuhn John Kuszmaul Muriel Médard Contention Resolution for Coded Radio Networks. 119-130 2022 SPAA https://doi.org/10.1145/3490148.3538573 conf/spaa/2022 db/conf/spaa/spaa2022.html#BenderGKKM22 Daniel DeLayo Kenny Zhang Kunal Agrawal 0001 Michael A. Bender Jonathan W. Berry Rathish Das Benjamin Moseley Cynthia A. Phillips Automatic HBM Management: Models and Algorithms. 147-159 2022 SPAA https://doi.org/10.1145/3490148.3538570 conf/spaa/2022 db/conf/spaa/spaa2022.html#DeLayoZABBDMP22 Kunal Agrawal 0001 Michael A. Bender Rathish Das William Kuszmaul Enoch Peserico Michele Scquizzato Online Parallel Paging with Optimal Makespan. 205-216 2022 SPAA https://doi.org/10.1145/3490148.3538577 conf/spaa/2022 db/conf/spaa/spaa2022.html#AgrawalBDKPS22 Michael A. Bender Martin Farach-Colton John Kuszmaul William Kuszmaul Mingmou Liu On the optimal time/space tradeoff for hash tables. 1284-1297 2022 STOC https://doi.org/10.1145/3519935.3519969 conf/stoc/2022 db/conf/stoc/stoc2022.html#BenderFKKL22

Michael A. Bender Martin Farach-Colton William Kuszmaul What Does Dynamic Optimality Mean in External Memory? 2022 abs/2201.01742 CoRR https://arxiv.org/abs/2201.01742 db/journals/corr/corr2201.html#abs-2201-01742

Michael A. Bender Alexander Conway 0001 Martin Farach-Colton Hanna Komlós William Kuszmaul Nicole Wein Online List Labeling: Breaking the log<sup>2</sup>n Barrier. 2022 abs/2203.02763 CoRR https://doi.org/10.48550/arXiv.2203.02763 db/journals/corr/corr2203.html#abs-2203-02763

David Tench Evan West Victor Zhang Michael A. Bender Abiyaz Chowdhury J. Ahmed Dellas Martin Farach-Colton Tyler Seip Kenny Zhang GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. 2022 abs/2203.14927 CoRR https://doi.org/10.48550/arXiv.2203.14927 db/journals/corr/corr2203.html#abs-2203-14927

Michael A. Bender Seth Gilbert Fabian Kuhn John Kuszmaul Muriel Médard Contention Resolution for Coded Radio Networks. 2022 abs/2207.11824 CoRR https://doi.org/10.48550/arXiv.2207.11824 db/journals/corr/corr2207.html#abs-2207-11824

Prashant Pandey 0001 Michael A. Bender Alex Conway 0001 Martin Farach-Colton William Kuszmaul Guido Tagliavini Rob Johnson 0001 IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity. 2022 abs/2210.04068 CoRR https://doi.org/10.48550/arXiv.2210.04068 db/journals/corr/corr2210.html#abs-2210-04068

Ezio Bartocci Michael A. Bender A Perspective on "CCS Expressions, Finite State Processes, and Three Problems of Equivalence". 76-77 2021 52 SIGACT News 4 https://doi.org/10.1145/3510382.3510394 db/journals/sigact/sigact52.html#BartocciB21

Shikha Singh 0002 Prashant Pandey 0001 Michael A. Bender Jonathan W. Berry Martin Farach-Colton Rob Johnson 0001 Thomas M. Kroeger Cynthia A. Phillips Timely Reporting of Heavy Hitters Using External Memory. 14:1-14:35 2021 46 ACM Trans. Database Syst. 4 https://doi.org/10.1145/3472392 https://www.wikidata.org/entity/Q130971509 db/journals/tods/tods46.html#SinghPBBFJKP21

Michael A. Bender Alex Conway 0001 Martin Farach-Colton William Jannen Yizheng Jiao Rob Johnson 0001 Eric Knorr Sara McAllister Nirjhar Mukherjee Prashant Pandey 0001 Donald E. Porter Jun Yuan 0006 Yang Zhan 0001 External-memory Dictionaries in the Affine and PDAM Models. 15:1-15:20 2021 8 ACM Trans. Parallel Comput. 3 https://doi.org/10.1145/3470635 https://www.wikidata.org/entity/Q130968028 db/journals/topc/topc8.html#BenderCFJJJKMMP21

Yang Zhan 0001 Alex Conway 0001 Yizheng Jiao Nirjhar Mukherjee Ian Groombridge Michael A. Bender Martin Farach-Colton William Jannen Rob Johnson 0001 Donald E. Porter Jun Yuan 0006 Copy-on-Abundant-Write for Nimble File System Clones. 5:1-5:27 2021 17 ACM Trans. Storage 1 https://doi.org/10.1145/3423495 db/journals/tos/tos17.html#ZhanCJMGBFJJPY21

Michael A. Bender Rathish Das Martin Farach-Colton Tianchi Mo David Tench Yung Ping Wang Mitigating False Positives in Filters: to Adapt or to Cache? 16-24 2021 APOCS https://doi.org/10.1137/1.9781611976489.2 conf/apocs/2021 db/conf/apocs/apocs2021.html#BenderDFMTW21 Michael A. Bender Tsvi Kopelowitz William Kuszmaul Ely Porat Clifford Stein 0001 Incremental Edge Orientation in Forests. 12:1-12:18 2021 ESA https://doi.org/10.4230/LIPIcs.ESA.2021.12 conf/esa/2021 db/conf/esa/esa2021.html#BenderKKP021 Michael A. Bender Bradley C. Kuszmaul William Kuszmaul Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering. 1171-1182 2021 FOCS https://doi.org/10.1109/FOCS52979.2021.00115 conf/focs/2021 db/conf/focs/focs2021.html#BenderKK21 Prashant Pandey 0001 Alex Conway 0001 Joe Durie Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design. 1386-1399 2021 SIGMOD Conference https://doi.org/10.1145/3448016.3452841 conf/sigmod/2021 db/conf/sigmod/sigmod2021.html#PandeyCDBFJ21 Michael A. Bender William Kuszmaul Randomized Cup Game Algorithms Against Strong Adversaries. 2059-2077 2021 SODA https://doi.org/10.1137/1.9781611976465.123 conf/soda/2021 db/conf/soda/soda2021.html#BenderK21 Kunal Agrawal 0001 Michael A. Bender Rathish Das William Kuszmaul Enoch Peserico Michele Scquizzato Tight Bounds for Parallel Paging and Green Paging. 3022-3041 2021 SODA https://doi.org/10.1137/1.9781611976465.180 conf/soda/2021 db/conf/soda/soda2021.html#AgrawalBDKPS21 Michael A. Bender Abhishek Bhattacharjee Alex Conway 0001 Martin Farach-Colton Rob Johnson 0001 Sudarsun Kannan William Kuszmaul Nirjhar Mukherjee Donald E. Porter Guido Tagliavini Janet Vorobyeva Evan West Paging and the Address-Translation Problem. 105-117 2021 SPAA https://doi.org/10.1145/3409964.3461814 conf/spaa/2021 db/conf/spaa/spaa2021.html#BenderBCFJKKMPT21 Michael Bender 0001 John Gilbert 0001 Bruce Hendrickson Blair D. Sullivan Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021, Virtual Conference, July 19-21, 2021 ACDA SIAM 2021 978-1-61197-683-0 https://doi.org/10.1137/1.9781611976830 db/conf/acda/acda2021.html

Michael A. Bender Bradley C. Kuszmaul William Kuszmaul Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering. 2021 abs/2107.01250 CoRR https://arxiv.org/abs/2107.01250 db/journals/corr/corr2107.html#abs-2107-01250

Michael A. Bender Tsvi Kopelowitz William Kuszmaul Ely Porat Clifford Stein 0001 Incremental Edge Orientation in Forests. 2021 abs/2107.02318 CoRR https://arxiv.org/abs/2107.02318 db/journals/corr/corr2107.html#abs-2107-02318

Michael A. Bender Alex Conway 0001 Martin Farach-Colton William Kuszmaul Guido Tagliavini All-Purpose Hashing. 2021 abs/2109.04548 CoRR https://arxiv.org/abs/2109.04548 db/journals/corr/corr2109.html#abs-2109-04548

Michael A. Bender Martin Farach-Colton John Kuszmaul William Kuszmaul Mingmou Liu On the Optimal Time/Space Tradeoff for Hash Tables. 2021 abs/2111.00602 CoRR https://arxiv.org/abs/2111.00602 db/journals/corr/corr2111.html#abs-2111-00602

Michael A. Bender Alex Conway 0001 Martin Farach-Colton William Kuszmaul Guido Tagliavini Tiny Pointers. 2021 abs/2111.12800 CoRR https://arxiv.org/abs/2111.12800 db/journals/corr/corr2111.html#abs-2111-12800

Yang Zhan 0001 Alex Conway 0001 Nirjhar Mukherjee Ian Groombridge Martin Farach-Colton Rob Johnson 0001 Yizheng Jiao Michael A. Bender William Jannen Donald E. Porter Jun Yuan 0006 How to Not Copy Files. 2020 45 login Usenix Mag. 3 https://www.usenix.org/publications/login/fall2020/zhan db/journals/usenix-login/usenix-login45.html#ZhanCMGFJJBJPY20

Yang Zhan 0001 Alexander Conway 0001 Yizheng Jiao Nirjhar Mukherjee Ian Groombridge Michael A. Bender Martin Farach-Colton William Jannen Rob Johnson 0001 Donald E. Porter Jun Yuan 0006 How to Copy Files. 75-89 2020 FAST https://www.usenix.org/conference/fast20/presentation/zhan conf/fast/2020 db/conf/fast/fast2020.html#0001CJMGBFJJPY20 Shikha Singh 0002 Sergey Madaminov Michael A. Bender Michael Ferdman Ryan Johnson Benjamin Moseley Hung Q. Ngo 0001 Dung Nguyen Soeren Olesen Kurt Stirewalt Geoffrey Washburn A Scheduling Approach to Incremental Maintenance of Datalog Programs. 864-873 2020 IPDPS https://doi.org/10.1109/IPDPS47924.2020.00093 conf/ipps/2020 db/conf/ipps/ipdps2020.html#0002MBFJM0NOSW20 Michael A. Bender Mayank Goswami 0001 Dzejla Medjedovic Pablo Montes Kostas Tsichlas Batched Predecessor and Sorting with Size-Priced Information in External Memory. 155-167 2020 LATIN https://doi.org/10.1007/978-3-030-61792-9_13 conf/latin/2020 db/conf/latin/latin2020.html#Bender0MMT20 Prashant Pandey 0001 Shikha Singh 0002 Michael A. Bender Jonathan W. Berry Martin Farach-Colton Rob Johnson 0001 Thomas M. Kroeger Cynthia A. Phillips Timely Reporting of Heavy Hitters using External Memory. 1431-1446 2020 SIGMOD Conference https://doi.org/10.1145/3318464.3380598 https://www.wikidata.org/entity/Q130987287 conf/sigmod/2020 db/conf/sigmod/sigmod2020.html#Pandey0BBFJKP20 Michael A. Bender Rathish Das Martin Farach-Colton Rob Johnson 0001 William Kuszmaul Flushing Without Cascades. 650-669 2020 SODA https://doi.org/10.1137/1.9781611975994.40 conf/soda/2020 db/conf/soda/soda2020.html#BenderDFJK20 Kunal Agrawal 0001 Michael A. Bender Jeremy T. Fineman Seth Gilbert Maxwell Young Contention Resolution with Message Deadlines. 23-35 2020 SPAA https://doi.org/10.1145/3350755.3400239 conf/spaa/2020 db/conf/spaa/spaa2020.html#AgrawalBFGY20 Michael A. Bender Rezaul Alam Chowdhury Rathish Das Rob Johnson 0001 William Kuszmaul Andrea Lincoln Quanquan C. Liu Jayson Lynch Helen Xu 0001 Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. 63-73 2020 SPAA https://doi.org/10.1145/3350755.3400274 conf/spaa/2020 db/conf/spaa/spaa2020.html#BenderCDJKLLLX20 Rathish Das Kunal Agrawal 0001 Michael A. Bender Jonathan W. Berry Benjamin Moseley Cynthia A. Phillips How to Manage High-Bandwidth Memory Automatically. 187-199 2020 SPAA https://doi.org/10.1145/3350755.3400233 https://www.wikidata.org/entity/Q130976224 conf/spaa/2020 db/conf/spaa/spaa2020.html#DasABBMP20 Kunal Agrawal 0001 Michael A. Bender Rathish Das William Kuszmaul Enoch Peserico Michele Scquizzato Green Paging and Parallel Paging. 493-495 2020 SPAA https://doi.org/10.1145/3350755.3400231 conf/spaa/2020 db/conf/spaa/spaa2020.html#AgrawalBDKPS20 Michael A. Bender Tsvi Kopelowitz William Kuszmaul Seth Pettie Contention resolution without collision detection. 105-118 2020 STOC https://doi.org/10.1145/3357713.3384305 conf/stoc/2020 db/conf/stoc/stoc2020.html#BenderKKP20

Michael A. Bender Tsvi Kopelowitz William Kuszmaul Seth Pettie Contention Resolution Without Collision Detection. 2020 abs/2004.08039 CoRR https://arxiv.org/abs/2004.08039 db/journals/corr/corr2004.html#abs-2004-08039

Michael A. Bender Mayank Goswami 0001 Dzejla Medjedovic Pablo Montes Kostas Tsichlas Batched Predecessor and Sorting with Size-Priced Information in External Memory. 2020 abs/2004.13197 CoRR https://arxiv.org/abs/2004.13197 db/journals/corr/corr2004.html#abs-2004-13197

Michael A. Bender Jeremy T. Fineman Seth Gilbert Maxwell Young Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. 6:1-6:33 2019 66 J. ACM 1 https://doi.org/10.1145/3276769 https://www.wikidata.org/entity/Q115522536 db/journals/jacm/jacm66.html#BenderFGY19

Alex Conway 0001 Eric Knorr Yizheng Jiao Michael A. Bender William Jannen Rob Johnson 0001 Donald E. Porter Martin Farach-Colton Filesystem Aging: It's more Usage than Fullness. 2019 HotStorage https://www.usenix.org/conference/hotstorage19/presentation/conway conf/hotstorage/2019 db/conf/hotstorage/hotstorage2019.html#ConwayKJBJJPF19 Michael A. Bender Jake Christensen Alex Conway 0001 Martin Farach-Colton Rob Johnson 0001 Meng-Tsung Tsai Optimal Ball Recycling. 2527-2546 2019 SODA https://doi.org/10.1137/1.9781611975482.155 https://dl.acm.org/citation.cfm?id=3310590 conf/soda/2019 db/conf/soda/soda2019.html#BenderCCFJT19 Michael A. Bender Alex Conway 0001 Martin Farach-Colton William Jannen Yizheng Jiao Rob Johnson 0001 Eric Knorr Sara McAllister Nirjhar Mukherjee Prashant Pandey 0001 Donald E. Porter Jun Yuan 0006 Yang Zhan 0001 Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design. 265-274 2019 SPAA https://doi.org/10.1145/3323165.3323210 https://www.wikidata.org/entity/Q130957511 conf/spaa/2019 db/conf/spaa/spaa2019.html#BenderCFJJJKMMP19 Michael A. Bender Martin Farach-Colton William Kuszmaul Achieving optimal backlog in multi-processor cup games. 1148-1157 2019 STOC https://doi.org/10.1145/3313276.3316342 conf/stoc/2019 db/conf/stoc/stoc2019.html#BenderFK19 Michael A. Bender Ola Svensson Grzegorz Herman 27th Annual European Symposium on Algorithms, ESA 2019, Munich/Garching, Germany, September 9-11, 2019 ESA Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019 LIPIcs 144 978-3-95977-124-5 http://www.dagstuhl.de/dagpub/978-3-95977-124-5 db/conf/esa/esa2019.html

Michael A. Bender Martin Farach-Colton William Kuszmaul Achieving Optimal Backlog in Multi-Processor Cup Games. 2019 abs/1904.02861 CoRR http://arxiv.org/abs/1904.02861 db/journals/corr/corr1904.html#abs-1904-02861

Prashant Pandey 0001 Michael A. Bender Rob Johnson 0001 Rob Patro Squeakr: an exact and approximate k-mer counting system. 568-575 2018 34 Bioinform. 4 https://doi.org/10.1093/bioinformatics/btx636 https://www.wikidata.org/entity/Q49999382 db/journals/bioinformatics/bioinformatics34.html#PandeyBJP18

Michael A. Bender Tsvi Kopelowitz Seth Pettie Maxwell Young Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses. 1735-1754 2018 47 SIAM J. Comput. 5 https://doi.org/10.1137/17M1158604 https://www.wikidata.org/entity/Q129143109 db/journals/siamcomp/siamcomp47.html#BenderKPY18

Michael A. Bender Rezaul Alam Chowdhury Pramod Ganapathi Samuel McCauley Yuan Tang The range 1 query (R1Q) problem. 130-147 2018 743 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.12.040 db/journals/tcs/tcs743.html#BenderCGMT18

Yang Zhan 0001 Yizheng Jiao Donald E. Porter Alex Conway 0001 Eric Knorr Martin Farach-Colton Michael A. Bender Jun Yuan 0006 William Jannen Rob Johnson 0001 Efficient Directory Mutations in a Full-Path-Indexed File System. 22:1-22:27 2018 14 ACM Trans. Storage 3 https://doi.org/10.1145/3241061 https://www.wikidata.org/entity/Q128862369 db/journals/tos/tos14.html#ZhanJPCKFBYJJ18

Yang Zhan 0001 Alexander Conway 0001 Yizheng Jiao Eric Knorr Michael A. Bender Martin Farach-Colton William Jannen Rob Johnson 0001 Donald E. Porter Jun Yuan 0006 The Full Path to Full-Path Indexing. 123-138 2018 FAST https://www.usenix.org/conference/fast18/presentation/zhan conf/fast/2018 db/conf/fast/fast2018.html#ZhanCJKBFJJPY18 Michael A. Bender Martin Farach-Colton Mayank Goswami 0001 Rob Johnson 0001 Samuel McCauley Shikha Singh 0002 Bloom Filters, Adaptivity, and the Dictionary Problem. 182-193 2018 FOCS https://doi.org/10.1109/FOCS.2018.00026 https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00026 conf/focs/2018 db/conf/focs/focs2018.html#BenderFGJM018 Michael A. Bender The Algorithmics of Write Optimization. 1 2018 IPDPS https://doi.org/10.1109/IPDPS.2018.00010 https://doi.ieeecomputersociety.org/10.1109/IPDPS.2018.00010 conf/ipps/2018 db/conf/ipps/ipdps2018.html#Bender18 Prashant Pandey 0001 Fatemeh Almodaresi Michael A. Bender Michael Ferdman Rob Johnson 0001 Rob Patro Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index. 271-273 2018 RECOMB https://link.springer.com/content/pdf/bbm%3A978-3-319-89929-9%2F1.pdf conf/recomb/2018 db/conf/recomb/recomb2018.html#PandeyABFJP18 Michael A. Bender Martin Farach-Colton Miguel A. Mosteiro LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings LATIN Springer 2018 Lecture Notes in Computer Science 10807 978-3-319-77403-9 978-3-319-77404-6 https://doi.org/10.1007/978-3-319-77404-6 db/conf/latin/latin2018.html

Michael A. Bender Jake Christensen Alexander Conway 0001 Martin Farach-Colton Rob Johnson 0001 Meng-Tsung Tsai Optimal Ball Recycling. 2018 abs/1807.01804 CoRR http://arxiv.org/abs/1807.01804 db/journals/corr/corr1807.html#abs-1807-01804

Michael A. Bender Jonathan W. Berry Martin Farach-Colton Rob Johnson 0001 Thomas M. Kroeger Prashant Pandey 0001 Cynthia A. Phillips Shikha Singh 0002 The Online Event-Detection Problem. 2018 abs/1812.09824 CoRR http://arxiv.org/abs/1812.09824 db/journals/corr/corr1812.html#abs-1812-09824

Prashant Pandey 0001 Michael A. Bender Rob Johnson 0001 Rob Patro deBGR: an efficient and near-exact representation of the weighted de Bruijn graph. i133-i141 2017 33 Bioinform. 14 https://doi.org/10.1093/bioinformatics/btx261 https://www.wikidata.org/entity/Q42697222 db/journals/bioinformatics/bioinformatics33.html#PandeyBJP17

Michael A. Bender Jonathan W. Berry Simon D. Hammond K. Scott Hemmert Samuel McCauley Branden Moore Benjamin Moseley Cynthia A. Phillips David S. Resnick Arun Rodrigues Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation. 213-228 2017 102 J. Parallel Distributed Comput. https://doi.org/10.1016/j.jpdc.2016.12.009 db/journals/jpdc/jpdc102.html#BenderBHHMMMPRR17

Michael A. Bender Martin Farach-Colton Sándor P. Fekete Jeremy T. Fineman Seth Gilbert Cost-Oblivious Storage Reallocation. 38:1-38:20 2017 13 ACM Trans. Algorithms 3 https://doi.org/10.1145/3070693 db/journals/talg/talg13.html#BenderFFFG17

Jun Yuan 0006 Yang Zhan 0001 William Jannen Prashant Pandey 0001 Amogh Akshintala Kanchan Chandnani Pooja Deo Zardosht Kasheff Leif Walsh Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Bradley C. Kuszmaul Donald E. Porter Writes Wrought Right, and Other Adventures in File System Optimization. 3:1-3:26 2017 13 ACM Trans. Storage 1 https://doi.org/10.1145/3032969 db/journals/tos/tos13.html#YuanZJPACDKWBFJ17

Alex Conway 0001 Ainesh Bakshi Yizheng Jiao Yang Zhan 0001 Michael A. Bender William Jannen Rob Johnson 0001 Bradley C. Kuszmaul Donald E. Porter Jun Yuan 0006 Martin Farach-Colton How to Fragment Your File System. 2017 42 login Usenix Mag. 2 https://www.usenix.org/publications/login/summer2017/conway db/journals/usenix-login/usenix-login42.html#ConwayBJ0BJJKPY17

Alexander Conway 0001 Ainesh Bakshi Yizheng Jiao William Jannen Yang Zhan 0001 Jun Yuan 0006 Michael A. Bender Rob Johnson 0001 Bradley C. Kuszmaul Donald E. Porter Martin Farach-Colton File Systems Fated for Senescence? Nonsense, Says Science! 45-58 2017 FAST https://www.usenix.org/conference/fast17/technical-sessions/presentation/conway conf/fast/2017 db/conf/fast/fast2017.html#ConwayBJJZYBJKP17 Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Simon Mauras Tyler Mayer Cynthia A. Phillips Helen Xu 0001 Write-Optimized Skip Lists. 69-78 2017 PODS https://doi.org/10.1145/3034786.3056117 conf/pods/2017 db/conf/pods/pods2017.html#BenderFJMMPX17 Prashant Pandey 0001 Michael A. Bender Rob Johnson 0001 Rob Patro A General-Purpose Counting Filter: Making Every Bit Count. 775-787 2017 SIGMOD Conference https://doi.org/10.1145/3035918.3035963 https://www.wikidata.org/entity/Q130966260 conf/sigmod/2017 db/conf/sigmod/sigmod2017.html#PandeyBJP17 Michael A. Bender Jeremy T. Fineman Seth Gilbert Tsvi Kopelowitz Pablo Montes File Maintenance: When in Doubt, Change the Layout! 1503-1522 2017 SODA https://doi.org/10.1137/1.9781611974782.98 http://dl.acm.org/citation.cfm?id=3039784 conf/soda/2017 db/conf/soda/soda2017.html#BenderFGKM17 Peyman Afshani Michael A. Bender Martin Farach-Colton Jeremy T. Fineman Mayank Goswami 0001 Meng-Tsung Tsai Cross-Referenced Dictionaries and the Limits of Write Optimization. 1523-1532 2017 SODA https://doi.org/10.1137/1.9781611974782.99 http://dl.acm.org/citation.cfm?id=3039785 conf/soda/2017 db/conf/soda/soda2017.html#AfshaniBFFGT17

Prashant Pandey 0001 Michael A. Bender Rob Johnson 0001 A Fast x86 Implementation of Select. 2017 abs/1706.00990 CoRR http://arxiv.org/abs/1706.00990 db/journals/corr/corr1706.html#PandeyBJ17

Michael A. Bender Martin Farach-Colton Mayank Goswami 0001 Rob Johnson 0001 Samuel McCauley Shikha Singh 0002 Bloom Filters, Adaptivity, and the Dictionary Problem. 2017 abs/1711.01616 CoRR http://arxiv.org/abs/1711.01616 db/journals/corr/corr1711.html#abs-1711-01616

Michael A. Bender Jeremy T. Fineman Seth Gilbert Robert E. Tarjan A New Approach to Incremental Cycle Detection and Related Problems. 14:1-14:22 2016 12 ACM Trans. Algorithms 2 https://doi.org/10.1145/2756553 db/journals/talg/talg12.html#BenderFGT16

Michael A. Bender Roozbeh Ebrahimi Haodong Hu Bradley C. Kuszmaul B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys. 19:1-19:33 2016 41 ACM Trans. Database Syst. 3 https://doi.org/10.1145/2907945 db/journals/tods/tods41.html#BenderEHK16

Jun Yuan 0006 Yang Zhan 0001 William Jannen Prashant Pandey 0001 Amogh Akshintala Kanchan Chandnani Pooja Deo Zardosht Kasheff Leif Walsh Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Bradley C. Kuszmaul Donald E. Porter Optimizing Every Operation in a Write-optimized File System. 1-14 2016 FAST https://www.usenix.org/conference/fast16/technical-sessions/presentation/yuan conf/fast/2016 db/conf/fast/fast2016.html#YuanZJPACDKWBFJ16 Michael A. Bender Samuel McCauley Bertrand Simon 0001 Shikha Singh 0002 Frédéric Vivien Resource Optimization for Program Committee Members: A Subreview Article. 7:1-7:20 2016 FUN https://doi.org/10.4230/LIPIcs.FUN.2016.7 conf/fun/2016 db/conf/fun/fun2016.html#BenderMS0V16 William Jannen Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Bradley C. Kuszmaul Donald E. Porter Lazy Analytics: Let Other Queries Do the Work For You. 2016 HotStorage https://www.usenix.org/conference/hotstorage16/workshop-program/presentation/jannen conf/hotstorage/2016 db/conf/hotstorage/hotstorage2016.html#JannenBFJKP16 Michael A. Bender Rezaul Chowdhury Alexander Conway 0001 Martin Farach-Colton Pramod Ganapathi Rob Johnson 0001 Samuel McCauley Bertrand Simon 0001 Shikha Singh 0002 The I/O Complexity of Computing Prime Tables. 192-206 2016 LATIN https://doi.org/10.1007/978-3-662-49529-2_15 conf/latin/2016 db/conf/latin/latin2016.html#BenderCCFGJMS016 Michael A. Bender Jonathan W. Berry Rob Johnson 0001 Thomas M. Kroeger Samuel McCauley Cynthia A. Phillips Bertrand Simon 0001 Shikha Singh 0002 David Zage Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries. 289-302 2016 PODS https://doi.org/10.1145/2902251.2902276 conf/pods/2016 db/conf/pods/pods2016.html#BenderBJKMPSSZ16 Michael A. Bender Jeremy T. Fineman Seth Gilbert Maxwell Young How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness. 636-654 2016 SODA https://doi.org/10.1137/1.9781611974331.ch47 http://dl.acm.org/citation.cfm?id=2884482 conf/soda/2016 db/conf/soda/soda2016.html#BenderFGY16 Michael A. Bender Erik D. Demaine Roozbeh Ebrahimi Jeremy T. Fineman Rob Johnson 0001 Andrea Lincoln Jayson Lynch Samuel McCauley Cache-Adaptive Analysis. 135-144 2016 SPAA https://doi.org/10.1145/2935764.2935798 conf/spaa/2016 db/conf/spaa/spaa2016.html#BenderDEFJLLM16 Michael A. Bender Tsvi Kopelowitz Seth Pettie Maxwell Young Contention resolution with log-logstar channel accesses. 499-508 2016 STOC https://doi.org/10.1145/2897518.2897655 conf/stoc/2016 db/conf/stoc/stoc2016.html#BenderKPY16 Jun Yuan 0006 Yang Zhan 0001 William Jannen Prashant Pandey 0001 Amogh Akshintala Kanchan Chandnani Pooja Deo Zardosht Kasheff Leif Walsh Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Bradley C. Kuszmaul Donald E. Porter Optimizing Every Operation in a Write-optimized File System. 2016 USENIX ATC https://www.usenix.org/conference/atc16/technical-sessions/presentation/yuan conf/usenix/2016 db/conf/usenix/usenix2016.html#YuanZJPACDKWBFJ16

Michael A. Bender Martin Farach-Colton Sándor P. Fekete Jeremy T. Fineman Seth Gilbert Reallocation Problems in Scheduling. 389-409 2015 73 Algorithmica 2 https://doi.org/10.1007/s00453-014-9930-4 db/journals/algorithmica/algorithmica73.html#BenderFFFG15

Michael A. Bender Jeremy T. Fineman Mahnush Movahedi Jared Saia Varsha Dani Seth Gilbert Seth Pettie Maxwell Young Resource-Competitive Algorithms. 57-71 2015 46 SIGACT News 3 https://doi.org/10.1145/2818936.2818949 db/journals/sigact/sigact46.html#BenderFMSDGPY15

Michael A. Bender Sándor P. Fekete Alexander Kröller Vincenzo Liberatore Joseph S. B. Mitchell Valentin Polishchuk Jukka Suomela The minimum backlog problem. 51-61 2015 605 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.08.027 db/journals/tcs/tcs605.html#BenderFKLMPS15

Michael A. Bender Martin Farach-Colton William Jannen Rob Johnson 0001 Bradley C. Kuszmaul Donald E. Porter Jun Yuan 0006 Yang Zhan 0001 An Introduction to Bε-trees and Write-Optimization. 2015 40 login Usenix Mag. 5 https://www.usenix.org/publications/login/oct15/bender db/journals/usenix-login/usenix-login40.html#BenderFJJKPY015

William Jannen Jun Yuan 0006 Yang Zhan 0001 Amogh Akshintala John Esmet Yizheng Jiao Ankur Mittal Prashant Pandey 0001 Phaneendra Reddy Leif Walsh Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Bradley C. Kuszmaul Donald E. Porter BetrFS: A Right-Optimized Write-Optimized File System. 301-315 2015 FAST https://www.usenix.org/conference/fast15/technical-sessions/presentation/jannen conf/fast/2015 db/conf/fast/fast2015.html#JannenYZAEJMPRW15 Michael A. Bender Jonathan W. Berry Simon D. Hammond K. Scott Hemmert Samuel McCauley Branden Moore Benjamin Moseley Cynthia A. Phillips David S. Resnick Arun Rodrigues Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation. 835-846 2015 IPDPS https://doi.org/10.1109/IPDPS.2015.94 https://doi.ieeecomputersociety.org/10.1109/IPDPS.2015.94 conf/ipps/2015 db/conf/ipps/ipdps2015.html#BenderBHHMMMPRR15 Michael A. Bender Samuel McCauley Andrew McGregor 0001 Shikha Singh 0002 Hoa T. Vu Run Generation Revisited: What Goes Up May or May Not Come Down. 703-714 2015 ISAAC https://doi.org/10.1007/978-3-662-48971-0_59 conf/isaac/2015 db/conf/isaac/isaac2015.html#BenderMM0V15 Michael A. Bender Jonathan W. Berry Simon D. Hammond Branden Moore Benjamin Moseley Cynthia A. Phillips k-Means Clustering on Two-Level Memory Systems. 197-205 2015 MEMSYS https://doi.org/10.1145/2818950.2818977 https://www.wikidata.org/entity/Q130995130 conf/memsys/2015 db/conf/memsys/memsys2015.html#BenderBHMMP15 Michael A. Bender Martin Farach-Colton Sándor P. Fekete Jeremy T. Fineman Seth Gilbert Cost-Oblivious Reallocation for Scheduling and Planning. 143-154 2015 SPAA https://doi.org/10.1145/2755573.2755589 conf/spaa/2015 db/conf/spaa/spaa2015.html#BenderFFFG15

Michael A. Bender Samuel McCauley Andrew McGregor 0001 Shikha Singh 0002 Hoa T. Vu Run Generation Revisited: What Goes Up May or May Not Come Down. 2015 abs/1504.06501 CoRR http://arxiv.org/abs/1504.06501 db/journals/corr/corr1504.html#BenderMMSV15

Michael A. Bender Ritwik Bose Rezaul Alam Chowdhury Samuel McCauley The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. 715-730 2014 54 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-013-9484-x db/journals/mst/mst54.html#BenderBCM14

Michael A. Bender Rezaul Alam Chowdhury Pramod Ganapathi Samuel McCauley Yuan Tang The Range 1 Query (R1Q) Problem. 116-128 2014 COCOON https://doi.org/10.1007/978-3-319-08783-2_11 conf/cocoon/2014 db/conf/cocoon/cocoon2014.html#BenderCGMT14 Michael A. Bender Martin Farach-Colton Mayank Goswami 0001 Dzejla Medjedovic Pablo Montes Meng-Tsung Tsai The Batched Predecessor Problem in External Memory. 112-124 2014 ESA https://doi.org/10.1007/978-3-662-44777-2_10 conf/esa/2014 db/conf/esa/esa2014.html#BenderFGMMT14 Michael A. Bender Martin Farach-Colton Sándor P. Fekete Jeremy T. Fineman Seth Gilbert Cost-oblivious storage reallocation. 278-288 2014 PODS https://doi.org/10.1145/2594538.2594548 conf/pods/2014 db/conf/pods/pods2014.html#BenderFFFG14 Dan Alistarh James Aspnes Michael A. Bender Rati Gelashvili Seth Gilbert Dynamic Task Allocation in Asynchronous Shared Memory. 416-435 2014 SODA https://doi.org/10.1137/1.9781611973402.31 conf/soda/2014 db/conf/soda/soda2014.html#AlistarhABGG14 Michael A. Bender Roozbeh Ebrahimi Jeremy T. Fineman Golnaz Ghasemiesfeh Rob Johnson 0001 Samuel McCauley Cache-Adaptive Algorithms. 958-971 2014 SODA https://doi.org/10.1137/1.9781611973402.71 conf/soda/2014 db/conf/soda/soda2014.html#BenderEFGJM14

Michael A. Bender Jeremy T. Fineman Seth Gilbert Maxwell Young NoiseOFF: A Backoff Protocol for a Dynamic, Noisy World. 2014 abs/1402.5207 CoRR http://arxiv.org/abs/1402.5207 db/journals/corr/corr1402.html#BenderFGY14

Michael A. Bender Martin Farach-Colton Sándor P. Fekete Jeremy T. Fineman Seth Gilbert Cost-oblivious storage reallocation. 2014 abs/1404.2019 CoRR http://arxiv.org/abs/1404.2019 db/journals/corr/corr1404.html#BenderFFFG14

Michael A. Bender Jacek Blazewicz Erwin Pesch Denis Trystram Guochuan Zhang Guest editorial: "New trends in scheduling" - Centre CNRS "La Villa Clythia" Frejus Workshop, September 12-17, 2010. 347-348 2013 16 J. Sched. 4 https://doi.org/10.1007/s10951-013-0332-2 https://www.wikidata.org/entity/Q57387716 db/journals/scheduling/scheduling16.html#BenderBPTZ13

Michael A. Bender Martin Farach-Colton Sándor P. Fekete Jeremy T. Fineman Seth Gilbert Reallocation problems in scheduling. 271-279 2013 SPAA https://doi.org/10.1145/2486159.2486181 conf/spaa/2013 db/conf/spaa/spaa2013.html#BenderFFFG13 Michael A. Bender David P. Bunde Vitus J. Leung Samuel McCauley Cynthia A. Phillips Efficient scheduling to minimize calibrations. 280-287 2013 SPAA https://doi.org/10.1145/2486159.2486193 conf/spaa/2013 db/conf/spaa/spaa2013.html#BenderBLMP13

Michael A. Bender Martin Farach-Colton Sándor P. Fekete Jeremy T. Fineman Seth Gilbert Reallocation Problems in Scheduling http://arxiv.org/abs/1305.6555 2013 CoRR abs/1305.6555 db/journals/corr/corr1305.html#abs-1305-6555

Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Russell Kraner Bradley C. Kuszmaul Dzejla Medjedovic Pablo Montes Pradeep Shetty Richard P. Spillane Erez Zadok Don't Thrash: How to Cache Your Hash on Flash. 1627-1637 2012 5 Proc. VLDB Endow. 11 http://vldb.org/pvldb/vol5/p1627_michaelabender_vldb2012.pdf https://doi.org/10.14778/2350229.2350275 https://www.wikidata.org/entity/Q63090442 db/journals/pvldb/pvldb5.html#BenderFJKKMMSSZ12

Dan Alistarh Michael A. Bender Seth Gilbert Rachid Guerraoui How to Allocate Tasks Asynchronously. 331-340 2012 FOCS https://doi.org/10.1109/FOCS.2012.41 https://doi.ieeecomputersociety.org/10.1109/FOCS.2012.41 conf/focs/2012 db/conf/focs/focs2012.html#AlistarhBGG12 Michael A. Bender Ritwik Bose Rezaul Alam Chowdhury Samuel McCauley The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. 28-39 2012 FUN https://doi.org/10.1007/978-3-642-30347-0_6 conf/fun/2012 db/conf/fun/fun2012.html#BenderBCM12 John Esmet Michael A. Bender Martin Farach-Colton Bradley C. Kuszmaul The TokuFS Streaming File System. 2012 HotStorage https://www.usenix.org/conference/hotstorage12/workshop-program/presentation/esmet conf/hotstorage/2012 db/conf/hotstorage/hotstorage2012.html#EsmetBFK12

Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Russell Kraner Bradley C. Kuszmaul Dzejla Medjedovic Pablo Montes Pradeep Shetty Richard P. Spillane Erez Zadok Don't Thrash: How to Cache Your Hash on Flash http://arxiv.org/abs/1208.0290 2012 CoRR abs/1208.0290 db/journals/corr/corr1208.html#abs-1208-0290

Michael A. Bender Gerth Stølting Brodal Rolf Fagerberg Dongdong Ge Simai He Haodong Hu John Iacono Alejandro López-Ortiz The Cost of Cache-Oblivious Searching. 463-505 2011 61 Algorithmica 2 https://doi.org/10.1007/s00453-010-9394-0 db/journals/algorithmica/algorithmica61.html#BenderBFGHHIL11

Esther M. Arkin Michael A. Bender Joseph S. B. Mitchell Valentin Polishchuk The snowblower problem. 370-384 2011 44 Comput. Geom. 8 https://doi.org/10.1016/j.comgeo.2011.03.003 db/journals/comgeo/comgeo44.html#ArkinBMP11

Michael A. Bender Bradley C. Kuszmaul Shang-Hua Teng Kebin Wang Optimal Cache-Oblivious Mesh Layouts. 269-296 2011 48 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-009-9242-2 https://www.wikidata.org/entity/Q125614448 db/journals/mst/mst48.html#BenderKTW11

Michael A. Bender Seth Gilbert Guest Editorial: Parallelism in Algorithms and Architectures. 671 2011 49 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-011-9363-2 db/journals/mst/mst49.html#BenderG11

Michael A. Bender Seth Gilbert Mutual Exclusion with O(log^2 Log n) Amortized Work. 728-737 2011 FOCS https://doi.org/10.1109/FOCS.2011.84 https://doi.ieeecomputersociety.org/10.1109/FOCS.2011.84 conf/focs/2011 db/conf/focs/focs2011.html#BenderG11 Michael A. Bender Martin Farach-Colton Rob Johnson 0001 Bradley C. Kuszmaul Dzejla Medjedovic Pablo Montes Pradeep Shetty Richard P. Spillane Erez Zadok Don't Thrash: How to Cache Your Hash on Flash. 2011 HotStorage https://www.usenix.org/conference/hotstorage11/dont-thrash-how-cache-your-hash-flash conf/hotstorage/2011 db/conf/hotstorage/hotstorage2011.html#BenderFJKMMSSZ11

Michael A. Bender Sándor P. Fekete Tom Kamphans Nils Schweer Maintaining Arrays of Contiguous Objects http://arxiv.org/abs/1101.5407 2011 CoRR abs/1101.5407 db/journals/corr/corr1101.html#abs-1101-5407

Michael A. Bender Jeremy T. Fineman Seth Gilbert Robert Endre Tarjan A New Approach to Incremental Cycle Detection and Related Problems http://arxiv.org/abs/1112.0784 2011 CoRR abs/1112.0784 db/journals/corr/corr1112.html#abs-1112-0784

Michael A. Bender Gerth Stølting Brodal Rolf Fagerberg Riko Jacob Elias Vicari Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. 934-962 2010 47 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-010-9285-4 db/journals/mst/mst47.html#BenderBFJV10

Michael A. Bender Jacek Blazewicz Erwin Pesch Denis Trystram Guochuan Zhang Guest editorial - Special issue "New challenges in scheduling theory" (Marseilles Workshop, May 12-16, 2008). 451-452 2010 13 J. Sched. 5 https://doi.org/10.1007/s10951-010-0196-7 https://www.wikidata.org/entity/Q57387741 db/journals/scheduling/scheduling13.html#BenderBPTZ10

Michael A. Bender Haodong Hu Bradley C. Kuszmaul Performance guarantees for B-trees with different-sized atomic keys. 305-316 2010 PODS https://doi.org/10.1145/1807085.1807125 conf/pods/2010 db/conf/pods/pods2010.html#BenderHK10

Kunal Agrawal 0001 Michael A. Bender Jeremy T. Fineman The Worst Page-Replacement Policy. 175-185 2009 44 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-008-9114-1 db/journals/mst/mst44.html#AgrawalBF09

Michael A. Bender Sándor P. Fekete Tom Kamphans Nils Schweer Maintaining Arrays of Contiguous Objects. 14-25 2009 FCT https://doi.org/10.1007/978-3-642-03409-1_3 conf/fct/2009 db/conf/fct/fct2009.html#BenderFKS09 Michael A. Bender Jeremy T. Fineman Seth Gilbert A new approach to incremental topological ordering. 1108-1115 2009 SODA https://doi.org/10.1137/1.9781611973068.120 http://dl.acm.org/citation.cfm?id=1496770.1496890 conf/soda/2009 db/conf/soda/soda2009.html#BenderFG09 Michael A. Bender From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering. 2 2009 SEA https://doi.org/10.1007/978-3-642-02011-7_2 conf/wea/2009 db/conf/wea/sea2009.html#Bender09 Friedhelm Meyer auf der Heide Michael A. Bender SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 SPAA ACM 2009 978-1-60558-606-9 https://doi.org/10.1145/1583991 db/conf/spaa/spaa2009.html

Michael A. Bender David P. Bunde Erik D. Demaine Sándor P. Fekete Vitus J. Leung Henk Meijer Cynthia A. Phillips Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. 279-298 2008 50 Algorithmica 2 https://doi.org/10.1007/s00453-007-9037-2 db/journals/algorithmica/algorithmica50.html#BenderBDFLMP08

Michael A. Bender Dongdong Ge Simai He Haodong Hu Ron Y. Pinter Steven Skiena Firas Swidan Improved bounds on sorting by length-weighted reversals. 744-774 2008 74 J. Comput. Syst. Sci. 5 https://doi.org/10.1016/j.jcss.2007.08.008 db/journals/jcss/jcss74.html#BenderGHHPSS08

Michael A. Bender Raphaël Clifford Kostas Tsichlas Scheduling algorithms for procrastinators. 95-104 2008 11 J. Sched. 2 https://doi.org/10.1007/s10951-007-0038-4 db/journals/scheduling/scheduling11.html#BenderCT08

Michael A. Bender Jacek Blazewicz Klaus Ecker Erwin Pesch Denis Trystram Guest editorial. 309-310 2008 11 J. Sched. 5 https://doi.org/10.1007/s10951-008-0074-8 https://www.wikidata.org/entity/Q57387750 db/journals/scheduling/scheduling11.html#BenderBEPT08

Michael A. Bender Bryan Bradley Geetha Jagannathan Krishnan Pillaipakkamnatt Sum-of-squares heuristics for bin packing and memory allocation. 2007 12 ACM J. Exp. Algorithmics https://doi.org/10.1145/1227161.1227165 db/journals/jea/jea12.html#BenderBJP07 2.3:1-2.3:19

Lars Arge Michael A. Bender Erik D. Demaine Bryan Holland-Minkley J. Ian Munro An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. 1672-1695 2007 36 SIAM J. Comput. 6 https://doi.org/10.1137/S0097539703428324 db/journals/siamcomp/siamcomp36.html#ArgeBDHM07

Harold N. Gabow Michael A. Bender Martin Farach-Colton Introduction to SODA 2002 and 2003 special issue. 2007 3 ACM Trans. Algorithms 4 https://doi.org/10.1145/1290672.1290673 db/journals/talg/talg3.html#GabowBF07 36

Michael A. Bender Haodong Hu An adaptive packed-memory array. 2007 32 ACM Trans. Database Syst. 4 https://doi.org/10.1145/1292609.1292616 db/journals/tods/tods32.html#BenderH07 26

Kunal Agrawal 0001 Michael A. Bender Jeremy T. Fineman The Worst Page-Replacement Policy. 135-145 2007 conf/fun/2007 FUN https://doi.org/10.1007/978-3-540-72914-3_13 db/conf/fun/fun2007.html#AgrawalBF07 Michael A. Bender Cynthia A. Phillips Scheduling DAGs on asynchronous processors. 35-45 2007 conf/spaa/2007 SPAA https://doi.org/10.1145/1248377.1248384 db/conf/spaa/spaa2007.html#BenderP07 Michael A. Bender Gerth Stølting Brodal Rolf Fagerberg Riko Jacob Elias Vicari Optimal sparse matrix dense vector multiplication in the I/O-model. 61-70 2007 conf/spaa/2007 SPAA https://doi.org/10.1145/1248377.1248391 db/conf/spaa/spaa2007.html#BenderBFJV07 Michael A. Bender Martin Farach-Colton Jeremy T. Fineman Yonatan R. Fogel Bradley C. Kuszmaul Jelani Nelson Cache-oblivious streaming B-trees. 81-92 2007 conf/spaa/2007 SPAA https://doi.org/10.1145/1248377.1248393 db/conf/spaa/spaa2007.html#BenderFFFKN07

Michael A. Bender Bradley C. Kuszmaul Shang-Hua Teng Kebin Wang Optimal Cache-Oblivious Mesh Layouts http://arxiv.org/abs/0705.1033 2007 CoRR abs/0705.1033 db/journals/corr/corr0705.html#abs-0705-1033

Esther M. Arkin Michael A. Bender Sándor P. Fekete Joseph S. B. Mitchell Martin Skutella The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. 193-221 2006 46 Algorithmica 2 https://doi.org/10.1007/s00453-006-1206-1 db/journals/algorithmica/algorithmica46.html#ArkinBFMS06

Michael A. Bender Martin Farach-Colton Miguel A. Mosteiro Insertion Sort is O(n log n). 391-397 2006 39 Theory Comput. Syst. 3 https://doi.org/10.1007/s00224-005-1237-z https://www.wikidata.org/entity/Q30052820 db/journals/mst/mst39.html#BenderFM06

Michael A. Bender Jeremy T. Fineman Seth Gilbert Contention Resolution with Heterogeneous Job Sizes. 112-123 2006 conf/esa/2006 ESA https://doi.org/10.1007/11841036_13 db/conf/esa/esa2006.html#BenderFG06 Michael A. Bender Dror G. Feitelson Allan Gottlieb Uwe Schwiegelshohn Topic 3: Scheduling and Load Balancing. 155 2006 conf/europar/2006 Euro-Par https://doi.org/10.1007/11823285_16 db/conf/europar/europar2006.html#BenderFGS06 Michael A. Bender Haodong Hu An adaptive packed-memory array. 20-29 2006 conf/pods/2006 PODS https://doi.org/10.1145/1142351.1142355 db/conf/pods/pods2006.html#BenderH06 Michael A. Bender Martin Farach-Colton Bradley C. Kuszmaul Cache-oblivious string B-trees. 233-242 2006 conf/pods/2006 PODS https://doi.org/10.1145/1142351.1142385 db/conf/pods/pods2006.html#BenderFK06 Esther M. Arkin Michael A. Bender Joseph S. B. Mitchell Valentin Polishchuk The Snowblower Problem. 219-234 2006 WAFR https://doi.org/10.1007/978-3-540-68405-3_14 conf/wafr/2006 db/conf/wafr/wafr2006.html#ArkinBMP06

Esther M. Arkin Michael A. Bender Joseph S. B. Mitchell Valentin Polishchuk The Snowblower Problem http://arxiv.org/abs/cs/0603026 2006 CoRR abs/cs/0603026 db/journals/corr/corr0603.html#abs-cs-0603026

Michael A. Bender Raphaël Clifford Kostas Tsichlas Scheduling Algorithms for Procrastinators http://arxiv.org/abs/cs/0606067 2006 CoRR abs/cs/0606067 db/journals/corr/corr0606.html#abs-cs-0606067

Yonatan Aumann Michael A. Bender Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. 191-207 2005 17 Distributed Comput. 3 https://doi.org/10.1007/s00446-004-0113-4 db/journals/dc/dc17.html#AumannB05

Michael A. Bender Martin Farach-Colton Giridhar Pemmasani Steven Skiena Pavel Sumazin Lowest common ancestors in trees and directed acyclic graphs. 75-94 2005 57 J. Algorithms 2 https://doi.org/10.1016/j.jalgor.2005.08.001 https://www.wikidata.org/entity/Q29541159 db/journals/jal/jal57.html#BenderFPSS05

Michael A. Bender Erik D. Demaine Martin Farach-Colton Cache-Oblivious B-Trees. 341-358 2005 35 SIAM J. Comput. 2 https://doi.org/10.1137/S0097539701389956 https://www.wikidata.org/entity/Q59831031 db/journals/siamcomp/siamcomp35.html#BenderDF05

Esther M. Arkin Michael A. Bender Erik D. Demaine Sándor P. Fekete Joseph S. B. Mitchell Saurabh Sethia Optimal Covering Tours with Turn Costs. 531-566 2005 35 SIAM J. Comput. 3 https://doi.org/10.1137/S0097539703434267 db/journals/siamcomp/siamcomp35.html#ArkinBDFMS05

Denis Trystram Michael A. Bender Uwe Schwiegelshohn Luís Paulo Santos Topic 3 Scheduling and Load-Balancing. 207 2005 conf/europar/2005 Euro-Par https://doi.org/10.1007/11549468_25 db/conf/europar/europar2005.html#TrystramBSS05 Michael A. Bender Jeremy T. Fineman Seth Gilbert Bradley C. Kuszmaul Concurrent cache-oblivious b-trees. 228-237 2005 conf/spaa/2005 SPAA https://doi.org/10.1145/1073970.1074009 db/conf/spaa/spaa2005.html#BenderFGK05 Michael A. Bender Martin Farach-Colton Simai He Bradley C. Kuszmaul Charles E. Leiserson Adversarial contention resolution for simple channels. 325-332 2005 conf/spaa/2005 SPAA https://doi.org/10.1145/1073970.1074023 db/conf/spaa/spaa2005.html#BenderFHKL05 Michael A. Bender David P. Bunde Erik D. Demaine Sándor P. Fekete Vitus J. Leung Henk Meijer Cynthia A. Phillips Communication-Aware Processor Allocation for Supercomputers. 169-181 2005 conf/wads/2005 WADS https://doi.org/10.1007/11534273_16 db/conf/wads/wads2005.html#BenderBDFLMP05 Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 Cache-Oblivious and Cache-Aware Algorithms Lars Arge Michael A. Bender Erik D. Demaine Charles E. Leiserson Kurt Mehlhorn 04301 2005 Dagstuhl Seminar Proceedings IBFI, Schloss Dagstuhl, Germany db/conf/dagstuhl/P4301.html http://drops.dagstuhl.de/portals/04301/

Esther M. Arkin Michael A. Bender Erik D. Demaine Martin L. Demaine Joseph S. B. Mitchell Saurabh Sethia Steven Skiena When can you fold a map? 23-46 2004 29 Comput. Geom. 1 https://doi.org/10.1016/j.comgeo.2004.03.012 db/journals/comgeo/comgeo29.html#ArkinBDDMSS04

Michael A. Bender Ziyang Duan John Iacono Jing Wu A locality-preserving cache-oblivious dynamic dictionary. 115-136 2004 53 J. Algorithms 2 https://doi.org/10.1016/j.jalgor.2004.04.014 db/journals/jal/jal53.html#BenderDIW04

Michael A. Bender Saurabh Sethia Steven Skiena Data structures for maintaining set partitions. 43-67 2004 25 Random Struct. Algorithms 1 https://doi.org/10.1002/rsa.20025 db/journals/rsa/rsa25.html#BenderSS04

Michael A. Bender S. Muthukrishnan 0001 Rajmohan Rajaraman Approximation Algorithms for Average Stretch Scheduling. 195-222 2004 7 J. Sched. 3 https://doi.org/10.1023/B:JOSH.0000019681.52701.8b db/journals/scheduling/scheduling7.html#BenderMR04

Michael A. Bender Martin Farach-Colton The Level Ancestor Problem simplified. 5-12 2004 321 Theor. Comput. Sci. 1 https://doi.org/10.1016/j.tcs.2003.05.002 https://www.wikidata.org/entity/Q57311753 db/journals/tcs/tcs321.html#BenderF04

Marcelo O. Sztainberg Esther M. Arkin Michael A. Bender Joseph S. B. Mitchell Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem. 691-701 2004 20 IEEE Trans. Robotics 4 https://doi.org/10.1109/TRO.2004.829439 db/journals/trob/trob20.html#SztainbergABM04

Michael A. Bender Bryan Bradley Geetha Jagannathan Krishnan Pillaipakkamnatt The Robustness of the Sum-of-Squares Algorithm for Bin Packing. 18-30 2004 conf/alenex/2004 ALENEX/ANALC db/conf/alenex/alenex2004.html#BenderBJP04 Firas Swidan Michael A. Bender Dongdong Ge Simai He Haodong Hu Ron Y. Pinter Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. 32-46 https://doi.org/10.1007/978-3-540-27801-6_3 2004 conf/cpm/2004 CPM db/conf/cpm/cpm2004.html#SwidanBGHHP04 Michael A. Bender Martin Farach-Colton Simai He Bradley C. Kuszmaul Charles E. Leiserson Adversarial Analyses of Window Backoff Strategies. 2004 conf/ipps/2004 IPDPS Next Generation Software Program - NSFNGS - PI Workshop https://doi.org/10.1109/IPDPS.2004.1303230 https://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303230 db/conf/ipps/ipdps2004-w10.html#BenderFHKL04 Michael A. Bender Dongdong Ge Simai He Haodong Hu Ron Y. Pinter Steven Skiena Firas Swidan Improved bounds on sorting with length-weighted reversals. 919-928 2004 conf/soda/2004 SODA http://dl.acm.org/citation.cfm?id=982792.982930 db/conf/soda/soda2004.html#BenderGHHPSS04 Michael A. Bender Jeremy T. Fineman Seth Gilbert Charles E. Leiserson On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. 133-144 2004 conf/spaa/2004 SPAA https://doi.org/10.1145/1007912.1007933 db/conf/spaa/spaa2004.html#BenderFGL04 Lars Arge Michael A. Bender Erik D. Demaine Charles E. Leiserson Kurt Mehlhorn 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. 2004 Cache-Oblivious and Cache-Aware Algorithms http://drops.dagstuhl.de/opus/volltexte/2005/157 conf/dagstuhl/2004P4301 db/conf/dagstuhl/P4301.html#ArgeBDLM04

Esther M. Arkin Michael A. Bender Sándor P. Fekete Joseph S. B. Mitchell Martin Skutella The Freeze-Tag Problem: How to Wake Up a Swarm of Robots http://arxiv.org/abs/cs/0402045 2004 CoRR cs.DS/0402045 db/journals/corr/corr0402.html#cs-DS-0402045

Michael A. Bender Martin Farach-Colton Miguel A. Mosteiro Insertion Sort is O(n log n) http://arxiv.org/abs/cs.DS/0407003 https://doi.org/10.48550/arXiv.cs/0407003 2004 CoRR cs.DS/0407003 db/journals/corr/corr0407.html#cs-DS-0407003

Michael A. Bender David P. Bunde Erik D. Demaine Sándor P. Fekete Vitus J. Leung Henk Meijer Cynthia A. Phillips Communication-Aware Processor Allocation for Supercomputers http://arxiv.org/abs/cs.DS/0407058 https://doi.org/10.48550/arXiv.cs/0407058 2004 CoRR cs.DS/0407058 db/journals/corr/corr0407.html#cs-DS-0407058

Esther M. Arkin Michael A. Bender Joseph S. B. Mitchell Steven Skiena The Lazy Bureaucrat scheduling problem. 129-146 2003 184 Inf. Comput. 1 https://doi.org/10.1016/S0890-5401(03)00060-9 db/journals/iandc/iandc184.html#ArkinBMS03

Tien-Ruey Hsiang Esther M. Arkin Michael A. Bender Sándor P. Fekete Joseph S. B. Mitchell Online dispersion algorithms for swarms of robots. 382-383 2003 conf/compgeom/2003 SCG https://doi.org/10.1145/777792.777854 db/conf/compgeom/compgeom2003.html#HsiangABFM03 Michael A. Bender Gerth Stølting Brodal Rolf Fagerberg Dongdong Ge Simai He Haodong Hu John Iacono Alejandro López-Ortiz The Cost of Cache-Oblivious Searching. 271-282 2003 conf/focs/2003 FOCS https://doi.org/10.1109/SFCS.2003.1238201 https://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238201 db/conf/focs/focs2003.html#BenderBFGHHIL03 Esther M. Arkin Michael A. Bender Dongdong Ge Improved approximation algorithms for the freeze-tag problem. 295-303 2003 conf/spaa/2003 SPAA https://doi.org/10.1145/777412.777465 db/conf/spaa/spaa2003.html#ArkinBG03

Esther M. Arkin Michael A. Bender Erik D. Demaine Sándor P. Fekete Joseph S. B. Mitchell Saurabh Sethia Optimal Covering Tours with Turn Costs http://arxiv.org/abs/cs/0309014 2003 CoRR cs.DS/0309014 db/journals/corr/corr0309.html#cs-DS-0309014

Matthew Andrews Michael A. Bender Lisa Zhang 0001 New Algorithms for Disk Scheduling. 277-301 2002 32 Algorithmica 2 https://doi.org/10.1007/s00453-001-0071-1 db/journals/algorithmica/algorithmica32.html#AndrewsBZ02

Michael A. Bender Antonio Fernández 0001 Dana Ron Amit Sahai Salil P. Vadhan The Power of a Pebble: Exploring and Mapping Directed Graphs. 1-21 2002 176 Inf. Comput. 1 https://doi.org/10.1006/inco.2001.3081 db/journals/iandc/iandc176.html#BenderFRSV02

Michael A. Bender Michael O. Rabin Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk. 289-304 2002 35 Theory Comput. Syst. 3 https://doi.org/10.1007/s00224-002-1055-5 db/journals/mst/mst35.html#BenderR02

Michael A. Bender Dana Ron Testing properties of directed graphs: acyclicity and connectivity. 184-205 2002 20 Random Struct. Algorithms 2 db/journals/rsa/rsa20.html#BenderR02 https://doi.org/10.1002/rsa.10023

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 Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies. 296-304 2002 conf/cluster/2002 CLUSTER https://doi.org/10.1109/CLUSTR.2002.1137758 https://doi.ieeecomputersociety.org/10.1109/CLUSTR.2002.1137758 db/conf/cluster/cluster2002.html#LeungABBJLMPS02 Michael A. Bender Richard Cole 0001 Erik D. Demaine Martin Farach-Colton Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. 139-151 2002 conf/esa/2002 ESA https://doi.org/10.1007/3-540-45749-6_16 db/conf/esa/esa2002.html#BenderCDF02 Michael A. Bender Richard Cole 0001 Erik D. Demaine Martin Farach-Colton Jack Zito Two Simplified Algorithms for Maintaining Order in a List. 152-164 2002 conf/esa/2002 ESA https://doi.org/10.1007/3-540-45749-6_17 db/conf/esa/esa2002.html#BenderCDFZ02 Michael A. Bender Erik D. Demaine Martin Farach-Colton Efficient Tree Layout in a Multilevel Memory Hierarchy. 165-173 2002 conf/esa/2002 ESA https://doi.org/10.1007/3-540-45749-6_18 db/conf/esa/esa2002.html#BenderDF02 Michael A. Bender Richard Cole 0001 Rajeev Raman Exponential Structures for Efficient Cache-Oblivious Algorithms. 195-207 2002 conf/icalp/2002 ICALP https://doi.org/10.1007/3-540-45465-9_18 db/conf/icalp/icalp2002.html#BenderCR02 Michael A. Bender Martin Farach-Colton The Level Ancestor Problem Simplified. 508-515 2002 conf/latin/2002 LATIN https://doi.org/10.1007/3-540-45995-2_44 db/conf/latin/latin2002.html#BenderF02 Michael A. Bender Ziyang Duan John Iacono Jing Wu A locality-preserving cache-oblivious dynamic dictionary. 29-38 2002 conf/soda/2002 SODA http://dl.acm.org/citation.cfm?id=545381.545385 db/conf/soda/soda2002.html#BenderDIW02 Esther M. Arkin Michael A. Bender Sándor P. Fekete Joseph S. B. Mitchell Martin Skutella The freeze-tag problem: how to wake up a swarm of robots. 568-577 2002 conf/soda/2002 SODA http://dl.acm.org/citation.cfm?id=545381.545457 db/conf/soda/soda2002.html#ArkinBFMS02 Michael A. Bender S. Muthukrishnan 0001 Rajmohan Rajaraman Improved algorithms for stretch scheduling. 762-771 2002 conf/soda/2002 SODA http://dl.acm.org/citation.cfm?id=545381.545482 db/conf/soda/soda2002.html#BenderMR02 Lars Arge Michael A. Bender Erik D. Demaine Bryan Holland-Minkley J. Ian Munro Cache-oblivious priority queue and graph algorithm applications. 268-276 2002 conf/stoc/2002 STOC https://doi.org/10.1145/509907.509950 db/conf/stoc/stoc2002.html#ArgeBDHM02 Marcelo O. Sztainberg Esther M. Arkin Michael A. Bender Joseph S. B. Mitchell Analysis of Heuristics for the Freeze-Tag Problem. 270-279 2002 conf/swat/2002 SWAT https://doi.org/10.1007/3-540-45471-3_28 db/conf/swat/swat2002.html#SztainbergABM02 Tien-Ruey Hsiang Esther M. Arkin Michael A. Bender Sándor P. Fekete Joseph S. B. Mitchell Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments. 77-94 2002 WAFR https://doi.org/10.1007/978-3-540-45058-0_6 conf/wafr/2002 db/conf/wafr/wafr2002.html#HsiangABFM02

Esther M. Arkin Michael A. Bender Joseph S. B. Mitchell Steven Skiena The Lazy Bureaucrat Scheduling Problem https://arxiv.org/abs/cs/0210024 2002 CoRR cs.DS/0210024 db/journals/corr/corr0210.html#cs-DS-0210024

Stephen Alstrup Michael A. Bender Erik D. Demaine Martin Farach-Colton J. Ian Munro Theis Rauhe Mikkel Thorup Efficient Tree Layout in a Multilevel Memory Hierarchy http://arxiv.org/abs/cs/0211010 2002 CoRR cs.DS/0211010 db/journals/corr/corr0211.html#cs-DS-0211010

Tien-Ruey Hsiang Esther M. Arkin Michael A. Bender Sándor P. Fekete Joseph S. B. Mitchell Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments http://arxiv.org/abs/cs/0212022 2002 CoRR cs.RO/0212022 db/journals/corr/corr0212.html#cs-RO-0212022

Chandra Chekuri Michael A. Bender An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. 212-224 2001 41 J. Algorithms 2 https://doi.org/10.1006/jagm.2001.1184 db/journals/jal/jal41.html#ChekuriB01

Esther M. Arkin Michael A. Bender Erik D. Demaine Sándor P. Fekete Joseph S. B. Mitchell Saurabh Sethia Optimal covering tours with turn costs. 138-147 2001 conf/soda/2001 SODA http://dl.acm.org/citation.cfm?id=365411.365430 db/conf/soda/soda2001.html#ArkinBDFMS01 Michael A. Bender Giridhar Pemmasani Steven Skiena Pavel Sumazin Finding least common ancestors in directed acyclic graphs. 845-854 2001 conf/soda/2001 SODA http://dl.acm.org/citation.cfm?id=365411.365795 db/conf/soda/soda2001.html#BenderPSS01 Esther M. Arkin Michael A. Bender Erik D. Demaine Martin L. Demaine Joseph S. B. Mitchell Saurabh Sethia Steven Skiena When Can You Fold a Map? 401-413 2001 conf/wads/2001 WADS https://doi.org/10.1007/3-540-44634-6_37 db/conf/wads/wads2001.html#ArkinBDDMSS01 Michael A. Bender A functional framework for efficient web-based scientific visualization systems. 1-119 Universität Kaiserslautern 2000

Michael A. Bender Chandra Chekuri Performance guarantees for the TSP with a parameterized triangle inequality. 17-21 2000 73 Inf. Process. Lett. 1-2 db/journals/ipl/ipl73.html#BenderC00 https://doi.org/10.1016/S0020-0190(99)00160-X

Michael A. Bender Erik D. Demaine Martin Farach-Colton Cache-Oblivious B-Trees. 399-409 2000 conf/focs/2000 FOCS db/conf/focs/focs2000.html#BenderDF00 https://doi.org/10.1109/SFCS.2000.892128 https://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892128 Michael A. Bender Dana Ron Testing Acyclicity of Directed Graphs in Sublinear Time. 809-820 https://doi.org/10.1007/3-540-45022-X_68 2000 conf/icalp/2000 ICALP db/conf/icalp/icalp2000.html#BenderR00 Michael A. Bender Martin Farach-Colton The LCA Problem Revisited. 88-94 2000 conf/latin/2000 LATIN db/conf/latin/latin2000.html#BenderF00 https://doi.org/10.1007/10719839_9 https://www.wikidata.org/entity/Q29040766 Mie Sato Ingmar Bitter Michael A. Bender Arie E. Kaufman Masayuki Nakajima 0001 TEASAR: Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons. 281- 2000 conf/pg/2000 PG https://doi.org/10.1109/PCCGA.2000.883951 https://doi.ieeecomputersociety.org/10.1109/PCCGA.2000.883951 db/conf/pg/pg2000.html#SatoBBKN00 Michael A. Bender Michael O. Rabin Scheduling Cilk multithreaded parallel programs on processors of different speeds. 13-21 2000 conf/spaa/2000 SPAA https://doi.org/10.1145/341800.341803 db/conf/spaa/spaa2000.html#BenderR00 Michael A. Bender Saurabh Sethia Steven Skiena Data Structures for Maintaining Set Partitions. 83-96 https://doi.org/10.1007/3-540-44985-X_9 2000 conf/swat/2000 SWAT db/conf/swat/swat2000.html#BenderSS00 Ingmar Bitter Mie Sato Michael A. Bender Kevin T. McDonnell Arie E. Kaufman Ming Wan CEASAR: a smooth, accurate and robust centerline extraction algorithm. 45-52 2000 conf/visualization/2000 IEEE Visualization https://doi.org/10.1109/VISUAL.2000.885675 https://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885675 https://dl.acm.org/citation.cfm?id=375217 db/conf/visualization/visualization2000.html#BitterSBMKW00

Esther M. Arkin Michael A. Bender Erik D. Demaine Martin L. Demaine Joseph S. B. Mitchell Saurabh Sethia Steven Skiena When Can You Fold a Map? https://arxiv.org/abs/cs/0011026 2000 CoRR cs.CG/0011026 db/journals/corr/corr0011.html#cs-CG-0011026

Michael A. Bender Chandra Chekuri Performance Guarantees for the TSP with a Parameterized Triangle Inequality. 80-85 https://doi.org/10.1007/3-540-48447-7_10 1999 conf/wads/1999 WADS db/conf/wads/wads99.html#BenderC99 Esther M. Arkin Michael A. Bender Joseph S. B. Mitchell Steven Skiena The Lazy Bureaucrat Scheduling Problem. 122-133 https://doi.org/10.1007/3-540-48447-7_14 1999 conf/wads/1999 WADS db/conf/wads/wads99.html#ArkinBMS99 Chandra Chekuri Michael A. Bender An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. 383-393 https://doi.org/10.1007/3-540-69346-7_29 1998 conf/ipco/1998 IPCO db/conf/ipco/ipco1998.html#CherukiB98 Michael A. Bender Soumen Chakrabarti S. Muthukrishnan 0001 Flow and Stretch Metrics for Scheduling Continuous Job Streams. 270-279 1998 conf/soda/1998 SODA db/conf/soda/soda98.html#BenderCM98 http://dl.acm.org/citation.cfm?id=314613.314715 Michael A. Bender Antonio Fernández 0001 Dana Ron Amit Sahai Salil P. Vadhan The Power of a Pebble: Exploring and Mapping Directed Graphs. 269-278 1998 conf/stoc/1998 STOC https://doi.org/10.1145/276698.276759 db/conf/stoc/stoc1998.html#BenderFRSV98

Yonatan Aumann Michael A. Bender Lisa Zhang 0001 Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. 1-16 1997 139 Inf. Comput. 1 db/journals/iandc/iandc139.html#AumannBZ97 https://doi.org/10.1006/inco.1997.2653

Matthew Andrews Michael A. Bender Lisa Zhang 0001 New Algorithms for the Disk Scheduling Problem. 550-559 1996 conf/focs/1996 FOCS db/conf/focs/focs96.html#AndrewsBZ96 https://doi.org/10.1109/SFCS.1996.548514 https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548514 Yonatan Aumann Michael A. Bender Fault Tolerant Data Structures. 580-589 1996 conf/focs/1996 FOCS db/conf/focs/focs96.html#AumannB96 https://doi.org/10.1109/SFCS.1996.548517 https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548517 Yonatan Aumann Michael A. Bender Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. 622-633 1996 conf/icalp/1996 ICALP db/conf/icalp/icalp96.html#AumannB96 https://doi.org/10.1007/3-540-61440-0_164 Yonatan Aumann Michael A. Bender Lisa Zhang 0001 Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. 270-276 1996 conf/spaa/1996 SPAA db/conf/spaa/spaa96.html#AumannBZ96 https://doi.org/10.1145/237502.237566

Michael A. Bender Michel Gastaldo Michel Morvan Parallel Interval Order Recognition and Construction of Interval Representations. 73-91 1995 143 Theor. Comput. Sci. 1 db/journals/tcs/tcs143.html#BenderGM95 https://doi.org/10.1016/0304-3975(95)80025-5

The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs Michael A. Bender Donna K. Slonim 75-85 conf/focs/FOCS35 1994 FOCS db/conf/focs/focs94.html#BenderS94 https://doi.org/10.1109/SFCS.1994.365703 https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365703 Peyman Afshani Kunal Agrawal 0001 Amogh Akshintala Dan Alistarh Fatemeh Almodaresi Stephen Alstrup Matthew Andrews Lars Arge Esther M. Arkin James Aspnes Hagit Attiya Yonatan Aumann Ainesh Bakshi Ezio Bartocci Sanjoy BaruahSanjoy K. Baruah Michael Benedikt Rory Bennett Aaron Bernstein Jonathan W. Berry Simon Bertron Abhishek Bhattacharjee Arghya Bhattacharya Philip Bille Ingmar Bitter Jacek Blazewicz Guy E. Blelloch Ritwik Bose Bryan Bradley Gerth Stølting Brodal David P. Bunde Nairen Cao Soumen Chakrabarti Kanchan Chandnani Chandra Chekuri Abiyaz Chowdhury Rezaul Alam ChowdhuryRezaul Chowdhury Jake Christensen Raphaël Clifford Richard Cole 0001 Michael Condict Alexander Conway 0001Alex Conway 0001 Justin Dallant Varsha Dani Rathish Das Daniel DeLayoDaniel R. Delayo J. Ahmed Dellas Erik D. Demaine Martin L. Demaine Pooja Deo Laxman Dhulipala Ziyang Duan Joe Durie Roozbeh Ebrahimi Klaus H. EckerKlaus Ecker John Esmet Rolf Fagerberg Martin Farach-ColtonMartín Farach-Colton Dror G. Feitelson Sándor P. Fekete Michael Ferdman Antonio Fernández 0001 Jeremy T. Fineman Yonatan R. Fogel Harold N. Gabow Pramod Ganapathi Jayneel Gandhi Michel Gastaldo Dongdong Ge Xiongzi Ge Rati Gelashvili Golnaz Ghasemiesfeh John R. GilbertJohn Gilbert 0001 Seth Gilbert Gilvir Gill Michael T. Goodrich Inge Li Gørtz Krishnan Gosakan Mayank Goswami 0001 Allan Gottlieb Ian Groombridge Rachid Guerraoui Simon D. Hammond Jaehyun Han Linfeng He Simai He Friedhelm Meyer auf der Heide Karl S. HemmertK. Scott Hemmert Bruce Hendrickson Grzegorz Herman Bryan Holland-Minkley Tien-Ruey Hsiang Haodong Hu Yang Hu John Iacono Riko Jacob Qamber Jafri Geetha Jagannathan William Jannen Yizheng Jiao Rob Johnson 0001 Ryan Johnson Jeanette Johnston Tom Kamphans Sudarsun Kannan Zardosht Kasheff Arie E. Kaufman Eric Knorr Hanna Komlós Tsvi Kopelowitz Michal Koucký 0001 László Kozma 0002 Russell Kraner Tom M. KroegerThomas M. Kroeger Alexander Kröller Fabian Kuhn Bradley C. Kuszmaul John Kuszmaul William Kuszmaul Alok Lal Charles E. Leiserson Vitus J. Leung Vincenzo Liberatore Andrea Lincoln Mingmou Liu Quanquan C. Liu Alejandro López-Ortiz Jayson Lynch Sergey Madaminov Quinten De Man Alberto Marchetti-Spaccamela Simon Mauras Tyler Mayer Sara McAllister Samuel McCauley Hunter McCoy Kevin T. McDonnell Andrew McGregor 0001 Muriel Médard Dzejla Medjedovic Kurt Mehlhorn Henk Meijer Joseph S. B. Mitchell Ankur Mittal Tianchi Mo Pablo Montes Branden Moore Michel Morvan Benjamin Moseley Miguel A. Mosteiro Mahnush Movahedi Ibrahim N. Mubarek Nirjhar Mukherjee J. Ian Munro S. Muthukrishnan 0001 Masayuki Nakajima 0001 Jelani Nelson Hung Q. Ngo 0001 Dung Nguyen Rishab Nithyanand Soeren Olesen Rotem Oshman Prashant Pandey 0001 Sagar Patel Rob Patro Giridhar Pemmasani Erwin Pesch Enoch Peserico Seth Pettie Cynthia A. Phillips Krishnan Pillaipakkamnatt Ron Y. Pinter Valentin Polishchuk Ely Porat Donald E. Porter Kirk Pruhs Michael O. Rabin Rajmohan Rajaraman Rajeev Raman Theis Rauhe Phaneendra Reddy David S. Resnick Arun Rodrigues Dana Ron Eva Rotenberg Sudeepa Roy 0001 Amit Sahai Jared Saia Michael E. Saks Luís Paulo Santos Mie Sato Noa Schiller Nils Schweer Uwe Schwiegelshohn Michele Scquizzato Steven S. Seiden Tyler Seip Saurabh Sethia Yarin Shechter Pradeep Shetty Elaine Shi Rose Silver Bertrand Simon 0001 Shikha Singh 0002 Steven Skiena Martin Skutella Donna K. Slonim Richard P. Spillane Karthik Sriram Clifford Stein 0001 R. E. Kurt StirewaltKurt Stirewalt Blair D. Sullivan Pavel Sumazin Jukka Suomela Ola Svensson Firas Swidan Marcelo O. Sztainberg Guido Tagliavini Yuan Tang Robert E. TarjanRobert Endre Tarjan David Tench Shang-Hua Teng Eric D. Thomas Mikkel Thorup Denis Trystram Meng-Tsung Tsai Kostas Tsichlas Salil P. Vadhan Todd Veldhuizen Elias Vicari Frédéric Vivien Janet Vorobyeva Hoa T. Vu Leif Walsh Ming Wan Kebin Wang Yung Ping Wang Geoffrey Washburn Nicole Wein Richard Wen Evan WestEvan T. West Jing Wu Helen Xu 0001 Maxwell Young Jun Yuan 0006 Erez Zadok David Zage Luke Zeller Yang Zhan 0001 Guochuan Zhang Kenny Zhang Lisa Zhang 0001 Victor Zhang Renfei Zhou Jack Zito