Serving in the dark should be done non-uniformly
From MaRDI portal
Publication:3448776
Recommendations
Cites work
- scientific article; zbMATH DE number 5485537 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 3586221 (Why is no real title available?)
- scientific article; zbMATH DE number 1857645 (Why is no real title available?)
- Balanced Allocations
- Buffer Overflow Management in QoS Switches
- Concentration of Measure for the Analysis of Randomized Algorithms
- Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
- Optimal oblivious routing in polynomial time
- Probabilistic methods for algorithmic discrete mathematics
- Probability and Computing
- Prompt Mechanisms for Online Auctions
- Scheduling Unrelated Machines by Randomized Rounding
- The loss of serving in the dark
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The zero-one principle for switching networks
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)