Two-tier relaxed heaps (Q929299): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 11:00, 28 June 2024

scientific article

Language	Label	Description	Also known as
English	Two-tier relaxed heaps	scientific article

Statements

scholarly article

0 references

Two-tier relaxed heaps (English)

0 references

0 references

0 references

Jyrki Katajainen

0 references

Acta Informatica

0 references

publication date

17 June 2008

0 references

zbMATH Keywords

heap operations

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.1007/s00236-008-0070-7

0 references

0 references

Optimal purely functional priority queues

0 references

0 references

Two new methods for constructing double-ended priority queues from priority queues

0 references

Two-Tier Relaxed Heaps

0 references

On the efficiency of pairing heaps and related data structures

0 references

The pairing heap: A new form of self-adjusting heap

0 references

0 references

0 references

Meldable heaps and boolean union-find

0 references

Purely Functional Data Structures

0 references

Worst-case optimal insertion and deletion methods for decomposable searching problems

0 references

A data structure for manipulating priority queues

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00236-008-0070-7

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:929299

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