11231 search results - page 40 / 2247 » Digging for Data Structures |
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
SIGCSE
1999
ACM
14 years 24 days ago
1999
ACM
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
POPL
2001
ACM
14 years 8 months ago
2001
ACM
AAECC
1999
Springer
13 years 8 months ago
1999
Springer
Gr
SIGPLAN
2002
13 years 8 months ago
2002
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...