Imagen de Portada

Optimal quantile estimation: beyond the comparison model

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gupta, Meghal, Singhal, Mihir, Wu, Hongxun
Formato:	Preprint
Publicado:	2024
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

Tight bounds for stream decodable error-correcting codes
por: Gupta, Meghal, et al.
Publicado: (2024)

Error Correction for Message Streams
por: Gupta, Meghal, et al.
Publicado: (2023)

Interactive Coding with Unbounded Noise
por: Fargion, Eden, et al.
Publicado: (2024)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
por: Cohen, Edith, et al.
Publicado: (2025)

Locally computing edge orientations
por: Mitrović, Slobodan, et al.
Publicado: (2025)

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

Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting
por: Grossman, Ofer, et al.
Publicado: (2023)

The communication complexity of distributed estimation
por: Gopalan, Parikshit, et al.
Publicado: (2025)

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
por: Mitrović, Slobodan, et al.
Publicado: (2026)

Few Single-Qubit Measurements Suffice to Certify Any Quantum State
por: Gupta, Meghal, et al.
Publicado: (2025)

Super-Constant Weight Dicke States in Constant Depth Without Fanout
por: Gretta, Lucas, et al.
Publicado: (2026)

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches
por: Cohen, Edith, et al.
Publicado: (2024)

Optimal mass estimation in the conditional sampling model
por: Adar, Tomer, et al.
Publicado: (2025)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
por: Gribelyuk, Elena, et al.
Publicado: (2024)

The Cost of Parallelizing Boosting
por: Lyu, Xin, et al.
Publicado: (2024)

Sample-Based Matroid Prophet Inequalities
por: Fu, Hu, et al.
Publicado: (2024)

Nearly Optimal Fault Tolerant Distance Oracle
por: Dey, Dipan, et al.
Publicado: (2024)

Near Optimal Dual Fault Tolerant Distance Oracle
por: Dey, Dipan, et al.
Publicado: (2024)

A Classical Quadratic Speedup for Planted $k$XOR
por: Gupta, Meghal, et al.
Publicado: (2025)

Omnipredictors for Regression and the Approximate Rank of Convex Functions
por: Gopalan, Parikshit, et al.
Publicado: (2024)

Local Gibbs sampling beyond local uniformity
por: Liu, Hongyang, et al.
Publicado: (2025)

Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap
por: Christalla, Manuel, et al.
Publicado: (2025)

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
por: Fang, Qiming, et al.
Publicado: (2026)

Improved 2-Approximate Shortest Paths for close vertex pairs
por: Gupta, Manoj
Publicado: (2025)

Theoretical insights and an experimental comparison of tango trees and multi-splay trees
por: Al-Adhami, Khaleel, et al.
Publicado: (2024)

Theoretical limitations of multi-layer Transformer
por: Chen, Lijie, et al.
Publicado: (2024)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
por: Oliveira, Mateus de Oliveira, et al.
Publicado: (2026)

Fingerprint Filters Are Optimal
por: Kuszmaul, William, et al.
Publicado: (2025)

Optimal antimatroid sorting
por: Berendsohn, Benjamin Aram
Publicado: (2025)

Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time
por: Parter, Merav, et al.
Publicado: (2025)

Nearly Optimal List Labeling
por: Bender, Michael A., et al.
Publicado: (2024)

Time-Optimal $k$-Server
por: Frei, Fabian, et al.
Publicado: (2025)

The Role of Commitment in Optimal Stopping
por: Correa, José, et al.
Publicado: (2025)

Simpler Universally Optimal Dijkstra
por: van der Hoog, Ivor, et al.
Publicado: (2025)

The Online Submodular Cover Problem
por: Gupta, Anupam, et al.
Publicado: (2025)

Steiner Forest: A Simplified Better-Than-2 Approximation
por: Gupta, Anupam, et al.
Publicado: (2025)

Fully-Dynamic Submodular Cover with Bounded Recourse
por: Gupta, Anupam, et al.
Publicado: (2020)

A Polynomial Time, Pure Differentially Private Estimator for Binary Product Distributions
por: Singhal, Vikrant
Publicado: (2023)

Engineering Optimal Parallel Task Scheduling
por: Akram, Matthew, et al.
Publicado: (2024)

Optimal Electrical Oblivious Routing on Expanders
por: Florescu, Cella, et al.
Publicado: (2024)