Imagen de Portada

The Instability of all Backoff Protocols

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Goldberg, Leslie Ann, Lapinskas, John
Formato:	Preprint
Publicado:	2026
Materias:	Probability Discrete Mathematics Data Structures and Algorithms Information Theory Networking and Internet Architecture
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Instability of backoff protocols with arbitrary arrival rates
por: Goldberg, Leslie Ann, et al.
Publicado: (2022)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
por: Dragan, Feodor F., et al.
Publicado: (2018)

The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems
por: Ganesan, Ashwin
Publicado: (2022)

Optimally revealing bits for rejection sampling
por: Langevin, Louis-Roy, et al.
Publicado: (2025)

A Method for Generating Connected Erdos-Renyi Random Graphs
por: Chinyaev, Boris
Publicado: (2025)

Efficient Online Random Sampling via Randomness Recycling
por: Draper, Thomas L., et al.
Publicado: (2025)

Efficient Rejection Sampling in the Entropy-Optimal Range
por: Draper, Thomas L., et al.
Publicado: (2025)

Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network
por: Brault, Gregory J., et al.
Publicado: (2024)

Tree algorithms for set reconciliation
por: Lázaro, Francisco, et al.
Publicado: (2025)

Zero-free regions and concentration inequalities for hypergraph colorings in the local lemma regime
por: Liu, Jingcheng, et al.
Publicado: (2026)

A Tight Bound on Localization of Electrical Flows
por: Gurel-Gurevich, Ori, et al.
Publicado: (2026)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
por: Jain, Vishesh, et al.
Publicado: (2026)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
por: Carlson, Charlie, et al.
Publicado: (2024)

Faster Mixing of the Jerrum-Sinclair Chain
por: Chen, Xiaoyu, et al.
Publicado: (2025)

Sink-free orientations: a local sampler with applications
por: Anand, Konrad, et al.
Publicado: (2025)

Towards an Optimal Contention Resolution Scheme for Matchings
por: Nuti, Pranav, et al.
Publicado: (2022)

Constructive l2-Discrepancy Minimization with Additive Deviations
por: Dutta, Kunal
Publicado: (2025)

Rumors on evolving graphs through stationary times
por: Bonasorte, Vicenzo
Publicado: (2025)

Phase Transitions via Complex Extensions of Markov Chains
por: Liu, Jingcheng, et al.
Publicado: (2024)

Deletion-correcting codes for an adversarial nanopore channel
por: Xie, Huiling, et al.
Publicado: (2026)

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
por: Li, Xiaxin, et al.
Publicado: (2024)

Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
por: Li, Xiaxin, et al.
Publicado: (2025)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
por: Feng, Weiming, et al.
Publicado: (2025)

Spectral Independence via Stability and Applications to Holant-Type Problems
por: Chen, Zongchen, et al.
Publicado: (2021)

Computing Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs
por: Vombatkere, Karan, et al.
Publicado: (2026)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
por: Li, Songhua, et al.
Publicado: (2023)

Aggregating maximal cliques in real-world graphs
por: Alon, Noga, et al.
Publicado: (2025)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
por: Davot, Tom, et al.
Publicado: (2024)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
por: Basu, Sabyasachi, et al.
Publicado: (2024)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
por: Huang, Yufan, et al.
Publicado: (2023)

Spectral Triadic Decompositions of Real-World Networks
por: Basu, Sabyasachi, et al.
Publicado: (2022)

Boltzmann Sampling for Powersets without an Oracle
por: Peyen, Jean
Publicado: (2026)

The Compilability Thresholds of 2-CNF to OBDD
por: de Colnet, Alexis, et al.
Publicado: (2026)

Integrating High-Dimensional Functions Deterministically
por: Gamarnik, David, et al.
Publicado: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
por: Kunisky, Dmitriy, et al.
Publicado: (2023)

Strong spatial mixing for colorings on trees and its algorithmic applications
por: Chen, Zongchen, et al.
Publicado: (2023)

Cycle-factors of regular graphs via entropy
por: Christoph, Micha, et al.
Publicado: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
por: Bansal, Nikhil, et al.
Publicado: (2025)

Probabilistic estimates of the diameters of the Rubik's Cube groups
por: Hirata, So
Publicado: (2024)

On constrained intersection representations of graphs and digraphs
por: Cicalese, Ferdinando, et al.
Publicado: (2025)