The one-out-of-\(k\) retrieval problem and linear network coding (Q259276): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.3934/amc.2016.10.95 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Limit theorems for discrete-time metapopulation models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential equation approximations for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decentralized Erasure Codes for Distributed Networked Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of ordinary differential equations as limits of pure jump markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993068 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3934/AMC.2016.10.95 / rank
 
Normal rank

Latest revision as of 12:48, 9 December 2024

scientific article
Language Label Description Also known as
English
The one-out-of-\(k\) retrieval problem and linear network coding
scientific article

    Statements

    The one-out-of-\(k\) retrieval problem and linear network coding (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 March 2016
    0 references
    delay tolerant network
    0 references
    linear network coding
    0 references
    fluid approximations
    0 references
    lower bounds
    0 references
    mean field arguments
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references