Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
From MaRDI portal
Recommendations
- Competitive algorithms from competitive equilibria, non-clairvoyant scheduling under polyhedral constraints
- Non-clairvoyant weighted flow time scheduling on different multi-processor models
- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
- Online non-clairvoyant scheduling to simultaneously minimize all convex functions
- Non-clairvoyant scheduling for weighted flow time
Cites work
- Advances in Cryptology – CRYPTO 2004
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Bounds on the sample complexity for private learning and private data release
- Characterizing the sample complexity of private learners
- Collusion-secure fingerprinting for digital data
- Differential privacy and the fat-shattering dimension of linear queries
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- Interactive privacy via the median mechanism
- Iterative Constructions and Private Data Release
- Lower bounds in differential privacy
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the geometry of differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Theory of Cryptography
Cited in
(9)- Non-clairvoyantly scheduling to minimize convex functions
- Online non-clairvoyant scheduling to simultaneously minimize all convex functions
- Competitive algorithms from competitive equilibria, non-clairvoyant scheduling under polyhedral constraints
- Truthful prompt scheduling for minimizing sum of completion times
- Non-Clairvoyant Precedence Constrained Scheduling.
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach
- scientific article; zbMATH DE number 7765403 (Why is no real title available?)
- Resource-constrained scheduling algorithms for stochastic independent tasks with unknown probability distribution
- Online two-dimensional load balancing
This page was built for publication: Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259565)
