Coordination mechanisms from (almost) all scheduling policies
From MaRDI portal
Publication:2988872
Recommendations
Cites work
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounds for Width Two Branching Programs
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Evaluating Branching Programs on Encrypted Data
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- New lattice-based cryptographic constructions
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public-key cryptosystems from the worst-case shortest vector problem
- Toward basing fully homomorphic encryption on worst-case hardness
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(16)- scientific article; zbMATH DE number 7561639 (Why is no real title available?)
- Designing cost-sharing methods for Bayesian games
- The price of anarchy for utilitarian scheduling games on related machines
- Coordination mechanisms for selfish routing over time on a tree
- Minimizing total completion time with machine-dependent priority lists
- Coordination mechanisms with hybrid local policies
- Strategic scheduling games: equilibria and efficiency
- Scheduling policies using marked/phantom slot algorithms
- Coordination mechanisms for selfish scheduling
- Price of anarchy in parallel processing
- Coordination mechanisms for parallel machine scheduling
- Inner product spaces for minsum coordination mechanisms
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- Multi-round cooperative search games with multiple players
- Optimal cost-sharing in general resource selection games
- Designing networks with good equilibria under uncertainty
This page was built for publication: Coordination mechanisms from (almost) all scheduling policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988872)