Sciweavers

11211 search results - page 83 / 2243
» Rank-Sensitive Data Structures
Sort
View
ICALP
2003
Springer
15 years 5 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
76
Voted
SIGCSE
1999
ACM
91views Education» more  SIGCSE 1999»
15 years 5 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
VSTTE
2005
Springer
15 years 6 months ago
Implications of a Data Structure Consistency Checking System
Abstract. We present a framework for verifying that programs correctly preserve important data structure consistency properties. Results from our implemented system indicate that o...
Viktor Kuncak, Patrick Lam, Karen Zee, Martin C. R...
90
Voted
ACSAC
2008
IEEE
15 years 7 months ago
Automatic Inference and Enforcement of Kernel Data Structure Invariants
Kernel-level rootkits affect system security by modifying key kernel data structures to achieve a variety of malicious goals. While early rootkits modified control data structur...
Arati Baliga, Vinod Ganapathy, Liviu Iftode