The VLSI Complexity of Sorting (Q3036700)

From MaRDI portal
Revision as of 10:39, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The VLSI Complexity of Sorting
scientific article

    Statements

    title
    The VLSI Complexity of Sorting (English)
    0 references
    author
    Clark D. Thompson
    0 references
    publication date
    1983
    0 references
    zbMATH Keywords
    area-time complexity
    0 references
    bitonic sort
    0 references
    bubble sort
    0 references
    mesh-connected computers
    0 references
    parallel algorithms
    0 references
    sorting
    0 references
    VLSI
    0 references
    heapsort
    0 references
    shuffle exchange network
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68P10
    0 references
    68W99
    0 references
    zbMATH DE Number
    3831291
    0 references
    OpenAlex ID
    W2134845208
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3036700&oldid=37320302"
    Powered by MediaWiki