Memory Efficient Algorithms for Finding Needles in Haystacks

Memory Efficient Algorithms for Finding Needles in Haystacks

Explore memory-efficient algorithms for locating specific elements within large datasets in this 24-minute conference talk presented at Crypto 2016. Delve into the research findings of Itai Dinur, Orr Dunkelman, Nathan Keller, and Adi Shamir as they discuss innovative techniques for solving the "needle in a haystack" problem with limited memory resources. Gain insights into the challenges and solutions associated with searching massive data structures efficiently, and learn about potential applications in cryptography and data analysis.