Random-Access Lists, from EE to FP
Abstract elided by the publisher.
Related papers
- Pushing the Information-Theoretic Limits of Random Access Lists: Traversing Cons Lists in (1 + 1/𝜎 ) ⌊lg 𝑛⌋ + 𝜎 + 9 Steps ICFP 2025
- Heterogeneous binary random-access lists JFP 2020
- A separation logic for concurrent randomized programs POPL 2019
- Perfect trees and bit-reversal permutations JFP 2000
- The SprayList: a scalable relaxed priority queue PPoPP 2015
- Bootstrapping one-sided flexible arrays ICFP 2002
- Inductive benchmarking for purely functional data structures JFP 2001
- Distributed Random Number Generation JFP 1992