Cited in
(86)- Amortization results for chromatic search trees, with an application to priority queues
- Fast bounding procedures for large instances of the simple plant location problem
- A note on constructing binary heaps with periodic networks.
- Inserting a new element into a heap
- Space-efficient planar convex hull algorithms
- Weak heaps engineered
- Worst-case efficient external-memory priority queues
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- Diamond deque: A simple data structure for priority deques
- Fractal analysis of pi normality
- Enumerating solutions to π(π)+π(π)=π(π)+π (π)
- Amortization results for chromatic search trees, with an application to priority queues
- The K-D heap: An efficient multi-dimensional priority queue
- Two skew-binary numeral systems and one application
- On sorting, heaps, and minimum spanning trees
- Implicit data structures for fast search and update
- On the connection between Hamming codes, Heapsort and other methods
- The randomized complexity of maintaining the minimum
- A characterization of heaps and its applications
- Two-tier relaxed heaps
- An in-place algorithm for Klee's measure problem in two dimensions
- Multidimensional heaps and complementary range searching
- New method in information processing for maintaining an efficient dynamic ordered set
- The relaxed min-max heap: A mergeable double-ended priority queue
- Weak-heap sort
- An efficient data structure for branch-and-bound algorithm
- Heaps with bits
- Priority queues on parallel machines
- Algorithms from THE BOOK
- Comparator networks for binary heap construction
- In-place algorithms for computing (Layers of) maxima
- The weak-heap data structure: variants and applications
- Regular numeral systems for data structures
- A pointer-free data structure for merging heaps and min-max heaps
- Bounds for min-max heaps
- NNLS
- HSL_ea19
- Quicksort
- QuickHeapsort
- BOB
- Find
- DQP
- Algorithm 360
- MedianOfNinthers
- AS 266
- IMP2_Binary_Heap
- Algorithm 347
- Squeakr
- TimSort
- An introduction to three algorithms for sorting in situ
- Lower and upper bounds on obtaining history independence
- Optimal parallel construction of heaps
- Line-segment intersection made in-place
- A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints
- An optimal algorithm for deleting the root of a heap
- Ranking the vertices of a complete multipartite paired comparison digraph
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths
- A complexity O(1) priority queue for event driven molecular dynamics simulations
- Separation algorithms for 0-1 knapsack polytopes
- The savings algorithm for the vehicle routing problem
- The pairing heap: A new form of self-adjusting heap
- Partial sums on the ultra-wide word RAM
- Sorting numbers in linear expected time and optimal extra space
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- Worst-case analysis of a generalized heapsort algorithm
- clustRviz
- Best case lower bounds for heapsort
- How good are projection methods for convex feasibility problems?
- Processing time-dependent shortest path queries without pre-computed speed information on road networks
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane
- Average-case analysis via incompressibility
- Optimizing binary heaps
- Multiway in-place merging
- A priority queue for the all pairs shortest path problem
- Investigations on the influence of the boundary conditions when computing the effective crack energy of random heterogeneous materials using fast marching methods
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- Fast meldable priority queues
- Convex-hull algorithms: implementation, testing, and experimentation
- An iterative working-set method for large-scale nonconvex quadratic programming
- Efficient Verified Implementation of Introsort and Pdqsort
- Design of hybrids for the minimum sum-of-squares clustering problem
- A survey on priority queues
- Exploiting planarity in separation routines for the symmetric traveling salesman problem
- A generalization of binomial queues
- Analysis of distributed consensus protocols with multi-equilibria under time-delays
- A dual gradient-projection method for large-scale strictly convex quadratic problems
This page was built for software: heapsort
