The following pages link to Storage Modification Machines (Q3902484):
Displaying 43 items.
- Efficient algorithms for the temporal precedence problem (Q293412) (← links)
- A logical approach to locality in pictures languages (Q295631) (← links)
- Even faster integer multiplication (Q306687) (← links)
- Unconventional algorithms: complementarity of axiomatics and construction (Q406192) (← links)
- A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
- Homonym population protocols (Q722223) (← links)
- From reaction-diffusion to physarum computing (Q734218) (← links)
- A tradeoff theorem for space and reversal (Q797282) (← links)
- Programmable reconfiguration of Physarum machines (Q968402) (← links)
- A note on predecessor searching in the pointer machine model (Q989469) (← links)
- The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
- Notes on the complexity of sorting in abstract machines (Q1068551) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- The problem of space invariance for sequential machines (Q1102112) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Space measures for storage modification machines (Q1119021) (← links)
- Simulations among multidimensional Turing machines (Q1165001) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Invariance properties of RAMs and linear time (Q1327595) (← links)
- Unit-cost pointers versus logarithmic-cost addresses (Q1334674) (← links)
- Self-modifying finite automata: An introduction (Q1350286) (← links)
- Finding a shortest vector in a two-dimensional lattice modulo m (Q1392031) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- A simulation result for two-way pushdown automata (Q1838834) (← links)
- Parallel pointer machines (Q2366720) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- Squeezing Feasibility (Q3188242) (← links)
- Group Input Machine (Q3599100) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- In Praise of Numerical Computation (Q3644734) (← links)
- Universal quantifiers and time complexity of random access machines (Q3699679) (← links)
- On time versus space III (Q3745280) (← links)
- The complexity of on-line simulations between multidimensional turing machines and random access machines (Q4013406) (← links)
- Kolmogorov and mathematical logic (Q4032626) (← links)
- Towards Slime Mould Based Computer (Q4598044) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- A computational model for generic graph functions (Q5096281) (← links)
- (Q5150372) (← links)
- Efficient reductions of picture words (Q5286054) (← links)
- Causal nets or what is a deterministic computation? (Q5905276) (← links)
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees (Q5958114) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
