Martı́n Farach-Colton
- Artificial Intelligence top 0.5%
- Computer Networks and Communications top 0.5%
- Molecular Biology top 10%
- Hardware and Architecture top 1%
- Computational Theory and Mathematics top 0.5%
- Co-authors
- Kevin ChenMoses CharikarMichael A. BenderAmihood AmirMikkel ThorupDannie DurandGary BensonBradley C. Kuszmaul
- Topics
- Algorithms and Data Compression (57 papers)Advanced Data Storage Technologies (38 papers)Caching and Content Delivery (20 papers)
- Partner nations
- United StatesNetherlandsGermany
In The Last Decade
Martı́n Farach-Colton
131 papers receiving 3.9k citations
Hit Papers
Peers
Comparison fields: 5 of 137
- Artificial Intelligence 2.2k
- Computer Networks and Communications 1.5k
- Molecular Biology 1.2k
- Hardware and Architecture 782
- Computational Theory and Mathematics 781
Countries citing papers authored by Martı́n Farach-Colton
This map shows the geographic impact of Martı́n Farach-Colton's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Martı́n Farach-Colton with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Martı́n Farach-Colton more than expected).
Fields of papers citing papers by Martı́n Farach-Colton
This network shows the impact of papers produced by Martı́n Farach-Colton. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Martı́n Farach-Colton. The network helps show where Martı́n Farach-Colton may publish in the future.
Co-authorship network of co-authors of Martı́n Farach-Colton
This figure shows the co-authorship network connecting the top 25 collaborators of Martı́n Farach-Colton. A scholar is included among the top collaborators of Martı́n Farach-Colton based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Martı́n Farach-Colton. Martı́n Farach-Colton is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 1 | |
| 3 | 0 | |
| 4 | 1 | |
| 5 | 8 | |
| 6 | 3 | |
| 7 | 5 | |
| 8 | 2 | |
| 9 | File systems fated for senescence? nonsense, says science! | 22 |
| 10 | Lazy analytics: let other queries do the work for you | 1 |
| 11 | Optimizing Every Operation in a Write-optimized File System | 2 |
| 12 | An Introduction to Bε-trees and Write-Optimization. | 16 |
| 13 | 8 | |
| 14 | 7 | |
| 15 | 12 | |
| 16 | 7 | |
| 17 | 20 | |
| 18 | 28 | |
| 19 | 20 | |
| 20 | 18 |
About Martı́n Farach-Colton
Martı́n Farach-Colton is a scholar working on Hardware and Architecture, Computer Networks and Communications and Artificial Intelligence, having authored 137 papers that have together received 4.1k indexed citations. Recurring topics across this work include Algorithms and Data Compression (57 papers), Advanced Data Storage Technologies (38 papers) and Caching and Content Delivery (20 papers). The work is most often cited by research in Hardware and Architecture (782 citations), Artificial Intelligence (2.2k citations) and Computer Networks and Communications (1.5k citations). Martı́n Farach-Colton has collaborated with scholars based in United States, Netherlands and Germany. Frequent co-authors include Kevin Chen, Moses Charikar, Michael A. Bender, Amihood Amir, Mikkel Thorup, Dannie Durand, Gary Benson, Bradley C. Kuszmaul, S. Muthukrishnan and Erik D. Demaine. Their work appears in journals such as Communications of the ACM, Gene and Journal of the ACM.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.