The following pages link to Space bounds for a game on graphs (Q4143082):
Displaying 33 items.
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- The depth of resolution proofs (Q647405) (← links)
- Highly symmetric expanders (Q700158) (← links)
- Data structures for distributed counting (Q794431) (← links)
- Smaller superconcentrators of density 28 (Q844173) (← links)
- Incremental branching programs (Q929291) (← links)
- A view of computability on term algebras (Q1051428) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- On time hierarchies (Q1137384) (← links)
- A note on the pebble game (Q1147083) (← links)
- The space complexity of pebble games on trees (Q1147515) (← links)
- A comparison of two variations of a pebble game on graphs (Q1149448) (← links)
- Pebbling with an auxiliary pushdown (Q1156489) (← links)
- Pebble games for studying storage sharing (Q1162159) (← links)
- Extreme time-space tradeoffs for graphs with small space requirements (Q1173412) (← links)
- Time-space trade-offs in a pebble game (Q1254254) (← links)
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds (Q1648810) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- The size and depth of layered Boolean circuits (Q1944075) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Rounds versus time for the two person pebble game (Q2641235) (← 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)
- Regular and General Resolution: An Improved Separation (Q3502715) (← links)
- Space-time tradeoffs for linear recursion (Q3968456) (← links)
- Construction of expanders and superconcentrators using Kolmogorov complexity (Q4500485) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Proofs of Catalytic Space (Q5090438) (← 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)
