Treap

Results: 19



#Item
11Computer programming / Skip list / Linked list / Splay tree / Binary search tree / Tree traversal / Self-balancing binary search tree / Treap / Quicksort / Binary trees / Graph theory / Computing

Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as

Add to Reading List

Source URL: epaperpress.com

Language: English - Date: 2006-11-06 09:35:09
12Computer programming / Skip list / Linked list / Splay tree / Binary search tree / Tree traversal / Self-balancing binary search tree / Treap / Quicksort / Binary trees / Graph theory / Computing

Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as

Add to Reading List

Source URL: ftp.cs.umd.edu

Language: English - Date: 1999-03-05 16:45:12
13Computer programming / Binary search tree / B-tree / Linked list / Tree / Trie / Splay tree / Treap / Self-balancing binary search tree / Binary trees / Graph theory / Computing

Lecture III Page 1 “Trees are the earth’s endless effort to speak to the listening heaven.” – Rabindranath Tagore, Fireflies, 1928

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2012-09-24 18:59:56
14Error detection and correction / Computing / Computer programming / Search algorithms / Treap / Hash tree / Hash function / Binary search tree / Cryptographic hash function / Cryptography / Hashing / Binary trees

Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure Tobias Pulls Roel Peeters

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-01-15 08:57:40
15Computing / Treap / Binary search tree / B-tree / Tree / Rope / Search tree / R-tree / Weight-balanced tree / Binary trees / Graph theory / Data management

Super-efficient Aggregating History-independent Persistent Authenticated Dictionaries? Scott A. Crosby and Dan S. Wallach Rice University, {scrosby,dwallach}@cs.rice.edu Abstract. Authenticated dictionaries allow users

Add to Reading List

Source URL: accurate-voting.org

Language: English - Date: 2013-06-05 15:32:08
16Computing / Treap / Binary search tree / B-tree / Tree / Self-balancing binary search tree / T-tree / R-tree / Trie / Binary trees / Graph theory / Data management

Abstract Authenticated dictionaries are a widely discussed paradigm to enable verifiable integrity for data storage on untrusted servers, such as today’s widely used “cloud computing” resources, allowing a server t

Add to Reading List

Source URL: tamperevident.cs.rice.edu

Language: English - Date: 2010-12-14 09:04:54
17Splay tree / Treap / Binary search tree / Self-balancing binary search tree / Heap / Red–black tree / B-tree / AVL tree / Tree traversal / Binary trees / Graph theory / Computing

Spring[removed]: Advanced Data Structures Lecture 5 — March 1, 2012 Prof. Erik Demaine

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2014-02-25 15:05:08
18Cartesian tree / Binary search tree / Self-balancing binary search tree / Splay tree / Scapegoat tree / Rope / Skip list / B-tree / Segment tree / Binary trees / Graph theory / Treap

Randomized Search Trees Raimund Seidel Computer Science Division

Add to Reading List

Source URL: people.ischool.berkeley.edu

Language: English - Date: 2004-12-14 00:43:14
19Computing / Data management / Computer programming / Binary search tree / Treap / Min-max heap / Binary trees / Priority queue / Heap

PDF Document

Add to Reading List

Source URL: www.uniriotec.br

Language: English - Date: 2012-10-05 19:23:54
UPDATE