Imagen de Portada

Distribution Testing Meets Sum Estimation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pradhan, Pinki, Roy, Sampriti
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Sublinear-time Moment Estimation using Weighted Sampling
por: Bhattacharya, Anup, et al.
Publicado: (2025)

Improved Algorithms for Clustering with Noisy Distance Oracles
por: Pradhan, Pinki, et al.
Publicado: (2026)

Sum Estimation via Vector Similarity Search
por: Mussmann, Stephen, et al.
Publicado: (2026)

Testing Distributions of Huge Objects
por: Goldreich, Oded, et al.
Publicado: (2022)

Distributionally Robust $k$-of-$n$ Sequential Testing
por: Tan, Rayen, et al.
Publicado: (2026)

When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
por: Adar, Tomer, et al.
Publicado: (2026)

Online Distributed Queue Length Estimation
por: Bhaskara, Aditya, et al.
Publicado: (2025)

Sparsifying Sums of Positive Semidefinite Matrices
por: Basu, Arpon, et al.
Publicado: (2025)

Approximate Min-Sum Subset Convolution
por: Stoian, Mihail
Publicado: (2024)

FPT Approximation for Capacitated Sum of Radii
por: Jaiswal, Ragesh, et al.
Publicado: (2024)

Derandomizing Pseudopolynomial Algorithms for Subset Sum
por: Chan, Timothy M.
Publicado: (2026)

Beating Bellman's Algorithm for Subset Sum
por: Bringmann, Karl, et al.
Publicado: (2024)

Distributed Sparsest Cut via Eigenvalue Estimation
por: Maus, Yannic, et al.
Publicado: (2025)

Sum-of-Max Chain Partition of a Tree
por: Luo, Ruixi, et al.
Publicado: (2025)

On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
por: Gadekar, Ameet
Publicado: (2026)

Min-Sum Set Cover on Parallel Machines
por: Szyfelbein, Michał
Publicado: (2026)

An Improved Pseudopolynomial Time Algorithm for Subset Sum
por: Chen, Lin, et al.
Publicado: (2024)

FPT approximations for Capacitated Sum of Radii and Diameters
por: Filtser, Arnold, et al.
Publicado: (2024)

Parameterized Algorithms for Minimum Sum Vertex Cover
por: Aute, Shubhada, et al.
Publicado: (2024)

Inverse Quadratic Decay in Random Subset Sum
por: Chen, Edwin, et al.
Publicado: (2026)

A Faster Algorithm for Pigeonhole Equal Sums
por: Jin, Ce, et al.
Publicado: (2024)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
por: Ito, Takehiro, et al.
Publicado: (2025)

FPT Approximations for Fair $k$-Min-Sum-Radii
por: Carta, Lena, et al.
Publicado: (2024)

Sumsets, 3SUM, Subset Sum: Now for Real!
por: Fischer, Nick
Publicado: (2024)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
por: Funke, Daniel, et al.
Publicado: (2024)

Optimal Non-Adaptive Tolerant Junta Testing via Local Estimators
por: Nadimpalli, Shivam, et al.
Publicado: (2024)

Testing vs Estimation for Index-Invariant Properties in the Huge Object Model
por: Chakraborty, Sourav, et al.
Publicado: (2024)

Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries
por: Chen, Xi, et al.
Publicado: (2024)

Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
por: Karathanasis, Konstantinos, et al.
Publicado: (2025)

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
por: Nezhad, Sina Bagheri, et al.
Publicado: (2025)

Approximate Maintenance of Maximum Subarray Sum in the Sliding Window Model
por: Suzuki, Ryo, et al.
Publicado: (2026)

Distribution Learning Meets Graph Structure Sampling
por: Bhattacharyya, Arnab, et al.
Publicado: (2024)

Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
por: Friggstad, Zachary, et al.
Publicado: (2024)

FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
por: Gadekar, Ameet
Publicado: (2026)

A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
por: Bhangale, Amey, et al.
Publicado: (2026)

Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs
por: Kothari, Pravesh, et al.
Publicado: (2024)

Grouped Color Deletion, Lasserre Exactness and Clique-Sum Locality for Rainbow Matching
por: Stamoulis, Georgios
Publicado: (2026)

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
por: Aggarwal, Divesh, et al.
Publicado: (2024)

Two Linear Passes Are Necessary for Sum-Exclude-Self Under Sublinear Space
por: Au, Andrew
Publicado: (2026)

Hitting Meets Packing: How Hard Can it Be?
por: Focke, Jacob, et al.
Publicado: (2024)