As an alternative to the Fibonacci heap, we design a new data structure called a 2-3 heap, which supports m decrease-key, and n insert operations and delete-min operations in O(m + n log n) time. The merit of the 2-3 heap is that it is conceptually simpler and easier to implement. The new data structure will have a wide application in

We argue that the limit of the propagation of the heap effects of a source code modification is determined by the aliasing structure of method parameters in a trace of the method calls that cross a boundary which partitions the heap. Further, that this aliasing structure is sufficient to uniquely determine the state of the part of the heap which has not been affected. And we give a definition o...

We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Unlike all other heap implementations that match the bounds of Fibonacci heaps, our structure needs only one cut and no other structural changes per key decrease; the trees representing the heap can evolve to have arb...

Analytical models are of vital importance to study the dynamics complex systems, including heap leaching process. In this work, a methodology copper recovery in by means fit analytical that capture product variations agents as function feeding is proposed, establishing first mode operation keeping agent fixed (H2SO4) and second mode, where Cl− added accelerate reaction kinetics sulfide minerals...