Mergeable heap

Interactive analytics increasingly involves querying for quantiles over specific sub-populations and time windows of high… Expand

In this paper we put forward a new generalization of Functional Encryption (FE) that we call Mergeable FE (mFE). In a mFE system… Expand

In structured overlay networks with millions of nodes, it is essential to optimize the extent to which routing paths are… Expand

In 1998, Chazelle [J. ACM, 47 (2000), pp. 1012--1027] introduced a new kind of meldable heap (priority queue) called the soft… Expand

We introduce a meldable heap which guarantees the worst-case cost of O(1) for find-min, insert, and meld with at most 0, 3, and 3… Expand

AbstractWe present a data structure, based upon a hierarchically decomposed tree, which enables us to manipulate on-line a… Expand

In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations find-min, insert… Expand

In this paper we explore two themes in data structure design: amortized computational complexity and self adjustment. We are… Expand

We present a data structure, based upon a stratified binary tree, which enables us to manipulate on-line a priority queue whose… Expand