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
11732002
The LCA problem revisited
MA Bender, M Farach-Colton
Latin American Symposium on Theoretical Informatics, 88-94, 2000
9152000
Optimal suffix tree construction with large alphabets
M Farach
Proceedings 38th Annual Symposium on Foundations of Computer Science, 137-143, 1997
6181997
NOTUNG: a program for dating gene duplications and optimizing gene family trees
K Chen, D Durand, M Farach-Colton
Journal of Computational Biology 7 (3-4), 429-447, 2000
4592000
Finding frequent items in data streams
M Charikar, K Chen, M Farach-Colton
Theoretical Computer Science 312 (1), 3-15, 2004
4532004
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
287*2005
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
2831996
1991
RJ Clark, RC Arkin, A Ram, R Bazzi, G Neiger, K Marzullo, G Neiger, ...
Grounding in communication. See Resnick et al 1 (99), 1, 1991
2661991
String matching in lempel—ziv compressed strings
M Farach, M Thorup
Algorithmica 20 (4), 388-404, 1998
2621998
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
2522000
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000
2422000
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
2331998
A robust model for finding optimal evolutionary trees
M Farach, S Kannan, T Warnow
Algorithmica 13 (1), 155-179, 1995
2221995
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
1992002
The level ancestor problem simplified
MA Bender, M Farach-Colton
Theoretical Computer Science 321 (1), 5-12, 2004
1982004
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
1942007
Don't Thrash: How to Cache Your Hash on Flash.
MA Bender, M Farach-Colton, R Johnson, R Kraner, BC Kuszmaul, ...
Proc. VLDB Endow. 5 (11), 1627-1637, 2012
1722012
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
SIAM Journal on Computing 35 (2), 341-358, 2005
1572005
High-performance streaming dictionary
MA Bender, M Farach-Colton, YR Fogel, Z Kasheff, BC Kuszmaul, ...
US Patent 8,996,563, 2015
1522015
Optimal superprimitivity testing for strings
A Apostolico, M Farach, CS Iliopoulos
Information Processing Letters 39 (1), 17-20, 1991
1441991
The system can't perform the operation now. Try again later.
Articles 1–20