The I/O Complexity of Computing Prime Tables (Q2802940)

From MaRDI portal
Revision as of 03:12, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The I/O Complexity of Computing Prime Tables
scientific article

    Statements

    title
    The I/O Complexity of Computing Prime Tables (English)
    0 references
    author
    Alexander Conway
    0 references
    Martín Farach-Colton
    0 references
    Pramod Ganapathi
    0 references
    Rob Johnson
    0 references
    Samuel McCauley
    0 references
    Bertrand Simon
    0 references
    Shikha Singh
    0 references
    Michael A. Bender
    0 references
    Rezaul Alam Chowdhury
    0 references
    publication date
    3 May 2016
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    11Y11
    0 references
    11Y16
    0 references
    68P10
    0 references
    68Q17
    0 references
    68W40
    0 references
    zbMATH DE Number
    6576669
    0 references
    zbMATH Keywords
    external-memory algorithms
    0 references
    prime tables
    0 references
    sorting
    0 references
    priority queues
    0 references
    OpenAlex ID
    W2413414340
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2802940&oldid=32945811"
    Powered by MediaWiki