The following pages link to (Q4185781):
Displaying 50 items.
- A difference in complexity between recursion and tail recursion (Q519902) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
- Incremental branching programs (Q929291) (← links)
- A view of computability on term algebras (Q1051428) (← links)
- Size-space tradeoffs for oblivious computations (Q1052095) (← links)
- Derivation of efficient programs for computing sequences of actions (Q1093362) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- White pebbles help (Q1111025) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426) (← links)
- The equivalence of r.e. program schemes and data flow schemes (Q1144928) (← links)
- Pebbling with an auxiliary pushdown (Q1156489) (← links)
- Pebble games for studying storage sharing (Q1162159) (← links)
- Optimal off-line detection of repetitions in a string (Q1170893) (← links)
- Extreme time-space tradeoffs for graphs with small space requirements (Q1173412) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- An observation on time-storage trade off (Q1217591) (← links)
- Storage requirements for deterministic polynomial time recognizable languages (Q1230508) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- A family of rules for recursion removal (Q1233310) (← links)
- Relationships between classes of monotonic functions (Q1235976) (← links)
- Effective proper procedures and universal classes of program schemata (Q1236424) (← links)
- Time-space trade-offs in a pebble game (Q1254254) (← links)
- Recursive information transducers: Computation models (Q1288659) (← links)
- Logical and schematic characterization of complexity classes (Q1323362) (← links)
- Program schemes, recursion schemes, and formal languages (Q1393937) (← links)
- On the cost of recomputing: Tight bounds on pebbling with faults (Q1575959) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- Counter machines (Q1606993) (← links)
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) (Q1683704) (← links)
- Bandwidth and pebbling (Q1838912) (← links)
- Translatability of schemas over restricted interpretations (Q1844072) (← links)
- On the structural simplicity of machines and languages (Q1924785) (← links)
- The size and depth of layered Boolean circuits (Q1944075) (← links)
- Reversible pebble games and the relation between tree-like and general resolution space (Q2033469) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Translating recursion equations into flow charts (Q2553232) (← links)
- Characterization of flowchartable recursions (Q2562565) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Branching Programs for Tree Evaluation (Q3182923) (← links)
- Space-time tradeoffs for linear recursion (Q3968456) (← links)
- Space bounds for a game on graphs (Q4143082) (← links)
- On the cost of recomputing: tight bounds on pebbling with faults (Q4632415) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- On abstraction and the expressive power of programming languages (Q5096222) (← links)
- Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
- Extending the Hong-Kung model to memory hierarchies (Q6064031) (← links)
