Pages that link to "Item:Q3959426"
From MaRDI portal
The following pages link to Asymptotically tight bounds on time-space trade-offs in a pebble game (Q3959426):
Displaying 23 items.
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Highly symmetric expanders (Q700158) (← links)
- Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
- White pebbles help (Q1111025) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Superconcentrators of depth 2 (Q1162816) (← links)
- On the power of white pebbles (Q1180416) (← links)
- On the cost of recomputing: Tight bounds on pebbling with faults (Q1575959) (← links)
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Rifflescrambler -- a memory-hard password storing function (Q2167756) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- Rounds versus time for the two person pebble game (Q2641235) (← links)
- Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Proof of Space from Stacked Expanders (Q3179360) (← links)
- On Reducing the Space Requirements of a Straight-Line Algorithm (Q3332245) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Rounds versus time for the two person pebble game (Q5096183) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)
- Bandwidth-Hard Functions: Reductions and Lower Bounds (Q6489332) (← links)
