Different modifications of pointer machines and their computational power. (Extended abstract)

DOI10.1007/3-540-54345-7_86MaRDI QIDQ4035265zbMATH OpenFDO

Authors K. V. Shvachko

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54345-7_86

zbMATH Keywords

Kolmogorov-Uspensky machinespointer machinesstorage modification machines

Mathematics Subject Classification ID

Recommendations

• Computing with a fixed number of pointers (invited talk)
• Hierarchies and space measures for pointer machines
• Variations on pushdown machines (Detailed Abstract)
• A note on predecessor searching in the pointer machine model
• Parallel pointer machines
• Sorting on a parallel pointer machine with applications to set expression evaluation
• Lower bounds on the complexity of simplex range reporting on a pointer machine (extended abstract)
• Modified branching programs and their computational power

Cited in

(3)

• Space measures for storage modification machines
• k versus k+1 index registers and modifiable versus non-modifiable programs
• From reaction-diffusion to physarum computing

This page was built for publication: Different modifications of pointer machines and their computational power. (Extended abstract)

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