scientific article; zbMATH DE number 1256736
From MaRDI portal
Publication:4228472
Recommendations
Cited in
(18)- Regular numeral systems for data structures
- Inductive benchmarking for purely functional data structures
- Purely functional, real-time deques with catenation
- Finger trees: a simple general-purpose data structure
- Efficient implementation of linearly used finite maps
- scientific article; zbMATH DE number 1263185 (Why is no real title available?)
- Optimal purely functional priority queues
- Simple Confluently Persistent Catenable Lists
- Purely Functional Data Structures
- scientific article; zbMATH DE number 1874367 (Why is no real title available?)
- A generic functional representation of sorted trees supporting attribution (Haskell can do it)
- Numerical representations as purely functional data structures
- Simple confluently persistent catenable lists
- Multi-Finger Binary Search Trees
- Regular and First-Order List Functions
- A representation for linear lists with movable fingers
- Purely Functional Worst Case Constant Time Catenable Sorted Lists
- Dynamic layers of maxima with applications to dominating queries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228472)