Projects per year
Fingerprint Dive into the research topics where Martin Farach-Colton is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
Glossaries
Engineering & Materials Science
Data structures
Engineering & Materials Science
Data storage equipment
Engineering & Materials Science
Pattern matching
Engineering & Materials Science
Numerical Taxonomy
Mathematics
String Matching
Mathematics
Evolutionary Tree
Mathematics
Strings
Mathematics
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.
Projects 2009 2020
CCF-BSF: AF: SMALL: COLLABORATIVE RESEARCH: THE DICTIONARY PROBLEM CONSIDERED
National Science Foundation (National Science Foundation (NSF))
9/1/17 → 8/31/20
Project: Research project
Glossaries
Data storage equipment
Data structures
AITF: COLLABORATIVE RESERACH: THEORY AND IMPLEMENTATION OF DYNAMIC DATA STRUCTURES FOR THE GPU
National Science Foundation (National Science Foundation (NSF))
9/1/16 → 8/31/20
Project: Research project
Data structures
Graphics processing unit
Parallel processing systems
Glossaries
Program processors
COLLABORATIVE RESEARCH: CONFERENCE: AITF PI MEETING
National Science Foundation (National Science Foundation (NSF))
1/1/17 → 12/31/17
Project: Research project
computer scientist
training opportunities
field research
expert
community
CSR: MEDIUM: COLLABORATIVE RESEARCH: FTFS: A READ/WRITE-OPTIMIZED FRACTAL TREE FILE SYSTEM
National Science Foundation (National Science Foundation (NSF))
10/1/14 → 9/30/17
Project: Research project
Fractals
Data structures
Computer systems
Systems analysis
Supercomputers
BIGDATA: MID-SCALE: DCM: COLLABORATIVE RESEARCH: ELIMINATING THE DATA INGESTION BOTTLENECK IN BIG-DATA APPLICATIONS
National Science Foundation (National Science Foundation (NSF))
2/1/13 → 1/31/17
Project: Research project
Processing
Data structures
Data warehouses
Hardware
Big data
Research Output 1989 2019
1
Citation
(Scopus)
Achieving optimal backlog in multi-processor cup games
Bender, M. A., Farach-Colton, M. & Kuszmaul, W., Jun 23 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 1148-1157 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Water
Fillers
Scheduling
3
Citations
(Scopus)
Engineering a high-performance GPU B-tree
Awad, M. A., Ashkiani, S., Johnson, R., Farach-Colton, M. & Owens, J. D., Feb 16 2019, PPoPP 2019 - Proceedings of the 24th Principles and Practice of Parallel Programming. Association for Computing Machinery, p. 145-157 13 p. (Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Dynamic random access storage
Limiters
Graphics processing unit
Throughput
Bandwidth
Optimal ball recycling
Bender, M. A., Christensen, J., Conway, A., Farach-Colton, M., Johnson, R. & Tsai, M. T., Jan 1 2019, p. 2527-2546. 20 p.Research output: Contribution to conference › Paper
Recycling
Bins
Ball
Game
Memory Model
Small refinements to the dam can have big consequences for data-structure design
Bender, M. A., Jannen, W., Knorr, E., Pandey, P., Conway, A., Jiao, Y., McAllister, S., Porter, D. E., Zhan, Y., Farach-Colton, M., Johnson, R., Mukherjee, N. & Yuan, J., Jun 17 2019, SPAA 2019 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 265-274 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
B-tree
Dams
Data structures
Data Structures
Refinement
Syntactic separation of subset satisfiability problems
Allender, E., Farach-Colton, M. & Tsai, M. T., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Syntactics
Hardness
Computational geometry
Graph theory