Does indirect addressing matter?

DOI10.1007/s00236-012-0171-1zbMath1259.68055OpenAlexW159110098MaRDI QIDQ1935454

Michael Brand

Publication date: 15 February 2013

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-012-0171-1

zbMATH Keywords

computational powerrandom access machinesindirect addressinguniform cost modelunit cost variable shift

Mathematics Subject Classification ID

Related Items (2)

P-RAM vs. RP-RAM ⋮ Constant-time sorting

Cites Work

• Unnamed Item
• Division in idealized unit cost RAMs
• On the power of the shift instruction
• Lower Bounds for Computations with the Floor Operation
• On pointers versus addresses
• A lower bound for integer greatest common divisor computations
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Does indirect addressing matter?