heapsort

swMATH34903MaRDI QIDQ46612FDOQ46612

Author name not available (Why is that?)

Cited In (71)

• A note on constructing binary heaps with periodic networks.
• Worst-case efficient external-memory priority queues
• Amortization results for chromatic search trees, with an application to priority queues
• The K-D heap: An efficient multi-dimensional priority queue
• On the connection between Hamming codes, Heapsort and other methods
• Algorithms from THE BOOK
• Comparator networks for binary heap construction
• Regular numeral systems for data structures
• Lower and upper bounds on obtaining history independence
• Ranking the vertices of a complete multipartite paired comparison digraph
• Fractal Analysis of Pi Normality
• Partial sums on the ultra-wide word RAM
• Average-case analysis via incompressibility
• Optimizing binary heaps
• Investigations on the influence of the boundary conditions when computing the effective crack energy of random heterogeneous materials using fast marching methods
• Amortization results for chromatic search trees, with an application to priority queues
• Fast bounding procedures for large instances of the simple plant location problem
• Inserting a new element into a heap
• Space-efficient planar convex hull algorithms
• Weak heaps engineered
• An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
• Diamond deque: A simple data structure for priority deques
• Enumerating solutions to 𝑝(𝑎)+𝑞(𝑏)=𝑟(𝑐)+𝑠(𝑑)
• On sorting, heaps, and minimum spanning trees
• Two skew-binary numeral systems and one application
• Implicit data structures for fast search and update
• The randomized complexity of maintaining the minimum
• A characterization of heaps and its applications
• Two-tier relaxed heaps
• A Survey on Priority Queues
• 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
• Priority queues on parallel machines
• An efficient data structure for branch-and-bound algorithm
• Heaps with bits
• In-place algorithms for computing (Layers of) maxima
• The weak-heap data structure: variants and applications
• A pointer-free data structure for merging heaps and min-max heaps
• Bounds for min-max heaps
• An introduction to three algorithms for sorting in situ
• Optimal parallel construction of heaps
• A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints
• Line-segment intersection made in-place
• An optimal algorithm for deleting the root of a heap
• Separation algorithms for 0-1 knapsack polytopes
• 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
• The savings algorithm for the vehicle routing problem
• The pairing heap: A new form of self-adjusting heap
• 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
• How good are projection methods for convex feasibility problems?
• Best case lower bounds for heapsort
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• Computing skeletons for rectilinearly convex obstacles in the rectilinear plane
• Multiway in-place merging
• A priority queue for the all pairs shortest path problem
• Fast meldable priority queues
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Convex-hull algorithms: implementation, testing, and experimentation
• Efficient Verified Implementation of Introsort and Pdqsort
• An iterative working-set method for large-scale nonconvex quadratic programming
• Design of hybrids for the minimum sum-of-squares clustering problem
• 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