Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficiently Computing Data-Independent Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Parallel Complexity Graphs and Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoff Cryptanalysis of Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4061993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key-Evolution Schemes Resilient to Space-Bounded Leakage / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Time Computable Self-erasing Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling and Proofs of Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Garbled Circuits from One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Security of Yao’s Garbled Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically tight bounds on time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Publicly verifiable proofs of sequential work / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternation. II. A graph theoretic approach to determinism versus nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of graphs with expensive depth-reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-time trade-offs on the FFT algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for computing functions, using connectivity properties of their circuits / rank
 
Normal rank

Latest revision as of 01:10, 14 July 2024

scientific article; zbMATH DE number 6734889
Language Label Description Also known as
English
Depth-Robust Graphs and Their Cumulative Memory Complexity
scientific article; zbMATH DE number 6734889

    Statements

    Depth-Robust Graphs and Their Cumulative Memory Complexity (English)
    0 references
    0 references
    0 references
    0 references
    23 June 2017
    0 references
    0 references
    data-independent memory hard functions (iMHFS)
    0 references
    0 references