Follow
Martin Farach-Colton
Martin Farach-Colton
Professor of Computer Science, Rutgers University
Verified email at cs.rutgers.edu
Title
Cited by
Cited by
Year
Finding frequent items in data streams
M Charikar, K Chen, M Farach-Colton
International Colloquium on Automata, Languages, and Programming, 693-703, 2002
13612002
The LCA problem revisited
MA Bender, M Farach-Colton
Latin American Symposium on Theoretical Informatics, 88-94, 2000
9722000
Optimal suffix tree construction with large alphabets
M Farach
Proceedings 38th Annual Symposium on Foundations of Computer Science, 137-143, 1997
6471997
Finding frequent items in data streams
M Charikar, K Chen, M Farach-Colton
Theoretical Computer Science 312 (1), 3-15, 2004
5242004
Notung: Dating gene duplications using gene family trees
K Chen, D Durand, M Farach-Colton
Proceedings of the fourth annual international conference on Computational …, 2000
5032000
Let sleeping files lie: Pattern matching in Z-compressed files
A Amir, G Benson, M Farach
Journal of Computer and System Sciences 52 (2), 299-307, 1996
2941996
Lowest common ancestors in trees and directed acyclic graphs
MA Bender, M Farach-Colton, G Pemmasani, S Skiena, P Sumazin
Journal of Algorithms 57 (2), 75-94, 2005
2842005
String matching in Lempel-Ziv compressed strings
M Farach, M Thorup
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
2741995
On the sorting-complexity of suffix tree construction
M Farach-Colton, P Ferragina, S Muthukrishnan
Journal of the ACM (JACM) 47 (6), 987-1011, 2000
2632000
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000
2612000
On the approximability of numerical taxonomy (fitting distances by tree metrics)
R Agarwala, V Bafna, M Farach, M Paterson, M Thorup
SIAM Journal on Computing 28 (3), 1073-1085, 1998
2321998
The level ancestor problem simplified
MA Bender, M Farach-Colton
Theoretical Computer Science 321 (1), 5-12, 2004
2202004
A robust model for finding optimal evolutionary trees
M Farach, S Kannan, T Warnow
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing …, 1993
2201993
High-performance streaming dictionary
MA Bender, M Farach-Colton, YR Fogel, Z Kasheff, BC Kuszmaul, ...
US Patent 8,996,563, 2015
2152015
Don't thrash: how to cache your hash on flash
MA Bender, M Farach-Colton, R Johnson, BC Kuszmaul, D Medjedovic, ...
3rd Workshop on Hot Topics in Storage and File Systems (HotStorage 11), 2011
2142011
Two simplified algorithms for maintaining order in a list
MA Bender, R Cole, ED Demaine, M Farach-Colton, J Zito
European Symposium on Algorithms, 152-164, 2002
2072002
Cache-oblivious streaming B-trees
MA Bender, M Farach-Colton, JT Fineman, YR Fogel, BC Kuszmaul, ...
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007
2002007
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
SIAM Journal on Computing 35 (2), 341-358, 2005
1632005
BetrFS: A Right-Optimized Write-Optimized File System.
W Jannen, J Yuan, Y Zhan, A Akshintala, J Esmet, Y Jiao, A Mittal, ...
FAST, 301-315, 2015
154*2015
Optimal superprimitivity testing for strings
A Apostolico, M Farach, CS Iliopoulos
Information Processing Letters 39 (1), 17-20, 1991
1511991
The system can't perform the operation now. Try again later.
Articles 1–20