Pages that link to "Item:Q4147586"

The following pages link to A data structure for manipulating priority queues (Q4147586):

Displaying 50 items.

• Weak heaps engineered (Q396692) (← links)
• The saga of minimum spanning trees (Q458468) (← links)
• Refined complexity analysis for heap operations (Q578912) (← links)
• A generalization of binomial queues (Q672741) (← links)
• Two skew-binary numeral systems and one application (Q692930) (← links)
• Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
• A complexity O(1) priority queue for event driven molecular dynamics simulations (Q870573) (← links)
• Parallel algorithms for gossiping by mail (Q911271) (← links)
• Two-tier relaxed heaps (Q929299) (← links)
• On sorting, heaps, and minimum spanning trees (Q973020) (← links)
• Reflected min-Max heaps (Q1007603) (← links)
• Computational experience with minimum spanning tree algorithms (Q1053620) (← links)
• The pairing heap: A new form of self-adjusting heap (Q1087333) (← links)
• A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
• Three priority queue applications revisited (Q1185291) (← links)
• Changing and unchanging the diameter of a hypercube (Q1199429) (← links)
• A note on Euclidean near neighbor searching in the plane (Q1253102) (← links)
• Weak-heap sort (Q1314628) (← links)
• Competing for the \(AC\)-unification race (Q1319390) (← links)
• The relaxed min-max heap: A mergeable double-ended priority queue (Q1323336) (← links)
• The even adjacency split problem for graphs (Q1566571) (← links)
• An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
• Avoiding the global sort: a faster contour tree algorithm (Q1688860) (← links)
• Intersection reporting on two collections of disjoint sets (Q1818976) (← links)
• A note on the construction of the data structure ``deap'' (Q1825631) (← links)
• A general class of resource tradeoffs (Q1837531) (← links)
• Theory of 2-3 heaps (Q1861570) (← links)
• Recurrence relations on heaps (Q1913701) (← links)
• The weak-heap data structure: variants and applications (Q1932363) (← links)
• A priority queue with the time-finger property (Q1932364) (← links)
• Lock-free concurrent binomial heaps (Q1994357) (← links)
• Regular numeral systems for data structures (Q2139186) (← links)
• Garamon: a geometric algebra library generator (Q2274744) (← links)
• Optimizing binary heaps (Q2411045) (← links)
• Efficient unbalanced merge-sort (Q2489231) (← links)
• FAT HEAPS WITHOUT REGULAR COUNTERS (Q2846479) (← links)
• A Survey on Priority Queues (Q2848973) (← links)
• A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
• Worst-Case Optimal Priority Queues via Extended Regular Counters (Q2907494) (← links)
• A Linear Potential Function for Pairing Heaps (Q2958341) (← links)
• STRONGER QUICKHEAPS (Q3016226) (← links)
• THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP (Q3084682) (← links)
• An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop (Q3194717) (← links)
• A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY (Q3421856) (← links)
• On random cartesian trees (Q4286297) (← links)
• Optimal purely functional priority queues (Q4339017) (← links)
• Bipartite binomial heaps (Q4637854) (← links)
• Pairing heaps: the forward variant. (Q5005110) (← links)
• Priority queues on parallel machines (Q5054832) (← links)
• Worst-case efficient external-memory priority queues (Q5054847) (← links)