Martı́n Farach-Colton
- Optimal Bounds for Open Addressing Without Reordering
2025/01/04 by Martı́n Farach-Colton, Martin Farach-Colton, Andrew Krapivin +4 · 17 voices · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Cooperative Communication and Network Coding #cs.DS #math.CO
- Finding frequent items in data streams
2003/08/12 by Moses Charikar, Kevin Chen, Martı́n Farach-Colton +1 · 51 citations
Computer Science · #Data Mining Algorithms and Applications #Advanced Database Systems and Queries #Data Stream Mining Techniques
- Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once
2021/09/09 by Michael A. Bender, Bender, Michael A., Alex Conway +8 · 2 voices · 4 citations
Computer Science · #Advanced Data Storage Technologies #Algorithms and Data Compression #Caching and Content Delivery #cs.DS
- Tight Bounds for Monotone Minimal Perfect Hashing
2022/07/21 by Sepehr Assadi, Assadi, Sepehr, Martı́n Farach-Colton +3 · 1 citation
Computer Science · #Advanced Image and Video Retrieval Techniques #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences