Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael A. Bender
Michael Bender 0001
Person information
- affiliation: Stony Brook University, NY, USA
Other persons with the same name
- Michael Bender — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2000
[b1]Michael A. Bender:
A functional framework for efficient web-based scientific visualization systems. Universität Kaiserslautern, 2000, pp. 1-119
Journal Articles
- 2023
- [j64]Michael A. Bender
, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once. J. ACM 70(6): 40:1-40:51 (2023) - [j63]Prashant Pandey, Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson:
IcebergHT: High Performance Hash Tables Through Stability and Low Associativity. Proc. ACM Manag. Data 1(1): 47:1-47:26 (2023) - 2022
- [j62]Janet Vorobyeva, Daniel R. Delayo, Michael A. Bender, Martin Farach-Colton, Prashant Pandey, Cynthia A. Phillips, Shikha Singh, Eric D. Thomas, Thomas M. Kroeger:
Using advanced data structures to enable responsive security monitoring. Clust. Comput. 25(4): 2893-2914 (2022) - 2021
- [j61]Ezio Bartocci, Michael A. Bender:
A Perspective on "CCS Expressions, Finite State Processes, and Three Problems of Equivalence". SIGACT News 52(4): 76-77 (2021) - [j60]Shikha Singh, Prashant Pandey, Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Cynthia A. Phillips:
Timely Reporting of Heavy Hitters Using External Memory. ACM Trans. Database Syst. 46(4): 14:1-14:35 (2021) - [j59]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:
External-memory Dictionaries in the Affine and PDAM Models. ACM Trans. Parallel Comput. 8(3): 15:1-15:20 (2021) - [j58]Yang Zhan, Alex Conway, Yizheng Jiao, Nirjhar Mukherjee, Ian Groombridge, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
Copy-on-Abundant-Write for Nimble File System Clones. ACM Trans. Storage 17(1): 5:1-5:27 (2021) - 2020
- [j57]Yang Zhan, Alex Conway, Nirjhar Mukherjee, Ian Groombridge, Martin Farach-Colton, Rob Johnson, Yizheng Jiao, Michael A. Bender, William Jannen, Donald E. Porter, Jun Yuan:
How to Not Copy Files. login Usenix Mag. 45(3) (2020) - 2019
- [j56]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. J. ACM 66(1): 6:1-6:33 (2019) - 2018
- [j55]Prashant Pandey, Michael A. Bender, Rob Johnson, Rob Patro:
Squeakr: an exact and approximate k-mer counting system. Bioinform. 34(4): 568-575 (2018) - [j54]Michael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young:
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses. SIAM J. Comput. 47(5): 1735-1754 (2018) - [j53]Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang:
The range 1 query (R1Q) problem. Theor. Comput. Sci. 743: 130-147 (2018) - [j52]Yang Zhan, Yizheng Jiao, Donald E. Porter, Alex Conway, Eric Knorr, Martin Farach-Colton, Michael A. Bender, Jun Yuan, William Jannen, Rob Johnson:
Efficient Directory Mutations in a Full-Path-Indexed File System. ACM Trans. Storage 14(3): 22:1-22:27 (2018) - 2017
- [j51]Prashant Pandey, Michael A. Bender, Rob Johnson, Rob Patro:
deBGR: an efficient and near-exact representation of the weighted de Bruijn graph. Bioinform. 33(14): i133-i141 (2017) - [j50]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. J. Parallel Distributed Comput. 102: 213-228 (2017) - [j49]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Storage Reallocation. ACM Trans. Algorithms 13(3): 38:1-38:20 (2017) - [j48]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:
Writes Wrought Right, and Other Adventures in File System Optimization. ACM Trans. Storage 13(1): 3:1-3:26 (2017) - [j47]Alex Conway, Ainesh Bakshi, Yizheng Jiao, Yang Zhan, Michael A. Bender, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, Martin Farach-Colton:
How to Fragment Your File System. login Usenix Mag. 42(2) (2017) - 2016
- [j46]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert E. Tarjan:
A New Approach to Incremental Cycle Detection and Related Problems. ACM Trans. Algorithms 12(2): 14:1-14:22 (2016) - [j45]Michael A. Bender, Roozbeh Ebrahimi, Haodong Hu, Bradley C. Kuszmaul:
B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys. ACM Trans. Database Syst. 41(3): 19:1-19:33 (2016) - 2015
- [j44]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. Algorithmica 73(2): 389-409 (2015) - [j43]Michael A. Bender, Jeremy T. Fineman, Mahnush Movahedi, Jared Saia, Varsha Dani, Seth Gilbert, Seth Pettie, Maxwell Young:
Resource-Competitive Algorithms. SIGACT News 46(3): 57-71 (2015) - [j42]Michael A. Bender, Sándor P. Fekete, Alexander Kröller, Vincenzo Liberatore, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
The minimum backlog problem. Theor. Comput. Sci. 605: 51-61 (2015) - [j41]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:
BetrFS: Write-Optimization in a Kernel File System. ACM Trans. Storage 11(4): 18:1-18:29 (2015) - [j40]Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, Yang Zhan:
An Introduction to Bε-trees and Write-Optimization. login Usenix Mag. 40(5) (2015) - 2014
- [j39]Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley:
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. Theory Comput. Syst. 54(4): 715-730 (2014) - 2013
- [j38]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. J. Sched. 16(4): 347-348 (2013) - 2012
- [j37]Michael A. Bender, Martin Farach-Colton, Rob Johnson, 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. Proc. VLDB Endow. 5(11): 1627-1637 (2012) - 2011
- [j36]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. Algorithmica 61(2): 463-505 (2011) - [j35]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk:
The snowblower problem. Comput. Geom. 44(8): 370-384 (2011) - [j34]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang:
Optimal Cache-Oblivious Mesh Layouts. Theory Comput. Syst. 48(2): 269-296 (2011) - [j33]Michael A. Bender, Seth Gilbert:
Guest Editorial: Parallelism in Algorithms and Architectures. Theory Comput. Syst. 49(4): 671 (2011) - 2010
- [j32]Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari:
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. Theory Comput. Syst. 47(4): 934-962 (2010) - [j31]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). J. Sched. 13(5): 451-452 (2010) - 2009
- [j30]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman:
The Worst Page-Replacement Policy. Theory Comput. Syst. 44(2): 175-185 (2009) - 2008
- [j29]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. Algorithmica 50(2): 279-298 (2008) - [j28]Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan:
Improved bounds on sorting by length-weighted reversals. J. Comput. Syst. Sci. 74(5): 744-774 (2008) - [j27]Michael A. Bender, Raphaël Clifford, Kostas Tsichlas:
Scheduling algorithms for procrastinators. J. Sched. 11(2): 95-104 (2008) - [j26]Michael A. Bender, Jacek Blazewicz, Klaus Ecker, Erwin Pesch, Denis Trystram:
Guest editorial. J. Sched. 11(5): 309-310 (2008) - 2007
- [j25]Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt:
Sum-of-squares heuristics for bin packing and memory allocation. ACM J. Exp. Algorithmics 12: 2.3:1-2.3:19 (2007) - [j24]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. SIAM J. Comput. 36(6): 1672-1695 (2007) - [j23]Harold N. Gabow, Michael A. Bender, Martin Farach-Colton:
Introduction to SODA 2002 and 2003 special issue. ACM Trans. Algorithms 3(4): 36 (2007) - [j22]Michael A. Bender, Haodong Hu:
An adaptive packed-memory array. ACM Trans. Database Syst. 32(4): 26 (2007) - 2006
- [j21]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. Algorithmica 46(2): 193-221 (2006) - [j20]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
Insertion Sort is O(n log n). Theory Comput. Syst. 39(3): 391-397 (2006) - 2005
- [j19]Yonatan Aumann, Michael A. Bender:
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distributed Comput. 17(3): 191-207 (2005) - [j18]Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin:
Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2): 75-94 (2005) - [j17]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Cache-Oblivious B-Trees. SIAM J. Comput. 35(2): 341-358 (2005) - [j16]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. SIAM J. Comput. 35(3): 531-566 (2005) - 2004
- [j15]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? Comput. Geom. 29(1): 23-46 (2004) - [j14]Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu:
A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2): 115-136 (2004) - [j13]Michael A. Bender, Saurabh Sethia, Steven Skiena:
Data structures for maintaining set partitions. Random Struct. Algorithms 25(1): 43-67 (2004) - [j12]Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman:
Approximation Algorithms for Average Stretch Scheduling. J. Sched. 7(3): 195-222 (2004) - [j11]Michael A. Bender, Martin Farach-Colton:
The Level Ancestor Problem simplified. Theor. Comput. Sci. 321(1): 5-12 (2004) - [j10]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. IEEE Trans. Robotics 20(4): 691-701 (2004) - 2003
- [j9]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat scheduling problem. Inf. Comput. 184(1): 129-146 (2003) - 2002
- [j8]Matthew Andrews, Michael A. Bender, Lisa Zhang:
New Algorithms for Disk Scheduling. Algorithmica 32(2): 277-301 (2002) - [j7]Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan:
The Power of a Pebble: Exploring and Mapping Directed Graphs. Inf. Comput. 176(1): 1-21 (2002) - [j6]Michael A. Bender, Michael O. Rabin:
Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk. Theory Comput. Syst. 35(3): 289-304 (2002) - [j5]Michael A. Bender, Dana Ron:
Testing properties of directed graphs: acyclicity and connectivity. Random Struct. Algorithms 20(2): 184-205 (2002) - 2001
- [j4]Chandra Chekuri, Michael A. Bender:
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. J. Algorithms 41(2): 212-224 (2001) - 2000
- [j3]Michael A. Bender, Chandra Chekuri:
Performance guarantees for the TSP with a parameterized triangle inequality. Inf. Process. Lett. 73(1-2): 17-21 (2000) - 1997
- [j2]Yonatan Aumann, Michael A. Bender, Lisa Zhang:
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. Inf. Comput. 139(1): 1-16 (1997) - 1995
- [j1]Michael A. Bender, Michel Gastaldo, Michel Morvan:
Parallel Interval Order Recognition and Construction of Interval Representations. Theor. Comput. Sci. 143(1): 73-91 (1995)
Conference and Workshop Papers
- 2024
- [c129]Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul:
Modern Hashing Made Simple. SOSA 2024: 363-373 - 2023
- [c128]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:
Mosaic Pages: Big TLB Reach with Small Pages. ASPLOS (3) 2023: 433-448 - [c127]Kunal Agrawal, Sanjoy K. Baruah, Michael A. Bender, Alberto Marchetti-Spaccamela:
The Safe and Effective Use of Low-Assurance Predictions in Safety-Critical Systems. ECRTS 2023: 3:1-3:19 - [c126]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Tiny Pointers. SODA 2023: 477-508 - [c125]Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini:
An Associativity Threshold Phenomenon in Set-Associative Caches. SPAA 2023: 117-127 - [c124]Michael A. Bender, Daniel DeLayo, Bradley C. Kuszmaul, William Kuszmaul, Evan West:
Increment - and - Freeze: Every Cache, Everywhere, All of the Time. SPAA 2023: 129-139 - 2022
- [c123]Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender:
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. ESA 2022: 16:1-16:17 - [c122]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:
BetrFS: a compleat file system for commodity SSDs. EuroSys 2022: 610-627 - [c121]Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. FOCS 2022: 980-990 - [c120]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
What Does Dynamic Optimality Mean in External Memory? ITCS 2022: 18:1-18:23 - [c119]Michael Bender, Michael Benedikt, Sudeepa Roy:
2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2022: 103-104 - [c118]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. SIGMOD Conference 2022: 325-339 - [c117]Michael A. Bender, Seth Gilbert, Fabian Kuhn, John Kuszmaul, Muriel Médard:
Contention Resolution for Coded Radio Networks. SPAA 2022: 119-130 - [c116]Daniel DeLayo, Kenny Zhang, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Rathish Das, Benjamin Moseley, Cynthia A. Phillips:
Automatic HBM Management: Models and Algorithms. SPAA 2022: 147-159 - [c115]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Online Parallel Paging with Optimal Makespan. SPAA 2022: 205-216 - [c114]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the optimal time/space tradeoff for hash tables. STOC 2022: 1284-1297 - 2021
- [c113]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? APOCS 2021: 16-24 - [c112]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. ESA 2021: 12:1-12:18 - [c111]Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul:
Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering. FOCS 2021: 1171-1182 - [c110]Prashant Pandey, Alex Conway, Joe Durie, Michael A. Bender, Martin Farach-Colton, Rob Johnson:
Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design. SIGMOD Conference 2021: 1386-1399 - [c109]Michael A. Bender, William Kuszmaul:
Randomized Cup Game Algorithms Against Strong Adversaries. SODA 2021: 2059-2077 - [c108]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Tight Bounds for Parallel Paging and Green Paging. SODA 2021: 3022-3041 - [c107]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:
Paging and the Address-Translation Problem. SPAA 2021: 105-117 - 2020
- [c106]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:
How to Copy Files. FAST 2020: 75-89 - [c105]Shikha Singh, Sergey Madaminov, Michael A. Bender, Michael Ferdman, Ryan Johnson, Benjamin Moseley, Hung Q. Ngo, Dung Nguyen, Soeren Olesen, Kurt Stirewalt, Geoffrey Washburn:
A Scheduling Approach to Incremental Maintenance of Datalog Programs. IPDPS 2020: 864-873 - [c104]Michael A. Bender, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Kostas Tsichlas:
Batched Predecessor and Sorting with Size-Priced Information in External Memory. LATIN 2020: 155-167 - [c103]Prashant Pandey, Shikha Singh, Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Cynthia A. Phillips:
Timely Reporting of Heavy Hitters using External Memory. SIGMOD Conference 2020: 1431-1446 - [c102]Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul:
Flushing Without Cascades. SODA 2020: 650-669 - [c101]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
Contention Resolution with Message Deadlines. SPAA 2020: 23-35 - [c100]Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu:
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA 2020: 63-73 - [c99]Rathish Das, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Benjamin Moseley, Cynthia A. Phillips:
How to Manage High-Bandwidth Memory Automatically. SPAA 2020: 187-199 - [c98]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Green Paging and Parallel Paging. SPAA 2020: 493-495 - [c97]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie:
Contention resolution without collision detection. STOC 2020: 105-118 - 2019
- [c96]Alex Conway, Eric Knorr, Yizheng Jiao, Michael A. Bender, William Jannen, Rob Johnson, Donald E. Porter, Martin Farach-Colton:
Filesystem Aging: It's more Usage than Fullness. HotStorage 2019 - [c95]Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai:
Optimal Ball Recycling. SODA 2019: 2527-2546 - [c94]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:
Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design. SPAA 2019: 265-274 - [c93]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
Achieving optimal backlog in multi-processor cup games. STOC 2019: 1148-1157 - 2018
- [c92]Yang Zhan, Alexander Conway, Yizheng Jiao, Eric Knorr, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
The Full Path to Full-Path Indexing. FAST 2018: 123-138 - [c91]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. FOCS 2018: 182-193 - [c90]Michael A. Bender:
The Algorithmics of Write Optimization. IPDPS 2018: 1 - [c89]Prashant Pandey, Fatemeh Almodaresi, Michael A. Bender, Michael Ferdman, Rob Johnson, Rob Patro:
Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index. RECOMB 2018: 271-273 - 2017
- [c88]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:
File Systems Fated for Senescence? Nonsense, Says Science! FAST 2017: 45-58 - [c87]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Simon Mauras, Tyler Mayer, Cynthia A. Phillips, Helen Xu:
Write-Optimized Skip Lists. PODS 2017: 69-78 - [c86]Prashant Pandey, Michael A. Bender, Rob Johnson, Rob Patro:
A General-Purpose Counting Filter: Making Every Bit Count. SIGMOD Conference 2017: 775-787 - [c85]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montes:
File Maintenance: When in Doubt, Change the Layout! SODA 2017: 1503-1522 - [c84]Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai:
Cross-Referenced Dictionaries and the Limits of Write Optimization. SODA 2017: 1523-1532 - 2016
- [c83]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:
Optimizing Every Operation in a Write-optimized File System. FAST 2016: 1-14 - [c82]Michael A. Bender, Samuel McCauley, Bertrand Simon, Shikha Singh, Frédéric Vivien:
Resource Optimization for Program Committee Members: A Subreview Article. FUN 2016: 7:1-7:20 - [c81]William Jannen, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
Lazy Analytics: Let Other Queries Do the Work For You. HotStorage 2016 - [c80]Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton, Pramod Ganapathi, Rob Johnson, Samuel McCauley, Bertrand Simon, Shikha Singh:
The I/O Complexity of Computing Prime Tables. LATIN 2016: 192-206 - [c79]Michael A. Bender, Jonathan W. Berry, Rob Johnson, Thomas M. Kroeger, Samuel McCauley, Cynthia A. Phillips, Bertrand Simon, Shikha Singh, David Zage:
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries. PODS 2016: 289-302 - [c78]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness. SODA 2016: 636-654 - [c77]Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley:
Cache-Adaptive Analysis. SPAA 2016: 135-144 - [c76]Michael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young:
Contention resolution with log-logstar channel accesses. STOC 2016: 499-508 - [c75]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:
Optimizing Every Operation in a Write-optimized File System. USENIX Annual Technical Conference 2016 - 2015
- [c74]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:
BetrFS: A Right-Optimized Write-Optimized File System. FAST 2015: 301-315 - [c73]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. IPDPS 2015: 835-846 - [c72]Michael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh, Hoa T. Vu:
Run Generation Revisited: What Goes Up May or May Not Come Down. ISAAC 2015: 703-714 - [c71]Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, Branden Moore, Benjamin Moseley, Cynthia A. Phillips:
k-Means Clustering on Two-Level Memory Systems. MEMSYS 2015: 197-205 - [c70]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Reallocation for Scheduling and Planning. SPAA 2015: 143-154 - 2014
- [c69]Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang:
The Range 1 Query (R1Q) Problem. COCOON 2014: 116-128 - [c68]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai:
The Batched Predecessor Problem in External Memory. ESA 2014: 112-124 - [c67]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. PODS 2014: 278-288 - [c66]Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert:
Dynamic Task Allocation in Asynchronous Shared Memory. SODA 2014: 416-435 - [c65]Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley:
Cache-Adaptive Algorithms. SODA 2014: 958-971 - 2013
- [c64]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation problems in scheduling. SPAA 2013: 271-279 - [c63]Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, Cynthia A. Phillips:
Efficient scheduling to minimize calibrations. SPAA 2013: 280-287 - 2012
- [c62]Dan Alistarh, Michael A. Bender, Seth Gilbert, Rachid Guerraoui:
How to Allocate Tasks Asynchronously. FOCS 2012: 331-340 - [c61]Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley:
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. FUN 2012: 28-39 - [c60]John Esmet, Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul:
The TokuFS Streaming File System. HotStorage 2012 - 2011
- [c59]Michael A. Bender, Seth Gilbert:
Mutual Exclusion with O(log^2 Log n) Amortized Work. FOCS 2011: 728-737 - [c58]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok:
Don't Thrash: How to Cache Your Hash on Flash. HotStorage 2011 - 2010
- [c57]Michael A. Bender, Haodong Hu, Bradley C. Kuszmaul:
Performance guarantees for B-trees with different-sized atomic keys. PODS 2010: 305-316 - 2009
- [c56]Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Maintaining Arrays of Contiguous Objects. FCT 2009: 14-25 - [c55]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert:
A new approach to incremental topological ordering. SODA 2009: 1108-1115 - [c54]Michael A. Bender:
From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering. SEA 2009: 2 - 2007
- [c53]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman:
The Worst Page-Replacement Policy. FUN 2007: 135-145 - [c52]Michael A. Bender, Cynthia A. Phillips:
Scheduling DAGs on asynchronous processors. SPAA 2007: 35-45 - [c51]Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari:
Optimal sparse matrix dense vector multiplication in the I/O-model. SPAA 2007: 61-70 - [c50]Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson:
Cache-oblivious streaming B-trees. SPAA 2007: 81-92 - 2006
- [c49]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert:
Contention Resolution with Heterogeneous Job Sizes. ESA 2006: 112-123 - [c48]Michael A. Bender, Dror G. Feitelson, Allan Gottlieb, Uwe Schwiegelshohn:
Topic 3: Scheduling and Load Balancing. Euro-Par 2006: 155 - [c47]Michael A. Bender, Haodong Hu:
An adaptive packed-memory array. PODS 2006: 20-29 - [c46]Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul:
Cache-oblivious string B-trees. PODS 2006: 233-242 - [c45]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk:
The Snowblower Problem. WAFR 2006: 219-234 - 2005
- [c44]Denis Trystram, Michael A. Bender, Uwe Schwiegelshohn, Luís Paulo Santos:
Topic 3 Scheduling and Load-Balancing. Euro-Par 2005: 207 - [c43]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul:
Concurrent cache-oblivious b-trees. SPAA 2005: 228-237 - [c42]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial contention resolution for simple channels. SPAA 2005: 325-332 - [c41]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. WADS 2005: 169-181 - 2004
- [c40]Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt:
The Robustness of the Sum-of-Squares Algorithm for Bin Packing. ALENEX/ANALC 2004: 18-30 - [c39]Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter:
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. CPM 2004: 32-46 - [c38]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial Analyses of Window Backoff Strategies. IPDPS Next Generation Software Program - NSFNGS - PI Workshop 2004 - [c37]Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan:
Improved bounds on sorting with length-weighted reversals. SODA 2004: 919-928 - [c36]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson:
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. SPAA 2004: 133-144 - 2003
- [c35]Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
Online dispersion algorithms for swarms of robots. SCG 2003: 382-383 - [c34]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. FOCS 2003: 271-282 - [c33]Esther M. Arkin, Michael A. Bender, Dongdong Ge:
Improved approximation algorithms for the freeze-tag problem. SPAA 2003: 295-303 - 2002
- [c32]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. CLUSTER 2002: 296-304 - [c31]Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton:
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. ESA 2002: 139-151 - [c30]Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito:
Two Simplified Algorithms for Maintaining Order in a List. ESA 2002: 152-164 - [c29]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA 2002: 165-173 - [c28]Michael A. Bender, Richard Cole, Rajeev Raman:
Exponential Structures for Efficient Cache-Oblivious Algorithms. ICALP 2002: 195-207 - [c27]Michael A. Bender, Martin Farach-Colton:
The Level Ancestor Problem Simplified. LATIN 2002: 508-515 - [c26]Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu:
A locality-preserving cache-oblivious dynamic dictionary. SODA 2002: 29-38 - [c25]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. SODA 2002: 568-577 - [c24]Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman:
Improved algorithms for stretch scheduling. SODA 2002: 762-771 - [c23]Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro:
Cache-oblivious priority queue and graph algorithm applications. STOC 2002: 268-276 - [c22]Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell:
Analysis of Heuristics for the Freeze-Tag Problem. SWAT 2002: 270-279 - [c21]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. WAFR 2002: 77-94 - 2001
- [c20]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. SODA 2001: 138-147 - [c19]Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin:
Finding least common ancestors in directed acyclic graphs. SODA 2001: 845-854 - [c18]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? WADS 2001: 401-413 - 2000
- [c17]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Cache-Oblivious B-Trees. FOCS 2000: 399-409 - [c16]Michael A. Bender, Dana Ron:
Testing Acyclicity of Directed Graphs in Sublinear Time. ICALP 2000: 809-820 - [c15]Michael A. Bender, Martin Farach-Colton:
The LCA Problem Revisited. LATIN 2000: 88-94 - [c14]Mie Sato, Ingmar Bitter, Michael A. Bender, Arie E. Kaufman, Masayuki Nakajima:
TEASAR: Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons. PG 2000: 281- - [c13]Michael A. Bender, Michael O. Rabin:
Scheduling Cilk multithreaded parallel programs on processors of different speeds. SPAA 2000: 13-21 - [c12]Michael A. Bender, Saurabh Sethia, Steven Skiena:
Data Structures for Maintaining Set Partitions. SWAT 2000: 83-96 - [c11]Ingmar Bitter, Mie Sato, Michael A. Bender, Kevin T. McDonnell, Arie E. Kaufman, Ming Wan:
CEASAR: a smooth, accurate and robust centerline extraction algorithm. IEEE Visualization 2000: 45-52 - 1999
- [c10]Michael A. Bender, Chandra Chekuri:
Performance Guarantees for the TSP with a Parameterized Triangle Inequality. WADS 1999: 80-85 - [c9]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat Scheduling Problem. WADS 1999: 122-133 - 1998
- [c8]Chandra Chekuri, Michael A. Bender:
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. IPCO 1998: 383-393 - [c7]Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan:
Flow and Stretch Metrics for Scheduling Continuous Job Streams. SODA 1998: 270-279 - [c6]Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan:
The Power of a Pebble: Exploring and Mapping Directed Graphs. STOC 1998: 269-278 - 1996
- [c5]Matthew Andrews, Michael A. Bender, Lisa Zhang:
New Algorithms for the Disk Scheduling Problem. FOCS 1996: 550-559 - [c4]Yonatan Aumann, Michael A. Bender:
Fault Tolerant Data Structures. FOCS 1996: 580-589 - [c3]Yonatan Aumann, Michael A. Bender:
Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. ICALP 1996: 622-633 - [c2]Yonatan Aumann, Michael A. Bender, Lisa Zhang:
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. SPAA 1996: 270-276 - 1994
- [c1]Michael A. Bender, Donna K. Slonim:
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs. FOCS 1994: 75-85
Editorship
- 2021
- [e5]Michael Bender, John Gilbert, 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. SIAM 2021, ISBN 978-1-61197-683-0 [contents] - 2019
- [e4]Michael A. Bender, Ola Svensson, Grzegorz Herman:
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. LIPIcs 144, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-124-5 [contents] - 2018
- [e3]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. Lecture Notes in Computer Science 10807, Springer 2018, ISBN 978-3-319-77403-9 [contents] - 2009
- [e2]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. ACM 2009, ISBN 978-1-60558-606-9 [contents] - 2005
- [e1]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn:
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301, IBFI, Schloss Dagstuhl, Germany 2005 [contents]
Informal and Other Publications
- 2024
- [i40]Alex Conway, Ainesh Bakshi, Arghya Bhattacharya, Rory Bennett, Yizheng Jiao, Eric Knorr, Yang Zhan, Michael A. Bender, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, Martin Farach-Colton:
File System Aging. CoRR abs/2401.08858 (2024) - [i39]Hagit Attiya, Michael A. Bender, Martin Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. CoRR abs/2403.14445 (2024) - 2023
- [i38]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, John Kuszmaul, Maxwell Young:
Robust and Listening-Efficient Contention Resolution. CoRR abs/2302.07751 (2023) - [i37]Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini:
An Associativity Threshold Phenomenon in Set-Associative Caches. CoRR abs/2304.04954 (2023) - 2022
- [i36]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
What Does Dynamic Optimality Mean in External Memory? CoRR abs/2201.01742 (2022) - [i35]Michael A. Bender, Alexander Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. CoRR abs/2203.02763 (2022) - [i34]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. CoRR abs/2203.14927 (2022) - [i33]Michael A. Bender, Seth Gilbert, Fabian Kuhn, John Kuszmaul, Muriel Médard:
Contention Resolution for Coded Radio Networks. CoRR abs/2207.11824 (2022) - [i32]Prashant Pandey, Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson:
IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity. CoRR abs/2210.04068 (2022) - 2021
- [i31]Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul:
Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering. CoRR abs/2107.01250 (2021) - [i30]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. CoRR abs/2107.02318 (2021) - [i29]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
All-Purpose Hashing. CoRR abs/2109.04548 (2021) - [i28]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the Optimal Time/Space Tradeoff for Hash Tables. CoRR abs/2111.00602 (2021) - [i27]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Tiny Pointers. CoRR abs/2111.12800 (2021) - 2020
- [i26]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie:
Contention Resolution Without Collision Detection. CoRR abs/2004.08039 (2020) - [i25]Michael A. Bender, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Kostas Tsichlas:
Batched Predecessor and Sorting with Size-Priced Information in External Memory. CoRR abs/2004.13197 (2020) - 2019
- [i24]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
Achieving Optimal Backlog in Multi-Processor Cup Games. CoRR abs/1904.02861 (2019) - 2018
- [i23]Michael A. Bender, Jake Christensen, Alexander Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai:
Optimal Ball Recycling. CoRR abs/1807.01804 (2018) - [i22]Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Prashant Pandey, Cynthia A. Phillips, Shikha Singh:
The Online Event-Detection Problem. CoRR abs/1812.09824 (2018) - 2017
- [i21]Prashant Pandey, Michael A. Bender, Rob Johnson:
A Fast x86 Implementation of Select. CoRR abs/1706.00990 (2017) - [i20]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. CoRR abs/1711.01616 (2017) - 2015
- [i19]Michael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh, Hoa T. Vu:
Run Generation Revisited: What Goes Up May or May Not Come Down. CoRR abs/1504.06501 (2015) - 2014
- [i18]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
NoiseOFF: A Backoff Protocol for a Dynamic, Noisy World. CoRR abs/1402.5207 (2014) - [i17]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. CoRR abs/1404.2019 (2014) - 2013
- [i16]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. CoRR abs/1305.6555 (2013) - 2012
- [i15]Michael A. Bender, Martin Farach-Colton, Rob Johnson, 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. CoRR abs/1208.0290 (2012) - 2011
- [i14]Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Maintaining Arrays of Contiguous Objects. CoRR abs/1101.5407 (2011) - [i13]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert Endre Tarjan:
A New Approach to Incremental Cycle Detection and Related Problems. CoRR abs/1112.0784 (2011) - 2007
- [i12]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang:
Optimal Cache-Oblivious Mesh Layouts. CoRR abs/0705.1033 (2007) - 2006
- [i11]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk:
The Snowblower Problem. CoRR abs/cs/0603026 (2006) - [i10]Michael A. Bender, Raphaël Clifford, Kostas Tsichlas:
Scheduling Algorithms for Procrastinators. CoRR abs/cs/0606067 (2006) - 2004
- [i9]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn:
04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms 2004 - [i8]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. CoRR cs.DS/0402045 (2004) - [i7]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
Insertion Sort is O(n log n). CoRR cs.DS/0407003 (2004) - [i6]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. CoRR cs.DS/0407058 (2004) - 2003
- [i5]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. CoRR cs.DS/0309014 (2003) - 2002
- [i4]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat Scheduling Problem. CoRR cs.DS/0210024 (2002) - [i3]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. CoRR cs.DS/0211010 (2002) - [i2]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. CoRR cs.RO/0212022 (2002) - 2000
- [i1]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? CoRR cs.CG/0011026 (2000)
Coauthor Index
Alexander Conway
aka: Alex Conway
aka: Alex Conway
Martin Farach-Colton
aka: Martín Farach-Colton
aka: Martín Farach-Colton
[j64] [j63] [j62] [j60] [j59] [j58] [j57] [j52] [j49] [j48] [j47] [j44] [j41] [j40] [j37] [j23] [j20] [j18] [j17] [j11] [c129] [c128] [c126] [c125] [c122] [c121] [c120] [c118] [c114] [c113] [c110] [c107] [c106] [c103] [c102] [c96] [c95] [c94] [c93] [c92] [c91] [c88] [c87] [c84] [c83] [c81] [c80] [c75] [c74] [c70] [c68] [c67] [c64] [c60] [c58] [c50] [c46] [c42] [c38] [c31] [c30] [c29] [c27] [c17] [c15] [e3] [i40] [i39] [i37] [i36] [i35] [i34] [i32] [i29] [i28] [i27] [i24] [i23] [i22] [i20] [i17] [i16] [i15] [i7] [i3]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-11 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
