Two new methods for constructing double-ended priority queues from priority queues (Q836938): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00607-008-0019-2 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00607-008-0019-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022705471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black box for constant-time insertion in priority queues (note) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric min-max heap: a simpler data structure for double-ended priority queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max heaps and generalized priority queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diamond deque: A simple data structure for priority deques / rank
 
Normal rank
Property / cites work
 
Property / cites work: MERGEABLE DOUBLE-ENDED PRIORITY QUEUES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence-based data structures for double-ended priority queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxed min-max heap: A mergeable double-ended priority queue / 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: Q2757736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflected min-Max heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460605 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00607-008-0019-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:41, 10 December 2024

scientific article
Language Label Description Also known as
English
Two new methods for constructing double-ended priority queues from priority queues
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references