Explaining binomial heaps

DOI10.1017/S0956796899003317MaRDI QIDQ4256149zbMATH OpenOpenAlexFDO

Authors Ralf Hinze

Publication date 28 June 1999

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796899003317

zbMATH Keywords

functional programming languagesprogramming language Haskell

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• Bipartite binomial heaps
• Optimizing binary heaps
• scientific article; zbMATH DE number 742986
• Heaps and two exponential structures
• scientific article; zbMATH DE number 1696652
• A note on the problem of heaps
• Static Analysis
• A characterization of heaps and its applications
• A Note on HEAPSORT
• Recurrence relations on heaps

Cited in

(1)

• Calculating datastructures

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Explaining binomial heaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256149)