Storage Modification Machines

Cited in

(47)

Universal quantifiers and time complexity of random access machines
In Praise of Numerical Computation
Unconventional algorithms: complementarity of axiomatics and construction
Kolmogorov and mathematical logic
The problem of space invariance for sequential machines
Space measures for storage modification machines
The 1982 ACM Turing Award lecture. An overview of computational complexity
Four Soviets walk the dog: improved bounds for computing the Fréchet distance
A Survey on Analog Models of Computation
Efficient reductions of picture words
Notes on the complexity of sorting in abstract machines
A note on predecessor searching in the pointer machine model
Homonym population protocols
Efficient algorithms for the temporal precedence problem
A logical approach to locality in pictures languages
A computational model for generic graph functions
Parallel pointer machines
Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
Even faster integer multiplication
The Level-Ancestor problem on pure pointer machines
Theoretical computer science: computability, decidability and logic
From reaction-diffusion to physarum computing
The complexity of on-line simulations between multidimensional turing machines and random access machines
Programmable reconfiguration of Physarum machines
Squeezing Feasibility
Tri-state circuits. A circuit model that captures RAM
Invariance properties of RAMs and linear time
Effective storage capacity of labeled graphs
Simulations among multidimensional Turing machines
Sorting, linear time and the satisfiability problem
Unit-cost pointers versus logarithmic-cost addresses
Multiplication
Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
Causal nets or what is a deterministic computation?
Self-modifying finite automata: An introduction
Computability of real functions with oracle pointer machines implies real-time simulation of chemical reaction networks
Time and space measures for a complete graph computation model
A Natural Axiomatization of Computability and Proof of Church's Thesis
Complexity theory of parallel time and hardware
On time versus space III
Finding a shortest vector in a two-dimensional lattice modulo m
On nondeterminism in parallel computation
A simulation result for two-way pushdown automata
A class of algorithms which require nonlinear time to maintain disjoint sets
Group Input Machine
Towards slime mould based computer
A tradeoff theorem for space and reversal

This page was built for publication: Storage Modification Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902484)