Efficient algorithms for merging (Q1056542): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Merging of 3 Elements with <i>n</i> Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal merging of 2 elements with n elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of the binary merge algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimality of Linear Merge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merging of 4 or 5 elements with n elements / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01933617 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006931095 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:25, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for merging
scientific article

    Statements

    Efficient algorithms for merging (English)
    0 references
    0 references
    0 references
    1983
    0 references
    23, 410-428 (1983)
    0 references
    maximum length of an ordered list
    0 references
    top down algorithm
    0 references
    optimal merge length
    0 references
    strong heuristics
    0 references
    optimal merging
    0 references

    Identifiers