11213 search results - page 84 / 2243 » Low-contention data structures |
125
Voted
WEBDB
2004
Springer
15 years 9 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...
129
Voted
ICALP
2003
Springer
15 years 8 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.
99
Voted
SIGCSE
1999
ACM
15 years 8 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
208
Voted
POPL
2001
ACM
16 years 4 months ago
2001
ACM
136
Voted
VSTTE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a framework for verifying that programs correctly preserve important data structure consistency properties. Results from our implemented system indicate that o...