:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bshouty, Nader H., Haddad, George
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2604.05615
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Note on Second-Order Expected Maximum-Load Bounds for Binary Linear Hashing
par: Bshouty, Nader H.
Publié: (2026)

On Exact Learning of $d$-Monotone Functions
par: Bshouty, Nader H.
Publié: (2025)

$(1-ε)$-Approximation of Knapsack in Nearly Quadratic Time
par: Mao, Xiao
Publié: (2023)

A $(1+ε)$-Approximation for Ultrametric Embedding in Subquadratic Time
par: Bathie, Gabriel, et autres
Publié: (2025)

A simple $(2+ε)$-approximation for knapsack interdiction
par: Weninger, Noah
Publié: (2026)

Decremental $(1+ε)$-Approximate Maximum Eigenvector: Dynamic Power Method
par: Adil, Deeksha, et autres
Publié: (2024)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Limitations of Membership Queries in Testable Learning
par: Lange, Jane, et autres
Publié: (2025)

Fast and Simple $(1+ε)Δ$-Edge-Coloring of Dense Graphs
par: Dhawan, Abhishek
Publié: (2024)

A $(5/3+ε)$-Approximation for Tricolored Non-crossing Euclidean TSP
par: Baligács, Júlia, et autres
Publié: (2024)

Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
par: Haeupler, Bernhard, et autres
Publié: (2025)

Dynamic $((1+ε)\ln n)$-Approximation Algorithms for Minimum Set Cover and Dominating Set
par: Solomon, Shay, et autres
Publié: (2023)

ε-Cost Sharding: Scaling Hypergraph-Based Static Functions and Filters to Trillions of Keys
par: Vigna, Sebastiano
Publié: (2025)

A $O^*((2 + ε)^k)$ Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs
par: Lafond, Manuel, et autres
Publié: (2026)

Max-Cut with $ε$-Accurate Predictions
par: Cohen-Addad, Vincent, et autres
Publié: (2024)

Computing Tree Decompositions with Small Independence Number
par: Dallard, Clément, et autres
Publié: (2022)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
par: Haeupler, Bernhard, et autres
Publié: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
par: Bernshteyn, Anton, et autres
Publié: (2024)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
par: Assadi, Sepehr
Publié: (2023)

Improved Certificates for Independence Number in Semirandom Hypergraphs
par: Kothari, Pravesh, et autres
Publié: (2026)

Testable Learning with Distribution Shift
par: Klivans, Adam R., et autres
Publié: (2023)

Testable algorithms for approximately counting edges and triangles in sublinear time and space
par: Eden, Talya, et autres
Publié: (2025)

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

Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate
par: Chen, Ho-Lin, et autres
Publié: (2026)

Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs
par: Bieliński, Paweł Rafał, et autres
Publié: (2026)

Testably Learning Polynomial Threshold Functions
par: Slot, Lucas, et autres
Publié: (2024)

Almost-Uniform Edge Sampling: Leveraging Independent-Set and Local Graph Queries
par: Adar, Tomer, et autres
Publié: (2026)

Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries
par: Chen, Xi, et autres
Publié: (2024)

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

When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
par: Adar, Tomer, et autres
Publié: (2026)

Simpler O(1) Query Algorithm for Level Ancestors
par: Saxena, Sanjeev
Publié: (2022)

Deterministic $(2/3-\varepsilon)$-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries
par: Terao, Tatsuya
Publié: (2024)

Testable Learning of General Halfspaces under Massart Noise
par: Diakonikolas, Ilias, et autres
Publié: (2026)

Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
par: Diakonikolas, Ilias, et autres
Publié: (2024)

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

Small Independent Sets versus Small Separator in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2026)

Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
par: Boneh, Itai, et autres
Publié: (2025)

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
par: Baguley, Samuel, et autres
Publié: (2024)

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries
par: Fei, Yumou
Publié: (2025)

Extraction Theorems With Small Extraction Numbers
par: Agarwal, Arjun, et autres
Publié: (2024)