On pointers versus addresses

DOI10.1145/146637.146666zbMath0799.68114OpenAlexW2083481894MaRDI QIDQ4302806

Zvi Galil, Amir M. Ben-Amram

Publication date: 21 August 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/146637.146666

zbMATH Keywords

incompressibilityrandom access machineRAMrandom access memorypointer structures

Mathematics Subject Classification ID

Related Items (8)

Sequential and parallel algorithms for the NCA problem on pure pointer machines ⋮ Unit-cost pointers versus logarithmic-cost addresses ⋮ When can we sort in \(o(n\log n)\) time? ⋮ P-RAM vs. RP-RAM ⋮ Does indirect addressing matter? ⋮ Dynamic normal forms and dynamic characteristic polynomial ⋮ Sorting, linear time and the satisfiability problem ⋮ Lower bounds for dynamic algebraic problems

This page was built for publication: On pointers versus addresses