- The FreezeTag Problem: How to Wake Up a Swarm of Robots
- The Robustness of the Sum-of-Squares Algorithm for Bin Packing Michael A. Bender Bryan Bradley y Geetha Jagannathan z
- Improved Bounds on Sorting with Length-Weighted Reversals (Extended Abstract)
- Performance Guarantees for Btrees with DifferentSized Atomic Keys #
- New Algorithms for Disk Scheduling Matthew Andrews \Lambda Michael A. Bender y Lisa Zhang z
- Finding Least Common Ancestors in Directed Acyclic Graphs Michael A. Bender Giridhar Pemmasani Steven Skiena y Pavel Sumazin z
- Maintaining Arrays of Contiguous Objects Michael A. Bender1
- Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small
- The Level Ancestor Problem Simpli ed Michael A. Bender 1? and Mart n Farach-Colton 2
- INSERTION SORT is O(n log n) Michael A. Bender
- Improved Algorithms for Stretch Scheduling Michael A. Bender S. Muthukrishnan y Rajmohan Rajaraman z
- A Locality-Preserving Cache-Oblivious Dynamic Dictionary Michael A. Bender y Ziyang Duan z John Iacono x Jing Wu {
- Sorting by LengthWeighted Reversals: Dealing with Signs and Circularity
- Online Dispersion Algorithms for Swarms of Robots TienRuey Hsiang
- The Worst Page-Replacement Policy Kunal Agrawal
- Performance Guarantees for the TSP with a Parameterized Triangle Inequality
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines \Lambda
- Scheduling Cilk Multithreaded Parallel Programs on Processors of Different Speeds
- Adversarial Contention Resolution for Simple Channels Michael A. Bender
- Data Structures for Maintaining Set Partitions (Extended Abstract)
- The Cost of Cache-Oblivious Searching Michael A. Bender y Gerth St lting Brodal zx Rolf Fagerberg z Dongdong Ge
- SAND20021488 Unlimited Release
- Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems \Lambda
- preprint LAUR070471 Optimal Shape of a Blob
- OntheFly Maintenance of SeriesParallel Relationships in ForkJoin Multithreaded Programs
- INSERTION SORT is O(n log n) # Michael A. Bender + Martn FarachColton # Miguel Mosteiro
- Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments
- Ecient Low-Contention Asynchronous Consensus with the Value-Oblivious Adversary Scheduler
- Scheduling Algorithms for Procrastinators Michael A. Bender
- Testing Properties of Directed Graphs: Acyclicity and Connectivity Michael A. Bender y
- A Locality-Preserving Cache-Oblivious Dynamic Dictionary Michael A. Bender y
- The Lazy Bureaucrat Scheduling Problem Esther M. Arkin 1? , Michael A. Bender 2?? , Joseph S. B. Mitchell 1? ? ? , and
- The Worst PageReplacement Policy Kunal Agrawal 1 , Michael A. Bender 2 , and Jeremy T. Fineman 1
- Concurrent CacheOblivious BTrees Michael A. Bender
- Ecient Tree Layout in a Multilevel Memory Hierarchy Stephen Alstrup y Michael A. Bender z Erik D. Demaine x
- Cache-Oblivious Priority Queue and Graph Algorithm Applications
- Fault Tolerant Data Structures Yonatan Aumann \Lambda Michael A. Bender y
- The Power of a Pebble: Exploring and Mapping Directed Graphs
- The Lazy Bureaucrat Scheduling Problem ? Esther M. Arkin a;1 , Michael A. Bender b;2 ,
- What is the Optimal Shape of a City? Carl M. Bender
- When Can You Fold a Map? Esther M. Arkin Michael A. Bender y Erik D. Demaine z Martin L. Demaine z
- The Worst PageReplacement Policy Kunal Agrawal
- Approximation Algorithms for Average Stretch Scheduling Michael A. Bender 1 S. Muthukrishnan 2 Rajmohan Rajaraman 3
- Two Simpli ed Algorithms for Maintaining Order in a List
- Scheduling DAGs on Asynchronous Processors Michael A. Bender #
- Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
- The LCA Problem Revisited Michael A. Bender
- Processor Allocation on Cplant: Achieving General Processor Locality Using OneDimensional Allocation Strategies
- Improved Bounds on Sorting by Length-Weighted Reversals Michael A. Bender
- An Optimal CacheOblivious Priority Queue and its Application to Graph Algorithms #
- Data Structures for Maintaining Set Partitions Michael A. Bender y Saurabh Sethia z Steven S. Skiena x
- Optimal CacheOblivious Mesh Layouts Michael A. Bender # + # Bradley C. Kuszmaul + ShangHua Teng # ##++ Kebin Wang ##
- The Power of a Pebble: Exploring and Mapping Directed Graphs \Lambda
- Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model
- CacheOblivious BTrees Michael A. Bender Erik D. Demaine y Martin FarachColton z
- CACHEOBLIVIOUS BTREES # MICHAEL A. BENDER + , ERIK D. DEMAINE # , AND MARTIN FARACHCOLTON
- Flow and Stretch Metrics for Scheduling Continuous Job Streams Michael A. Bender \Lambda Soumen Chakrabarti y S. Muthukrishnan z
- The Cost of Cache-Oblivious Searching Michael A. Bender
- preprint LA-UR-07-0471 Optimal Shape of a Blob
- Testing Acyclicity of Directed Graphs in Sublinear Time \Lambda Michael A. Bender y
- Analysis of Heuristics for the FreezeTag Marcelo O. Sztainberg 1 , Esther M. Arkin 1 , Michael A. Bender 2 , and
- Laboratoire de l'Informatique du Paralllisme Ecole Normale Suprieure de Lyon
- Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk
- The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
- When Can You Fold a Map? Esther M. Arkin 1 , Michael A. Bender 2 , Erik D. Demaine 3 , Martin L. Demaine 3 ,
- Improved Approximation Algorithms for the FreezeTag Problem
- An Adaptive PackedMemory Array Michael A. Bender
- INSERTION SORT is O(n log n) Michael A. Bender
- The Freeze-Tag Problem: How to Wake Up a Swarm of Robots Esther M. Arkin
- An Optimal Cache-Oblivious Priority Queue and its Application to Graph Algorithms
- The LCA Problem Revisited Michael A. Bender
- Cache-Oblivious String B-trees Michael A. Bender
- Scheduling DAGs on Asynchronous Processors Michael A. Bender
- Cache-Oblivious Streaming B-trees Michael A. Bender
- Performance Guarantees for B-trees with Different-Sized Atomic Keys
- Efficient Asynchronous Consensus with the ValueOblivious Adversary Scheduler
- Optimal Cache-Oblivious Mesh Layouts Michael A. Bender Bradley C. Kuszmaul Shang-Hua Teng Kebin Wang
- Sum-of-Squares Heuristics for Bin Packing and Memory Allocation
- An Adaptive Packed-Memory Array Michael A. Bender
- Ecient Tree Layout in a Multilevel Memory Michael A. Bender 1? , Erik D. Demaine 2?? , and Martin Farach-Colton 3? ? ?
- Performance Guarantees for the TSP with a Parameterized Triangle Inequality
- Scheduling Algorithms for Procrastinators Michael A. Bender # Raphael Clifford + Kostas Tsichlas #
- Optimal Covering Tours with Turn Costs Esther M. Arkin Michael A. Bender y Erik D. Demaine z S andor P. Fekete x
- Lowest Common Ancestors in Trees and Directed Acyclic Graphs1 Michael A. Bender2 3
- Mutual Exclusion with O(log2 log n) Amortized Work
- Don't Thrash: How to Cache your Hash on Flash Appears in the proceedings of the 3rd USENIX Workshop in Hot Topics in Storage and File Systems (HotStorage 2011)
- Don't Thrash: How to Cache your Hash on Flash Appears in the proceedings of the 3rd USENIX Workshop in Hot Topics in Storage and File Systems (HotStorage 2011)
- Mutual Exclusion with O(log 2 log n) Amortized Work Michael A. Bender
- The Snowblower Problem Esther M. Arkin
