The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael A. Bender: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt
    The Robustness of the Sum-of-Squares Algorithm for Bin Packing. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:18-30 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    CLUSTER, 2002, pp:296-304 [Conf]
  3. Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell
    Online dispersion algorithms for swarms of robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:382-383 [Conf]
  4. Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter
    Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:32-46 [Conf]
  5. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton
    Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:139-151 [Conf]
  6. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito
    Two Simplified Algorithms for Maintaining Order in a List. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:152-164 [Conf]
  7. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Efficient Tree Layout in a Multilevel Memory Hierarchy. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:165-173 [Conf]
  8. Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
    Contention Resolution with Heterogeneous Job Sizes. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:112-123 [Conf]
  9. Matthew Andrews, Michael A. Bender, Lisa Zhang
    New Algorithms for the Disk Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:550-559 [Conf]
  10. Yonatan Aumann, Michael A. Bender
    Fault Tolerant Data Structures. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:580-589 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:271-282 [Conf]
  12. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Cache-Oblivious B-Trees. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:399-409 [Conf]
  13. Michael A. Bender, Donna K. Slonim
    The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:75-85 [Conf]
  14. Yonatan Aumann, Michael A. Bender
    Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:622-633 [Conf]
  15. Michael A. Bender, Richard Cole, Rajeev Raman
    Exponential Structures for Efficient Cache-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:195-207 [Conf]
  16. Michael A. Bender, Dana Ron
    Testing Acyclicity of Directed Graphs in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:809-820 [Conf]
  17. Chandra Chekuri, Michael A. Bender
    An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:383-393 [Conf]
  18. Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson
    Adversarial Analyses of Window Backoff Strategies. [Citation Graph (0, 0)][DBLP]
    IPDPS Next Generation Software Program - NSFNGS - PI Workshop, 2004, pp:- [Conf]
  19. Michael A. Bender, Martin Farach-Colton
    The LCA Problem Revisited. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:88-94 [Conf]
  20. Michael A. Bender, Martin Farach-Colton
    The Level Ancestor Problem Simplified. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:508-515 [Conf]
  21. Mie Sato, Ingmar Bitter, Michael A. Bender, Arie E. Kaufman, Masayuki Nakajima
    TEASAR: Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons. [Citation Graph (0, 0)][DBLP]
    Pacific Conference on Computer Graphics and Applications, 2000, pp:281-0 [Conf]
  22. Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul
    Cache-oblivious string B-trees. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:233-242 [Conf]
  23. Michael A. Bender, Haodong Hu
    An adaptive packed-memory array. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:20-29 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:138-147 [Conf]
  25. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:568-577 [Conf]
  26. Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan
    Flow and Stretch Metrics for Scheduling Continuous Job Streams. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:270-279 [Conf]
  27. Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu
    A locality-preserving cache-oblivious dynamic dictionary. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:29-38 [Conf]
  28. Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan
    Improved bounds on sorting with length-weighted reversals. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:919-928 [Conf]
  29. Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman
    Improved algorithms for stretch scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:762-771 [Conf]
  30. Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin
    Finding least common ancestors in directed acyclic graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:845-854 [Conf]
  31. Yonatan Aumann, Michael A. Bender, Lisa Zhang
    Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:270-276 [Conf]
  32. Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul
    Concurrent cache-oblivious b-trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:228-237 [Conf]
  33. Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson
    On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:133-144 [Conf]
  34. Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson
    Adversarial contention resolution for simple channels. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:325-332 [Conf]
  35. Michael A. Bender, Michael O. Rabin
    Scheduling Cilk multithreaded parallel programs on processors of different speeds. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:13-21 [Conf]
  36. Esther M. Arkin, Michael A. Bender, Dongdong Ge
    Improved approximation algorithms for the freeze-tag problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:295-303 [Conf]
  37. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
    Cache-oblivious priority queue and graph algorithm applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:268-276 [Conf]
  38. Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
    The Power of a Pebble: Exploring and Mapping Directed Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:269-278 [Conf]
  39. Michael A. Bender, Saurabh Sethia, Steven Skiena
    Data Structures for Maintaining Set Partitions. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:83-96 [Conf]
  40. Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell
    Analysis of Heuristics for the Freeze-Tag Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:270-279 [Conf]
  41. Ingmar Bitter, Mie Sato, Michael A. Bender, Kevin T. McDonnell, Arie E. Kaufman, Ming Wan
    CEASAR: a smooth, accurate and robust centerline extraction algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2000, pp:45-52 [Conf]
  42. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:169-181 [Conf]
  43. 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? [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:401-413 [Conf]
  44. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:122-133 [Conf]
  45. Michael A. Bender, Chandra Chekuri
    Performance Guarantees for the TSP with a Parameterized Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:80-85 [Conf]
  46. Matthew Andrews, Michael A. Bender, Lisa Zhang
    New Algorithms for Disk Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:277-301 [Journal]
  47. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:2, pp:193-221 [Journal]
  48. 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? [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:1, pp:23-46 [Journal]
  49. 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? [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  50. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat Scheduling Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  51. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  52. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  53. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  54. Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro
    Insertion Sort is O(n log n) [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  55. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  56. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  57. Yonatan Aumann, Michael A. Bender
    Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:17, n:3, pp:191-207 [Journal]
  58. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat scheduling problem. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:129-146 [Journal]
  59. Yonatan Aumann, Michael A. Bender, Lisa Zhang
    Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:1, pp:1-16 [Journal]
  60. Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
    The Power of a Pebble: Exploring and Mapping Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:1, pp:1-21 [Journal]
  61. Michael A. Bender, Chandra Chekuri
    Performance guarantees for the TSP with a parameterized triangle inequality. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:1-2, pp:17-21 [Journal]
  62. Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu
    A locality-preserving cache-oblivious dynamic dictionary. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:53, n:2, pp:115-136 [Journal]
  63. Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin
    Lowest common ancestors in trees and directed acyclic graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:2, pp:75-94 [Journal]
  64. Chandra Chekuri, Michael A. Bender
    An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:212-224 [Journal]
  65. Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro
    Insertion Sort is O(n log n). [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:391-397 [Journal]
  66. Michael A. Bender, Michael O. Rabin
    Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:3, pp:289-304 [Journal]
  67. Michael A. Bender, Dana Ron
    Testing properties of directed graphs: acyclicity and connectivity. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:2, pp:184-205 [Journal]
  68. Michael A. Bender, Saurabh Sethia, Steven Skiena
    Data structures for maintaining set partitions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:1, pp:43-67 [Journal]
  69. Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman
    Approximation Algorithms for Average Stretch Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:3, pp:195-222 [Journal]
  70. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:531-566 [Journal]
  71. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Cache-Oblivious B-Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:341-358 [Journal]
  72. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1672-1695 [Journal]
  73. Michael A. Bender, Martin Farach-Colton
    The Level Ancestor Problem simplified. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:5-12 [Journal]
  74. Michael A. Bender, Michel Gastaldo, Michel Morvan
    Parallel Interval Order Recognition and Construction of Interval Representations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:73-91 [Journal]
  75. Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
    Optimal sparse matrix dense vector multiplication in the I/O-model. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:61-70 [Conf]
  76. Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson
    Cache-oblivious streaming B-trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:81-92 [Conf]
  77. Michael A. Bender, Cynthia A. Phillips
    Scheduling DAGs on asynchronous processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:35-45 [Conf]
  78. Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
    The Worst Page-Replacement Policy. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:135-145 [Conf]
  79. Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang
    Optimal Cache-Oblivious Mesh Layouts [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  80. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk
    The Snowblower Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  81. Michael A. Bender, Raphaël Clifford, Kostas Tsichlas
    Scheduling Algorithms for Procrastinators [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  82. Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt
    Sum-of-squares heuristics for bin packing and memory allocation. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]

  83. 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. [Citation Graph (, )][DBLP]


  84. Maintaining Arrays of Contiguous Objects. [Citation Graph (, )][DBLP]


  85. Performance guarantees for B-trees with different-sized atomic keys. [Citation Graph (, )][DBLP]


  86. A new approach to incremental topological ordering. [Citation Graph (, )][DBLP]


  87. From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering. [Citation Graph (, )][DBLP]


  88. The Snowblower Problem. [Citation Graph (, )][DBLP]


  89. Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002