Depth Robust Graphs and Their Cumulative Memory Complexity
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a presentation from Eurocrypt 2017 on depth robust graphs and their cumulative memory complexity, delving into the research findings of Joël Alwen, Jeremiah Blocki, and Krzysztof Pietrzak. Gain insights into this cryptographic concept and its implications for memory-hard functions and other applications in the field of cryptography.
Syllabus
Depth Robust Graphs and Their Cumulative Memory Complexity
Taught by
TheIACR
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer