%%REFEREED JOURNALS %% 1 @Article{BenderSt93, Annote = {A1}, author = "Michael A. Bender and Howard A. Stone", title = "An Integral Equation Approach to the Study of the Steady-State Current at Surface Microelectrodes", journal = "Journal of Electroanalytical Chemistry and Interfacial Chemistry", volume = "351", pages = "29--55", year = 1993 } %% 2 @Article{BenderGaMo95, Annote = {A2}, author = "Michael A. Bender and Michel Gastaldo and Michel Morvan", title = "Parallel Interval Order Recognition and Construction of Interval Representations", journal = "Theoretical Computer Science", volume = "143", number = "1", pages = "73--91", year = "1995" } %% 3 @Article{AumannBeZh97, Annote = {A3}, title = "Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems", author = "Yonatan Aumann and Michael A. Bender and Lisa Zhang", pages = "1--16", journal = "Information and Computation", month = "25~" # nov, year = "1997", volume = "139", number = "1" } %% 4 @article{BenderCh00, Annote = {A4}, author = "Michael A. Bender and Chandra Chekuri", title = "Performance Guarantees for the {TSP} with a Parameterized Triangle Inequality", journal = "Information Processing Letters", volume = "73", number = "1--2", pages = "17--21", year = "2000" } %% 5 @Article{SatoBiBeKaNa00, Annote = {A5}, author = "Mie Sato and Ingmar Bitter and Michael A. Bender and Arie Kaufman and Masayuki Nakajima", title = "Tree-structure Extraction Algorithm for Accurate and Robust Skeletons (in {Japanese})", journal = "The Journal of the Institute of Image Information and Television Engineers", year = "2000" } %% 6 @Article{ChekuriBender01, Annote = {A6}, author = "Chandra Chekuri and Michael A. Bender", title = "An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines", journal = "Journal of Algorithms", year = 2001, volume = 41, pages = "212--224" } %% 7 @Article{BenderRon02, Annote = {A7}, author = "Chandra Chekuri and Michael A. Bender", title = "Testing Properties of Directed Graphs: Acyclicity and Connectivity", author = "Michael A. Bender and Dana Ron", journal = "Random Structures and Algorithms", year = "2002", volume = "20", number = "2", pages = "184--205", } %% 8 @Article{AndrewsBeZh02, Annote = {A8}, bibnote = {Was AndrewsBenderZhang02}, title = "New Algorithms for the Disk Scheduling Problem", author = "Matthew Andrews and Michael A. Bender and Lisa Zhang", journal = "Algorithmica", volume = "32", number = "2", pages = "277--301", month = "February", year = "2002" } %% 9 @Article{BenderRabin02, Annote = {A9}, title = "Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to {Cilk}", author = "Michael A. Bender and Michael O. Rabin", year = "2002", journal = "Theory of Computing Systems Special Issue on SPAA00", volume = "35", pages = "289--304" } % 10 @Article{BenderFernandezRonSahaiVadhan02, Annote = {A10}, author = "Michael A. Bender and Antonio Fern{\'a}ndez and Dana Ron and Amit Sahai and Salil P. Vadhan", title = "The Power of a Pebble: Exploring and Mapping Directed Graphs", journal = "Information and Computation", volume = "176", pages = "1--21", year = "2002" } %% 11 @article{ArkinBenderMitchellSkiena03, Annote = {A11}, title = "The Lazy Bureaucrat Scheduling Problem", author = "Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell and Steven S. Skiena", journal = "Information and Computation", volume = "184", number = "1", pages = "129--146", year = "2003" } %% 12 @article{BenderBeDeFe04 ,Annote = {A12} ,AUTHOR = "Carl M. Bender and Michael A. Bender and Erik D. Demaine and S{\'a}ndor Fekete" ,TITLE = "What is the Optimal Shape of a City?" ,Journal = "Journal of Physics A: Mathematical and General" ,volume = "37" ,pages = "147-159" ,year = "2004" } %% 13 @article{BenderFa04, Annote = {A13}, author = {Michael A. Bender and Martin Farach-Colton}, title = {The Level Ancestor Problem Simplified}, journal = {Theoretical Computer Science}, volume = {321}, number = {1}, year = {2004}, pages = {5--12} } %% 14 @ARTICLE{ArkinBeDeDeMiSeSk04, Annote = {A14}, AUTHOR = {Esther M. Arkin and Michael A. Bender and Erik D. Demaine and Martin L. Demaine and Joseph S. B. Mitchell and Saurabh Sethia and Steven S. Skiena}, TITLE = {When Can You Fold a Map?}, JOURNAL = {Computational Geometry: Theory and Applications}, journalurl = {http://www.elsevier.com/locate/issn/09257721}, VOLUME = 29, NUMBER = 1, MONTH = {September}, YEAR = 2004, PAGES = {23--46}, NOTE = {Special issue of selected papers from the 10th Annual Fall Workshop on Computational Geometry, 2000.} } %% 15 @ARTICLE{SztainbergArBeMi04, Annote = {A15}, AUTHOR = {Marcelo Sztainberg and Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell}, TITLE = {Theoretical and Experimental Analysis of Heuristics for the Freeze-Tag Robot Awakening Problem}, JOURNAL = {IEEE Transactions on Robotics and Automation}, YEAR = {2004}, volume = {20}, number = {4}, pages = {691-701}, month = {August} } %% 16 @article{BenderMuRa04, Annote = {A16}, author = {Michael A. Bender and S. Muthukrishnan and Rajmohan Rajaraman}, title = {Approximation Algorithms for Average Stretch Scheduling}, journal = {Journal of Scheduling}, volume = {7}, number = {3}, year = {2004}, pages = {195-222}, NOTE = {Special issue of selected papers from the 10th Annual Fall SODA 2002} } %% 17 @article{BenderDuIaWu04 , Annote = {A17} ,bibnote = {was BenderDuanIaconoWu-2004} ,author = "Michael A. Bender and Ziyang Duan and John Iacono and Jing Wu" ,title = "A Locality-Preserving Cache-Oblivious Dynamic Dictionary" ,volume = 3 ,number = 2 ,pages = {115--136} ,journal = "Journal of Algorithms" ,year = "2004" } %% 18 @article{BenderSeSk04, Annote = {A18}, author= "Michael A. Bender and Saurabh Sethia and Steven S. Skiena", title = "Data Structures for Maintaining Set Partitions", journal = "Random Structures and Algorithms", volume = "25", number= "1", pages= "43--67", year= "2004" } %% 19 @Article{AumannBe04 ,Annote = {A19} ,author = {Yonatan Aumann and Michael A. Bender} ,title = {Efficient Low-Contention Asynchronous Consensus with the Value-Oblivious Adversary Scheduler} ,journal = {Distributed Computing} ,volume = {17} ,number = {3} ,year = {2005} ,pages = {191-207} } %% 20 @Article{BenderDeFa05, Annote = {A20}, author= "Michael A. Bender and Erik D. Demaine and Martin Farach-Colton", title = "Cache-Oblivious {B}-Trees", journal = "{SIAM} Journal on Computing", volume = "35", number= "2", pages= "341-358", year= "2005" } %% 21 @Article{ArkinBeDeFeMiSe05, Annote = {A21}, author= "Esther M. Arkin and Michael A. Bender and Erik D. Demaine and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Saurabh Sethia", title = "Optimal Covering Tours with Turn Costs", journal = "{SIAM} Journal on Computing", volume = "35", number= "3", pages= "531-566", year= "2005" } %% 22 @article{BenderFaPeSkSu05, Annote = {A22}, author = {Michael A. Bender and Martin Farach-Colton and Giridhar Pemmasani and Steven Skiena and Pavel Sumazin}, title = {Lowest Common Ancestors in Trees and Directed Acyclic Graphs}, journal = {Journal of Algorithms}, volume = {57}, number = {2}, year = {2005}, pages = {75-94} } %% 23 @article{BenderFaMo06, Annote = {A23}, author = {Michael A. Bender and Martin Farach-Colton and Miguel A. Mosteiro}, title = {Insertion Sort is O(n log n)}, journal = {Theory of Computing Systems}, volume = {39}, number = {3}, year = {2006}, pages = {391-397}, note= {Special Issue on \emph{SPAA '00}} } %% 24 @Article{ArkinBeFeMiSk06, Annote = {A24}, author = {Esther M. Arkin and Michael A. Bender and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Martin Skutella}, title = {The Freeze-Tag Problem: How to Wake Up a Swarm of Robots}, journal = {Algorithmica}, volume = {46}, number = {2}, year = {2006}, pages = {193-221} } %% 25 @article{ArgeBeDeHoMu07 ,Annote = {A25} ,bibnote = {Was ArgeBenderDemaineHolland-MinkleyMunro-2004} ,author = "Lars Arge and Michael A. Bender and Erik D. Demaine and Bryan Holland-Minkley and J. Ian Munro", title = "Cache-Oblivious Priority Queue and Graph Algorithm Applications", journal = "{SIAM} Journal on Computing", year = "2007", volume = {36}, number = {6}, year = {2007}, pages = {1672-1695} } %% 26 @article{BenderBrJaPi07, annote = {J26}, author = {Michael A. Bender and Bryan Bradley and Geetha Jagannathan and Krishnan Pillaipakkamnatt}, title = {Sum-of-Squares Heuristics for Bin Packing and Memory Allocation}, journal = {Journal of Experimental Algorithmics}, volume = {12}, year = {2007}, issn = {1084-6654}, pages = {2.3} } %% URL: http://link.aip.org/link/?JMP/48/073518 %% DOI: 10.1063/1.2752008 %% 27 @article{BenderBe07, Annote = {A27}, author = {Michael A. Bender and Carl M. Bender}, title = {Optimal Shape of a Blob}, journal = {Journal of Mathematical Physics}, year = {2007}, volume = {8}, number = {7}} %% 28 @article{BenderBuDeFeLeMe07, Annote = {A28}, Author = {Michael A. Bender and David P. Bunde and Erik D. Demaine and S{\'a}ndor P. Fekete and Vitus J. Leung and Henk Meijer and Cynthia A. Phillips}, Title = {Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance }, Journal = {Algorithmica}, Note = {In press}, Year = {2007}} %% 29 @article{BenderClTs07, Annote = {A29}, Author = {Michael A. Bender A. Bender and Raphael Clifford and Kostas Tsichlas}, Date-Added = {2007-09-15 20:35:11 -0400}, Date-Modified = {2007-09-15 20:38:02 -0400}, Journal = {Journal of Scheduling}, Title = {Scheduling Algorithms for Procrastinators}, Year = {2007}, note = {In press.} } %% 30 @article{BenderGeHeHuPiSkSw07, Annote = {A39}, Author = {Michael A. Bender and Dongdong Ge and Simai He and Haodong Hu and Ron Y. Pinter and Firas Swidan and Steven Skiena and Firas Swidan}, Journal = {Journal of Computer and System Sciences}, Title = {Improved Bounds on Sorting by Length-Weighted Reversals}, Year = {2007}, Note = {In press} } %% 31 @article{BenderHu07, Annote = {A31}, Author = {Michael A. Bender and Haodong Hu}, Journal = {Transactions on Database Systems}, Title = {An Adaptive Packed-Memory Array}, Year = {2007}, Note = {In press} } %%REFEREED CONFERENCES %% 1 @InProceedings{BenderSl94, Annote = {C1}, title = "The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs", author = "Michael A. Bender and Donna K. Slonim", pages = "75--85", booktitle = "Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS)", month = "November", year = "1994" } %% 2 @InProceedings{AumannBe96a, Annote = {C2}, title = "Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler", author = "Yonatan Aumann and Michael A. Bender", pages = "622--633", booktitle = "Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP)", month = "July", year = "1996" } %% 3 @InProceedings{AndrewsBeZh96, Annote = {C3}, title = "New Algorithms for the Disk Scheduling Problem", author = "Matthew Andrews and Michael A. Bender and Lisa Zhang", pages = "580--589", booktitle = "Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS)", year = "1996" } %% 4 @InProceedings{AumannBeZh96, Annote = {C4}, title = "Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems", author = "Yonatan Aumann and Michael A. Bender and Lisa Zhang", pages = "270--276", booktitle = "Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)", year = "1996" } %% 5 @InProceedings{AumannBe96b, Annote = {C5}, title = "Fault Tolerant Data Structures", author = "Yonatan Aumann and Michael A. Bender", pages = "580--589", booktitle = "Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS)", month = "October", year = "1996" } %% 6 @InProceedings{BenderChMu98, Annote = {C6}, title = "Flow and Stretch Metrics for Scheduling Continuous Job Streams", author = "Michael A. Bender and Soumen Chakrabarti and S. Muthukrishnan", booktitle = "Proceedings of the 9th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA)", pages = "270--279", year = "1998" } %% 7 @InProceedings{BenderFeRoSaVa98, Annote = {C7}, author = "Michael A. Bender and Antonio Fern{\'a}ndez and Dana Ron and Amit Sahai and Salil P. Vadhan", title = "The Power of a Pebble: Exploring and Mapping Directed Graphs", pages = "269--278", booktitle = "Proceedings of the 30th Annual {ACM} Symposium on Theory of Computing ({STOC})", year = "1998" } %% 8 @Inproceedings{ChekuriBe98, Annote = {C8}, author = "Chandra Chekuri and Michael A. Bender", title = "An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines", booktitle = "Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (IPCO)", journal = "Lecture Notes in Computer Science", volume = "1412", pages = "383--393", year = "1998" } %% 9 @InProceedings{ArkinBeMiSk99, Annote = {C9}, title = "The Lazy Bureaucrat Scheduling Problem", author = "Ether M. Arkin and Michael A. Bender and Joseph S. B. Mitchell and Steven S. Skiena", booktitle = "Proceedings of the 6th Workshop on Discrete Algorithms {(WADS)}", pages = "122--133", year = "1999" } %% 10 @InProceedings{BenderCh99, Annote = {C10}, title = "Performance Guarantees for the {TSP} with a Parametrized Triangle Inequality", author = "Michael. A. Bender and Chandra Chekuri", booktitle = "Proceedings of the 6th Workshop on Discrete Algorithms (WADS)", pages = "80--85", year = "1999" } %% 11 @Inproceedings{BenderFarach00, Annote = {C11}, author = "Michael A. Bender and Martin Farach-Colton", title = "The {LCA} Problem Revisited ", booktitle = "Proceedings of Latin American Theoretical {IN}formatics (LATIN)", pages = "88--94", year = "2000" } %% 12 @InProceedings{BenderSeSk00, Annote = {C12}, title = "Data Structures for Maintaining Set Partitions", author = "Michael A. Bender and Saurabh Sethia and Steven Skiena", booktitle = "Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT)", pages = "83--96", year = "2000" } %% 13 @InProceedings{BenderRo00, Annote = {C13}, title = "Testing Acyclicity of Directed Graphs in Sublinear Time", author = "Michael A. Bender and Dana Ron", booktitle = "Proceedings of the 27th International Colloquium on Automata, Languages, and Programming (ICALP)", pages = "809-820", year = "2000" } %% 14 @InProceedings{BenderRabin00, Annote = {C14}, title = "Scheduling {Cilk} Multithreaded Computations on Processors of Different Speeds", author = "Michael A. Bender and Michael O. Rabin", pages = "13--21", booktitle = "Proceedings of the 12th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA)", month = "July", year = "2000" } %% 15 @InProceedings{BitterSBMKW00, Annote = {C15}, title = "{CEASAR}: A Smooth, Accurate, and Robust Centerline Extraction Algorithm", author = "Ingmar Bitter and Mie Sato and Michael A. Bender and Kevin T. McDonnell and Arie E. Kaufman and Min Wan", booktitle = "IEEE Visualization 2000", pages = "45--52", month = "October", year = "2000" } %% 16 @InProceedings{SatoBBK00, Annote = {C16}, title = "{TEASAR}: Tree-structure Extraction Algorithm for Accurate and Robust Skeletons", author = "Mie Sato and Ingmar Bitter and Michael A. Bender and Arie E. Kaufman ", booktitle = "Eighth Pacific Conference on Computer Graphics and Applications Graphics", pages = "281--287", address = "Hong Kong, China", month = "October", year = "2000" } %% 17 @Inproceedings{BenderDeFa00, Annote = {C17}, author = "Michael A. Bender and Erik D. Demaine and Martin Farach-Colton", title = "Cache-Oblivious {B}-Trees", booktitle = "Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS)", pages = "399--409", year = "2000" } %% 18 @inproceedings{ArkinBeDeFeMiSe01, Annote = {C18}, author = {Esther M. Arkin and Michael A. Bender and Erik D. Demaine and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Saurabh Sethia}, title = {Optimal Covering Tours with Turn Costs}, booktitle = {Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)}, year = {2001}, pages = {138-147} } %% 19 @inproceedings{BenderPeSkSu01, Annote = {C19}, author = {Michael A. Bender and Giridhar Pemmasani and Steven Skiena and Pavel Sumazin}, title = {Finding Least Common Ancestors in Directed Acyclic Graphs.}, booktitle = {Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA)}, year = {2001}, pages = {845-854} } %% 20 @inproceedings{ArkinBeDeDeMiSeSk01, Annote = {C20}, author = {Esther M. Arkin and Michael A. Bender and Erik D. Demaine and Martin L. Demaine and Joseph S. B. Mitchell and Saurabh Sethia and Steven Skiena}, title = {When Can You Fold a Map?}, booktitle = {7th International Workshop Algorithms and Data Structures (WADS)}, year = {2001}, pages = {401-413} } %% series = {Lecture Notes in Computer Science 2125}, %% volume = {2125}, %% 21 @inproceedings{ArkinBeFeMiSk02, Annote = {C21}, author = {Esther M. Arkin and Michael A. Bender and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Martin Skutella}, title = {The Freeze-Tag Problem: How to Wake up a Swarm of Robots}, booktitle = {Proceedings of the 13th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA)}, year = {2002}, pages = {568-577} } %% 22 @inproceedings{BenderDuIaWu02, Annote = {C22}, author = "Michael A. Bender and Ziyang Duan and John Iacono and Jing Wu", title = "A Locality-Preserving Cache-Oblivious Dynamic Dictionary", booktitle = "Proceedings of the 13th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA)", year = "2002", pages = "29--38" } %% 23 @InProceedings{BenderMuthukrishnanRajaraman-2002, Annote = {C23}, author = "Michael A. Bender and S. Muthukrishnan and Rajmohan Rajaraman", title = "Improved Algorithms for Stretch Scheduling", booktitle = "Proceedings of the 13th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA)", pages = "762--771", year = "2002" } %% 24 @Inproceedings{BenderFa02, Annote = {C24}, bibnote = {was BenderFarach02}, author = "Michael A. Bender and Martin Farach-Colton", title = "The Level Ancestor Problem Simplified", booktitle = "Proceedings of Latin American Theoretical {IN}formatics (LATIN)", pages = "508--515", year = "2002" } %% 25 @inproceedings{ArgeBeDeHoMu02, Annote = {C25}, bibnote = {was ArgeBenderDemaineHolland-MinkleyMunro-2002}, author = "Lars Arge and Michael A. Bender and Erik D. Demaine and Bryan Holland-Minkley and J. Ian Munro", title = "Cache-Oblivious Priority Queue and Graph Algorithm Applications", booktitle = "Proceedings of the 34th Annual {ACM} Symposium on Theory of Computing ({STOC})", pages = "268--276", year = "2002" } %% 26 @Inproceedings{BenderCoRa02 ,Annote = {C26} ,bibnote = {was BenderColeRaman-2002} ,author = "Michael A. Bender and Richard Cole and Rajeev Raman" ,title = "Exponential Structures for Efficient Cache-Oblivious Algorithms" ,booktitle = "Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP)" ,pages = "195-207" ,year = "2002" } %% 27 @inproceedings{SztainbergArBeMi02, Annote = {C27}, author = {Marcelo O. Sztainberg and Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell}, title = {Analysis of Heuristics for the Freeze-Tag Problem}, booktitle = {8th Scandinavian Workshop on Algorithm Theory (SWAT)}, year = {2002}, pages = {270-279}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {2368} } %% 28 @Inproceedings{BenderCoDeFa02, Annote = {C28}, bibnote = {was BenderColeDemaineFarach-2002}, author = "Michael A. Bender and Richard Cole and Erik D. Demaine and Martin Farach-Colton", title = "Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy", booktitle = "Proceedings of the 10th European Symposium on Algorithms (ESA)", pages = "139--151", year = "2002" } %% 29 @Inproceedings{BenderCoDeFaZi02, Annote = {C29}, bibnote = {was BenderColeDemaineFarachZito-2002}, author = "Michael A. Bender and Richard Cole and Erik D. Demaine and Martin Farach-Colton and J. Zito", title = "Two Simplified Algorithms for Maintaining Order in a List", booktitle = "Proceedings of the 10th European Symposium on Algorithms (ESA)", pages = "152--164", year = "2002" } %% 30 @Inproceedings{BenderDeFa02, Annote = {C30}, bibnote = {was BenderDemaineFarach-2002}, author = "Michael A. Bender and Erik D. Demaine and Martin Farach-Colton", title = "Efficient Tree Layout in a Multilevel Memory Hierarchy", booktitle = "Proceedings of the 10th European Symposium on Algorithms (ESA)", pages = "165--173", year = "2002" } %% 31 @inproceedings{LeungArBeBuJoLaMiPhSe02, Annote = {C31}, bibnote = {was LeungABBJLMPS-2002}, title= "Processor Allocation on {Cplant}: Achieving General Processor Locality Using One-Dimensional Allocation Strategies", author= "Vitus Leung and Esther M. Arkin and Michael A. Bender and David P. Bunde and Jeanette Johnston and Alok Lal and Joseph S. B. Mitchell and Cynthia A. Phillips and Steven S. Seiden", booktitle="Proceedings of the 4th {IEEE} International Conference on Cluster Computing (CLUSTER)", year ="2002", pages ="296--304" } %% 32 @inproceedings{HsiangArBeFeMi02, Annote = {C32}, author = "Tien-Ruey Hsiang and Esther M. Arkin and Michael A. Bender and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell", title = "Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments", booktitle = "Proceedings of the 5th International Workshop on Algorithmic Foundations of Robotics (WAFR)", year = "2002" } %% 33 @inproceedings{HsiangArBeFeMi03, Annote = {C33}, author = {Tien-Ruey Hsiang and Esther M. Arkin and Michael A. Bender and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell}, title = {Online Dispersion Algorithms for Swarms of Robots}, booktitle = {Proceedings of the 19th ACM Symposium on Computational (SoCG)}, year = {2003}, pages = {382-383}, note = {Video} } %% 34 @inproceedings{ArkinBGHM-2003, Annote = {C34}, author = "Esther M. Arkin and Michael A. Bender and Dongdong Ge and Simai He and Joseph S. B. Mitchell", title = "Improved Approximation Algorithms for the Freeze-Tag Problem", booktitle = "Proceedings of the 15th Annual {ACM} Symposium on Parallelism in Algorithms and Architecture (SPAA)", pages = "295--303", year = "2003" } %% 35 @INPROCEEDINGS{BenderBrFaGeHeHuIaLo03, Annote = {C35}, AUTHOR = "Michael A. Bender and Gerth S. Brodal and Rolf Fagerberg and Dongdong Ge and Simai He and Haodong Hu and John Iacono and Alejandro Lopez-Ortiz", TITLE = "The Cost of Cache-Oblivious Searching", BOOKTITLE = "Proceedings of the 44th Annual Symposium on Foundations of Computer Science {(FOCS)}", YEAR = "2003", pages = "271-280" } %% 36 @inproceedings{BenderGeHeHuPiSkSw02, Annote = {C36}, author = {Michael A. Bender and Dongdong Ge and Simai He and Haodong Hu and Ron Y. Pinter and Steven Skiena and Firas Swidan}, title = {Improved Bounds on Sorting with Length-Weighted Reversals}, booktitle = {Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)}, year = {2004}, pages = {919-928} } %% 37 @INPROCEEDINGS{BenderBrJaPi04, Annote = {C37}, AUTHOR = "Michael A. Bender and Bryan Bradley and Geetha Jagannathan and Krishnan Pillaipakkamnatt", TITLE = "The Robustness of the Sum-of-Squares Algorithm for Bin Packing", BOOKTITLE = "Proceedings of the 6th Workshop on Algorithm Engineering and Experiments {(ALENEX)}", PAGES= "18-30", YEAR = "2004" } %% 38 @InProceedings{BenderFiGi04, Annote = {C38}, author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Charles E. Leiserson}, title = {On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs}, booktitle = {Proceedings of the Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, month = {June}, year = {2004}, pages = {133--144} } %% 39 @inproceedings{BenderFaMo04, Annote = {C39}, author = {Michael A. Bender and Martin Farach-Colton and Miguel Mosteiro}, title = {Insertion Sort is $O(n \log n)$}, verbose-booktitle = {Proceedings of the 3rd International Conference on Fun with Algorithms (FUN)}, booktitle = {Fun with Algorithms}, year = {2004}, pages = {16-23} } %% 40 @inproceedings{SwidanBeGeHeHuPi04, Annote = {C40}, author = {Firas Swidan and Michael A. Bender and Dongdong Ge and Simai He and Haodong Hu and Ron Y. Pinter}, title = {Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity}, booktitle = {Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM)}, year = {2004}, pages = {32-46} } %% 41 @InProceedings{BenderFiGiKu05, Annote = {C41}, author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Bradley C. Kuszmaul}, title = {Concurrent Cache-Oblivious Search Trees}, booktitle = {Symposium on Parallelism in Algorithms and Architechtures (SPAA)}, pages = {228-237}, year = 2005 } %% 42 @inproceedings{BenderFaHeKuLe05, Annote = {C42}, author = {Michael A. Bender and Martin Farach-Colton and Simai He and Bradley C. Kuszmaul and Charles E. Leiserson}, title = {Adversarial Contention Resolution for Simple Channels}, booktitle = {17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, year = {2005}, pages = {325--332} } %% 43 @inproceedings{BenderBDFLMP05, Annote = {C43}, author = {Michael A. Bender and David P. Bunde and Erik D. Demaine and S{\'a}ndor P. Fekete and Vitus J. Leung and Henk Meijer and Cynthia A. Phillips}, title = {Communication-Aware Processor Allocation for Supercomputers}, booktitle = {9th International Workshop on Algorithms and Data Structures (WADS)}, year = {2005}, pages = {169-181}, } %% 44 @Inproceedings{BenderHu06, Annote = {C44}, author = {Michael A. Bender and Haodong Hu}, title = {An Adaptive Packed-Memory Array}, booktitle = "Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS)", year = {2006}, pages = {20-29} } %% 45 @Inproceedings{BenderFaKu06, Annote = {C45}, author = {Michael A. Bender and Martin Farach-Colton and Bradley Kuszmaul}, title = {Cache-Oblivious String {B}-Trees}, booktitle = {Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS)}, year = {2006}, pages = {233-242} } %% 46 %%\texttt{http://arxiv.org/abs/cs/0603026} @Inproceedings{ArkinBeMiPo06, Annote = {C46}, author = "Esther M. Arkin and Michael A. Bender and Joseph S. B. Mitchell and Valentin Polishchuk", title = "The Snowblower Problem", booktitle = "Proceedings of the 7th Workshop on Algorithmic Foundations of Robotics (WAFR)", year = "2006" } %% 47 @INPROCEEDINGS{BenderFiGi06, Annote = {C47}, AUTHOR = {Michael A. Bender and Jeremy T. Fineman and and Seth Gilbert}, TITLE = {Contention Resolution with Heterogeneous Job Sizes}, BOOKTITLE = {Proceedings of the 14th Annual European Symposium on Algorithms (ESA)}, YEAR = {2006}, pages = {112--123} } %% 48 @inproceedings{BenderPh07, Annote = {C48}, author = {Michael A. Bender and Cynthia A. Phillips}, title = {Scheduling DAGs on Asynchronous Processors}, booktitle = {Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, year = {2007}, pages = {35--45} } %% location = {San Diego, California, USA}, %% 49 @inproceedings{BenderBrFaJaVi07, Annote = {C49}, author = {Michael A. Bender and Gerth S. Brodal and Rolf Fagerberg and Riko Jacob and Elias Vicari}, title = {Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model}, booktitle = {Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, year = {2007}, pages = {61--70}, } %% location = {San Diego, California, USA}, %% 50 @inproceedings{BenderFaFiFoKuNe07, Annote = {C50}, author = {Michael A. Bender and Martin Farach-Colton and Jeremy T. Fineman and Yonatan R. Fogel and Bradley C. Kuszmaul and Jelani Nelson}, title = {Cache-Oblivious Streaming B-trees}, booktitle = {Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, year = {2007}, pages = {81--92} } %% location = {San Diego, California, USA}, %% 51 @inproceedings{AgrawalBeFi07, Annote = {C51}, author = {Kunal Agrawal and Michael A. Bender and Jeremy T. Fineman}, title = {The Worst Page-Replacement Policy}, booktitle = {Proceedings of the 4rd International Conference on Fun with Algorithms (FUN)}, pages = {135--145}, year = {2007} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%% TECHNICAL REPORTS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @Misc{TreeLayout_Manuscript2002, Annote = {R1}, AUTHOR = {Stephen Alstrup and Michael A. Bender and Erik D. Demaine and Martin Farach-Colton and J. Ian Munro and Theis Rauhe and Mikkel Thorup}, TITLE = {Efficient Tree Layout in a Multilevel Memory Hierarchy}, MONTH = {November 11}, YEAR = 2002, note = {\url{http://www.arXiv.org/abs/cs.DS/0211010}}, } @techreport{LeungArBe02b, Annote = {R2}, bibnote = {was leung02b}, title= "Processor Allocation on {Cplant}: Achieving General Processor Locality Using One-Dimensional Allocation Strategies", author= "Vitus Leung and Esther M. Arkin and Michael A. Bender and David P. Bunde and Jeanette Johnston and Alok Lal and Joseph S. B. Mitchell and Cynthia A. Phillips and Steven S. Seiden", type= "Technical Report", number= "SAND2002-1488", institution= "Sandia National Laboratories", year="2002" } @Misc{Alstrup-Bender-Demaine-Farach-Colton-Munro-Rauhe-Thorup-2002, Annote = {R3}, AUTHOR = {Stephen Alstrup and Michael A. Bender and Erik D. Demaine and Martin Farach-Colton and J. Ian Munro and Theis Rauhe and Mikkel Thorup}, TITLE = {Efficient Tree Layout in a Multilevel Memory Hierarchy}, HOWPUBLISHED = {arXiv:cs.DS/0211010}, MONTH = {November}, YEAR = 2002, NOTE = {\url{http://www.arXiv.org/abs/cs.DS/0211010}} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% PATENTS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @MISC{BenderChMu00, Annote = {P1}, title= "A System and Method for Scheduling Webservers with a Quality-of-Service Guarantee for Each User", author = "M.~A. Bender and S.~Chakrabarti and S.~Muthukrishnan", howpublished = "United States Patent 6,112,221.", year = "2000" } @MISC{LeungBeBuPh05, Annote = {P2}, title = "Fault Tolerant, Deadlock-Free Routing, and Routing-Based Processor Allocation in a Multiple Processor Computing Apparatus", author = "V. J. Leung and M. A. Bender and D. P. Bunde and C. A. Phillips", howpublished = "United States Patent Application Serial No. 11/110,466", year = "2005" } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% UNPUBLISHED %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @unpublished{AumannBender2003, Annote = {U1}, title = "Fault Tolerant Data Structures", author = "Yonatan Aumann and Michael A. Bender", note = "Submitted to the {\em Journal of Computer System Sciences}", year = "2003" } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% WORKSHOP %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @MISC{ArgeBeDeLeMe04, Annote = {W1}, bibnote = {was Dagstuhl-cache-2004} ,author = "L. Arge and Michael A. Bender and E. D. Demaine and C. E. Leiserson and K. Mehlhorn" ,title = "Dagstuhl Seminar Number 04301: Cache-Oblivious and Cache-Aware Algorithms" ,howpublished = "http://www.dagstuhl.de/04301/" ,year = "2004" ,month = "July" } @MISC{TrystramBlBeEcPe06, Annote = {W2}, bibnote = {was Dagstuhl-cache-2004} ,author = "Denis Trystram and Jacek Blazewicz and Michael A. Bender and Klaus Ecker and Erwin Pesch" ,title = "CIRM Workshop: Scheduling Algorithms for new Emerging Applications " ,howpublished = "\url{http://www.cirm.univ-mrs.fr/web.ang/liste_rencontre/Rencontres2006/Tryst06/Tryst06.html}" ,year = "2006" ,month = "May" }