\(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs

DOI10.1016/0890-5401(92)90078-TzbMath0755.68046OpenAlexW2032117602MaRDI QIDQ1201728

Kurt Mehlhorn, Christian Uhrig, Wolfgang J. Paul

Publication date: 17 January 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(92)90078-t

zbMATH Keywords

random accessrandom access machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• Unnamed Item
• On heads versus tapes
• Tape versus queue and stacks: The lower bounds
• On-line simulation of k + 1 tapes by k tapes requires nonlinear time

This page was built for publication: \(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs