Michael A. Bender

Alberto Marchetti-Spaccamela

Proceedings of the 35th Euromicro Conference on Real-Time Systems, 2023

Mosaic Pages: Big TLB Reach with Small Pages.

[BibT_eX]

[DOI]

Abhishek Bhattacharjee

Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023

2022

IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity.

[BibT_eX]

[DOI]

CoRR, 2022

Using advanced data structures to enable responsive security monitoring.

[BibT_eX]

[DOI]

Clust. Comput., 2022

On the optimal time/space tradeoff for hash tables.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Automatic HBM Management: Models and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Contention Resolution for Coded Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Online Parallel Paging with Optimal Makespan.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2022 ACM PODS Alberto O. Mendelzon Test-of-Time Award.

[BibT_eX]

[DOI]

Michael Bender

Michael Benedikt

Sudeepa Roy

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

What Does Dynamic Optimality Mean in External Memory?

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Online List Labeling: Breaking the log<sup>2</sup>n Barrier.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

BetrFS: a compleat file system for commodity SSDs.

[BibT_eX]

[DOI]

Proceedings of the EuroSys '22: Seventeenth European Conference on Computer Systems, Rennes, France, April 5, 2022

When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting.

[BibT_eX]

[DOI]

Rob Johnson

Rishab Nithyanand

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Copy-on-Abundant-Write for Nimble File System Clones.

[BibT_eX]

[DOI]

ACM Trans. Storage, 2021

External-memory Dictionaries in the Affine and PDAM Models.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

Timely Reporting of Heavy Hitters Using External Memory.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2021

A Perspective on "CCS Expressions, Finite State Processes, and Three Problems of Equivalence".

[BibT_eX]

[DOI]

Ezio Bartocci

SIGACT News, 2021

All-Purpose Hashing.

[BibT_eX]

[DOI]

CoRR, 2021

Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering.

[BibT_eX]

[DOI]

CoRR, 2021

Paging and the Address-Translation Problem.

[BibT_eX]

[DOI]

Abhishek Bhattacharjee

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Randomized Cup Game Algorithms Against Strong Adversaries.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Tight Bounds for Parallel Paging and Green Paging.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Incremental Edge Orientation in Forests.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Mitigating False Positives in Filters: to Adapt or to Cache?

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

2020

How to Not Copy Files.

[BibT_eX]

[DOI]

Contention resolution without collision detection.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

How to Manage High-Bandwidth Memory Automatically.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Contention Resolution with Message Deadlines.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Green Paging and Parallel Paging.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Flushing Without Cascades.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Batched Predecessor and Sorting with Size-Priced Information in External Memory.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

A Scheduling Approach to Incremental Maintenance of Datalog Programs.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

How to Copy Files.

[BibT_eX]

[DOI]

Proceedings of the 18th USENIX Conference on File and Storage Technologies, 2020

2019

Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness.

[BibT_eX]

[DOI]

J. ACM, 2019

Achieving optimal backlog in multi-processor cup games.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Optimal Ball Recycling.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Filesystem Aging: It's more Usage than Fullness.

[BibT_eX]

[DOI]

Proceedings of the 11th USENIX Workshop on Hot Topics in Storage and File Systems, 2019

2018

Efficient Directory Mutations in a Full-Path-Indexed File System.

[BibT_eX]

[DOI]

ACM Trans. Storage, 2018

The range 1 query (R1Q) problem.

[BibT_eX]

[DOI]

Pramod Ganapathi

Samuel McCauley

Yuan Tang

Theor. Comput. Sci., 2018

Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

The Online Event-Detection Problem.

[BibT_eX]

[DOI]

CoRR, 2018

Squeakr: an exact and approximate k-mer counting system.

[BibT_eX]

[DOI]

Bioinform., 2018

Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2018

The Algorithmics of Write Optimization.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Bloom Filters, Adaptivity, and the Dictionary Problem.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

The Full Path to Full-Path Indexing.

[BibT_eX]

[DOI]

Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018

2017

How to Fragment Your File System.

[BibT_eX]

[DOI]

Writes Wrought Right, and Other Adventures in File System Optimization.

[BibT_eX]

[DOI]

ACM Trans. Storage, 2017

Cost-Oblivious Storage Reallocation.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2017

A Fast x86 Implementation of Select.

[BibT_eX]

[DOI]

Prashant Pandey

Rob Johnson

CoRR, 2017

deBGR: an efficient and near-exact representation of the weighted de Bruijn graph.

[BibT_eX]

[DOI]

Bioinform., 2017

File Maintenance: When in Doubt, Change the Layout!

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Cross-Referenced Dictionaries and the Limits of Write Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A General-Purpose Counting Filter: Making Every Bit Count.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Write-Optimized Skip Lists.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

File Systems Fated for Senescence? Nonsense, Says Science!

[BibT_eX]

[DOI]

Proceedings of the 15th USENIX Conference on File and Storage Technologies, 2017

2016

B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2016

A New Approach to Incremental Cycle Detection and Related Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Contention resolution with log-logstar channel accesses.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Cache-Adaptive Analysis.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

The I/O Complexity of Computing Prime Tables.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Lazy Analytics: Let Other Queries Do the Work For You.

[BibT_eX]

[DOI]

Proceedings of the 8th USENIX Workshop on Hot Topics in Storage and File Systems, 2016

Resource Optimization for Program Committee Members: A Subreview Article.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Optimizing Every Operation in a Write-optimized File System.

[BibT_eX]

[DOI]

Proceedings of the 14th USENIX Conference on File and Storage Technologies, 2016

2015

An Introduction to Bε-trees and Write-Optimization.

[BibT_eX]

[DOI]

BetrFS: Write-Optimization in a Kernel File System.

[BibT_eX]

[DOI]

ACM Trans. Storage, 2015

The minimum backlog problem.

[BibT_eX]

[DOI]

Valentin Polishchuk

Jukka Suomela

Theor. Comput. Sci., 2015

Resource-Competitive Algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2015

Reallocation Problems in Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 2015

Cost-Oblivious Reallocation for Scheduling and Planning.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

k-Means Clustering on Two-Level Memory Systems.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Symposium on Memory Systems, 2015

Run Generation Revisited: What Goes Up May or May Not Come Down.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

BetrFS: A Right-Optimized Write-Optimized File System.

[BibT_eX]

[DOI]

Proceedings of the 13th USENIX Conference on File and Storage Technologies, 2015

2014

The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye.

[BibT_eX]

[DOI]

Ritwik Bose

Samuel McCauley

Theory Comput. Syst., 2014

NoiseOFF: A Backoff Protocol for a Dynamic, Noisy World.

[BibT_eX]

[DOI]

CoRR, 2014

Cache-Adaptive Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Dynamic Task Allocation in Asynchronous Shared Memory.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The Batched Predecessor Problem in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Guest editorial: "New trends in scheduling" - Centre CNRS "La Villa Clythia" Frejus Workshop, September 12-17, 2010.

[BibT_eX]

[DOI]

J. Sched., 2013

Efficient scheduling to minimize calibrations.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012

Don't Thrash: How to Cache Your Hash on Flash.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2012

The TokuFS Streaming File System.

[BibT_eX]

[DOI]

Proceedings of the 4th USENIX Workshop on Hot Topics in Storage and File Systems, 2012

How to Allocate Tasks Asynchronously.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Optimal Cache-Oblivious Mesh Layouts.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Guest Editorial: Parallelism in Algorithms and Architectures.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

The snowblower problem.

[BibT_eX]

[DOI]

Valentin Polishchuk

Comput. Geom., 2011

The Cost of Cache-Oblivious Searching.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Alejandro López-Ortiz

Algorithmica, 2011

Don't Thrash: How to Cache Your Hash on Flash.

[BibT_eX]

[DOI]

Proceedings of the 3rd USENIX Workshop on Hot Topics in Storage and File Systems, 2011

Mutual Exclusion with O(log^2 Log n) Amortized Work.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Guest editorial - Special issue "New challenges in scheduling theory" (Marseilles Workshop, May 12-16, 2008).

[BibT_eX]

[DOI]

J. Sched., 2010

Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Rolf Fagerberg

Riko Jacob

Elias Vicari

Theory Comput. Syst., 2010

Performance guarantees for B-trees with different-sized atomic keys.

[BibT_eX]

[DOI]

Haodong Hu

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009

The Worst Page-Replacement Policy.

[BibT_eX]

[DOI]

Kunal Agrawal

Jeremy T. Fineman

Theory Comput. Syst., 2009

From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

A new approach to incremental topological ordering.

[BibT_eX]

[DOI]

Jeremy T. Fineman

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Maintaining Arrays of Contiguous Objects.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008

Scheduling algorithms for procrastinators.

[BibT_eX]

[DOI]

Raphaël Clifford

Kostas Tsichlas

J. Sched., 2008

Guest editorial.

[BibT_eX]

[DOI]

J. Sched., 2008

Improved bounds on sorting by length-weighted reversals.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.

[BibT_eX]

[DOI]

Algorithmica, 2008

2007

An adaptive packed-memory array.

[BibT_eX]

[DOI]

Haodong Hu

ACM Trans. Database Syst., 2007

Introduction to SODA 2002 and 2003 special issue.

[BibT_eX]

[DOI]

Harold N. Gabow

ACM Trans. Algorithms, 2007

An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms.

[BibT_eX]

[DOI]

Lars Arge

Bryan Holland-Minkley

J. Ian Munro

SIAM J. Comput., 2007

Sum-of-squares heuristics for bin packing and memory allocation.

[BibT_eX]

[DOI]

Krishnan Pillaipakkamnatt

Bryan Bradley

Geetha Jagannathan

ACM J. Exp. Algorithmics, 2007

Scheduling DAGs on asynchronous processors.

[BibT_eX]

[DOI]

Cynthia A. Phillips

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Cache-oblivious streaming B-trees.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

2006

Insertion Sort is O(n log n).

[BibT_eX]

[DOI]

Miguel A. Mosteiro

Theory Comput. Syst., 2006

The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots.

[BibT_eX]

[DOI]

Sándor P. Fekete

Martin Skutella

Algorithmica, 2006

Cache-oblivious string B-trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Topic 3: Scheduling and Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

Contention Resolution with Heterogeneous Job Sizes.

[BibT_eX]

[DOI]

Jeremy T. Fineman

Proceedings of the Algorithms, 2006

2005

Cache-Oblivious B-Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Optimal Covering Tours with Turn Costs.

[BibT_eX]

[DOI]

Saurabh Sethia

SIAM J. Comput., 2005

Lowest common ancestors in trees and directed acyclic graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler.

[BibT_eX]

[DOI]

Distributed Comput., 2005

Communication-Aware Processor Allocation for Supercomputers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Adversarial contention resolution for simple channels.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Concurrent cache-oblivious b-trees.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Topic 3 Scheduling and Load-Balancing.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

2004

Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem.

[BibT_eX]

[DOI]

Marcelo O. Sztainberg

IEEE Trans. Robotics, 2004

The Level Ancestor Problem simplified.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Approximation Algorithms for Average Stretch Scheduling.

[BibT_eX]

[DOI]

S. Muthukrishnan

Rajmohan Rajaraman

J. Sched., 2004

Data structures for maintaining set partitions.

[BibT_eX]

[DOI]

Saurabh Sethia

Steven Skiena

Random Struct. Algorithms, 2004

A locality-preserving cache-oblivious dynamic dictionary.

[BibT_eX]

[DOI]

J. Algorithms, 2004

When can you fold a map?

[BibT_eX]

[DOI]

Saurabh Sethia

Steven Skiena

Comput. Geom., 2004

On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Improved bounds on sorting with length-weighted reversals.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Adversarial Analyses of Window Backoff Strategies.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004

Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

The Robustness of the Sum-of-Squares Algorithm for Bin Packing.

[BibT_eX]

Krishnan Pillaipakkamnatt

Bryan Bradley

Geetha Jagannathan

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

The Lazy Bureaucrat scheduling problem.

[BibT_eX]

[DOI]

Steven Skiena

Inf. Comput., 2003

Improved approximation algorithms for the freeze-tag problem.

[BibT_eX]

[DOI]

Dongdong Ge

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Online dispersion algorithms for swarms of robots.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

Testing properties of directed graphs: acyclicity and connectivity.

[BibT_eX]

[DOI]

Dana Ron

Random Struct. Algorithms, 2002

Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk.

[BibT_eX]

[DOI]

Michael O. Rabin

Theory Comput. Syst., 2002

The Power of a Pebble: Exploring and Mapping Directed Graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2002

Efficient Tree Layout in a Multilevel Memory Hierarchy

[BibT_eX]

[DOI]

CoRR, 2002

New Algorithms for Disk Scheduling.

[BibT_eX]

[DOI]

Matthew Andrews

Lisa Zhang

Algorithmica, 2002

Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics V, 2002

Analysis of Heuristics for the Freeze-Tag Problem.

[BibT_eX]

[DOI]

Marcelo O. Sztainberg

Proceedings of the Algorithm Theory, 2002

Cache-oblivious priority queue and graph algorithm applications.

[BibT_eX]

[DOI]

Lars Arge

Bryan Holland-Minkley

J. Ian Munro

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Improved algorithms for stretch scheduling.

[BibT_eX]

[DOI]

S. Muthukrishnan

Rajmohan Rajaraman

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

The freeze-tag problem: how to wake up a swarm of robots.

[BibT_eX]

[DOI]

Sándor P. Fekete

Martin Skutella

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Exponential Structures for Efficient Cache-Oblivious Algorithms.

[BibT_eX]

[DOI]

Richard Cole

Rajeev Raman

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Efficient Tree Layout in a Multilevel Memory Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Two Simplified Algorithms for Maintaining Order in a List.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.

[BibT_eX]

[DOI]

Cynthia A. Phillips

Steven S. Seiden

Proceedings of the 2002 IEEE International Conference on Cluster Computing (CLUSTER 2002), 2002

2001

An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.

[BibT_eX]

[DOI]

Chandra Chekuri

J. Algorithms, 2001

Finding least common ancestors in directed acyclic graphs.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Performance guarantees for the TSP with a parameterized triangle inequality.

[BibT_eX]

[DOI]

Chandra Chekuri

Inf. Process. Lett., 2000

CEASAR: a smooth, accurate and robust centerline extraction algorithm.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE Visualization Conference, 2000

Scheduling Cilk multithreaded parallel programs on processors of different speeds.

[BibT_eX]

[DOI]

Michael O. Rabin

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

TEASAR: Tree-Structure Extraction Algorithm for Accurate and Robust Skeletons.

[BibT_eX]

[DOI]

Proceedings of the 8th Pacific Conference on Computer Graphics and Applications, 2000

The LCA Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Testing Acyclicity of Directed Graphs in Sublinear Time.

[BibT_eX]

[DOI]

Dana Ron

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

A functional framework for efficient web-based scientific visualization systems.

[BibT_eX]

PhD thesis, 2000

1998

Flow and Stretch Metrics for Scheduling Continuous Job Streams.

[BibT_eX]

[DOI]

Soumen Chakrabarti

S. Muthukrishnan

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems.

[BibT_eX]

[DOI]

Lisa Zhang

Inf. Comput., 1997

1996

Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Fault Tolerant Data Structures.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

New Algorithms for the Disk Scheduling Problem.

[BibT_eX]

[DOI]

Matthew Andrews

Lisa Zhang

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Parallel Interval Order Recognition and Construction of Interval Representations.

[BibT_eX]

[DOI]

Michel Gastaldo

Michel Morvan

Theor. Comput. Sci., 1995

1994

The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs

[BibT_eX]

[DOI]