Unit-cost pointers versus logarithmic-cost addresses
From MaRDI portal
Publication:1334674
DOI10.1016/0304-3975(93)00079-KzbMath0938.68649OpenAlexW2094089655MaRDI QIDQ1334674
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Space measures for storage modification machines
- Time bounded random access machines
- On the power of the shift instruction
- Fast Algorithms for Finding Nearest Common Ancestors
- Storage Modification Machines
- On pointers versus addresses
- A nonrecursive list compacting algorithm
This page was built for publication: Unit-cost pointers versus logarithmic-cost addresses
