Martin Farach-Colton

Known as: Martín Farach-Colton 
Martin Farach-Colton is an American computer scientist, known for his work in streaming algorithms, suffix tree construction, pattern matching in… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2017
01219992017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We develop a dynamic dictionary data structure for the GPU, supporting fast insertions and deletions, based on the Log Structured… (More)
Is this relevant?
2017
2017
This special issue of the ACM Transactions on Storage presents some of the highlights of the 14th USENIX Conference on File and… (More)
Is this relevant?
2015
2015
This special issue of the ACM Transactions on Storage presents some of the highlights of the 13th USENIX Conference on File and… (More)
Is this relevant?
2006
2006
Traditional INSERTION SORT runs in O(n) time because each insertion takes O(n) time. When people run INSERTION SORT in the… (More)
Is this relevant?
2006
2006
Aims. We want to investigate whether brown dwarfs (BDs) form like stars or are ejected embryos. We study the presence of disks… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2003
2003
OF THE DISSERTATION Undiscretized Dynamic Programming and Ordinal Embeddings by Rahul Shah Dissertation Director: Martin Farach… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • table 2.1
  • figure 2.4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed data structure is <i>cache… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Review
1999
Review
1999
Mathematics has grown and developed through its association with the natural sciences, of which, historically, physics has been… (More)
Is this relevant?