Finger trees: a simple general-purpose data structure

DOI10.1017/S0956796805005769zbMATH Open1088.68041WikidataQ59595142 ScholiaQ59595142MaRDI QIDQ3377461FDOQ3377461

Authors: Ralf Hinze, Ross Paterson 

Publication date: 22 March 2006

Published in: Journal of Functional Programming (Search for Journal in Brave)

Recommendations

• Program-ing finger trees in Coq
• scientific article; zbMATH DE number 1256736
• scientific article; zbMATH DE number 218385
• scientific article; zbMATH DE number 1303596
• scientific article; zbMATH DE number 2079361

zbMATH Keywords

search treepriority queuepriority search queue

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (16)

• Genetic programming \(+\) proof search \(=\) automatic improvement
• Efficient implementation of linearly used finite maps
• Inductive benchmarking for purely functional data structures
• Title not available (Why is that?)
• Calculating datastructures
• Title not available (Why is that?)
• Multi-Finger Binary Search Trees
• Calculating a linear-time solution to the densest-segment problem
• Efficient parallel and incremental parsing of practical context-free languages
• Refinement to Imperative/HOL
• Towards an induction principle for nested data types
• Lazy tree splitting
• Shape Neutral Analysis of Graph-based Data-structures
• Purely Functional 1-2 Brother Trees
• Title not available (Why is that?)
• On constructing 2-3 trees

This page was built for publication: Finger trees: a simple general-purpose data structure

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