The critical greedy server on the integers is recurrent (Q1737969)

From MaRDI portal
Revision as of 09:32, 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
The critical greedy server on the integers is recurrent
scientific article

    Statements

    The critical greedy server on the integers is recurrent (English)
    0 references
    0 references
    0 references
    24 April 2019
    0 references
    greedy server
    0 references
    queueing system
    0 references
    recurrence
    0 references
    iterated logarithm law
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references