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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00236-008-0070-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996864203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal purely functional priority queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new methods for constructing double-ended priority queues from priority queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tier Relaxed Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of pairing heaps and related data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pairing heap: A new form of self-adjusting heap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heaps on Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meldable heaps and boolean union-find / rank
 
Normal rank
Property / cites work
 
Property / cites work: Purely Functional Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case optimal insertion and deletion methods for decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for manipulating priority queues / rank
 
Normal rank

Revision as of 11:00, 28 June 2024

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

    Statements

    Identifiers