Related papers: ELB-Trees, An Efficient and Lock-free B-tree Deriv…
A Blink Tree latch method and protocol supports synchronous node deletion in a high concurrency environment. Full source code is available.
We prove the equivalence of EL-shellability and the existence of recursive atom ordering independent of roots. We show that a comodernistic lattice, as defined by Schweig and Woodroofe, admits a recursive atom ordering independent of roots,…
An anytime decoding algorithm for tree codes using Monte-Carlo tree search is proposed. The meaning of anytime decoding here is twofold: 1) the decoding algorithm is an anytime algorithm, whose decoding performance improves as more…
We present a closed form expression for |V_{ub}|^2/ |V_{tb} V_{ts}^*|^2 in terms of the endpoint photon and lepton spectra from the inclusive decays B -> X_s\gamma and B -> X_u\ell\nu, respectively, which includes the resummation of the…
To maximize the performance of concurrent data structures, researchers have often turned to highly complex fine-grained techniques, resulting in efficient and elegant algorithms, which can however be often difficult to understand and prove…
A significant impediment to high performance in key-value stores is the high cost of thread switching or stalls. While there are many sources for this, a major one is the contention for resources. And this cost increases with load as…
We use edge slidings and saturated disjoint Borel families to give a conceptually simple proof of Hjorth's theorem on cost attained: if a countable p.m.p. ergodic equivalence relation $E$ is treeable and has cost $n \in \mathbb{N} \cup…
The B-tree is a fundamental secondary index structure that is widely used for answering one-dimensional range reporting queries. Given a set of $N$ keys, a range query can be answered in $O(\log_B \nm + \frac{K}{B})$ I/Os, where $B$ is the…
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow epsilon-contractions and reachability predicates (with regular constraints) for pairs of configurations, the structures remain…
We introduce and study the index morphism for G-invariant leafwise G-transversally elliptic operators on smooth closed foliated manifolds which are endowed with leafwise actions of the compact group G. We prove the usual axioms of excision,…
We present an efficient lock-free algorithm for parallel accessible hash tables with open addressing, which promises more robust performance and reliability than conventional lock-based implementations. ``Lock-free'' means that it is…
We study learning-augmented binary search trees (BSTs) via Treaps with carefully designed priorities. The result is a simple search tree in which the depth of each item $x$ is determined by its predicted weight $w_x$. Specifically, each…
Database Management Systems and K/V-Stores operate on updatable datasets -- massively exceeding the size of available main memory. Tree-based K/V storage management structures became particularly popular in storage engines. B+ Trees allow…
A BC-tree (block-cutpoint-tree) is a tree (with at least two vertices) where the distance between any two leaves is even. Motivated from the study of the "core" of a graph, BC-trees provide an interesting class of trees. We consider…
We show that the equivalence of deterministic linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to express XML and…
We give a systematic way to compute higher orders in the 1/m_b expansion in inclusive semi-leptonic decays at tree level. We reproduce the known 1/m_b^3 terms and compute the 1/m_b^4 terms at tree level. The appearing non-perturbative…
We give an algorithm to enumerate the results on trees of monadic second-order (MSO) queries represented by nondeterministic tree automata. After linear time preprocessing (in the input tree), we can enumerate answers with linear delay (in…
The tree is an essential data structure in many applications. In a distributed application, such as a distributed file system, the tree is replicated.To improve performance and availability, different clients should be able to update their…
The paper proposes a new static analysis designed to handle open programs, i.e., fragments of programs, with dynamic pointer-linked data structures - in particular, various kinds of lists - that employ advanced low-level pointer operations.…
A tremendous range of design tasks in materials, physics, and biology can be formulated as finding the optimum of an objective function depending on many parameters without knowing its closed-form expression or the derivative. Traditional…