Weak heaps engineered (Q396692)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Weak heaps engineered	scientific article

Statements

scholarly article

0 references

Weak heaps engineered (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.jda.2013.07.002

0 references

Stefan Edelkamp

0 references

0 references

Jyrki Katajainen

0 references

Journal of Discrete Algorithms

0 references

publication date

13 August 2014

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

data structures

0 references

priority queues

0 references

weak heaps

0 references

constant factors

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jda.2013.07.002

0 references

0 references

Black box for constant-time insertion in priority queues (note)

0 references

Performance engineering case study

0 references

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses

0 references

0 references

0 references

The weak-heap data structure: variants and applications

0 references

Implementing <i>HEAPSORT</i> with ( <i>n</i> log <i>n</i> - 0.9 <i>n</i> ) and <i>QUICKSORT</i> with ( <i>n</i> log <i>n</i> + 0.2 <i>n</i> ) comparisons

0 references

0 references

Multipartite priority queues

0 references

A data structure for manipulating priority queues

0 references

BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:396692

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q396692&oldid=35405069"