4536 search results - page 252 / 908 » Contention-Sensitive Data Structures and Algorithms |
133
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
106
click to vote
ESA
2003
Springer
15 years 7 months ago
2003
Springer
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
107
click to vote
CAV
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
SIGOPS
2010
15 years 26 days ago
2010
We develop techniques that make authenticated directories efficient and scalable toward the goal of managing tens of billions of objects in a single directory. Internet storage s...
131
click to vote
FPCA
1995
15 years 6 months ago
1995
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...