Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael A. Bender
2010 – today
- 2013
[c60]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert: Reallocation problems in scheduling. SPAA 2013: 271-279- [c59]Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, Cynthia A. Phillips: Efficient scheduling to minimize calibrations. SPAA 2013: 280-287
- [i15]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
- [j34]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. PVLDB 5(11): 1627-1637 (2012)
- [c58]Dan Alistarh, Michael A. Bender, Seth Gilbert, Rachid Guerraoui: How to Allocate Tasks Asynchronously. FOCS 2012: 331-340
- [c57]Michael A. Bender, Ritwik Bose, Rezaul Chowdhury, Samuel McCauley: The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. FUN 2012: 28-39
- [i14]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
- [j33]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)
- [j32]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk: The snowblower problem. Comput. Geom. 44(8): 370-384 (2011)
- [j31]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang: Optimal Cache-Oblivious Mesh Layouts. Theory Comput. Syst. 48(2): 269-296 (2011)
- [j30]Michael A. Bender, Seth Gilbert: Guest Editorial: Parallelism in Algorithms and Architectures. Theory Comput. Syst. 49(4): 671 (2011)
- [c56]Michael A. Bender, Seth Gilbert: Mutual Exclusion with O(log^2 Log n) Amortized Work. FOCS 2011: 728-737
- [i13]Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer: Maintaining Arrays of Contiguous Objects. CoRR abs/1101.5407 (2011)
- [i12]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)
- 2010
- [j29]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)
- [c55]Michael A. Bender, Haodong Hu, Bradley C. Kuszmaul: Performance guarantees for B-trees with different-sized atomic keys. PODS 2010: 305-316
2000 – 2009
- 2009
- [j28]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman: The Worst Page-Replacement Policy. Theory Comput. Syst. 44(2): 175-185 (2009)
- [c54]Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer: Maintaining Arrays of Contiguous Objects. FCT 2009: 14-25
- [c53]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert: A new approach to incremental topological ordering. SODA 2009: 1108-1115
- [c52]Michael A. Bender: From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering. SEA 2009: 2
- [e2]Friedhelm Meyer auf der Heide, Michael A. Bender (Eds.): 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
- 2008
- [j27]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)
- [j26]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)
- [j25]Michael A. Bender, Raphaël Clifford, Kostas Tsichlas: Scheduling algorithms for procrastinators. J. Scheduling 11(2): 95-104 (2008)
- 2007
- [j24]Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt: Sum-of-squares heuristics for bin packing and memory allocation. ACM Journal of Experimental Algorithmics 12 (2007)
- [j23]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)
- [j22]Harold N. Gabow, Michael A. Bender, Martin Farach-Colton: Introduction to SODA 2002 and 2003 special issue. ACM Transactions on Algorithms 3(4) (2007)
- [j21]Michael A. Bender, Haodong Hu: An adaptive packed-memory array. ACM Trans. Database Syst. 32(4) (2007)
- [c51]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman: The Worst Page-Replacement Policy. FUN 2007: 135-145
- [c50]Michael A. Bender, Cynthia A. Phillips: Scheduling DAGs on asynchronous processors. SPAA 2007: 35-45
- [c49]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
- [c48]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
- [i11]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang: Optimal Cache-Oblivious Mesh Layouts. CoRR abs/0705.1033 (2007)
- 2006
- [j20]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)
- [j19]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro: Insertion Sort is O(n log n). Theory Comput. Syst. 39(3): 391-397 (2006)
- [c47]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert: Contention Resolution with Heterogeneous Job Sizes. ESA 2006: 112-123
- [c46]
- [c45]Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul: Cache-oblivious string B-trees. PODS 2006: 233-242
- [c44]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk: The Snowblower Problem. WAFR 2006: 219-234
- [i10]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk: The Snowblower Problem. CoRR abs/cs/0603026 (2006)
- [i9]Michael A. Bender, Raphaël Clifford, Kostas Tsichlas: Scheduling Algorithms for Procrastinators. CoRR abs/cs/0606067 (2006)
- 2005
- [j18]Yonatan Aumann, Michael A. Bender: Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distributed Computing 17(3): 191-207 (2005)
- [j17]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)
- [j16]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. SIAM J. Comput. 35(2): 341-358 (2005)
- [j15]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)
- [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
- [e1]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (Eds.): Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301, IBFI, Schloss Dagstuhl, Germany 2005
- 2004
- [j14]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)
- [j13]Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2): 115-136 (2004)
- [j12]Michael A. Bender, Saurabh Sethia, Steven Skiena: Data structures for maintaining set partitions. Random Struct. Algorithms 25(1): 43-67 (2004)
- [j11]Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman: Approximation Algorithms for Average Stretch Scheduling. J. Scheduling 7(3): 195-222 (2004)
- [j10]Michael A. Bender, Martin Farach-Colton: The Level Ancestor Problem simplified. Theor. Comput. Sci. 321(1): 5-12 (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]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
- [c37]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
- [c36]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
- [c35]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
- [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
- [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)
- [c34]Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell: Online dispersion algorithms for swarms of robots. Symposium on Computational Geometry 2003: 382-383
- [c33]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
- [c32]Esther M. Arkin, Michael A. Bender, Dongdong Ge: Improved approximation algorithms for the freeze-tag problem. SPAA 2003: 295-303
- [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
- [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)
- [c31]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
- [c30]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
- [c29]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
- [c28]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA 2002: 165-173
- [c27]Michael A. Bender, Richard Cole, Rajeev Raman: Exponential Structures for Efficient Cache-Oblivious Algorithms. ICALP 2002: 195-207
- [c26]
- [c25]Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. SODA 2002: 29-38
- [c24]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
- [c23]Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman: Improved algorithms for stretch scheduling. SODA 2002: 762-771
- [c22]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
- [c21]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
- [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)
- 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)
- [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
- [b1]Michael A. Bender: A functional framework for efficient web-based scientific visualization systems. Universität Kaiserslautern 2000, pp. 1-119
- [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)
- [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]
- [c14]Mie Sato, Ingmar Bitter, Michael A. Bender, Arie E. Kaufman, Masayuki Nakajima: TEASAR: Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons. Pacific Conference on Computer Graphics and Applications 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
- [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)
1990 – 1999
- 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
- 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)
- 1996
- [c5]Matthew Andrews, Michael A. Bender, Lisa Zhang: New Algorithms for the Disk Scheduling Problem. FOCS 1996: 550-559
- [c4]
- [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
- 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)
- 1994
- [c1]Michael A. Bender, Donna K. Slonim: The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs. FOCS 1994: 75-85
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:02 CEST by the dblp team