Martín Farach-Colton
Latin American Symposium on Theoretical Informatics · 2000–2002
A researcher in the Science corpus: 4 papers; trusts 2 researchers and is trusted by 57 researchers here, as inferred from the citation graph.
Whom Martín Farach-Colton trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Martín Farach-Colton overall
- Graham Cormode
- Kunihiko Sadakane
- S. Muthu Muthukrishnan
- David P. Woodruff
- Sariel Har-Peled
- Juha Kärkkäinen
- Jeffrey Scott Vitter
- Jon M. Kleinberg
- Kenneth L. Clarkson
- Piotr Indyk
Papers from Martín Farach-Colton's perspective
Ordered by how strongly the researchers Martín Farach-Colton trusts endorse each paper. Same corpus, a different order for every researcher.
- Clustering data streams (Proceedings 41st Annual Symposium on Foundations of Computer Science)
- The input/output complexity of sorting and related problems
- AND T
- Skip lists: a probabilistic alternative to balanced trees
- External memory algorithms and data structures: dealing with massive data (CSUR)
- Database-friendly random projections (ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems)
- Stable distributions, pseudorandom generators, embeddings and data stream computation (Proceedings 41st Annual Symposium on Foundations of Computer Science)
- Data-streams and histograms (Symposium on the Theory of Computing)
- Near-optimal sparse fourier representations via sampling
- Pattern classification and scene analysis
Their papers
- Finding frequent items in data streams (2002) — 2,037 citations
- NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees (2000) — 531 citations
- The LCA Problem Revisited (2000) — 893 citations
- Cache-oblivious B-trees (2000) — 345 citations