11212 search results - page 245 / 2243 » Semi-persistent Data Structures |
161
click to vote
IFL
2007
Springer
16 years 20 days ago
2007
Springer
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
185
click to vote
WEBDB
2004
Springer
15 years 12 months ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
173
click to vote
ICALP
2003
Springer
15 years 11 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.
132
click to vote
SIGCSE
1999
ACM
15 years 10 months 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
