Two-tier relaxed heaps
type: Item
instance of: scholarly article
title: Two-tier relaxed heaps
zbMATH Open document ID: 1144.68015
author: Amr Elmasry
author: Claus Jensen
author: Jyrki Katajainen
published in: Acta Informatica
publication date: 2008-06-17T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5288698
zbMATH Keywords: heap operations
describes a project that uses: heapsort
MaRDI profile type: Publication
full work available at URL: s00236-008-0070-7
OpenAlex ID: W1996864203
cites work: Q4875168
cites work: Optimal purely functional priority queues
cites work: Introduction to algorithms
cites work: Two new methods for constructing double-ended priority queues from priority queues
cites work: Two-Tier Relaxed Heaps
cites work: On the efficiency of pairing heaps and related data structures
cites work: The pairing heap: A new form of self-adjusting heap
cites work: Heaps on Heaps
cites work: Algorithm design: Foundations, analysis, and Internet examples
cites work: Meldable heaps and boolean union-find
cites work: Purely Functional Data Structures
cites work: Worst-case optimal insertion and deletion methods for decomposable searching problems
cites work: A data structure for manipulating priority queues
DOI: 10.1007/S00236-008-0070-7
description: scientific article; zbMATH DE number 5288698