| 2009 | ||
|---|---|---|
| 94 | Friedhelm Meyer auf der Heide, Michael A. Bender: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 ACM 2009 | |
| 93 | Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer: Maintaining Arrays of Contiguous Objects. FCT 2009: 14-25 | |
| 92 | Michael A. Bender: From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering. SEA 2009: 2 | |
| 91 | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert: A new approach to incremental topological ordering. SODA 2009: 1108-1115 | |
| 2008 | ||
| 90 | 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) | |
| 89 | 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) | |
| 88 | Michael A. Bender, Raphaël Clifford, Kostas Tsichlas: Scheduling algorithms for procrastinators. J. Scheduling 11(2): 95-104 (2008) | |
| 2007 | ||
| 87 | Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman: The Worst Page-Replacement Policy. FUN 2007: 135-145 | |
| 86 | Michael A. Bender, Cynthia A. Phillips: Scheduling DAGs on asynchronous processors. SPAA 2007: 35-45 | |
| 85 | 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 | |
| 84 | 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 | |
| 83 | 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) | |
| 82 | Michael A. Bender, Haodong Hu: An adaptive packed-memory array. ACM Trans. Database Syst. 32(4): (2007) | |
| 81 | Harold N. Gabow, Michael A. Bender, Martin Farach-Colton: Introduction to SODA 2002 and 2003 special issue. ACM Transactions on Algorithms 3(4): (2007) | |
| 80 | Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang: Optimal Cache-Oblivious Mesh Layouts CoRR abs/0705.1033: (2007) | |
| 79 | 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) | |
| 2006 | ||
| 78 | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert: Contention Resolution with Heterogeneous Job Sizes. ESA 2006: 112-123 | |
| 77 | Michael A. Bender, Haodong Hu: An adaptive packed-memory array. PODS 2006: 20-29 | |
| 76 | Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul: Cache-oblivious string B-trees. PODS 2006: 233-242 | |
| 75 | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk: The Snowblower Problem. WAFR 2006: 219-234 | |
| 74 | 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) | |
| 73 | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk: The Snowblower Problem CoRR abs/cs/0603026: (2006) | |
| 72 | Michael A. Bender, Raphaël Clifford, Kostas Tsichlas: Scheduling Algorithms for Procrastinators CoRR abs/cs/0606067: (2006) | |
| 71 | 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 | ||
| 70 | Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 IBFI, Schloss Dagstuhl, Germany 2005 | |
| 69 | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul: Concurrent cache-oblivious b-trees. SPAA 2005: 228-237 | |
| 68 | Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson: Adversarial contention resolution for simple channels. SPAA 2005: 325-332 | |
| 67 | 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 | |
| 66 | Yonatan Aumann, Michael A. Bender: Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distributed Computing 17(3): 191-207 (2005) | |
| 65 | 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) | |
| 64 | Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. SIAM J. Comput. 35(2): 341-358 (2005) | |
| 63 | 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 | ||
| 62 | 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 | |
| 61 | 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 | |
| 60 | 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 | |
| 59 | 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 | |
| 58 | 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 | |
| 57 | 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 | |
| 56 | 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) | |
| 55 | Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro: Insertion Sort is O(n log n) CoRR cs.DS/0407003: (2004) | |
| 54 | 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) | |
| 53 | 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) | |
| 52 | Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2): 115-136 (2004) | |
| 51 | Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman: Approximation Algorithms for Average Stretch Scheduling. J. Scheduling 7(3): 195-222 (2004) | |
| 50 | Michael A. Bender, Saurabh Sethia, Steven Skiena: Data structures for maintaining set partitions. Random Struct. Algorithms 25(1): 43-67 (2004) | |
| 49 | Michael A. Bender, Martin Farach-Colton: The Level Ancestor Problem simplified. Theor. Comput. Sci. 321(1): 5-12 (2004) | |
| 2003 | ||
| 48 | 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 | |
| 47 | Esther M. Arkin, Michael A. Bender, Dongdong Ge: Improved approximation algorithms for the freeze-tag problem. SPAA 2003: 295-303 | |
| 46 | 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 | |
| 45 | 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) | |
| 44 | 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 | ||
| 43 | 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 | |
| 42 | 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 | |
| 41 | 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 | |
| 40 | Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA 2002: 165-173 | |
| 39 | Michael A. Bender, Richard Cole, Rajeev Raman: Exponential Structures for Efficient Cache-Oblivious Algorithms. ICALP 2002: 195-207 | |
| 38 | Michael A. Bender, Martin Farach-Colton: The Level Ancestor Problem Simplified. LATIN 2002: 508-515 | |
| 37 | Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. SODA 2002: 29-38 | |
| 36 | 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 | |
| 35 | Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman: Improved algorithms for stretch scheduling. SODA 2002: 762-771 | |
| 34 | 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 | |
| 33 | 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 | |
| 32 | Matthew Andrews, Michael A. Bender, Lisa Zhang: New Algorithms for Disk Scheduling. Algorithmica 32(2): 277-301 (2002) | |
| 31 | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena: The Lazy Bureaucrat Scheduling Problem CoRR cs.DS/0210024: (2002) | |
| 30 | 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) | |
| 29 | 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) | |
| 28 | 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) | |
| 27 | Michael A. Bender, Dana Ron: Testing properties of directed graphs: acyclicity and connectivity. Random Struct. Algorithms 20(2): 184-205 (2002) | |
| 26 | 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) | |
| 2001 | ||
| 25 | 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 | |
| 24 | Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin: Finding least common ancestors in directed acyclic graphs. SODA 2001: 845-854 | |
| 23 | 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 | |
| 22 | Chandra Chekuri, Michael A. Bender: An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. J. Algorithms 41(2): 212-224 (2001) | |
| 2000 | ||
| 21 | Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. FOCS 2000: 399-409 | |
| 20 | Michael A. Bender, Dana Ron: Testing Acyclicity of Directed Graphs in Sublinear Time. ICALP 2000: 809-820 | |
| 19 | 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 | |
| 18 | Michael A. Bender, Martin Farach-Colton: The LCA Problem Revisited. LATIN 2000: 88-94 | |
| 17 | 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- | |
| 16 | Michael A. Bender, Michael O. Rabin: Scheduling Cilk multithreaded parallel programs on processors of different speeds. SPAA 2000: 13-21 | |
| 15 | Michael A. Bender, Saurabh Sethia, Steven Skiena: Data Structures for Maintaining Set Partitions. SWAT 2000: 83-96 | |
| 14 | 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) | |
| 13 | Michael A. Bender, Chandra Chekuri: Performance guarantees for the TSP with a parameterized triangle inequality. Inf. Process. Lett. 73(1-2): 17-21 (2000) | |
| 1999 | ||
| 12 | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena: The Lazy Bureaucrat Scheduling Problem. WADS 1999: 122-133 | |
| 11 | Michael A. Bender, Chandra Chekuri: Performance Guarantees for the TSP with a Parameterized Triangle Inequality. WADS 1999: 80-85 | |
| 1998 | ||
| 10 | Chandra Chekuri, Michael A. Bender: An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. IPCO 1998: 383-393 | |
| 9 | Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan: Flow and Stretch Metrics for Scheduling Continuous Job Streams. SODA 1998: 270-279 | |
| 8 | 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 | ||
| 7 | Yonatan Aumann, Michael A. Bender, Lisa Zhang: Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. Inf. Comput. 139(1): 1-16 (1997) | |
| 1996 | ||
| 6 | Matthew Andrews, Michael A. Bender, Lisa Zhang: New Algorithms for the Disk Scheduling Problem. FOCS 1996: 550-559 | |
| 5 | Yonatan Aumann, Michael A. Bender: Fault Tolerant Data Structures. FOCS 1996: 580-589 | |
| 4 | Yonatan Aumann, Michael A. Bender: Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. ICALP 1996: 622-633 | |
| 3 | Yonatan Aumann, Michael A. Bender, Lisa Zhang: Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. SPAA 1996: 270-276 | |
| 1995 | ||
| 2 | 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 | ||
| 1 | Michael A. Bender, Donna K. Slonim: The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs FOCS 1994: 75-85 | |