11784 search results - page 608 / 2357 » Interpolation for data structures |
172
click to vote
ESA
2003
Springer
16 years 12 days 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 ...
171
click to vote
SIGCSE
1999
ACM
15 years 11 months ago
1999
ACM
This paper describes a project suitable for students in CS2 that combines the classical implementation of basic data structures (priority queues, lists, arrays) with the design an...
211
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Pr...
173
click to vote
CAV
2010
Springer
15 years 11 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...
173
click to vote
MPC
2000
Springer
15 years 10 months ago
2000
Springer
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of ...