Finger trees: a simple general-purpose data structure

Reference. Finger trees: a simple general-purpose data structure

Ralf Hinze, Ross Paterson · JFP · 2006 · PDF · DOI · pldb

Cite

Cite as @hinze-2005-finger (helia, typst) · \cite{hinze-2005-finger} (LaTeX)

BibTeX

bibtex · 11 lines

@article{hinze-2005-finger,
  author    = {Ralf Hinze and
               Ross Paterson},
  title     = {Finger trees: a simple general-purpose data structure},
  journal   = {J. Funct. Program.},
  volume    = {16},
  number    = {2},
  pages     = {197--217},
  year      = {2006},,
  doi       = {10.1017/s0956796805005769},
}

hayagriva YAML (typst)

yaml · 16 lines

hinze-2005-finger:
  type: article
  title: 'Finger trees: a simple general-purpose data structure'
  author:
  - Hinze, Ralf
  - Paterson, Ross
  date: 2006
  page-range: 197-217
  serial-number:
    doi: 10.1017/s0956796805005769
  parent:
    type: periodical
    title: J. Funct. Program.
    publisher: Cambridge University Press (CUP)
    issue: 2
    volume: 16

Download: hinze-2005-finger.bib · hinze-2005-finger.yml

Cited by (1)

On constructing 2-3 trees hinze-2018-onJFP · 2018

We consider the task of constructing 2-3 trees. Given a sequence of elements we seek to build a 2-3 tree–in linear time–that contains the elements in symmetric order. We discuss three approaches: top-down, bottom-up, and incremental. The incremental approach is more flexible than the other two in that it allows us to interleave the construction work with other operations, for example, queries.

PDF · DOI · pldb

Cites 17 works (0 here)

External (17)

Generic Haskell: Practice and theory (2003)
Haskell 98 Language and Libraries (2003)
Introduction to Algorithms (2001)
Breadth-first numbering: lessons from a small exercise in algorithm design (2000)
Purely Functional Data Structures (1998)
Functional Pearl: The Zipper (1997)
Catenable double-ended queues (1997)
Type classes: Exploring the design space (1997)
Purely functional representations of catenable sorted lists (1996)
Persistent lists with catenation via recursive slow-down (1995)
Sorting and/by merging finger trees (1992)
Making data structures persistent (1989)
Priority search trees (1985)
Self-adjusting binary search trees (1985)
AVL-trees for localized search (1985)
Polymorphic type schemes and recursive definitions (1984)
A new representation for linear lists (1977)