11214 search results - page 3 / 2243 » Just-in-time data structures |
107
click to vote
SIGPLAN
2002
15 years 3 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...
148
Voted
SBMF
2010
Springer
14 years 10 months ago
2010
Springer
This paper presents a framework to reason about the eects of assignments in recursive data structures. We dene an operational semantics for a core language based on Meyer's id...
132
Voted
CJ
1998
15 years 3 months ago
1998
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
92
Voted
IPL
2010
15 years 2 months ago
2010
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
113
Voted
ML
2007
ACM
15 years 3 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...