Sciweavers

11211 search results - page 15 / 2243
» (Data) STRUCTURES
Sort
View
78
Voted
ICALP
2003
Springer
15 years 2 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
SIGCSE
1999
ACM
91views Education» more  SIGCSE 1999»
15 years 1 months ago
Using randomization in the teaching of data structures and algorithms
We describe an approach for incorporating randomization in the teaching of data structures and algorithms. The proofs we include are quite simple and can easily
Michael T. Goodrich, Roberto Tamassia
SIGCSE
2012
ACM
310views Education» more  SIGCSE 2012»
13 years 5 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...
AADEBUG
1997
Springer
15 years 1 months ago
Assertions for Dynamic Shape Analysis of List Data Structures
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
Mikhail Auguston, Miu Har Hon
FGCS
2006
125views more  FGCS 2006»
14 years 9 months ago
Compressible memory data structures for event-based trace analysis
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
Andreas Knüpfer, Wolfgang E. Nagel