Generating plausible diagnostic hypotheses with self-processing causal networks. - Jonathan Wald; Martin Farach; Malle A. Tagamets; James A. Reggia (J. Exp. Theor. Artif. Intell., 1989)

Adaptive Dictionary Matching - Amihood Amir; Martin Farach (FOCS, 1991)

Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. - Amihood Amir; Martin Farach (SODA, 1991)

Efficient matching of nonrectangular shapes. - Amihood Amir; Martin Farach (Ann. Math. Artif. Intell., 1991)

Optimal Superprimitivity Testing for Strings. - Alberto Apostolico; Martin Farach; Costas S. Iliopoulos (Inf. Process. Lett., 1991)

Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). - Amihood Amir; Martin Farach; Yossi Matias (CPM, 1992)

Alphabet Independent Two Dimensional Matching - Amihood Amir; Gary Benson; Martin Farach (STOC, 1992)

Two-Dimensional Dictionary Matching. - Amihood Amir; Martin Farach (Inf. Process. Lett., 1992)

Optimal Parallel Two Dimensional Pattern Matching. - Amihood Amir; Gary Benson; Martin Farach (SPAA, 1993)

Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) - Martin Farach; Mikkel Thorup (FOCS, 1994)

An Efficient Algorithm for Dynamic Text Indexing. - Ming Gu 002; Martin Farach; Richard Beigel (SODA, 1994)

Alphabet Dependence in Parameterized Matching. - Amihood Amir; Martin Farach; S. Muthukrishnan 001 (Inf. Process. Lett., 1994)

Dynamic Dictionary Matching. - Amihood Amir; Martin Farach; Zvi Galil; Raffaele Giancarlo; Kunsoo Park (J. Comput. Syst. Sci., 1994)

An Alphabet Independent Approach to Two-Dimensional Pattern Matching. - Amihood Amir; Gary Benson; Martin Farach (SIAM J. Comput., 1994)

Computing the Agreement of Trees with Bounded Degrees. - Martin Farach; Teresa M. Przytycka; Mikkel Thorup (ESA, 1995)

On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence. - Martin Farach; Michiel O. Noordewier; Serap A. Savari; Larry A. Shepp; Aaron D. Wyner; Jacob Ziv (SODA, 1995)

Optimal Parallel Dictionary Matching and Compression (Extended Abstract). - Martin Farach; S. Muthukrishnan 001 (SPAA, 1995)

A Robust Model for Finding Optimal Evolutionary Trees. - Martin Farach; Sampath Kannan; Tandy J. Warnow (Algorithmica, 1995)

Fast Comparison of Evolutionary Trees. - Martin Farach; Mikkel Thorup (Inf. Comput., 1995)

On the Agreement of Many Trees. - Martin Farach; Teresa M. Przytycka; Mikkel Thorup (Inf. Process. Lett., 1995)

Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures - Amihood Amir; Martin Farach (Inf. Comput., 1995)

Improved Dynamic Dictionary Matching - Amihood Amir; Martin Farach; Ramana M. Idury; Johannes A. La Poutré; Alejandro A. Schäffer (Inf. Comput., 1995)

Perfect Hashing for Strings: Formalization and Algorithms. - Martin Farach; S. Muthukrishnan 001 (CPM, 1996)

The Structure of Circular Decomposable Metrics. - George Christopher; Martin Farach; Michael A. Trick (ESA, 1996)

Optimal Logarithmic Time Randomized Suffix Tree Construction. - Martin Farach; S. Muthukrishnan 001 (ICALP, 1996)

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). - Richa Agarwala; Vineet Bafna; Martin Farach; Babu O. Narayanan; Mike Paterson; Mikkel Thorup (SODA, 1996)

Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. - Amihood Amir; Gary Benson; Martin Farach (J. Comput. Syst. Sci., 1996)

Two dimensional matching. - Amihood Amir; Martin Farach (Pattern Matching Algorithms, 1997)

Nearly Tight Bounds on the Learnability of Evolution. - Andris Ambainis; Richard Desper; Martin Farach; Sampath Kannan (FOCS, 1997)

Optimal Suffix Tree Construction with Large Alphabets. - Martin Farach (FOCS, 1997)

DNA Strand Separation Prediction: A Parallel Implementation. - Gabriela Hristescu; Craig J. Benham; Martin Farach (PDPTA, 1997)

Numerical taxonomy on data (abstract): experimental results. - Jaime Cohen; Martin Farach (RECOMB, 1997)

Group testing problems with sequences in experimental molecular biology. - Martin Farach; Sampath Kannan; E. Knill; S. Muthukrishnan 001 (SEQUENCES, 1997)

Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. - Richa Agarwala; Serafim Batzoglou; Vlado Dancík; Scott E. Decatur; Martin Farach; Sridhar Hannenhalli; Steven Skiena (SODA, 1997)

Optimal Parallel Randomized Renaming. - Martin Farach; S. Muthukrishnan 001 (Inf. Process. Lett., 1997)

Optimal Two-Dimensional Compressed Matching. - Amihood Amir; Gary Benson; Martin Farach (J. Algorithms, 1997)

Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. - Richa Agarwala; Serafim Batzoglou; Vlado Dancík; Scott E. Decatur; Sridhar Hannenhalli; Martin Farach; S. Muthukrishnan 001; Steven Skiena (J. Comput. Biol., 1997)

Numerical Taxonomy on Data: Experimental Results. - Jaime Cohen; Martin Farach (J. Comput. Biol., 1997)

Recognizing Circular Decompossible Metrics. - Martin Farach (J. Comput. Biol., 1997)

Sparse Dynamic Programming for Evolutionary-Tree Comparison. - Martin Farach; Mikkel Thorup (SIAM J. Comput., 1997)

Overcoming the Memory Bottleneck in Suffix Tree Construction. - Martin Farach; Paolo Ferragina; S. Muthukrishnan 001 (FOCS, 1998)

String Matching in Lempel-Ziv Compressed Strings. - Martin Farach; Mikkel Thorup (Algorithmica, 1998)

Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. - Amihood Amir; Gary Benson; Martin Farach (Inf. Comput., 1998)

Evaluation of Algorithms for Local Register Allocation. - Vincenzo Liberatore; Martin Farach-Colton; Ulrich Kremer (CC, 1999)

Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. - Martin Farach-Colton; Piotr Indyk (FOCS, 1999)

Efficient Algorithms for Inverting Evolution. - Martin Farach; Sampath Kannan (J. ACM, 1999)

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). - Richa Agarwala; Vineet Bafna; Martin Farach; Mike Paterson; Mikkel Thorup (SIAM J. Comput., 1999)

COFE: A Scalable Method for Feature Extraction from Complex Objects. - Gabriela Hristescu; Martin Farach-Colton (DaWaK, 2000)

The LCA Problem Revisited. - Michael A. Bender; Martin Farach-Colton (LATIN, 2000)

Notung: dating gene duplications using gene family trees. - Kevin C. Chen; Dannie Durand; Martin Farach-Colton (RECOMB, 2000)

On the sorting-complexity of suffix tree construction. - Martin Farach-Colton; Paolo Ferragina; S. Muthukrishnan 001 (J. ACM, 2000)

On Local Register Allocation. - Martin Farach-Colton; Vincenzo Liberatore (J. Algorithms, 2000)

NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees. - Kevin C. Chen; Dannie Durand; Martin Farach-Colton (J. Comput. Biol., 2000)

An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. - Richard Cole 001; Martin Farach-Colton; Ramesh Hariharan; Teresa M. Przytycka; Mikkel Thorup (SIAM J. Comput., 2000)

On the midpath tree conjuncture: a counter-example. - Rahul Shah 001; Martin Farach-Colton (SODA, 2001)

Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. - Michael A. Bender; Richard Cole 001; Erik D. Demaine; Martin Farach-Colton (ESA, 2002)

Two Simplified Algorithms for Maintaining Order in a List. - Michael A. Bender; Richard Cole 001; Erik D. Demaine; Martin Farach-Colton; Jack Zito (ESA, 2002)

Efficient Tree Layout in a Multilevel Memory Hierarchy. - Michael A. Bender; Erik D. Demaine; Martin Farach-Colton (ESA, 2002)

Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. - Rahul Shah 001; Martin Farach-Colton (SODA, 2002)

Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. - Yair Bartal; Martin Farach-Colton; Shibu Yooseph; Lisa Zhang (Algorithmica, 2002)

Efficient Tree Layout in a Multilevel Memory Hierarchy - Stephen Alstrup; Michael A. Bender; Erik D. Demaine; Martin Farach-Colton; J. Ian Munro; Theis Rauhe; Mikkel Thorup (CoRR, 2002)

Adventures at Google. - Martin Farach-Colton (ENC, 2003)

Barnacle: An Assembly Algorithm for Clone-based Sequences of Whole Genomes - Vicky Choi; Martin Farach-Colton (CoRR, 2003)

Randomization, Persuasiveness and Rigor in Proofs. - Catherine Womach; Martin Farach (Synth., 2003)

Adversarial Analyses of Window Backoff Strategies. - Michael A. Bender; Martin Farach-Colton; Simai He; Bradley C. Kuszmaul; Charles E. Leiserson (IPDPS Next Generation Software Program - NSFNGS - PI Workshop, 2004)

Discovering temporal relations in molecular pathways using protein-protein interactions. - Martin Farach-Colton; Yang Huang; John L. L. Woolford (RECOMB, 2004)

The Level Ancestor Problem simplified. - Michael A. Bender; Martin Farach-Colton (Theor. Comput. Sci., 2004)

Finding frequent items in data streams. - Moses Charikar; Kevin C. Chen; Martin Farach-Colton (Theor. Comput. Sci., 2004)

Adversarial contention resolution for simple channels. - Michael A. Bender; Martin Farach-Colton; Simai He; Bradley C. Kuszmaul; Charles E. Leiserson (SPAA, 2005)

Lowest common ancestors in trees and directed acyclic graphs. - Michael A. Bender; Martin Farach-Colton; Giridhar Pemmasani; Steven Skiena; Pavel Sumazin (J. Algorithms, 2005)

Cache-Oblivious B-Trees. - Michael A. Bender; Erik D. Demaine; Martin Farach-Colton (SIAM J. Comput., 2005)

Lower Bounds for Clear Transmissions in Radio Networks. - Martin Farach-Colton; Rohan J. Fernandes; Miguel A. Mosteiro (LATIN, 2006)

Cache-oblivious string B-trees. - Michael A. Bender; Martin Farach-Colton; Bradley C. Kuszmaul (PODS, 2006)

On the Complexity of Ordinal Clustering. - Rahul Shah 001; Martin Farach-Colton (J. Classif., 2006)

Insertion Sort is O(n log n). - Michael A. Bender; Martin Farach-Colton; Miguel A. Mosteiro (Theory Comput. Syst., 2006)

Sensor Network Gossiping or How to Break the Broadcast Lower Bound. - Martin Farach-Colton; Miguel A. Mosteiro (ISAAC, 2007)

Lattice based Clustering of Temporal Gene-Expression Matrices. - Yang Huang; Martin Farach-Colton (SDM, 2007)

Cache-oblivious streaming B-trees. - Michael A. Bender; Martin Farach-Colton; Jeremy T. Fineman; Yonatan R. Fogel; Bradley C. Kuszmaul; Jelani Nelson (SPAA, 2007)

Optimal spaced seeds for faster approximate string matching. - Martin Farach-Colton; Gad M. Landau; Süleyman Cenk Sahinalp; Dekel Tsur (J. Comput. Syst. Sci., 2007)

Introduction to SODA 2002 and 2003 special issue. - Harold N. Gabow; Michael A. Bender; Martin Farach-Colton (ACM Trans. Algorithms, 2007)

Preface. - Mary Cryan; Martin Farach-Colton (Theor. Comput. Sci., 2007)

A Linear Delay Algorithm for Building Concept Lattices. - Martin Farach-Colton; Yang Huang (CPM, 2008)

Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. - Noga Alon; Mihai Badoiu; Erik D. Demaine; Martin Farach-Colton; Mohammad Taghi Hajiaghayi; Anastasios Sidiropoulos (ACM Trans. Algorithms, 2008)

Fast and compact regular expression matching. - Philip Bille; Martin Farach-Colton (Theor. Comput. Sci., 2008)

Efficient and Robust Prediction Algorithms for Protein Complexes Using Gomory-Hu Trees. - Antonina Mitrofanova; Martin Farach-Colton; Bud Mishra (Pacific Symposium on Biocomputing, 2009)

Bootstrapping a hop-optimal network in the weak sensor model. - Martin Farach-Colton; Rohan J. Fernandes; Miguel A. Mosteiro (ACM Trans. Algorithms, 2009)

Don't Thrash: How to Cache Your Hash on Flash. - Michael A. Bender; Martin Farach-Colton; Rob Johnson 001; Bradley C. Kuszmaul; Dzejla Medjedovic; Pablo Montes; Pradeep Shetty; Richard P. Spillane; Erez Zadok (HotStorage, 2011)

Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. - Martin Farach-Colton; Antonio Fernández Anta; Alessia Milani; Miguel A. Mosteiro; Shmuel Zaks (DISC, 2011)

The TokuFS Streaming File System. - John Esmet; Michael A. Bender; Martin Farach-Colton; Bradley C. Kuszmaul (HotStorage, 2012)

Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. - Martin Farach-Colton; Antonio Fernández Anta; Alessia Milani; Miguel A. Mosteiro; Shmuel Zaks (LATIN, 2012)

Don't Thrash: How to Cache Your Hash on Flash. - Michael A. Bender; Martin Farach-Colton; Rob Johnson 001; Russell Kraner; Bradley C. Kuszmaul; Dzejla Medjedovic; Pablo Montes; Pradeep Shetty; Richard P. Spillane; Erez Zadok (Proc. VLDB Endow., 2012)

Forty Years of Text Indexing. - Alberto Apostolico; Maxime Crochemore; Martin Farach-Colton; Zvi Galil; S. Muthukrishnan 001 (CPM, 2013)

Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound). - Martin Farach-Colton; Antonio Fernández Anta; Miguel A. Mosteiro (Theor. Comput. Sci., 2013)

The Batched Predecessor Problem in External Memory. - Michael A. Bender; Martin Farach-Colton; Mayank Goswami 001; Dzejla Medjedovic; Pablo Montes; Meng-Tsung Tsai (ESA, 2014)

Computing the Degeneracy of Large Graphs. - Martin Farach-Colton; Meng-Tsung Tsai (LATIN, 2014)

BetrFS: A Right-Optimized Write-Optimized File System. - William Jannen; Jun Yuan 006; Yang Zhan 001; Amogh Akshintala; John Esmet; Yizheng Jiao; Ankur Mittal; Prashant Pandey 001; Phaneendra Reddy; Leif Walsh; Michael A. Bender; Martin Farach-Colton; et al. (FAST, 2015)

On the Complexity of Computing Prime Tables. - Martin Farach-Colton; Meng-Tsung Tsai (ISAAC, 2015)

Cost-Oblivious Reallocation for Scheduling and Planning. - Michael A. Bender; Martin Farach-Colton; Sándor P. Fekete; Jeremy T. Fineman; Seth Gilbert (SPAA, 2015)

Finding Articulation Points of Large Graphs in Linear Time. - Martin Farach-Colton; Tsan-sheng Hsu; Meng Li; Meng-Tsung Tsai (WADS, 2015)

Reallocation Problems in Scheduling. - Michael A. Bender; Martin Farach-Colton; Sándor P. Fekete; Jeremy T. Fineman; Seth Gilbert (Algorithmica, 2015)

Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. - Martin Farach-Colton; Miguel A. Mosteiro (Algorithmica, 2015)

Exact Sublinear Binomial Sampling. - Martin Farach-Colton; Meng-Tsung Tsai (Algorithmica, 2015)

BetrFS: Write-Optimization in a Kernel File System. - William Jannen; Jun Yuan 006; Yang Zhan 001; Amogh Akshintala; John Esmet; Yizheng Jiao; Ankur Mittal; Prashant Pandey 001; Phaneendra Reddy; Leif Walsh; Michael A. Bender; Martin Farach-Colton; et al. (ACM Trans. Storage, 2015)

An Introduction to Bε-trees and Write-Optimization. - Michael A. Bender; Martin Farach-Colton; William Jannen; Rob Johnson 001; Bradley C. Kuszmaul; Donald E. Porter; Jun Yuan 006; Yang Zhan 001 (login Usenix Mag., 2015)

Lazy Analytics: Let Other Queries Do the Work For You. - William Jannen; Michael A. Bender; Martin Farach-Colton; Rob Johnson 001; Bradley C. Kuszmaul; Donald E. Porter (HotStorage, 2016)

The I/O Complexity of Computing Prime Tables. - Michael A. Bender; Rezaul Chowdhury; Alexander Conway 001; Martin Farach-Colton; Pramod Ganapathi; Rob Johnson 001; Samuel McCauley; Bertrand Simon 001; Shikha Singh 002 (LATIN, 2016)

Tight Approximations of Degeneracy in Large Graphs. - Martin Farach-Colton; Meng-Tsung Tsai (LATIN, 2016)

Parallel Lookups in String Indexes. - Anders Roy Christiansen; Martin Farach-Colton (SPIRE, 2016)

Optimizing Every Operation in a Write-optimized File System. - Jun Yuan 006; Yang Zhan 001; William Jannen; Prashant Pandey 001; Amogh Akshintala; Kanchan Chandnani; Pooja Deo; Zardosht Kasheff; Leif Walsh; Michael A. Bender; Martin Farach-Colton; Rob Johnson 001; et al. (USENIX ATC, 2016)

40 years of suffix trees. - Alberto Apostolico; Maxime Crochemore; Martin Farach-Colton; Zvi Galil; S. Muthukrishnan 001 (Commun. ACM, 2016)

Special issue in honor of the 60th birthday of Amihood Amir. - Gary Benson; Martin Farach-Colton; Moshe Lewenstein; Ely Porat (Theor. Comput. Sci., 2016)

Lowest Common Ancestors in Trees. - Martin Farach-Colton (Encyclopedia of Algorithms, 2016)

File Systems Fated for Senescence? Nonsense, Says Science! - Alexander Conway 001; Ainesh Bakshi; Yizheng Jiao; William Jannen; Yang Zhan 001; Jun Yuan 006; Michael A. Bender; Rob Johnson 001; Bradley C. Kuszmaul; Donald E. Porter; Martin Farach-Colton (FAST, 2017)

Write-Optimized Skip Lists. - Michael A. Bender; Martin Farach-Colton; Rob Johnson 001; Simon Mauras; Tyler Mayer; Cynthia A. Phillips; Helen Xu 001 (PODS, 2017)

Cross-Referenced Dictionaries and the Limits of Write Optimization. - Peyman Afshani; Michael A. Bender; Martin Farach-Colton; Jeremy T. Fineman; Mayank Goswami 001; Meng-Tsung Tsai (SODA, 2017)

Dictionaries Revisited. - Martin Farach-Colton (SEA, 2017)

Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution. - Paulo Sérgio Almeida; Carlos Baquero; Martin Farach-Colton; Paulo Jesus; Miguel A. Mosteiro (Distributed Comput., 2017)

Cost-Oblivious Storage Reallocation. - Michael A. Bender; Martin Farach-Colton; Sándor P. Fekete; Jeremy T. Fineman; Seth Gilbert (ACM Trans. Algorithms, 2017)

Writes Wrought Right, and Other Adventures in File System Optimization. - Jun Yuan 006; Yang Zhan 001; William Jannen; Prashant Pandey 001; Amogh Akshintala; Kanchan Chandnani; Pooja Deo; Zardosht Kasheff; Leif Walsh; Michael A. Bender; Martin Farach-Colton; Rob Johnson 001; et al. (ACM Trans. Storage, 2017)

How to Fragment Your File System. - Alex Conway 001; Ainesh Bakshi; Yizheng Jiao; Yang Zhan 001; Michael A. Bender; William Jannen; Rob Johnson 001; Bradley C. Kuszmaul; Donald E. Porter; Jun Yuan 006; Martin Farach-Colton (login Usenix Mag., 2017)

The Full Path to Full-Path Indexing. - Yang Zhan 001; Alexander Conway 001; Yizheng Jiao; Eric Knorr; Michael A. Bender; Martin Farach-Colton; William Jannen; Rob Johnson 001; Donald E. Porter; Jun Yuan 006 (FAST, 2018)

Bloom Filters, Adaptivity, and the Dictionary Problem. - Michael A. Bender; Martin Farach-Colton; Mayank Goswami 001; Rob Johnson 001; Samuel McCauley; Shikha Singh 002 (FOCS, 2018)

Mind the Gap (Invited Paper). - Martin Farach-Colton (FUN, 2018)

Optimal Hashing in External Memory. - Alexander Conway 001; Martin Farach-Colton; Philip Shilane (ICALP, 2018)

A Dynamic Hash Table for the GPU. - Saman Ashkiani; Martin Farach-Colton; John D. Owens (IPDPS, 2018)

GPU LSM: A Dynamic Dictionary Data Structure for the GPU. - Saman Ashkiani; Shengren Li; Martin Farach-Colton; Nina Amenta; John D. Owens (IPDPS, 2018)

Quotient Filters: Approximate Membership Queries on the GPU. - Afton Geil; Martin Farach-Colton; John D. Owens (IPDPS, 2018)

Streaming Algorithms for Planar Convex Hulls. - Martin Farach-Colton; Meng Li; Meng-Tsung Tsai (ISAAC, 2018)

Closure Operators and Spam Resistance for PageRank. - Lucas Farach-Colton; Martin Farach-Colton; Reut Levi; Moti Medina; Miguel A. Mosteiro (CoRR, 2018)

The Online Event-Detection Problem. - Michael A. Bender; Jonathan W. Berry; Martin Farach-Colton; Rob Johnson 001; Thomas M. Kroeger; Prashant Pandey 001; Cynthia A. Phillips; Shikha Singh 002 (CoRR, 2018)

Efficient Directory Mutations in a Full-Path-Indexed File System. - Yang Zhan 001; Yizheng Jiao; Donald E. Porter; Alex Conway 001; Eric Knorr; Martin Farach-Colton; Michael A. Bender; Jun Yuan 006; William Jannen; Rob Johnson 001 (ACM Trans. Storage, 2018)

Syntactic Separation of Subset Satisfiability Problems. - Eric Allender; Martin Farach-Colton; Meng-Tsung Tsai (APPROX-RANDOM, 2019)

Filesystem Aging: It's more Usage than Fullness. - Alex Conway 001; Eric Knorr; Yizheng Jiao; Michael A. Bender; William Jannen; Rob Johnson 001; Donald E. Porter; Martin Farach-Colton (HotStorage, 2019)

Engineering a high-performance GPU B-Tree. - Muhammad A. Awad; Saman Ashkiani; Rob Johnson 001; Martin Farach-Colton; John D. Owens (PPoPP, 2019)

Optimal Ball Recycling. - Michael A. Bender; Jake Christensen; Alex Conway 001; Martin Farach-Colton; Rob Johnson 001; Meng-Tsung Tsai (SODA, 2019)

Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Jannen; Yizheng Jiao; Rob Johnson 001; Eric Knorr; Sara McAllister; Nirjhar Mukherjee; Prashant Pandey 001; Donald E. Porter; Jun Yuan 006; et al. (SPAA, 2019)

Achieving optimal backlog in multi-processor cup games. - Michael A. Bender; Martin Farach-Colton; William Kuszmaul (STOC, 2019)

Theoretical Foundations of Storage Systems (Dagstuhl Seminar 19111). - Martin Farach-Colton; Inge Li Gørtz; Rob Johnson 001; Donald E. Porter (Dagstuhl Reports, 2019)

How to Copy Files. - Yang Zhan 001; Alexander Conway 001; Yizheng Jiao; Nirjhar Mukherjee; Ian Groombridge; Michael A. Bender; Martin Farach-Colton; William Jannen; Rob Johnson 001; Donald E. Porter; Jun Yuan 006 (FAST, 2020)

Flushing Without Cascades. - Michael A. Bender; Rathish Das; Martin Farach-Colton; Rob Johnson 001; William Kuszmaul (SODA, 2020)

Streaming Complexity of Spanning Tree Computation. - Yi-Jun Chang; Martin Farach-Colton; Tsan-sheng Hsu; Meng-Tsung Tsai (STACS, 2020)

SplinterDB: Closing the Bandwidth Gap for NVMe Key-Value Stores. - Alexander Conway 001; Abhishek Gupta; Vijay Chidambaram; Martin Farach-Colton; Richard P. Spillane; Amy Tai; Rob Johnson 001 (USENIX ATC, 2020)

How to Not Copy Files. - Yang Zhan 001; Alex Conway 001; Nirjhar Mukherjee; Ian Groombridge; Martin Farach-Colton; Rob Johnson 001; Yizheng Jiao; Michael A. Bender; William Jannen; Donald E. Porter; Jun Yuan 006 (login Usenix Mag., 2020)

Mitigating False Positives in Filters: to Adapt or to Cache? - Michael A. Bender; Rathish Das; Martin Farach-Colton; Tianchi Mo; David Tench; Yung Ping Wang (APOCS, 2021)

Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design. - Prashant Pandey 001; Alex Conway 001; Joe Durie; Michael A. Bender; Martin Farach-Colton; Rob Johnson 001 (SIGMOD Conference, 2021)

Paging and the Address-Translation Problem. - Michael A. Bender; Abhishek Bhattacharjee; Alex Conway 001; Martin Farach-Colton; Rob Johnson 001; Sudarsun Kannan; William Kuszmaul; Nirjhar Mukherjee; Donald E. Porter; Guido Tagliavini; Janet Vorobyeva; Evan West (SPAA, 2021)

Better GPU Hash Tables. - Muhammad A. Awad; Saman Ashkiani; Serban D. Porumbescu; Martin Farach-Colton; John D. Owens (CoRR, 2021)

All-Purpose Hashing. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini (CoRR, 2021)

Dynamic Windows Scheduling with Reallocation. - Martin Farach-Colton; Katia Leal; Miguel A. Mosteiro; Christopher Thraves Caro (ACM J. Exp. Algorithmics, 2021)

Timely Reporting of Heavy Hitters Using External Memory. - Shikha Singh 002; Prashant Pandey 001; Michael A. Bender; Jonathan W. Berry; Martin Farach-Colton; Rob Johnson 001; Thomas M. Kroeger; Cynthia A. Phillips (ACM Trans. Database Syst., 2021)

External-memory Dictionaries in the Affine and PDAM Models. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Jannen; Yizheng Jiao; Rob Johnson 001; Eric Knorr; Sara McAllister; Nirjhar Mukherjee; Prashant Pandey 001; Donald E. Porter; Jun Yuan 006; et al. (ACM Trans. Parallel Comput., 2021)

Copy-on-Abundant-Write for Nimble File System Clones. - Yang Zhan 001; Alex Conway 001; Yizheng Jiao; Nirjhar Mukherjee; Ian Groombridge; Michael A. Bender; Martin Farach-Colton; William Jannen; Rob Johnson 001; Donald E. Porter; Jun Yuan 006 (ACM Trans. Storage, 2021)

BetrFS: a compleat file system for commodity SSDs. - Yizheng Jiao; Simon Bertron; Sagar Patel; Luke Zeller; Rory Bennett; Nirjhar Mukherjee; Michael A. Bender; Michael Condict; Alex Conway 001; Martin Farach-Colton; Xiongzi Ge; William Jannen; et al. (EuroSys, 2022)

Online List Labeling: Breaking the log2n Barrier. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; Hanna Komlós; William Kuszmaul; Nicole Wein (FOCS, 2022)

What Does Dynamic Optimality Mean in External Memory? - Michael A. Bender; Martin Farach-Colton; William Kuszmaul (ITCS, 2022)

GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. - David Tench; Evan West; Victor Zhang; Michael A. Bender; Abiyaz Chowdhury; J. Ahmed Dellas; Martin Farach-Colton; Tyler Seip; Kenny Zhang (SIGMOD Conference, 2022)

On the optimal time/space tradeoff for hash tables. - Michael A. Bender; Martin Farach-Colton; John Kuszmaul; William Kuszmaul; Mingmou Liu (STOC, 2022)

Using advanced data structures to enable responsive security monitoring. - Janet Vorobyeva; Daniel R. Delayo; Michael A. Bender; Martin Farach-Colton; Prashant Pandey 001; Cynthia A. Phillips; Shikha Singh 002; Eric D. Thomas; Thomas M. Kroeger (Clust. Comput., 2022)

IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity. - Prashant Pandey 001; Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini; Rob Johnson 001 (CoRR, 2022)

Analyzing and Implementing GPU Hash Tables. - Muhammad A. Awad; Saman Ashkiani; Serban D. Porumbescu; Martin Farach-Colton; John D. Owens (APOCS, 2023)

Optimal Uncoordinated Unique IDs. - Peter C. Dillinger; Martin Farach-Colton; Guido Tagliavini; Stefan Walzer (PODS, 2023)

Graph Ranking and the Cost of Sybil Defense. - Gwendolyn Farach-Colton; Martin Farach-Colton; Leslie Ann Goldberg; Hanna Komlós; John Lapinskas; Reut Levi; Moti Medina; Miguel A. Mosteiro (EC, 2023)

Tight Bounds for Monotone Minimal Perfect Hashing. - Sepehr Assadi; Martin Farach-Colton; William Kuszmaul (SODA, 2023)

Tiny Pointers. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini (SODA, 2023)

An Associativity Threshold Phenomenon in Set-Associative Caches. - Michael A. Bender; Rathish Das; Martin Farach-Colton; Guido Tagliavini (SPAA, 2023)

IcebergHT: High Performance Hash Tables Through Stability and Low Associativity. - Prashant Pandey 001; Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini; Rob Johnson 001 (Proc. ACM Manag. Data, 2023)

SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy. - Alex Conway 001; Martin Farach-Colton; Rob Johnson 001 (Proc. ACM Manag. Data, 2023)

Mosaic Pages: Big TLB Reach with Small Pages. - Krishnan Gosakan; Jaehyun Han; William Kuszmaul; Ibrahim N. Mubarek; Nirjhar Mukherjee; Karthik Sriram; Guido Tagliavini; Evan West; Michael A. Bender; Abhishek Bhattacharjee; Alex Conway 001; Martin Farach-Colton; et al. (Zenodo, 2023)

From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071). - Martin Farach-Colton; Fabian Daniel Kuhn; Ronitt Rubinfeld; Przemyslaw Uznanski (Dagstuhl Reports, 2023)

Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini (J. ACM, 2023)

Snake in Optimal Space and Time. - Philip Bille; Martín Farach-Colton; Inge Li Gørtz; Ivor van der Hoog (FUN, 2024)

History-Independent Concurrent Objects. - Hagit Attiya; Michael A. Bender; Martín Farach-Colton; Rotem Oshman; Noa Schiller (PODC, 2024)

Beyond Bloom: A Tutorial on Future Feature-Rich Filters. - Prashant Pandey 001; Martín Farach-Colton; Niv Dayan; Huanchen Zhang (SIGMOD Conference Companion, 2024)

Modern Hashing Made Simple. - Michael A. Bender; Martín Farach-Colton; John Kuszmaul; William Kuszmaul (SOSA, 2024)

A Nearly Quadratic Improvement for Memory Reallocation. - Martin Farach-Colton; William Kuszmaul; Nathan S. Sheffield; Alek Westover (SPAA, 2024)

File System Aging. - Alex Conway 001; Ainesh Bakshi; Arghya Bhattacharya; Rory Bennett; Yizheng Jiao; Eric Knorr; Yang Zhan 001; Michael A. Bender; William Jannen; Rob Johnson 001; Bradley C. Kuszmaul; Donald E. Porter; et al. (CoRR, 2024)

Nearly Optimal List Labeling. - Michael A. Bender; Alex Conway 001; Martín Farach-Colton; Hanna Komlós; Michal Koucký 001; William Kuszmaul; Michael E. Saks (CoRR, 2024)

Mosaic Pages: Big TLB Reach With Small Pages. - Jaehyun Han; Krishnan Gosakan; William Kuszmaul; Ibrahim N. Mubarek; Nirjhar Mukherjee; Karthik Sriram; Guido Tagliavini; Evan West; Michael A. Bender; Abhishek Bhattacharjee; Alex Conway 001; Martín Farach-Colton; et al. (IEEE Micro, 2024)

Layered List Labeling. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; Hanna Komlós; William Kuszmaul (Proc. ACM Manag. Data, 2024)

History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures. - Michael A. Bender; Martín Farach-Colton; Michael T. Goodrich; Hanna Komlós (Proc. ACM Manag. Data, 2024)

Adaptive Quotient Filters. - Richard Wen; Hunter McCoy; David Tench; Guido Tagliavini; Michael A. Bender; Alex Conway 001; Martin Farach-Colton; Rob Johnson 001; Prashant Pandey 001 (Proc. ACM Manag. Data, 2024)