Image de couverture de livre

A survey of Chernoff and Hoeffding bounds

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Gerbessiotis, Alexandros V.
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Packing $K_r$s in bounded degree graphs
par: McKay, Michael, et autres
Publié: (2022)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
par: Paul-Pena, Daniel, et autres
Publié: (2025)

Markovian protocols and an upper bound on the extension complexity of the matching polytope
par: Szusterman, M.
Publié: (2026)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
par: Foucaud, Florent, et autres
Publié: (2025)

Clique-free t-matchings in degree-bounded graphs
par: Paluch, Katarzyna, et autres
Publié: (2024)

Improved bounds for coloring locally sparse hypergraphs
par: Iliopoulos, Fotis
Publié: (2020)

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
par: Kaymakov, Kirill V., et autres
Publié: (2024)

Translating between the representations of an acyclic convex geometry of bounded degree
par: Defrain, Oscar, et autres
Publié: (2025)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
par: Alecu, Bogdan, et autres
Publié: (2024)

Quasi-linear distance query reconstruction for graphs of bounded treelength
par: Bastide, Paul, et autres
Publié: (2024)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
par: Bencs, Ferenc, et autres
Publié: (2025)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
par: Bonamy, Marthe, et autres
Publié: (2020)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
par: Bentert, Matthias, et autres
Publié: (2024)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
par: Jenssen, Matthew, et autres
Publié: (2023)

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

Edge Clique Partition and Cover Beyond Independence
par: Fomin, Fedor V., et autres
Publié: (2025)

Fault-Tolerant Matroid Bases
par: Bentert, Matthias, et autres
Publié: (2025)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

H-Planarity and Parametric Extensions: when Modulators Act Globally
par: Fomin, Fedor V., et autres
Publié: (2025)

Path Contraction Faster than $2^n$
par: Agrawal, Akanksha, et autres
Publié: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
par: Fomin, Fedor V., et autres
Publié: (2024)

A Parameterized Perspective on Uniquely Restricted Matchings
par: Chaudhary, Juhi, et autres
Publié: (2025)

A Constant-Factor Approximation for Directed Latency
par: Blauth, Jannis, et autres
Publié: (2025)

A Tale of Santa Claus, Hypergraphs and Matroids
par: Davies, Sami, et autres
Publié: (2018)

Sequential testing problem: A follow-up review
par: Ünlüyurt, Tonguç
Publié: (2025)

A Unified Approach to Minimizing Symmetric Submodular Functions
par: Iwata, Satoru, et autres
Publié: (2026)

A Finer View of the Parameterized Landscape of Labeled Graph Contractions
par: Mathur, Yashaswini, et autres
Publié: (2025)

A polynomial kernel for vertex deletion into bipartite permutation graphs
par: Derbisz, Jan
Publié: (2021)

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
par: Aouad, Ali, et autres
Publié: (2022)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
par: Harada, Tsubasa, et autres
Publié: (2024)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
par: Veldt, Nate
Publié: (2025)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
par: Abboud, Amir, et autres
Publié: (2025)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
par: Liang, Wei, et autres
Publié: (2024)

A column generation algorithm for finding co-3-plexes in chordal graphs
par: Dupont-Bouillard, Alexandre
Publié: (2026)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
par: Bentert, Matthias, et autres
Publié: (2026)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2022)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)

A note on approximating the average degree of bounded arboricity graphs
par: Eden, Talya, et autres
Publié: (2026)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)

Inverse matroid optimization under subset constraints
par: Bérczi, Kristóf, et autres
Publié: (2025)