11231 search results - page 30 / 2247 » Digging for Data Structures |
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
WSS
2001
13 years 9 months ago
2001
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
SIGCSE
2005
ACM
14 years 2 months ago
2005
ACM
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
SIGCSE
1998
ACM
14 years 21 days ago
1998
ACM
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
KDD
2004
ACM
14 years 9 months ago
2004
ACM