Filters








6,276 Hits in 4.2 sec

Pairing heaps: the forward variant [article]

Dani Dorfman, Haim Kaplan, László Kozma, Uri Zwick
2018 arXiv   pre-print
They also proposed an arguably more natural variant, where both pairing and accumulation are performed in a combined left-to-right round (called the forward variant of pairing heaps).  ...  In this paper we show that inserting an item and deleting the minimum in a forward-variant pairing heap both take amortized time O(n· 4^√(n) ).  ...  Analysis of the forward variant of pairing heaps Before proving our main result, as a warm-up, we look at the arbitrary pairing and linking variant of pairing heaps.  ... 
arXiv:1709.01152v2 fatcat:pwn5ebllsvf2reqb4eoumy6oca

A Selectable Sloppy Heap [article]

Adrian Dumitrescu
2017 arXiv   pre-print
As such, our data structure outperforms the soft heap data structure of Chazelle (which only offers constant amortized complexity for a fixed error rate 0<ε≤ 1/2) in applications such as dynamic percentile  ...  Here we offer a data structure called selectable sloppy heap handling a dynamic version in which upon request: (i) a new element is inserted or (ii) an element of a prescribed quantile group is deleted  ...  More recently, suitable variants of Select with groups of 3 and 4 also running in O(n) time have been also put forward [10, 40] .  ... 
arXiv:1607.07673v2 fatcat:ctjmqaefezhkxfqan6j27urbny

A Distributed and Oblivious Heap [chapter]

Christian Scheideler, Stefan Schmid
2009 Lecture Notes in Computer Science  
In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends on the nodes currently in the network but not on the past.  ...  protected and operate independently of nodes "lower" in the heap.  ...  Acknowledgments The second author would like to thank Katharina Köster, Karin Lutzenberger, Tobias Tempel, Johanna Thalmann, and Benedikt Trumpp.  ... 
doi:10.1007/978-3-642-02930-1_47 fatcat:3hkgijci45ff3cibhh5g56siqi

Replacing Mark Bits with Randomness in Fibonacci Heaps [article]

Jerry Li, John Peebles
2015 arXiv   pre-print
Karger proposed a simple randomized variant of Fibonacci heaps in which mark bits are replaced by coin flips. This variant still has expected amortized cost O(1) for insert, decrease-key, and merge.  ...  We also prove a tight lower bound of Ω(√(n)) on delete-min in terms of the number of heap elements n.  ...  Additionally, there are many other works that deal with pairing F-heaps and their variants; eg., [FSST86] , [Pet05], [Elm09].  ... 
arXiv:1407.2569v3 fatcat:uhagjnxcrfh7bbuyv5zyx46ghu

Heap Abstractions for Static Analysis

Vini Kanvar, Uday P. Khedker
2016 ACM Computing Surveys  
In our search of a unified theme, we view a heap abstraction as consisting of two features: a heap model to represent the heap memory and a summarization technique for bounding the heap representation.  ...  This survey is a result of our quest for a unifying theme in the existing descriptions of heap abstractions.  ...  Acknowledgements An invigorating discussion in the Dagstuhl Seminar on Pointer Analysis [49] sowed the seeds of this survey paper.  ... 
doi:10.1145/2931098 fatcat:ocqh47fovraqtbjd35yrts6svi

Why some heaps support constant-amortized-time decrease-key operations, and others do not [article]

John Iacono
2013 arXiv   pre-print
ACM 46(4):473-501 (1999)] who showed a tradeoff between the number of augmented bits and the amortized cost of decrease-key. A new heap data structure, the sort heap, is presented.  ...  A lower bound is presented which shows that a class of heap algorithms in the pointer model with only heap pointers must spend Omega(log log n / log log log n) amortized time on the decrease-key operation  ...  We call such a variant of rank pairing heaps a pointer Rank-Pairing heap, and list in in Table 1 .  ... 
arXiv:1302.6641v3 fatcat:f63whiaw3fe2fjt6b4gu54mduu

Logical Characterizations of Heap Abstractions [article]

G. Yorsh, T. Reps, M. Sagiv, R. Wilhelm
2005 arXiv   pre-print
Shape analysis concerns the problem of determining "shape invariants" for programs that perform destructive updating on dynamically allocated storage.  ...  In that work, concrete stores are finite 2-valued logical structures, and the sets of stores that can possibly arise during execution are represented (conservatively) using a certain family of finite 3  ...  Embedding can be viewed as a variant of homomorphism [13] .  ... 
arXiv:cs/0312014v3 fatcat:4t4hf7iofbd7rlr7oziwdg3lbe

Dynamic Optimality Refuted – For Tournament Heaps [article]

J. Ian Munro, Richard Peng, Sebastian Wild, Lingyi Zhang
2019 arXiv   pre-print
Critical to this analysis is the characterization of the modifications that a heap can undergo upon an access. There are (Θ(n logn)) valid heaps on n keys, but only (Θ(n)) binary search trees.  ...  They represent a natural starting point for studying self-adjusting heaps due to the need to access the root-to-leaf path upon modifications.  ...  pairing heaps.  ... 
arXiv:1908.00563v1 fatcat:xck56oczsjg2fewt2n4t5wbc4y

HALO: post-link heap-layout optimisation

Joe Savage, Timothy M. Jones
2020 Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization  
To help alleviate these issues, we propose HALO: a postlink profile-guided optimisation tool that can improve the layout of heap data to reduce cache misses automatically.  ...  Today, general-purpose memory allocators dominate the landscape of dynamic memory management.  ...  Additional data related to this publication is available in the data repository at https://doi.org/10.17863/CAM.46071.  ... 
doi:10.1145/3368826.3377914 dblp:conf/cgo/SavageJ20 fatcat:lmr4btnnjzdkticd3sjj477k4e

On Sorting, Heaps, and Minimum Spanning Trees

Gonzalo Navarro, Rodrigo Paredes
2010 Algorithmica  
QHs are competitive with pairing heaps [16] and up to four times faster than binary heaps [42] (according to [27] , these are the fastest priority queue implementations in practice).  ...  Using the same amount of memory, our external QH perform up to 3 times fewer I/O accesses than R-Heaps [1] and up to 5 times fewer than Array-Heaps [8], which are the best alternatives tested in the survey  ...  We wish to thank the helpful and constructive comments from Peter Sanders and the anonymous referees.  ... 
doi:10.1007/s00453-010-9400-6 fatcat:efsxvf67xja4pbffe2wcwwke7a

Runtime specialization with optimistic heap analysis

Ajeet Shankar, S. Subramanya Sastry, Rastislav Bodík, James E. Smith
2005 Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming systems languages and applications - OOPSLA '05  
The specializer is powerful, because it specializes optimistically, using (potentially transient) constants in the heap; it is precise, because it specializes using data structures that are only partially  ...  These properties are the result of (1) a new algorithm for selecting specializable code fragments, based on a notion of influence; (2) a precise store profile for identifying constant heap locations; and  ...  This work is supported in part by the National Science Foundation, with grants CCF-0085949, CCR-0105721, CCR-0243657, CNS-0225610, CCR-0326577, an award from University of California MICRO program, the  ... 
doi:10.1145/1094811.1094837 dblp:conf/oopsla/ShankarSBS05 fatcat:oq7oowp3rngrbog4czz3ehlmvu

Runtime specialization with optimistic heap analysis

Ajeet Shankar, S. Subramanya Sastry, Rastislav Bodík, James E. Smith
2005 SIGPLAN notices  
The specializer is powerful, because it specializes optimistically, using (potentially transient) constants in the heap; it is precise, because it specializes using data structures that are only partially  ...  These properties are the result of (1) a new algorithm for selecting specializable code fragments, based on a notion of influence; (2) a precise store profile for identifying constant heap locations; and  ...  This work is supported in part by the National Science Foundation, with grants CCF-0085949, CCR-0105721, CCR-0243657, CNS-0225610, CCR-0326577, an award from University of California MICRO program, the  ... 
doi:10.1145/1103845.1094837 fatcat:d7flmjlo6nbkjg45onfsizjl44

Atomic heap transactions and fine-grain interrupts

Olin Shivers, James W. Clark, Roland McGrath
1999 SIGPLAN notices  
Otherwise, a heap client might access the heap during a time when its fundamental invariants do not hold, corrupting the heap.  ...  The two fundamental operations performed on a garbagecollected heap are "allocate" and "collect."  ...  The heap is always consistent. And we always proceed forwards.  ... 
doi:10.1145/317765.317783 fatcat:bqhiope2wzdrnff4ysr2gbl7hi

Atomic heap transactions and fine-grain interrupts

Olin Shivers, James W. Clark, Roland McGrath
1999 Proceedings of the fourth ACM SIGPLAN international conference on Functional programming - ICFP '99  
Otherwise, a heap client might access the heap during a time when its fundamental invariants do not hold, corrupting the heap.  ...  The two fundamental operations performed on a garbagecollected heap are "allocate" and "collect."  ...  The heap is always consistent. And we always proceed forwards.  ... 
doi:10.1145/317636.317783 dblp:conf/icfp/ShiversCM99 fatcat:ylqsx2jfubcufk4y3gdjlfvafa

Efficient sparse polynomial factoring using the Funnel heap [article]

Fatima K. Abu Salem and Khalil El-Harake and Karl Gemayel
2016 arXiv   pre-print
Additionally, we conduct a detailed empirical study confirming the superiority of Funnel Heap over the generic Binary Heap once swaps to external memory begin to take place.  ...  Funnel Heap.  ...  Acknowledgments We thank the Lebanese National Council for Scientific Research and the University Research Board -American University of Beirut, for supporting this work. References  ... 
arXiv:1612.05403v1 fatcat:nnubi4w3rza3hh6tlzxefokh34
« Previous Showing results 1 — 15 out of 6,276 results