Results 1 - 10 of 845

Fibonacci Heaps and Their Uses in Improved Network optimization algorithms

by Michael L. Fredman, Robert Endre Tarjan , 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in qlogn) amortized tim ..."
Abstract - Cited by 739 (18 self) - Add to MetaCart
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in qlogn) amortized

Binomial Heaps and Skew Binomial Heaps

by Rene Meis, Finn Nielsen, Peter Lammich , 2013
"... We implement and prove correct binomial heaps and skew binomial heaps. Both are data-structures for priority queues. While binomial heaps have logarithmic findMin, deleteMin, insert, and meld operations, skew binomial heaps have constant time findMin, insert, and meld operations, and only the delete ..."
Abstract - Add to MetaCart
We implement and prove correct binomial heaps and skew binomial heaps. Both are data-structures for priority queues. While binomial heaps have logarithmic findMin, deleteMin, insert, and meld operations, skew binomial heaps have constant time findMin, insert, and meld operations, and only

Composable memory transactions

by Tim Harris, Mark Plesko, Avraham Shinnar, David Tarditi - In Symposium on Principles and Practice of Parallel Programming (PPoPP , 2005
"... Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement atomic blocks over word-based transactional memory that provides scalable multiprocessor performance without requiring changes ..."
Abstract - Cited by 509 (43 self) - Add to MetaCart
changes to the basic structure of objects in the heap. However, these implementations perform poorly because they interpose on all accesses to shared memory in the atomic block, redirecting updates to a thread-private log which must be searched by reads in the block and later reconciled with the heap when

Functional Pearls: Explaining Binomial Heaps

by Ralf Hinze , 1999
"... This paper explains binomial heaps, a beautiful data structure for priority queues, using the functional programming language Haskell (Peterson & Hammond, 1997). We largely follow a deductive approach: using the metaphor of a tennis tournament we show that binomial heaps arise naturally through ..."
Abstract - Cited by 5 (4 self) - Add to MetaCart
This paper explains binomial heaps, a beautiful data structure for priority queues, using the functional programming language Haskell (Peterson & Hammond, 1997). We largely follow a deductive approach: using the metaphor of a tennis tournament we show that binomial heaps arise naturally through

Local Reasoning about Programs that Alter Data Structures

by Peter O'Hearn, John Reynolds, Hongseok Yang , 2001
"... We describe an extension of Hoare's logic for reasoning about programs that alter data structures. We consider a low-level storage model based on a heap with associated lookup, update, allocation and deallocation operations, and unrestricted address arithmetic. The assertion language is ba ..."
Abstract - Cited by 324 (28 self) - Add to MetaCart
We describe an extension of Hoare's logic for reasoning about programs that alter data structures. We consider a low-level storage model based on a heap with associated lookup, update, allocation and deallocation operations, and unrestricted address arithmetic. The assertion language

A Simpler Implementation and Analysis of Chazelle’s Soft Heaps

by Haim Kaplan, Uri Zwick - In Proc. of the 19th ACM-SIAM Symposium on Discrete Algorithms , 2009
"... Chazelle (JACM 47(6), 2000) devised an approximate meldable priority queue data structure, called Soft Heaps, and used it to obtain the fastest known deterministic comparison-based algorithm for computing minimum spanning trees, as well as some new algorithms for selection and approximate sorting pr ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
in O(log 1 ε) amortized time. Chazelle’s soft heaps are derived from the binomial heaps data structure in which each priority queue is composed of a collection of binomial trees. We describe a simpler and more direct implementation of soft heaps in which each priority queue is composed of a collection

Heaps Simplified

by Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan , 2009
"... The heap is a basic data structure used in a wide variety of applications, including shortest path and minimum spanning tree algorithms. In this paper we explore the design space of comparison-based, amortized-efficient heap implementations. From a consideration of dynamic single-elimination tourn ..."
Abstract - Add to MetaCart
The heap is a basic data structure used in a wide variety of applications, including shortest path and minimum spanning tree algorithms. In this paper we explore the design space of comparison-based, amortized-efficient heap implementations. From a consideration of dynamic single

Solving Shape-Analysis Problems in Languages with Destructive Updating

by Mooly Sagiv, Thomas Repst, Reinhard Wilhelm - POPL '96 , 1996
"... This paper concerns the static analysis of programs that perform destructive updating on heap-allocated storage. We give an algorithm that conservatively solves this problem by using a finite shape-graph to approximate the possible “shapes” that heap-allocated structures in a program can take on. In ..."
Abstract - Cited by 306 (20 self) - Add to MetaCart
This paper concerns the static analysis of programs that perform destructive updating on heap-allocated storage. We give an algorithm that conservatively solves this problem by using a finite shape-graph to approximate the possible “shapes” that heap-allocated structures in a program can take on

BI as an Assertion Language for Mutable Data Structures

by Samin Ishtiaq, Peter W. O'Hearn , 2000
"... Reynolds has developed a logic for reasoning about mutable data structures in which the pre- and postconditions are written in an intuitionistic logic enriched with a spatial form of conjunction. We investigate the approach from the point of view of the logic BI of bunched implications of O'Hea ..."
Abstract - Cited by 191 (14 self) - Add to MetaCart
Reynolds has developed a logic for reasoning about mutable data structures in which the pre- and postconditions are written in an intuitionistic logic enriched with a spatial form of conjunction. We investigate the approach from the point of view of the logic BI of bunched implications of O

Interval Heaps

by D. Wood, Vakgreep Informatica, Budapestlean Cd H, J. Van Leeuwen, J. Van Leeuwen - The Computer Journal , 1987
"... We present a simple, implicit data structure for implementing a double-ended priority queue. The data structure can be viewed as a natural generalization of the heap, and is different from a data structure for the same problem recently proposed by Atkineon et al. A number of applications to comp ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
We present a simple, implicit data structure for implementing a double-ended priority queue. The data structure can be viewed as a natural generalization of the heap, and is different from a data structure for the same problem recently proposed by Atkineon et al. A number of applications
Results 1 - 10 of 845