Sciweavers

11231 search results - page 40 / 2247
» Digging for Data Structures
Sort
View
ICALP
2003
Springer
15 years 4 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 3 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
POPL
2001
ACM
15 years 11 months ago
BI as an Assertion Language for Mutable Data Structures
Samin S. Ishtiaq, Peter W. O'Hearn
75
Voted
SIGPLAN
2002
14 years 10 months ago
Pattern-matching and rewriting rules for group indexed data structures
In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-ba...
Jean-Louis Giavitto, Olivier Michel, Julien Cohen