Image de couverture de livre

Perturbation-Resilient Trades for Dynamic Service Balancing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sima, Jin, Pan, Chao, Milenkovic, Olgica
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Information Theory Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Distribution Learning with Local Private Constraints
par: Sima, Jin, et autres
Publié: (2024)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
par: Li, Xin, et autres
Publié: (2024)

Unbounded Error Correcting Codes
par: Efremenko, Klim, et autres
Publié: (2024)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
par: Con, Roni, et autres
Publié: (2024)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
par: Ahmadypour, Niloufar, et autres
Publié: (2020)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Trellis codes with a good distance profile constructed from expander graphs
par: Zhu, Yubin, et autres
Publié: (2026)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

Generalized Orthogonal de Bruijn and Kautz Sequences
par: Chen, Yuan-Pon, et autres
Publié: (2025)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
par: Goldenberg, Elazar, et autres
Publié: (2024)

Construction of orientable sequences in $O(1)$-amortized time per bit
par: Gabric, Daniel, et autres
Publié: (2024)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
par: Hou, Jiaxin, et autres
Publié: (2023)

On constrained intersection representations of graphs and digraphs
par: Cicalese, Ferdinando, et autres
Publié: (2025)

A Method for Generating Connected Erdos-Renyi Random Graphs
par: Chinyaev, Boris
Publié: (2025)

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
par: Guruswami, Venkatesan, et autres
Publié: (2023)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
par: Fujimaru, Hiroto, et autres
Publié: (2025)

Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths
par: Bodwin, Greg, et autres
Publié: (2023)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
par: Bhattacharya, Sudatta, et autres
Publié: (2025)

Modularity and partially observed graphs
par: McDiarmid, Colin, et autres
Publié: (2021)

Testability in group theory
par: Becker, Oren, et autres
Publié: (2022)

Testability of relations between permutations
par: Becker, Oren, et autres
Publié: (2020)

$k$-local Graphs
par: Beth, Christian, et autres
Publié: (2024)

A Lower Bound for the Max Entropy Algorithm for TSP
par: Jin, Billy, et autres
Publié: (2023)

Perturbation results for distance-edge-monitoring numbers
par: Yang, Chenxu, et autres
Publié: (2023)

Redundancy Is All You Need (for CSP Sparsification)
par: Brakensiek, Joshua, et autres
Publié: (2024)

Sampling Balanced Forests of Grids in Polynomial Time
par: Cannon, Sarah, et autres
Publié: (2023)

Coarse Balanced Separators in Fat-Minor-Free Graphs
par: Bonnet, Édouard, et autres
Publié: (2026)

Local Limits of Small World Networks
par: Alimohammadi, Yeganeh, et autres
Publié: (2025)

The Metric Dimension of Sparse Random Graphs
par: Díaz, Josep, et autres
Publié: (2025)

A probabilistic analysis on general probabilistic scheduling problems
par: Suruga, Daiki
Publié: (2024)

Key Compression Limits for $k$-Minimum Value Sketches
par: Dickens, Charlie, et autres
Publié: (2024)

Capacity-Achieving Gray Codes
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Robust Gray Codes Approaching the Optimal Rate
par: Con, Roni, et autres
Publié: (2024)

Investigations on Algorithm Selection for Interval-Based Coding Methods
par: Strutz, Tilo, et autres
Publié: (2024)

Graph Reconstruction from Noisy Random Subgraphs
par: McGregor, Andrew, et autres
Publié: (2024)

More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
par: Ghentiyala, Surendra, et autres
Publié: (2024)

Continuous Optimization for Decoding Errors
par: Srivastava, Shashank
Publié: (2024)

A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities
par: Rivkin, Joey, et autres
Publié: (2024)

Towards Optimal Grammars for RNA Structures
par: Onokpasa, Evarista, et autres
Publié: (2024)

Scheduling Multi-Server Jobs is Not Easy
par: Vaze, Rahul
Publié: (2024)