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
10432002
The LCA problem revisited
MA Bender, M Farach-Colton
Latin American Symposium on Theoretical Informatics, 88-94, 2000
8672000
Optimal suffix tree construction with large alphabets
M Farach
Proceedings 38th Annual Symposium on Foundations of Computer Science, 137-143, 1997
5911997
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
4202000
Finding frequent items in data streams
M Charikar, K Chen, M Farach-Colton
Theoretical Computer Science 312 (1), 3-15, 2004
4142004
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
280*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
2731996
String matching in lempel—ziv compressed strings
M Farach, M Thorup
Algorithmica 20 (4), 388-404, 1998
2511998
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
2382000
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
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000
2232000
A robust model for finding optimal evolutionary trees
M Farach, S Kannan, T Warnow
Algorithmica 13 (1-2), 155-179, 1995
2111995
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
1872002
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
1842007
The level ancestor problem simplified
MA Bender, M Farach-Colton
Theoretical Computer Science 321 (1), 5-12, 2004
1832004
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
SIAM Journal on Computing 35 (2), 341-358, 2005
1462005
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model
R Agarwala, S Batzoglou, V Dančik, SE Decatur, S Hannenhalli, M Farach, ...
Journal of Computational Biology 4 (3), 275-296, 1997
1391997
Optimal superprimitivity testing for strings
A Apostolico, M Farach, CS Iliopoulos
Information Processing Letters 39 (1), 17-20, 1991
1391991
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
1352012
An O (n log n) algorithm for the maximum agreement subtree problem for binary trees
R Cole, M Farach-Colton, R Hariharan, T Przytycka, M Thorup
SIAM Journal on Computing 30 (5), 1385-1404, 2000
1352000
The system can't perform the operation now. Try again later.
Articles 1–20