Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SIGCSE
2012
ACM
310views Education» more  SIGCSE 2012»
10 years 3 months ago
CSTutor: a pen-based tutor for data structure visualization
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...
Sarah Buchanan, Brandon Ochs, Joseph J. LaViola Jr...
CORR
2011
Springer
215views Education» more  CORR 2011»
11 years 2 months ago
The total path length of split trees
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...
Nicolas Broutin, Cecilia Holmgren
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
11 years 7 months ago
Universal Limit Laws for Depths in Random Trees
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...
Luc Devroye
CORR
2004
Springer
118views Education» more  CORR 2004»
11 years 7 months ago
Understanding Search Trees via Statistical Physics
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...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
11 years 9 months ago
Dynamic optimality for skip lists and B-trees
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 [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...
ESA
2006
Springer
125views Algorithms» more  ESA 2006»
11 years 10 months ago
Purely Functional Worst Case Constant Time Catenable Sorted Lists
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...
Gerth Stølting Brodal, Christos Makris, Kos...
CCS
2000
ACM
11 years 11 months ago
Accountable certificate management using undeniable attestations
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 ...
Ahto Buldas, Peeter Laud, Helger Lipmaa
CPE
1997
Springer
79views Hardware» more  CPE 1997»
12 years 5 days ago
Storage Alternatives for Large Structured State Spaces
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...
Gianfranco Ciardo, Andrew S. Miner
ECAI
1998
Springer
12 years 7 days ago
Metaprogramming Forced Moves
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...
Tristan Cazenave

Book
2145views
13 years 5 months ago
An Introduction to Binary Search Trees and Balanced Trees
"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 ...
Ben Pfaff
books