Back to Results
First PageMeta Content
Software engineering / Binary trees / Computer programming / Sorting algorithms / Linked list / Persistent data structure / Double-ended queue / Queue / Stack / Abstract data types / Data structures / Computing


Mergeable persistent data structures Benjamin Farinier1 , Thomas Gazagnaire2 and Anil Madhavapeddy2 1: ENS Lyon [removed] 2: University of Cambridge [removed]
Add to Reading List

Document Date: 2014-12-01 17:47:14

Open Document

File Size: 266,02 KB

Share Result on Facebook

/

Facility

Irmin store / University of Cambridge thomas.gazagnaire@cl.cam.ac.uk anil.madhavapeddy@cl.cam.ac.uk Abstract Irmin / Core library / /

IndustryTerm

application developer / version-control systems / software projects / higher-level algorithms / binary search tree / binary search / large software stacks / distributed applications / /

Organization

University of Cambridge thomas.gazagnaire@cl.cam.ac.uk anil.madhavapeddy@cl.cam.ac.uk Abstract Irmin / /

Position

proof assistant / /

Technology

functional programming / RAM / instance using SHA algorithms / html / higher-level algorithms / API / /

URL

http /

SocialTag