Serving in the dark should be done non-uniformly

DOI10.1007/978-3-662-47672-7_8zbMATH Open1440.68322OpenAlexW961489624MaRDI QIDQ3448776FDOQ3448776

Authors: Ilan Reuven Cohen, Yossi Azar 

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_8

Recommendations

• The loss of serving in the dark
• Optimal ball recycling
• Balls into non-uniform bins
• Randomized allocation processes
• Competitive randomized algorithms for nonuniform problems

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Auctions, bargaining, bidding and selling, and other market models (91B26) Stochastic games, stochastic differential games (91A15) Probabilistic games; gambling (91A60)

Cites Work

• Buffer Overflow Management in QoS Switches
• Probabilistic methods for algorithmic discrete mathematics
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Balanced Allocations
• Probability and Computing
• Title not available (Why is that?)
• Concentration of Measure for the Analysis of Randomized Algorithms
• Title not available (Why is that?)
• Scheduling Unrelated Machines by Randomized Rounding
• The zero-one principle for switching networks
• Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
• Prompt Mechanisms for Online Auctions
• Optimal oblivious routing in polynomial time
• The loss of serving in the dark

Cited In (2)

• Comparison-based buffer management in QoS switches
• The loss of serving in the dark

This page was built for publication: Serving in the dark should be done non-uniformly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448776)