Memory Efficient Algorithms for Finding Needles in Haystacks
Offered By: TheIACR via YouTube
Course Description
Overview
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.
Syllabus
Memory Efficient Algorithms for Finding Needles in Haystacks
Taught by
TheIACR
Related Courses
Building Geospatial Apps on Postgres, PostGIS, & Citus at Large ScaleMicrosoft via YouTube Unlocking the Power of ML for Your JavaScript Applications with TensorFlow.js
TensorFlow via YouTube Managing the Reactive World with RxJava - Jake Wharton
ChariotSolutions via YouTube What's New in Grails 2.0
ChariotSolutions via YouTube Performance Analysis of Apache Spark and Presto in Cloud Environments
Databricks via YouTube