Pages that link to "Item:Q1087333"

The following pages link to The pairing heap: A new form of self-adjusting heap (Q1087333):

Displaying 47 items.

• The saga of minimum spanning trees (Q458468) (← links)
• Proximate point searching (Q598552) (← links)
• Amortized complexity verified (Q670702) (← links)
• A generalization of binomial queues (Q672741) (← links)
• Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
• The derivation of a tighter bound for top-down skew heaps (Q751283) (← links)
• A complexity O(1) priority queue for event driven molecular dynamics simulations (Q870573) (← links)
• Two-tier relaxed heaps (Q929299) (← links)
• On sorting, heaps, and minimum spanning trees (Q973020) (← links)
• The number of tests required to search an unordered table (Q1014399) (← links)
• Three priority queue applications revisited (Q1185291) (← links)
• Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN (Q1195936) (← links)
• A systematic analysis of splaying (Q1209317) (← links)
• Manipulating multiple stacks with ordered-heap (Q1310924) (← links)
• The relaxed min-max heap: A mergeable double-ended priority queue (Q1323336) (← links)
• A tight amortized bound for path reversal (Q1822942) (← links)
• Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
• The weak-heap data structure: variants and applications (Q1932363) (← links)
• A priority queue with the time-finger property (Q1932364) (← links)
• Progressive simplification of polygonal curves (Q2306367) (← links)
• Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686) (← links)
• Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract) (Q2768388) (← links)
• Quake Heaps: A Simple Alternative to Fibonacci Heaps (Q2848964) (← links)
• A Survey on Priority Queues (Q2848973) (← links)
• Amortized Complexity Verified (Q2945642) (← links)
• A Linear Potential Function for Pairing Heaps (Q2958341) (← links)
• STRONGER QUICKHEAPS (Q3016226) (← links)
• Pairing heaps, scrambled pairing and square-root trees (Q3066958) (← links)
• THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP (Q3084682) (← links)
• A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY (Q3421856) (← links)
• Replacing Mark Bits with Randomness in Fibonacci Heaps (Q3448845) (← links)
• Optimal purely functional priority queues (Q4339017) (← links)
• (Q4453142) (← links)
• Self-Adjusting Heaps (Q4728230) (← links)
• Parameterized self-adjusting heaps (Q4815767) (← links)
• Pairing heaps: the forward variant. (Q5005110) (← links)
• Improved bounds for multipass pairing heaps and path-balanced binary search trees (Q5009581) (← links)
• Priority queues on parallel machines (Q5054832) (← links)
• Fast meldable priority queues (Q5057442) (← links)
• The K-D heap: An efficient multi-dimensional priority queue (Q5060123) (← links)
• Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) (← links)
• A SIMPLE ARRAY VERSION OF M-HEAP (Q5168425) (← links)
• Regarding Goal Bounding and Jump Point Search (Q5856476) (← links)
• Rank-Pairing Heaps (Q5895541) (← links)
• Priority queues with decreasing keys (Q6495789) (← links)
• Building a parallel branch and bound library (Q6560211) (← links)
• Finding the \(k\) shortest simple paths: time and space trade-offs (Q6579778) (← links)