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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/amc.2016.10.95 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2753664036 / 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

Latest revision as of 15:25, 11 July 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
    0 references
    0 references
    0 references
    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
    0 references