Near-Optimal Consistency-Robustness Bounds for Non-Clairvoyant Scheduling

arXiv:2610.29037 · cs.DS · Submitted 2026-10-21 · Read on arXiv

cs.DS

Submitted: 2026-10-21

Updated: 2026-10-21

Terminology

• Consistency — 1× in this paper · explained in 3 episodes
• Robustness — 1× in this paper · explained in 6 episodes

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing