A lower bound is presented which shows that a class of heap algorithms in the pointer model with only heap pointers must spend Ω ( log log n log log log n ) amortized time on the Decrease-Key operation (given O(logn) amortized-time Extract-Min). Intuitively, this bound shows the key to having O(1)-time Decrease-Key is the ability to sort O(log n) items in O(log n) time; Fibonacci heaps [M. .L. ...

Two-way deterministic finite-state transducers define (partial) functions from input words to output words. This class of “regular” transductions has appealing theoretical properties, including a logical MSO-based characterization. We introduce a new kind of a transducer, heap-based (deterministic) transducer , that reads the input word from left to right in a single pass, and computes the outp...

Abstract Szklary Massif is situated about 60 km from Wrocław (southwestern Poland) and around 7 Ząbkowice Śląskie. The history of raw materials in this region started the fifteenth century with discovery precious minerals like chrysoprase, chalcedony, opal. exploitation nickel ore nineteenth was conducted few stops until 1983. remaining 17.21 mln mg 125,000 might be a chance to satisfy rising d...

There are the results of a study factors determining formation and changes in filtration properties heap leaching stack formed from pelletized poor sandy-clay ores. An analysis methods investigation ore material for different stages plots functioning is carried out. Influence segregation process during dumping on zones with very permeability parameters has been established by experimental works...

A heap structure designed for secondary storage is suggested that tries to make the best use of the available buffer space in primary memory. The heap is a complete multi-way tree, with multi-page blocks of records as nodes, satisfying a generalized heap property. A special feature of the tree is that the nodes may be partially filled, as in B-trees. The structure is complemented with priority-...

An inherently parallel algorithm is proposed that efficiently performs selection: finding the K-th largest member of a set of N members. Selection is a common component of many more complex algorithms and therefore is a widely studied problem. Not much is new in the proposed dualheap selection algorithm: the heap data structure is from J.W.J. Williams [1], the bottom-up heap construction is fro...

Let n denote the number of elements currently in a data structure. An in-place heap is stored in the first n locations of an array, uses O(1) extra space, and supports the operations: minimum , insert , and extract -min. We introduce an in-place heap, for which minimum and insert take O(1) worst-case time, and extract -min takes O(lg n) worst-case time and involves at most lg n+O(1) element com...

Despite extensive research the construction of a precise and scalable static heap analysis for object-oriented programs remains an open problem. This paper argues that much of the difficulty is the result of empirically unvalidated and inappropriate design decisions. We examine three of them and determine that in practice: (1) strong updates are not necessary for obtaining precise results (2) f...