default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Farach-Colton
Martín Farach-Colton – Martin Farach
Person information
- affiliation: New York University, NY, USA
- affiliation (former): Rutgers University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j67]Jaehyun Han
, Krishnan Gosakan, William Kuszmaul, Ibrahim N. Mubarek, Nirjhar Mukherjee, Karthik Sriram, Guido Tagliavini, Evan West, Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martín Farach-Colton, Jayneel Gandhi, Rob Johnson, Sudarsun Kannan, Donald E. Porter:
Mosaic Pages: Big TLB Reach With Small Pages. IEEE Micro 44(4): 52-59 (2024)- [j66]Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul:
Layered List Labeling. Proc. ACM Manag. Data 2(2): 101 (2024) - [j65]Michael A. Bender, Martín Farach-Colton, Michael T. Goodrich, Hanna Komlós:
History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures. Proc. ACM Manag. Data 2(2): 108 (2024) - 2023
- [j64]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once. J. ACM 70(6): 40:1-40:51 (2023) - [j63]Alex Conway, Martin Farach-Colton, Rob Johnson:
SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy. Proc. ACM Manag. Data 1(1): 46:1-46:27 (2023) - [j62]Prashant Pandey, Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson:
IcebergHT: High Performance Hash Tables Through Stability and Low Associativity. Proc. ACM Manag. Data 1(1): 47:1-47:26 (2023) - 2022
- [j61]Janet Vorobyeva, Daniel R. Delayo, Michael A. Bender, Martin Farach-Colton, Prashant Pandey, Cynthia A. Phillips, Shikha Singh, Eric D. Thomas, Thomas M. Kroeger:
Using advanced data structures to enable responsive security monitoring. Clust. Comput. 25(4): 2893-2914 (2022) - 2021
- [j60]Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves Caro:
Dynamic Windows Scheduling with Reallocation. ACM J. Exp. Algorithmics 26: 1.11:1-1.11:19 (2021) - [j59]Shikha Singh, Prashant Pandey, Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Cynthia A. Phillips:
Timely Reporting of Heavy Hitters Using External Memory. ACM Trans. Database Syst. 46(4): 14:1-14:35 (2021) - [j58]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Jannen, Yizheng Jiao, Rob Johnson, Eric Knorr, Sara McAllister, Nirjhar Mukherjee, Prashant Pandey, Donald E. Porter, Jun Yuan, Yang Zhan:
External-memory Dictionaries in the Affine and PDAM Models. ACM Trans. Parallel Comput. 8(3): 15:1-15:20 (2021) - [j57]Yang Zhan, Alex Conway, Yizheng Jiao, Nirjhar Mukherjee, Ian Groombridge, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
Copy-on-Abundant-Write for Nimble File System Clones. ACM Trans. Storage 17(1): 5:1-5:27 (2021) - 2020
- [j56]Yang Zhan, Alex Conway, Nirjhar Mukherjee, Ian Groombridge, Martin Farach-Colton, Rob Johnson, Yizheng Jiao, Michael A. Bender, William Jannen, Donald E. Porter, Jun Yuan:
How to Not Copy Files. login Usenix Mag. 45(3) (2020) - 2018
- [j55]Yang Zhan, Yizheng Jiao, Donald E. Porter, Alex Conway, Eric Knorr, Martin Farach-Colton, Michael A. Bender, Jun Yuan, William Jannen, Rob Johnson:
Efficient Directory Mutations in a Full-Path-Indexed File System. ACM Trans. Storage 14(3): 22:1-22:27 (2018) - 2017
- [j54]Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro:
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution. Distributed Comput. 30(4): 281-291 (2017) - [j53]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Storage Reallocation. ACM Trans. Algorithms 13(3): 38:1-38:20 (2017) - [j52]Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
Writes Wrought Right, and Other Adventures in File System Optimization. ACM Trans. Storage 13(1): 3:1-3:26 (2017) - [j51]Alex Conway, Ainesh Bakshi, Yizheng Jiao, Yang Zhan, Michael A. Bender, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, Martin Farach-Colton:
How to Fragment Your File System. login Usenix Mag. 42(2) (2017) - 2016
- [j50]Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan:
40 years of suffix trees. Commun. ACM 59(4): 66-73 (2016) - [j49]Gary Benson, Martin Farach-Colton, Moshe Lewenstein, Ely Porat:
Special issue in honor of the 60th birthday of Amihood Amir. Theor. Comput. Sci. 638: 1-2 (2016) - 2015
- [j48]Martin Farach-Colton, Miguel A. Mosteiro:
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. Algorithmica 73(1): 87-114 (2015) - [j47]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. Algorithmica 73(2): 389-409 (2015) - [j46]Martin Farach-Colton, Meng-Tsung Tsai:
Exact Sublinear Binomial Sampling. Algorithmica 73(4): 637-651 (2015) - [j45]William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
BetrFS: Write-Optimization in a Kernel File System. ACM Trans. Storage 11(4): 18:1-18:29 (2015) - [j44]Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, Yang Zhan:
An Introduction to Bε-trees and Write-Optimization. login Usenix Mag. 40(5) (2015) - 2013
- [j43]Martin Farach-Colton, Antonio Fernández Anta, Miguel A. Mosteiro:
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound). Theor. Comput. Sci. 472: 60-80 (2013) - 2012
- [j42]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok:
Don't Thrash: How to Cache Your Hash on Flash. Proc. VLDB Endow. 5(11): 1627-1637 (2012) - 2009
- [j41]Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro:
Bootstrapping a hop-optimal network in the weak sensor model. ACM Trans. Algorithms 5(4): 37:1-37:30 (2009) - 2008
- [j40]Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos:
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. ACM Trans. Algorithms 4(4): 46:1-46:21 (2008) - [j39]Philip Bille, Martin Farach-Colton:
Fast and compact regular expression matching. Theor. Comput. Sci. 409(3): 486-496 (2008) - 2007
- [j38]Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur:
Optimal spaced seeds for faster approximate string matching. J. Comput. Syst. Sci. 73(7): 1035-1044 (2007) - [j37]Harold N. Gabow, Michael A. Bender, Martin Farach-Colton:
Introduction to SODA 2002 and 2003 special issue. ACM Trans. Algorithms 3(4): 36 (2007) - [j36]Mary Cryan, Martin Farach-Colton:
Preface. Theor. Comput. Sci. 382(2): 85 (2007) - 2006
- [j35]Rahul Shah, Martin Farach-Colton:
On the Complexity of Ordinal Clustering. J. Classif. 23(1): 79-102 (2006) - [j34]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
Insertion Sort is O(n log n). Theory Comput. Syst. 39(3): 391-397 (2006) - 2005
- [j33]Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin:
Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2): 75-94 (2005) - [j32]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Cache-Oblivious B-Trees. SIAM J. Comput. 35(2): 341-358 (2005) - 2004
- [j31]Moses Charikar, Kevin C. Chen, Martin Farach-Colton:
Finding frequent items in data streams. Theor. Comput. Sci. 312(1): 3-15 (2004) - [j30]Michael A. Bender, Martin Farach-Colton:
The Level Ancestor Problem simplified. Theor. Comput. Sci. 321(1): 5-12 (2004) - 2003
- [j29]Catherine Womach, Martin Farach:
Randomization, Persuasiveness and Rigor in Proofs. Synth. 134(1-2): 71-84 (2003) - 2002
- [j28]Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang:
Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. Algorithmica 33(3): 272-286 (2002) - 2000
- [j27]Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan:
On the sorting-complexity of suffix tree construction. J. ACM 47(6): 987-1011 (2000) - [j26]Martin Farach-Colton, Vincenzo Liberatore:
On Local Register Allocation. J. Algorithms 37(1): 37-65 (2000) - [j25]Kevin C. Chen, Dannie Durand, Martin Farach-Colton:
NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees. J. Comput. Biol. 7(3-4): 429-447 (2000) - [j24]Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup:
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM J. Comput. 30(5): 1385-1404 (2000) - 1999
- [j23]Martin Farach, Sampath Kannan:
Efficient Algorithms for Inverting Evolution. J. ACM 46(4): 437-449 (1999) - [j22]Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup:
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). SIAM J. Comput. 28(3): 1073-1085 (1999) - 1998
- [j21]Martin Farach, Mikkel Thorup:
String Matching in Lempel-Ziv Compressed Strings. Algorithmica 20(4): 388-404 (1998) - [j20]Amihood Amir, Gary Benson, Martin Farach:
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. Inf. Comput. 144(1): 1-17 (1998) - 1997
- [j19]Martin Farach, S. Muthukrishnan:
Optimal Parallel Randomized Renaming. Inf. Process. Lett. 61(1): 7-10 (1997) - [j18]Amihood Amir, Gary Benson, Martin Farach:
Optimal Two-Dimensional Compressed Matching. J. Algorithms 24(2): 354-379 (1997) - [j17]Martin Farach:
Recognizing Circular Decompossible Metrics. J. Comput. Biol. 4(2): 157-162 (1997) - [j16]Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Sridhar Hannenhalli, Martin Farach, S. Muthukrishnan, Steven Skiena:
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. J. Comput. Biol. 4(3): 275-296 (1997) - [j15]Jaime Cohen, Martin Farach:
Numerical Taxonomy on Data: Experimental Results. J. Comput. Biol. 4(4): 547-558 (1997) - [j14]Martin Farach, Mikkel Thorup:
Sparse Dynamic Programming for Evolutionary-Tree Comparison. SIAM J. Comput. 26(1): 210-230 (1997) - 1996
- [j13]Amihood Amir, Gary Benson, Martin Farach:
Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. J. Comput. Syst. Sci. 52(2): 299-307 (1996) - 1995
- [j12]Martin Farach, Sampath Kannan, Tandy J. Warnow:
A Robust Model for Finding Optimal Evolutionary Trees. Algorithmica 13(1/2): 155-179 (1995) - [j11]Amihood Amir, Martin Farach:
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures. Inf. Comput. 118(1): 1-11 (1995) - [j10]Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer:
Improved Dynamic Dictionary Matching. Inf. Comput. 119(2): 258-282 (1995) - [j9]Martin Farach, Mikkel Thorup:
Fast Comparison of Evolutionary Trees. Inf. Comput. 123(1): 29-37 (1995) - [j8]Martin Farach, Teresa M. Przytycka, Mikkel Thorup:
On the Agreement of Many Trees. Inf. Process. Lett. 55(6): 297-301 (1995) - 1994
- [j7]Amihood Amir, Martin Farach, S. Muthukrishnan:
Alphabet Dependence in Parameterized Matching. Inf. Process. Lett. 49(3): 111-115 (1994) - [j6]Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park:
Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49(2): 208-222 (1994) - [j5]Amihood Amir, Gary Benson, Martin Farach:
An Alphabet Independent Approach to Two-Dimensional Pattern Matching. SIAM J. Comput. 23(2): 313-323 (1994) - 1992
- [j4]Amihood Amir, Martin Farach:
Two-Dimensional Dictionary Matching. Inf. Process. Lett. 44(5): 233-239 (1992) - 1991
- [j3]Amihood Amir, Martin Farach:
Efficient matching of nonrectangular shapes. Ann. Math. Artif. Intell. 4: 211-224 (1991) - [j2]Alberto Apostolico, Martin Farach, Costas S. Iliopoulos:
Optimal Superprimitivity Testing for Strings. Inf. Process. Lett. 39(1): 17-20 (1991) - 1989
- [j1]Jonathan Wald, Martin Farach, Malle A. Tagamets, James A. Reggia:
Generating plausible diagnostic hypotheses with self-processing causal networks. J. Exp. Theor. Artif. Intell. 1(2): 91-112 (1989)
Conference and Workshop Papers
- 2024
- [c125]Philip Bille, Martín Farach-Colton, Inge Li Gørtz, Ivor van der Hoog:
Snake in Optimal Space and Time. FUN 2024: 3:1-3:15 - [c124]Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. PODC 2024: 14-24 - [c123]Prashant Pandey, Martín Farach-Colton, Niv Dayan, Huanchen Zhang:
Beyond Bloom: A Tutorial on Future Feature-Rich Filters. SIGMOD Conference Companion 2024: 636-644 - [c122]Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul:
Modern Hashing Made Simple. SOSA 2024: 363-373 - [c121]Martin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover:
A Nearly Quadratic Improvement for Memory Reallocation. SPAA 2024: 125-135 - 2023
- [c120]Muhammad A. Awad, Saman Ashkiani, Serban D. Porumbescu, Martin Farach-Colton, John D. Owens:
Analyzing and Implementing GPU Hash Tables. APOCS 2023: 33-50 - [c119]Krishnan Gosakan, Jaehyun Han, William Kuszmaul, Ibrahim N. Mubarek, Nirjhar Mukherjee, Karthik Sriram, Guido Tagliavini, Evan West, Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Jayneel Gandhi, Rob Johnson, Sudarsun Kannan, Donald E. Porter:
Mosaic Pages: Big TLB Reach with Small Pages. ASPLOS (3) 2023: 433-448 - [c118]Peter C. Dillinger, Martin Farach-Colton, Guido Tagliavini, Stefan Walzer:
Optimal Uncoordinated Unique IDs. PODS 2023: 221-230 - [c117]Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg, Hanna Komlós, John Lapinskas, Reut Levi, Moti Medina, Miguel A. Mosteiro:
Graph Ranking and the Cost of Sybil Defense. EC 2023: 586-625 - [c116]Sepehr Assadi, Martin Farach-Colton, William Kuszmaul:
Tight Bounds for Monotone Minimal Perfect Hashing. SODA 2023: 456-476 - [c115]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Tiny Pointers. SODA 2023: 477-508 - [c114]Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini:
An Associativity Threshold Phenomenon in Set-Associative Caches. SPAA 2023: 117-127 - 2022
- [c113]Yizheng Jiao, Simon Bertron, Sagar Patel, Luke Zeller, Rory Bennett, Nirjhar Mukherjee, Michael A. Bender, Michael Condict, Alex Conway, Martin Farach-Colton, Xiongzi Ge, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
BetrFS: a compleat file system for commodity SSDs. EuroSys 2022: 610-627 - [c112]Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. FOCS 2022: 980-990 - [c111]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
What Does Dynamic Optimality Mean in External Memory? ITCS 2022: 18:1-18:23 - [c110]David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, J. Ahmed Dellas, Martin Farach-Colton, Tyler Seip, Kenny Zhang:
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. SIGMOD Conference 2022: 325-339 - [c109]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the optimal time/space tradeoff for hash tables. STOC 2022: 1284-1297 - 2021
- [c108]Michael A. Bender, Rathish Das, Martin Farach-Colton, Tianchi Mo, David Tench, Yung Ping Wang:
Mitigating False Positives in Filters: to Adapt or to Cache? APOCS 2021: 16-24 - [c107]Prashant Pandey, Alex Conway, Joe Durie, Michael A. Bender, Martin Farach-Colton, Rob Johnson:
Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design. SIGMOD Conference 2021: 1386-1399 - [c106]Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Donald E. Porter, Guido Tagliavini, Janet Vorobyeva, Evan West:
Paging and the Address-Translation Problem. SPAA 2021: 105-117 - 2020
- [c105]Yang Zhan, Alexander Conway, Yizheng Jiao, Nirjhar Mukherjee, Ian Groombridge, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
How to Copy Files. FAST 2020: 75-89 - [c104]Prashant Pandey, Shikha Singh, Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Cynthia A. Phillips:
Timely Reporting of Heavy Hitters using External Memory. SIGMOD Conference 2020: 1431-1446 - [c103]Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul:
Flushing Without Cascades. SODA 2020: 650-669 - [c102]Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai:
Streaming Complexity of Spanning Tree Computation. STACS 2020: 34:1-34:19 - [c101]Alexander Conway, Abhishek Gupta, Vijay Chidambaram, Martin Farach-Colton, Richard P. Spillane, Amy Tai, Rob Johnson:
SplinterDB: Closing the Bandwidth Gap for NVMe Key-Value Stores. USENIX ATC 2020: 49-63 - 2019
- [c100]Eric Allender, Martin Farach-Colton, Meng-Tsung Tsai:
Syntactic Separation of Subset Satisfiability Problems. APPROX-RANDOM 2019: 16:1-16:23 - [c99]Alex Conway, Eric Knorr, Yizheng Jiao, Michael A. Bender, William Jannen, Rob Johnson, Donald E. Porter, Martin Farach-Colton:
Filesystem Aging: It's more Usage than Fullness. HotStorage 2019 - [c98]Muhammad A. Awad, Saman Ashkiani, Rob Johnson, Martin Farach-Colton, John D. Owens:
Engineering a high-performance GPU B-Tree. PPoPP 2019: 145-157 - [c97]Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai:
Optimal Ball Recycling. SODA 2019: 2527-2546 - [c96]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Jannen, Yizheng Jiao, Rob Johnson, Eric Knorr, Sara McAllister, Nirjhar Mukherjee, Prashant Pandey, Donald E. Porter, Jun Yuan, Yang Zhan:
Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design. SPAA 2019: 265-274 - [c95]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
Achieving optimal backlog in multi-processor cup games. STOC 2019: 1148-1157 - 2018
- [c94]Yang Zhan, Alexander Conway, Yizheng Jiao, Eric Knorr, Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Donald E. Porter, Jun Yuan:
The Full Path to Full-Path Indexing. FAST 2018: 123-138 - [c93]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. FOCS 2018: 182-193 - [c92]Martin Farach-Colton:
Mind the Gap (Invited Paper). FUN 2018: 1:1-1:1 - [c91]Alexander Conway, Martin Farach-Colton, Philip Shilane:
Optimal Hashing in External Memory. ICALP 2018: 39:1-39:14 - [c90]Saman Ashkiani, Martin Farach-Colton, John D. Owens:
A Dynamic Hash Table for the GPU. IPDPS 2018: 419-429 - [c89]Saman Ashkiani, Shengren Li, Martin Farach-Colton, Nina Amenta, John D. Owens:
GPU LSM: A Dynamic Dictionary Data Structure for the GPU. IPDPS 2018: 430-440 - [c88]Afton Geil, Martin Farach-Colton, John D. Owens:
Quotient Filters: Approximate Membership Queries on the GPU. IPDPS 2018: 451-462 - [c87]Martin Farach-Colton, Meng Li, Meng-Tsung Tsai:
Streaming Algorithms for Planar Convex Hulls. ISAAC 2018: 47:1-47:13 - 2017
- [c86]Alexander Conway, Ainesh Bakshi, Yizheng Jiao, William Jannen, Yang Zhan, Jun Yuan, Michael A. Bender, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Martin Farach-Colton:
File Systems Fated for Senescence? Nonsense, Says Science! FAST 2017: 45-58 - [c85]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Simon Mauras, Tyler Mayer, Cynthia A. Phillips, Helen Xu:
Write-Optimized Skip Lists. PODS 2017: 69-78 - [c84]Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai:
Cross-Referenced Dictionaries and the Limits of Write Optimization. SODA 2017: 1523-1532 - [c83]Martin Farach-Colton:
Dictionaries Revisited. SEA 2017: 2:1-2:1 - 2016
- [c82]Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
Optimizing Every Operation in a Write-optimized File System. FAST 2016: 1-14 - [c81]William Jannen, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
Lazy Analytics: Let Other Queries Do the Work For You. HotStorage 2016 - [c80]Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton, Pramod Ganapathi, Rob Johnson, Samuel McCauley, Bertrand Simon, Shikha Singh:
The I/O Complexity of Computing Prime Tables. LATIN 2016: 192-206 - [c79]Martin Farach-Colton, Meng-Tsung Tsai:
Tight Approximations of Degeneracy in Large Graphs. LATIN 2016: 429-440 - [c78]Anders Roy Christiansen, Martin Farach-Colton:
Parallel Lookups in String Indexes. SPIRE 2016: 61-67 - [c77]Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
Optimizing Every Operation in a Write-optimized File System. USENIX ATC 2016 - 2015
- [c76]William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter:
BetrFS: A Right-Optimized Write-Optimized File System. FAST 2015: 301-315 - [c75]Martin Farach-Colton, Meng-Tsung Tsai:
On the Complexity of Computing Prime Tables. ISAAC 2015: 677-688 - [c74]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Reallocation for Scheduling and Planning. SPAA 2015: 143-154 - [c73]Martin Farach-Colton, Tsan-sheng Hsu, Meng Li, Meng-Tsung Tsai:
Finding Articulation Points of Large Graphs in Linear Time. WADS 2015: 363-372 - 2014
- [c72]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai:
The Batched Predecessor Problem in External Memory. ESA 2014: 112-124 - [c71]Martin Farach-Colton, Meng-Tsung Tsai:
Computing the Degeneracy of Large Graphs. LATIN 2014: 250-260 - [c70]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. PODS 2014: 278-288 - [c69]Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves:
Dynamic Windows Scheduling with Reallocation. SEA 2014: 99-110 - 2013
- [c68]Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan:
Forty Years of Text Indexing. CPM 2013: 1-10 - [c67]Martin Farach-Colton, Meng-Tsung Tsai:
Exact Sublinear Binomial Sampling. ISAAC 2013: 240-250 - [c66]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation problems in scheduling. SPAA 2013: 271-279 - 2012
- [c65]John Esmet, Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul:
The TokuFS Streaming File System. HotStorage 2012 - [c64]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. LATIN 2012: 303-314 - 2011
- [c63]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok:
Don't Thrash: How to Cache Your Hash on Flash. HotStorage 2011 - [c62]Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro:
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. OPODIS 2011: 513-527 - [c61]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. DISC 2011: 202-204 - 2009
- [c60]Antonina Mitrofanova, Martin Farach-Colton, Bud Mishra:
Efficient and Robust Prediction Algorithms for Protein Complexes Using Gomory-Hu Trees. Pacific Symposium on Biocomputing 2009: 215-226 - 2008
- [c59]Martin Farach-Colton, Yang Huang:
A Linear Delay Algorithm for Building Concept Lattices. CPM 2008: 204-216 - 2007
- [c58]Martin Farach-Colton, Miguel A. Mosteiro:
Sensor Network Gossiping or How to Break the Broadcast Lower Bound. ISAAC 2007: 232-243 - [c57]Yang Huang, Martin Farach-Colton:
Lattice based Clustering of Temporal Gene-Expression Matrices. SDM 2007: 398-409 - [c56]Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson:
Cache-oblivious streaming B-trees. SPAA 2007: 81-92 - [c55]Martin Farach-Colton, Miguel A. Mosteiro:
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. WADS 2007: 565-576 - 2006
- [c54]Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro:
Lower Bounds for Clear Transmissions in Radio Networks. LATIN 2006: 447-454 - [c53]Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul:
Cache-oblivious string B-trees. PODS 2006: 233-242 - 2005
- [c52]Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro:
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model. ESA 2005: 827-838 - [c51]Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur:
Optimal Spaced Seeds for Faster Approximate String Matching. ICALP 2005: 1251-1262 - [c50]Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos:
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. SODA 2005: 650-659 - [c49]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial contention resolution for simple channels. SPAA 2005: 325-332 - 2004
- [c48]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson:
Adversarial Analyses of Window Backoff Strategies. IPDPS Next Generation Software Program - NSFNGS - PI Workshop 2004 - [c47]Martin Farach-Colton, Yang Huang, John L. L. Woolford:
Discovering temporal relations in molecular pathways using protein-protein interactions. RECOMB 2004: 150-156 - 2003
- [c46]Martin Farach-Colton:
Adventures at Google. ENC 2003: 3 - 2002
- [c45]Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton:
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. ESA 2002: 139-151 - [c44]Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito:
Two Simplified Algorithms for Maintaining Order in a List. ESA 2002: 152-164 - [c43]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA 2002: 165-173 - [c42]Moses Charikar, Kevin C. Chen, Martin Farach-Colton:
Finding Frequent Items in Data Streams. ICALP 2002: 693-703 - [c41]Michael A. Bender, Martin Farach-Colton:
The Level Ancestor Problem Simplified. LATIN 2002: 508-515 - [c40]Rahul Shah, Martin Farach-Colton:
Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. SODA 2002: 108-115 - 2001
- [c39]Rahul Shah, Martin Farach-Colton:
On the midpath tree conjuncture: a counter-example. SODA 2001: 208-209 - 2000
- [c38]Gabriela Hristescu, Martin Farach-Colton:
COFE: A Scalable Method for Feature Extraction from Complex Objects. DaWaK 2000: 358-371 - [c37]Michael A. Bender, Erik D. Demaine, Martin Farach-Colton:
Cache-Oblivious B-Trees. FOCS 2000: 399-409 - [c36]Michael A. Bender, Martin Farach-Colton:
The LCA Problem Revisited. LATIN 2000: 88-94 - [c35]Kevin C. Chen, Dannie Durand, Martin Farach-Colton:
Notung: dating gene duplications using gene family trees. RECOMB 2000: 96-106 - 1999
- [c34]Vincenzo Liberatore, Martin Farach-Colton, Ulrich Kremer:
Evaluation of Algorithms for Local Register Allocation. CC 1999: 137-152 - [c33]Martin Farach-Colton, Piotr Indyk:
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. FOCS 1999: 171-180 - [c32]Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang:
Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. SODA 1999: 92-101 - 1998
- [c31]Martin Farach, Paolo Ferragina, S. Muthukrishnan:
Overcoming the Memory Bottleneck in Suffix Tree Construction. FOCS 1998: 174-185 - [c30]Martin Farach, Vincenzo Liberatore:
On Local Register Allocation. SODA 1998: 564-573 - 1997
- [c29]Martin Farach:
Optimal Suffix Tree Construction with Large Alphabets. FOCS 1997: 137-143 - [c28]Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan:
Nearly Tight Bounds on the Learnability of Evolution. FOCS 1997: 524-533 - [c27]Gabriela Hristescu, Craig J. Benham, Martin Farach:
DNA Strand Separation Prediction: A Parallel Implementation. PDPTA 1997: 610-619 - [c26]Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, Steven Skiena:
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. RECOMB 1997: 1-2 - [c25]Jaime Cohen, Martin Farach:
Numerical taxonomy on data (abstract): experimental results. RECOMB 1997: 98 - [c24]Martin Farach, Sampath Kannan, E. Knill, S. Muthukrishnan:
Group testing problems with sequences in experimental molecular biology. SEQUENCES 1997: 357-367 - [c23]Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, Steven Skiena:
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. SODA 1997: 390-399 - [c22]Jaime Cohen, Martin Farach:
Numerical Taxonomy on Data: Experimental Results. SODA 1997: 410-417 - 1996
- [c21]Martin Farach, S. Muthukrishnan:
Perfect Hashing for Strings: Formalization and Algorithms. CPM 1996: 130-140 - [c20]George Christopher, Martin Farach, Michael A. Trick:
The Structure of Circular Decomposable Metrics. ESA 1996: 486-500 - [c19]Martin Farach, S. Muthukrishnan:
Optimal Logarithmic Time Randomized Suffix Tree Construction. ICALP 1996: 550-561 - [c18]Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup:
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). SODA 1996: 365-372 - [c17]Martin Farach, Sampath Kannan:
Efficient Algorithms for Inverting Evolution. STOC 1996: 230-236 - 1995
- [c16]Martin Farach, Teresa M. Przytycka, Mikkel Thorup:
Computing the Agreement of Trees with Bounded Degrees. ESA 1995: 381-393 - [c15]Martin Farach, Michiel O. Noordewier, Serap A. Savari, Larry A. Shepp, Aaron D. Wyner, Jacob Ziv:
On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence. SODA 1995: 48-57 - [c14]Martin Farach, S. Muthukrishnan:
Optimal Parallel Dictionary Matching and Compression (Extended Abstract). SPAA 1995: 244-253 - [c13]Martin Farach, Mikkel Thorup:
String matching in Lempel-Ziv compressed strings. STOC 1995: 703-712 - 1994
- [c12]Martin Farach, Mikkel Thorup:
Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract). FOCS 1994: 770-779 - [c11]Amihood Amir, Gary Benson, Martin Farach:
Optimal Two-Dimensional Compressed Matching. ICALP 1994: 215-226 - [c10]Martin Farach, Mikkel Thorup:
Fast Comparison of Evolutionary Trees. SODA 1994: 481-488 - [c9]Ming Gu, Martin Farach, Richard Beigel:
An Efficient Algorithm for Dynamic Text Indexing. SODA 1994: 697-704 - [c8]Amihood Amir, Gary Benson, Martin Farach:
Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. SODA 1994: 705-714 - 1993
- [c7]Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer:
Improved Dynamic Dictionary Matching. SODA 1993: 392-401 - [c6]Amihood Amir, Gary Benson, Martin Farach:
Optimal Parallel Two Dimensional Pattern Matching. SPAA 1993: 79-85 - [c5]Martin Farach, Sampath Kannan, Tandy J. Warnow:
A robust model for finding optimal evolutionary trees. STOC 1993: 137-145 - 1992
- [c4]Amihood Amir, Martin Farach, Yossi Matias:
Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). CPM 1992: 262-275 - [c3]Amihood Amir, Gary Benson, Martin Farach:
Alphabet Independent Two Dimensional Matching. STOC 1992: 59-68 - 1991
- [c2]Amihood Amir, Martin Farach:
Adaptive Dictionary Matching. FOCS 1991: 760-766 - [c1]Amihood Amir, Martin Farach:
Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. SODA 1991: 212-223
Parts in Books or Collections
- 1997
- [p1]Amihood Amir, Martin Farach:
Two dimensional matching. Pattern Matching Algorithms 1997: 267-292
Editorship
- 2023
- [e8]Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman:
31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands. LIPIcs 274, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-295-2 [contents] - 2021
- [e7]Martin Farach-Colton, Sabine Storandt:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021. SIAM 2021, ISBN 978-1-61197-647-2 [contents] - 2020
- [e6]Martin Farach-Colton, Giuseppe Prencipe, Ryuhei Uehara:
10th International Conference on Fun with Algorithms, FUN 2021, May 30 to June 1, 2021, Favignana Island, Sicily, Italy. LIPIcs 157, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-145-0 [contents] - [e5]Martin Farach-Colton, Inge Li Gørtz:
3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020. SIAM 2020, ISBN 978-1-61197-601-4 [contents] - 2018
- [e4]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Lecture Notes in Computer Science 10807, Springer 2018, ISBN 978-3-319-77403-9 [contents] - 2004
- [e3]Martin Farach-Colton:
LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings. Lecture Notes in Computer Science 2976, Springer 2004, ISBN 3-540-21258-2 [contents] - 1999
- [e2]Martin Farach-Colton, Fred S. Roberts, Martin Vingron, Michael S. Waterman:
Mathematical Support for Molecular Biology, Proceedings from the DIMACS Special Year, 1998. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 47, DIMACS/AMS 1999, ISBN 978-0-8218-0826-9 [contents] - 1998
- [e1]Martin Farach-Colton:
Combinatorial Pattern Matching, 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings. Lecture Notes in Computer Science 1448, Springer 1998, ISBN 3-540-64739-2 [contents]
Reference Works
- 2016
- [r1]Martin Farach-Colton:
Lowest Common Ancestors in Trees. Encyclopedia of Algorithms 2016: 1169-1174
Informal and Other Publications
- 2024
- [i40]Alex Conway, Ainesh Bakshi, Arghya Bhattacharya, Rory Bennett, Yizheng Jiao, Eric Knorr, Yang Zhan, Michael A. Bender, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, Martin Farach-Colton:
File System Aging. CoRR abs/2401.08858 (2024) - [i39]Hagit Attiya, Michael A. Bender, Martin Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. CoRR abs/2403.14445 (2024) - [i38]Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul:
Layered List Labeling. CoRR abs/2404.16623 (2024) - [i37]Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, Michal Koucký, William Kuszmaul, Michael E. Saks:
Nearly Optimal List Labeling. CoRR abs/2405.00807 (2024) - [i36]Richard Wen, Hunter McCoy, David Tench, Guido Tagliavini, Michael A. Bender, Alex Conway, Martin Farach-Colton, Rob Johnson, Prashant Pandey:
Adaptive Quotient Filters. CoRR abs/2405.10253 (2024) - [i35]Martin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover:
A Nearly Quadratic Improvement for Memory Reallocation. CoRR abs/2405.12152 (2024) - 2023
- [i34]Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini:
An Associativity Threshold Phenomenon in Set-Associative Caches. CoRR abs/2304.04954 (2023) - [i33]Peter C. Dillinger, Martin Farach-Colton, Guido Tagliavini, Stefan Walzer:
Optimal Uncoordinated Unique IDs. CoRR abs/2304.07109 (2023) - [i32]Martin Farach-Colton, Fabian Daniel Kuhn, Ronitt Rubinfeld, Przemyslaw Uznanski:
From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071). Dagstuhl Reports 13(2): 33-46 (2023) - 2022
- [i31]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
What Does Dynamic Optimality Mean in External Memory? CoRR abs/2201.01742 (2022) - [i30]Michael A. Bender, Alexander Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. CoRR abs/2203.02763 (2022) - [i29]David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, J. Ahmed Dellas, Martin Farach-Colton, Tyler Seip, Kenny Zhang:
GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. CoRR abs/2203.14927 (2022) - [i28]Sepehr Assadi, Martin Farach-Colton, William Kuszmaul:
Tight Bounds for Monotone Minimal Perfect Hashing. CoRR abs/2207.10556 (2022) - [i27]Prashant Pandey, Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson:
IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity. CoRR abs/2210.04068 (2022) - 2021
- [i26]Muhammad A. Awad, Saman Ashkiani, Serban D. Porumbescu, Martin Farach-Colton, John D. Owens:
Better GPU Hash Tables. CoRR abs/2108.07232 (2021) - [i25]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
All-Purpose Hashing. CoRR abs/2109.04548 (2021) - [i24]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the Optimal Time/Space Tradeoff for Hash Tables. CoRR abs/2111.00602 (2021) - [i23]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Tiny Pointers. CoRR abs/2111.12800 (2021) - 2020
- [i22]Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai:
Streaming Complexity of Spanning Tree Computation. CoRR abs/2001.07672 (2020) - 2019
- [i21]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
Achieving Optimal Backlog in Multi-Processor Cup Games. CoRR abs/1904.02861 (2019) - [i20]Martin Farach-Colton, Inge Li Gørtz, Rob Johnson, Donald E. Porter:
Theoretical Foundations of Storage Systems (Dagstuhl Seminar 19111). Dagstuhl Reports 9(3): 39-51 (2019) - 2018
- [i19]Lucas Farach-Colton, Martin Farach-Colton, Reut Levi, Moti Medina, Miguel A. Mosteiro:
Closure Operators and Spam Resistance for PageRank. CoRR abs/1803.05001 (2018) - [i18]Alexander Conway, Martin Farach-Colton, Philip Shilane:
Optimal Hashing in External Memory. CoRR abs/1805.09423 (2018) - [i17]Michael A. Bender, Jake Christensen, Alexander Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai:
Optimal Ball Recycling. CoRR abs/1807.01804 (2018) - [i16]Martin Farach-Colton, Meng Li, Meng-Tsung Tsai:
Streaming Algorithms for Planar Convex Hulls. CoRR abs/1810.00455 (2018) - [i15]Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Prashant Pandey, Cynthia A. Phillips, Shikha Singh:
The Online Event-Detection Problem. CoRR abs/1812.09824 (2018) - 2017
- [i14]Saman Ashkiani, Shengren Li, Martin Farach-Colton, Nina Amenta, John D. Owens:
GPU LSM: A Dynamic Dictionary Data Structure for the GPU. CoRR abs/1707.05354 (2017) - [i13]Saman Ashkiani, Martin Farach-Colton, John D. Owens:
A Dynamic Hash Table for the GPU. CoRR abs/1710.11246 (2017) - [i12]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. CoRR abs/1711.01616 (2017) - 2015
- [i11]Martin Farach-Colton, Meng-Tsung Tsai:
On the complexity of computing prime tables. CoRR abs/1504.05240 (2015) - 2014
- [i10]Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves:
Dynamic Windows Scheduling with Reallocation. CoRR abs/1404.1087 (2014) - [i9]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. CoRR abs/1404.2019 (2014) - 2013
- [i8]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. CoRR abs/1305.6555 (2013) - 2012
- [i7]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok:
Don't Thrash: How to Cache Your Hash on Flash. CoRR abs/1208.0290 (2012) - 2011
- [i6]Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism. CoRR abs/1105.6151 (2011) - [i5]Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro:
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. CoRR abs/1109.4373 (2011) - 2005
- [i4]Philip Bille, Martin Farach-Colton:
Fast and Compact Regular Expression Matching. CoRR abs/cs/0509069 (2005) - 2004
- [i3]Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
Insertion Sort is O(n log n). CoRR cs.DS/0407003 (2004) - 2003
- [i2]Vicky Choi, Martin Farach-Colton:
Barnacle: An Assembly Algorithm for Clone-based Sequences of Whole Genomes. CoRR cs.DS/0302005 (2003) - 2002
- [i1]Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup:
Efficient Tree Layout in a Multilevel Memory Hierarchy. CoRR cs.DS/0211010 (2002)
Coauthor Index
[j67] [j66] [j65] [j64] [j62] [j61] [j59] [j58] [j57] [j56] [j55] [j53] [j52] [j51] [j47] [j45] [j44] [j42] [j37] [j34] [j33] [j32] [j30] [c124] [c122] [c119] [c115] [c114] [c113] [c112] [c111] [c110] [c109] [c108] [c107] [c106] [c105] [c104] [c103] [c99] [c97] [c96] [c95] [c94] [c93] [c86] [c85] [c84] [c82] [c81] [c80] [c77] [c76] [c74] [c72] [c70] [c66] [c65] [c63] [c56] [c53] [c49] [c48] [c45] [c44] [c43] [c41] [c37] [c36] [e4] [i40] [i39] [i38] [i37] [i36] [i34] [i31] [i30] [i29] [i27] [i25] [i24] [i23] [i21] [i17] [i15] [i12] [i9] [i8] [i7] [i3] [i1]
Alexander Conway
aka: Alex Conway
aka: Alex Conway
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
