Back to Results
First PageMeta Content
Computing / Computer programming / B-tree / Persistence / Persistent data structure / Binary search tree / Linked list / Rope / Tree traversal / Graph theory / Binary trees / Data structures


Making Data Structures Confluently Persistent∗ Amos Fiat† Haim Kaplan‡ Reality is merely an illusion, albeit a very persistent one.
Add to Reading List

Document Date: 2007-01-26 13:31:52

Open Document

File Size: 475,13 KB

Share Result on Facebook

Company

Fiat / /

/

Facility

Tel Aviv University / /

IndustryTerm

search key / search properties / balanced search trees / search trees / search keys / binary search tree / binary search / important applications / catenable finger search trees / naive solution / obvious solution / /

Organization

Israel Science Foundation / Tel Aviv University / Tel Aviv / /

Person

Albert Einstein / Amos Fiat† Haim Kaplan / /

/

Position

rt / single source vertex rt / /

Technology

functional programming / Random Access / simulation / non-randomized algorithms / /

SocialTag