SIGCSE
2012
ACM
12 years 23 hour ago
2012
ACM
We present CSTutor, a sketch-based interface designed to help students understand data structures. It currently supports Linked Lists, Binary Search Trees, AVL Trees, and Heaps, a...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
SIAMCOMP
1998
13 years 4 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
SODA
2008
ACM
13 years 5 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
ESA
2006
Springer
13 years 6 months ago
2006
Springer
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
CCS
2000
ACM
13 years 8 months ago
2000
ACM
This paper initiates a study of accountable certificate management methods, necessary to support long-term authenticity of digital documents. Our main contribution is a model for ...
CPE
1997
Springer
13 years 8 months ago
1997
Springer
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
ECAI
1998
Springer
13 years 8 months ago
1998
Springer
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
Book
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This
book provides an introduction to binary tree techniques and presents all of Libavl’s ...