相关论文: Improved Upper Bounds for Pairing Heaps

Ordered sets and maps play important roles as index structures in relational data models. When a shared index in a multi-user system is modified concurrently, the current state of the index will diverge into multiple versions containing the…

The smooth heap and the closely related slim heap are recently invented self-adjusting implementations of the heap (priority queue) data structure. We analyze the efficiency of these data structures. We obtain the following amortized bounds…

A common form of MapReduce application involves discovering relationships between certain pairs of inputs. Similarity joins serve as a good example of this type of problem, which we call a "some-pairs" problem. In the framework of Afrati et…

In a recent paper, Melbourne and Terhesiu [Operator renewal theory and mixing rates for dynamical systems with infinite measure, Invent. Math. 189 (2012), 61-110] obtained results on mixing and mixing rates for a large class of…

We consider the matching augmentation problem (MAP), where a matching of a graph needs to be extended into a $2$-edge-connected spanning subgraph by adding the minimum number of edges to it. We present a polynomial-time algorithm with an…

We introduce a new family of priority-queue data structures: partition-based simple heaps. The structures consist of $O(\log n)$ doubly-linked lists; order is enforced among data in different lists, but the individual lists are unordered.…

We define a pairing map $\pi_{\mathsf{CL}} : \mathbb{N}^2\to\mathbb{N}$ that encodes $x$ and $y$ into two disjoint bands of Zeckendorf indices separated by a delimiter computed from $x$. The construction is "carryless" by design: the…

It is known that random variables have the Riesz decomposition property and the interpolation property. These properties are not only interesting in their own rights; they have been applied to quantitative finance and actuarial mathematics.…

In this paper, we study the polyhedral structure of an integrated minimum-up/-down time and ramping polytope, which has broad applications in variant industries. The polytope we studied includes minimum-up/-down time, generation…

We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two classical algorithms for data structure maintenance. The pairing heap is a simple and efficient "self-adjusting" heap, introduced in 1986 by Fredman,…

We show that, by using multiplicative weights in a game-theoretic thought experiment (and an important convexity result on the composition of multiplicative weights with the relative entropy function), a symmetric bimatrix game (that is, a…

This work is based on the double correlated linear aggregations of holes in checkerboard geometry. It is proved that the pairing function symmetry is - d(x*x-y*y), as been observed experimentally. It is also shown that there is a…

We show that coupled autonomous thermal machines, in the presence of three heat reservoirs and following a global linear-irreversible description, provide a unified framework to accommodate the variety of expressions for the efficiency at…

We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…

This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…

Time dependent entropy of harmonic oscillator with time dependent mass and frequency are investigated. The joint entropy so called Leipnik's entropy is calculated by using time dependent wave function obtained by the Feynman path integral…

We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and…

The present paper addresses the swing equation with additional delayed damping as an example for pendulum-like systems. In this context, it is proved that recurring sub- and supercritical Hopf bifurcations occur if time delay is increased.…

We investigate the Emery model on several ladder-like lattices including two legs of copper d-orbitals and various numbers of oxygen p-orbitals. Pair binding energy, pair spatial structure, density distribution, and pairing correlation…

Spin chains with open boundaries, such as the transverse field Ising model, can display coherence times for edge spins that diverge with the system size as a consequence of almost conserved operators, the so-called strong zero modes. Here,…