Unit-cost pointers versus logarithmic-cost addresses

DOI10.1016/0304-3975(93)00079-KMaRDI QIDQ1334674zbMATH OpenOpenAlexFDO

Authors Amir M. Ben-Amram

Publication date 25 September 1994

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(93)00079-k

Mathematics Subject Classification ID

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A class of algorithms which require nonlinear time to maintain disjoint sets
• A nonrecursive list compacting algorithm
• Fast Algorithms for Finding Nearest Common Ancestors
• On pointers versus addresses
• On the power of the shift instruction
• Space measures for storage modification machines
• Storage Modification Machines
• Time bounded random access machines

This page was built for publication: Unit-cost pointers versus logarithmic-cost addresses

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