The Round Complexity of Two-Party Random Selection (Q3624376)

From MaRDI portal
Revision as of 22:33, 19 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 Round Complexity of Two-Party Random Selection
scientific article

    Statements

    title
    The Round Complexity of Two-Party Random Selection (English)
    0 references
    DOI
    10.1137/050641715
    0 references
    author
    Saurabh Sanghvi
    0 references
    Salil P. Vadhan
    0 references
    publication date
    30 April 2009
    0 references
    Mathematics Subject Classification ID
    68Q10
    0 references
    68P25
    0 references
    68Q85
    0 references
    94A60
    0 references
    zbMATH DE Number
    5549687
    0 references
    zbMATH Keywords
    cryptography
    0 references
    distributed computing
    0 references
    coin flipping
    0 references
    OpenAlex ID
    W1984298275
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3624376&oldid=31990755"
    Powered by MediaWiki