Stebėti
Martin Farach-Colton
Martin Farach-Colton
Shustek Professor of Computer Science, New York University
Patvirtintas el. paštas nyu.edu
Pavadinimas
Cituota
Cituota
Metai
Finding frequent items in data streams
M Charikar, K Chen, M Farach-Colton
International Colloquium on Automata, Languages, and Programming, 693-703, 2002
15462002
The LCA problem revisited
MA Bender, M Farach-Colton
LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del …, 2000
10452000
Optimal suffix tree construction with large alphabets
M Farach
Proceedings 38th Annual Symposium on Foundations of Computer Science, 137-143, 1997
7011997
Finding frequent items in data streams
M Charikar, K Chen, M Farach-Colton
Theoretical Computer Science 312 (1), 3-15, 2004
6022004
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
5392000
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
3222005
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
2981996
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
2892011
String matching in Lempel-Ziv compressed strings
M Farach, M Thorup
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
2831995
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
2772000
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000
2752000
High-performance streaming dictionary
MA Bender, M Farach-Colton, YR Fogel, Z Kasheff, BC Kuszmaul, ...
US Patent 8,996,563, 2015
2552015
The level ancestor problem simplified
MA Bender, M Farach-Colton
Theoretical Computer Science 321 (1), 5-12, 2004
2452004
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
2431998
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
2321993
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
2212002
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
2072007
Cache-oblivious B-trees
MA Bender, ED Demaine, M Farach-Colton
SIAM Journal on Computing 35 (2), 341-358, 2005
1822005
{BetrFS}: A {Right-Optimized}{Write-Optimized} file system
W Jannen, J Yuan, Y Zhan, A Akshintala, J Esmet, Y Jiao, A Mittal, ...
13th USENIX Conference on File and Storage Technologies (FAST 15), 301-315, 2015
1582015
Optimal superprimitivity testing for strings
A Apostolico, M Farach, CS Iliopoulos
Information Processing Letters 39 (1), 17-20, 1991
1551991
Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.
Straipsniai 1–20