Filters








230 Hits in 2.2 sec

Fibonacci Heaps Revisited [article]

Haim Kaplan and Robert E. Tarjan and Uri Zwick
2014 arXiv   pre-print
The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time and all other heap operations in O(1) amortized time.  ...  We propose a version with the following improvements over the original: (i) Each heap is represented by a single heap-ordered tree, instead of a set of trees.  ...  We have shown that without cascading rank changes, our data structure does not have the efficiency of Fibonacci heaps, solving an open problem of Fredman [8] .  ... 
arXiv:1407.5750v1 fatcat:d7v2f4n2sfbpjp66t4onfa4u5q

A Back-to-Basics Empirical Study of Priority Queues [chapter]

Daniel H. Larkin, Siddhartha Sen, Robert E. Tarjan
2013 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX)  
The theory community has proposed several new heap variants in the recent past which have remained largely untested experimentally.  ...  We also provide observations about how the input sequence affects the relative performance of the different heap variants.  ...  heaps, violation heaps, rank-relaxed weak queues, and strict Fibonacci heaps.  ... 
doi:10.1137/1.9781611973198.7 dblp:conf/alenex/LarkinST14 fatcat:ss67rxjgpnh3djv7mnsob3dfia

A Back-to-Basics Empirical Study of Priority Queues [article]

Daniel H. Larkin, Siddhartha Sen, Robert E. Tarjan
2014 arXiv   pre-print
The theory community has proposed several new heap variants in the recent past which have remained largely untested experimentally.  ...  We also provide observations about how the input sequence affects the relative performance of the different heap variants.  ...  heaps, violation heaps, rank-relaxed weak queues, and strict Fibonacci heaps.  ... 
arXiv:1403.0252v1 fatcat:jcslwnd4rnan5f3qdp75aifvj4

Task-based augmented merge trees with Fibonacci heaps

Charles Gueunet, Pierre Fortin, Julien Jomier, Julien Tierny
2017 2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)  
Our approach completely revisits the traditional, sequential merge tree algorithm to re-formulate the computation as a set of independent local tasks based on Fibonacci heaps.  ...  This new approach makes use of the Fibonacci heaps to completely revisit the traditional algorithm and compute the merge tree using independent local growths which can be expressed using tasks.  ...  A local algorithm based on Fibonacci heaps: We present a new algorithm for the computation of augmented merge trees.  ... 
doi:10.1109/ldav.2017.8231846 dblp:conf/ldav/GueunetFJT17 fatcat:caf6x3vh5ff2xmca4xaftfkqei

Task-based Augmented Contour Trees with Fibonacci Heaps [article]

Charles Gueunet, J Jomier, J Tierny
2019 arXiv   pre-print
This includes a new computation procedure based on Fibonacci heaps for the join and split trees, two intermediate data structures used to compute the contour tree, whose constructions are efficiently carried  ...  Our approach completely revisits the traditional, sequential contour tree algorithm to re-formulate all the steps of the computation as a set of independent local tasks.  ...  This new approach makes use of the Fibonacci heaps to completely revisit the traditional algorithm and compute the contour tree using independent local growths which can be expressed using tasks.  ... 
arXiv:1902.04805v1 fatcat:vld6jh7iv5gi3jw7qxgkrm4h4a

Task-based Augmented Contour Trees with Fibonacci Heaps

Charles Gueunet, Pierre Fortin, Julien Tierny, Julien Jomier
2019 IEEE Transactions on Parallel and Distributed Systems  
This new approach makes use of the Fibonacci heaps to completely revisit the traditional algorithm and compute the contour tree using independent local growths which can be expressed using tasks.  ...  At Figure 2 : Overview of our augmented merge tree algorithm based Fibonacci heaps (2D toy elevation example).  ... 
doi:10.1109/tpds.2019.2898436 fatcat:acggevv3xfclngp5vdohszxk7a

Automated Planning and Model Checking (Dagstuhl Seminar 14482)

Alessandro Cimatti, Stefan Edelkamp, Maria Fox, Daniele Magazzeni, Erion Plaku, Marc Herbstritt
2015 Dagstuhl Reports  
Zwick, "Fibonacci heaps revisited," arXiv:1407.5750v1 [cs.DS], 2014. URL http://arxiv.org/abs/1407.5750v1 . V. Aho, M. R. Garey, J. D.  ...  Last but not least, we will look at the latest developments of Fibonacci heaps, comparing enhanced lazy Fibonacci heaps that apply naive linkage in the consolidation with a 2014 proposal of simple Fibonacci  ... 
doi:10.4230/dagrep.4.11.227 dblp:journals/dagstuhl-reports/CimattiEFMP14 fatcat:ukc75llezvg2jevqaytqouvzje

The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(ka 1) [chapter]

Sebastian Böcker, Zsuzsanna Lipták
2005 Lecture Notes in Computer Science  
) is much higher for a Fibonacci heap.  ...  This algorithm has runtime O(k a 1 log a 1 ) using binary heaps, and O(a 1 (k +log a 1 )) using Fibonacci heaps as the priority queue.  ... 
doi:10.1007/11533719_97 fatcat:p5ykaahuzjhcznjlaa2oskhkaa

Degree-sequenced matching algorithms for input-queued switches

Madhusudan Hosaagrahara, Harish Sethu
2006 Telecommunications Systems  
, and the amortized cost of an insertion to a Fibonacci Heap is O(1).  ...  Complexity We derive the worst-case time-complexity assuming that the algorithm uses a Fibonacci Heap.  ... 
doi:10.1007/s11235-006-9024-y fatcat:eqtyrpg2wnhcnoxxekdzelcyci

Page 6199 of Mathematical Reviews Vol. , Issue 95j [page]

1995 Mathematical Reviews  
Kingston, Are Fibonacci heaps optimal? (442-450); Oscar H. Ibarra and Nicholas Q.  ...  Lee [Der Tsai Lee], k best cuts for circular-arc graphs (550-558); Lin Chen [Lin Chen], Revisiting circular arc graphs (559-566); C.  ... 

Monadic Memoization towards Correctness-Preserving Reduction of Search [chapter]

Richard Frost
2003 Lecture Notes in Computer Science  
Memoization is a well-known method which makes use of a table of previously-computed results in order to ensure that parts of a search (or computation) space are not revisited.  ...  In many cases, the time can be significantly reduced by making sure that parts of the search space are not revisited unnecessarily. In some cases a reduction in complexity is possible.  ...  lookup and update operations on the memo table being threaded through the computation. fib 20 => 10946 time = 235015 fib 21 => 17711 time = 380274 fib 22 => 28657 time = 615308 fib 50 => ran out of heap  ... 
doi:10.1007/3-540-44886-1_8 fatcat:5jvf7amiavdy7chbl7bs7htxty

Adding real-time capabilities to a SML compiler

Muyuan Li, Daniel E. McArdle, Jeffrey C. Murphy, Bhargav Shivkumar, Lukasz Ziarek
2016 ACM SIGBED Review  
Lastly, we will consider optimizations specific to RTEMS and revisit the I/O libraries.  ...  In the Fibonacci and MD5 benchmark, our implementation achieves identical performance to MLton with optimization passes disabled.  ... 
doi:10.1145/2930957.2930958 fatcat:zipy7jll75bjhabndnknn6efny

Adding Real-time Capabilities to a SML Compiler [article]

Muyuan Li, Daniel E McArdle, Jeffrey C Murphy, Bhargav Shivkumar, Lukasz Ziarek
2016 arXiv   pre-print
Lastly, we will consider optimizations specific to RTEMS and revisit the I/O libraries.  ...  In the Fibonacci and MD5 benchmark, our implementation achieves identical performance to MLton with optimization passes disabled.  ... 
arXiv:1601.03116v1 fatcat:pr6yfzyajfdhlcesxxlgzwal7e

Using Tasks to Create Your Own Algorithms [chapter]

Michael Voss, Rafael Asenjo, James Reinders
2019 Pro TBB  
You may also be thinking, after looking at Figure 10 -4, why in the world we are once again revisiting the parallel_invoke that was already covered way back in Chapter 2.  ...  In essence, we are trading stack space for heap space and FibTask's objects by FibCont's ones, which is beneficial if FibCont objects are smaller.  ... 
doi:10.1007/978-1-4842-4398-5_10 fatcat:ispyjf36z5eabgwewvieyynz7a

Improved bounds for multipass pairing heaps and path-balanced binary search trees [article]

Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick
2018 arXiv   pre-print
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, Sedgewick, Sleator, and Tarjan.  ...  O(log n) cost for deletemin, the average cost of decrease-key may be Ω(log log n), in contrast to the O(1) guarantee for Fibonacci heaps).  ... 
arXiv:1806.08692v1 fatcat:odregx54qbhzvimbzd5k2x6ne4
« Previous Showing results 1 — 15 out of 230 results