The loss of serving in the dark (Q2680226): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2022.106334 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4306179940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive queue policies for differentiated services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The loss of serving in the dark / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zero-one principle for switching networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with partial job values: does timesharing or randomization help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved online algorithms for buffer management in QoS switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prompt Mechanisms for Online Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and Upper Bounds on FIFO Buffer Management in QoS Switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4122535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buffer Overflow Management in QoS Switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved competitive guarantees for QoS buffering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153377 / 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: Q2921788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic methods for algorithmic discrete mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank

Latest revision as of 10:19, 31 July 2024

scientific article
Language Label Description Also known as
English
The loss of serving in the dark
scientific article

    Statements

    The loss of serving in the dark (English)
    0 references
    0 references
    0 references
    0 references
    30 January 2023
    0 references
    0 references
    oblivious algorithms
    0 references
    randomized algorithms
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    prompt mechanisms
    0 references
    0 references