Martin Farach-Colton

Sitert av

	Alle	Siden 2018
Sitater	12832	4300
h-indeks	56	31
i10-indeks	105	72

820

410

205

615

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202355 53 100 116 155 175 232 191 123 196 289 359 478 390 575 458 521 404 445 450 426 477 464 525 609 626 657 776 808 729 702

Offentlig tilgang

Vis alle

38 artikler

0 artikler

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

Michael A. BenderStony Brook UniversityVerifisert e-postadresse på cs.stonybrook.edu
Miguel A. MosteiroAssociate Professor, Computer Science Department, Pace UniversityVerifisert e-postadresse på pace.edu
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerifisert e-postadresse på mit.edu
Moses CharikarProfessor of Computer Science, Stanford UniversityVerifisert e-postadresse på cs.stanford.edu
Richard ColeProfessor of Computer Science, Courant Institute, New York UniversityVerifisert e-postadresse på cs.nyu.edu
Teresa PrzytyckaNCBI / NLM / NIHVerifisert e-postadresse på ncbi.nlm.nih.gov
Vineet BafnaProfessor, Computer Science & Engineering, University of California, San DiegoVerifisert e-postadresse på cs.ucsd.edu
Charles E. LeisersonMITVerifisert e-postadresse på mit.edu
Paolo FerraginaProfessor of Algorithms, Dept. Computer Science, University of PisaVerifisert e-postadresse på unipi.it
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerifisert e-postadresse på warwick.ac.uk
Alejandro SchafferComputer Scientist, National Institutes of HealthVerifisert e-postadresse på nih.gov
Andris AmbainisProfessor, University of LatviaVerifisert e-postadresse på lu.lv

Følg

Martin Farach-Colton

Distinguished Professor of Computer Science, Rutgers University

Verifisert e-postadresse på cs.rutgers.edu

Algorithms Data Structures External Memory Storage Systems


Tittel Sorter etter sitater Sorter etter år Sorter etter tittel	Sitert av Sitert av	År
Finding frequent items in data streams M Charikar, K Chen, M Farach-Colton International Colloquium on Automata, Languages, and Programming, 693-703, 2002	1497	2002
The LCA problem revisited MA Bender, M Farach-Colton LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del …, 2000	1012	2000
Optimal suffix tree construction with large alphabets M Farach Proceedings 38th Annual Symposium on Foundations of Computer Science, 137-143, 1997	685	1997
Finding frequent items in data streams M Charikar, K Chen, M Farach-Colton Theoretical Computer Science 312 (1), 3-15, 2004	574	2004
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	507	2000
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	310	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	294	1996
String matching in Lempel-Ziv compressed strings M Farach, M Thorup Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995	284	1995
Cache-oblivious B-trees MA Bender, ED Demaine, M Farach-Colton Proceedings 41st Annual Symposium on Foundations of Computer Science, 399-409, 2000	273	2000
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	272	2000
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	260	2011
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	242	1998
High-performance streaming dictionary MA Bender, M Farach-Colton, YR Fogel, Z Kasheff, BC Kuszmaul, ... US Patent 8,996,563, 2015	238	2015
The level ancestor problem simplified MA Bender, M Farach-Colton Theoretical Computer Science 321 (1), 5-12, 2004	235	2004
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	234	1993
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	216	2002
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	203	2007
Cache-oblivious B-trees MA Bender, ED Demaine, M Farach-Colton SIAM Journal on Computing 35 (2), 341-358, 2005	173	2005
Optimal superprimitivity testing for strings A Apostolico, M Farach, CS Iliopoulos Information Processing Letters 39 (1), 17-20, 1991	158	1991
{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	146	2015

Systemet kan ikke utføre handlingen. Prøv på nytt senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg

Sitert av

Medforfattere