Image de couverture de livre

Stochastic Function Certification with Correlations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ghuge, Rohan, Moondra, Jai, Singh, Mohit
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms 68W25 F.2.0
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
par: Gupta, Swati, et autres
Publié: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
par: Gupta, Swati, et autres
Publié: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
par: Gupta, Swati, et autres
Publié: (2023)

Strongly Sublinear Algorithms for Testing Pattern Freeness
par: Newman, Ilan, et autres
Publié: (2021)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
par: Borodin, Allan, et autres
Publié: (2025)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
par: Gupta, Swati, et autres
Publié: (2026)

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
par: Feng, Weiming, et autres
Publié: (2022)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
par: Gu, Qian-Ping, et autres
Publié: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
par: Filmus, Yuval, et autres
Publié: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Quasi-optimal hierarchically semi-separable matrix approximation
par: Amsel, Noah, et autres
Publié: (2025)

PPSZ is better than you think
par: Scheder, Dominik
Publié: (2022)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

Optimal non-adaptive algorithm for edge estimation
par: Bishnu, Arijit, et autres
Publié: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
par: Sun, Hao
Publié: (2023)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Naively Sorting Evolving Data is Optimal and Robust
par: Giakkoupis, George, et autres
Publié: (2024)

The Telephone $k$-Multicast Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
par: Bai, Miao, et autres
Publié: (2023)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2025)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
par: Zhong, Xianghui
Publié: (2019)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
par: Shigemizu, Mika, et autres
Publié: (2018)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

APTAS for bin packing with general cost structures
par: Jaykrishnan, G., et autres
Publié: (2024)

Strengths and Limitations of Greedy in Cup Games
par: Jasińska, Kalina, et autres
Publié: (2026)

Maximizing Diversity in (near-)Median String Selection
par: Chakraborty, Diptarka, et autres
Publié: (2026)

String 2-Covers with No Length Restrictions
par: Boneh, Itai, et autres
Publié: (2024)

Fast FPT Algorithms for Grundy Number on Dense Graphs
par: Nezhad, Sina Ghasemi, et autres
Publié: (2024)

Minimum-cost paths for electric cars
par: Dorfman, Dani, et autres
Publié: (2024)

Hairpin Completion Distance Lower Bound
par: Boneh, Itai, et autres
Publié: (2024)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
par: Crochemore, Maxime, et autres
Publié: (2025)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
par: Grobben, Kobe, et autres
Publié: (2025)

The Quasi-probability Method and Applications for Trace Reconstruction
par: Rubinstein, Ittai
Publié: (2024)

Many Objective Problems Where Crossover is Provably Essential
par: Opris, Andre
Publié: (2024)