Optimal parallel algorithms for rectilinear link-distance problems (Q1897477)

From MaRDI portal
Revision as of 08:36, 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
Optimal parallel algorithms for rectilinear link-distance problems
scientific article

    Statements

    title
    Optimal parallel algorithms for rectilinear link-distance problems (English)
    0 references
    author
    Andrzej Lingas
    0 references
    Anil Maheshwari
    0 references
    Jörg-Rüdiger Sack
    0 references
    published in
    Algorithmica
    0 references
    publication date
    27 August 1995
    0 references
    zbMATH Keywords
    optimal parallel solutions
    0 references
    link-distance problems
    0 references
    parallel random access machine
    0 references

    Identifiers

    DOI
    10.1007/BF01206332
    0 references
    Mathematics Subject Classification ID
    68U05
    0 references
    68W15
    0 references
    68Q25
    0 references
    zbMATH DE Number
    790623
    0 references
    Wikidata QID
    Q62037495
    0 references
    OpenAlex ID
    W2043144539
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1897477&oldid=36914112"
    Powered by MediaWiki