A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
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...
We present a novel approach to shape-based interpolation of gray-level volume data. In contrast to the segmentation-based techniques our method directly processes the scalar volum...
We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to loc...
Solving complex global problems such as illegal immigration, border control, and terrorism requires government organizations at all levels to share not only data but, more importa...
Seema Degwekar, Jeff DePree, Howard W. Beck, Carla...