:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Duchi, John, Haque, Saminul, Kuditipudi, Rohith
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2502.20708
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

High-dimensional estimation with missing data: Statistical and computational limits
by: Verchand, Kabir Aladin, et al.
Published: (2026)

Speed-robust scheduling revisited
by: Minařík, Josef, et al.
Published: (2024)

Probabilistic analysis of arithmetic coding showing its robustness
by: Mahmoud, Hosam M., et al.
Published: (2025)

On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
by: Kapralov, Michael, et al.
Published: (2024)

Better space-time-robustness trade-offs for set reconciliation
by: Belazzougui, Djamal, et al.
Published: (2024)

An adversarially robust data-market for spatial, crowd-sourced data
by: Kharman, Aida Manzano, et al.
Published: (2022)

Recoverable robust shortest path problem under interval budgeted uncertainty representations
by: Jackiewicz, Marcel, et al.
Published: (2024)

Fair Rent Division: New Budget and Rent Constraints
by: Gangam, Rohith Reddy, et al.
Published: (2025)

New simple and fast quicksort algorithm for equal keys
by: Afereidoon, Parviz
Published: (2025)

Adaptive encodings for small and fast compressed suffix arrays
by: Díaz-Domínguez, Diego, et al.
Published: (2026)

ZOR filters: fast and smaller than fuse filters
by: Limasset, Antoine
Published: (2026)

Fast, robust approximate message passing
by: Ivkov, Misha, et al.
Published: (2024)

On efficient robust regression with subquadratic samples
by: Adil, Deeksha, et al.
Published: (2026)

Robust Popular Matchings
by: Bullinger, Martin, et al.
Published: (2024)

An Efficient and Scalable Auditing Scheme for Cloud Data Storage using an Enhanced B-tree
by: Islam, Tariqul, et al.
Published: (2024)

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

Optimal quantile estimation: beyond the comparison model
by: Gupta, Meghal, et al.
Published: (2024)

Instance-optimal estimation of L2-norm
by: Adar, Tomer
Published: (2026)

Balanced Learned Sort: a new learned model for fast and balanced item bucketing
by: Ferragina, Paolo, et al.
Published: (2024)

An information-theoretic lower bound in time-uniform estimation
by: Duchi, John C., et al.
Published: (2024)

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
by: Dell, Holger, et al.
Published: (2022)

Analyzing the effect of prediction accuracy on the distributionally-robust competitive ratio
by: Yoshinaga, Toru, et al.
Published: (2026)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)

Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares
by: Chen, Hongjie, et al.
Published: (2024)

Simple parallel estimation of the partition ratio for Gibbs distributions
by: Harris, David G., et al.
Published: (2025)

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
by: Censor-Hillel, Keren, et al.
Published: (2025)

PHast -- Perfect Hashing made fast
by: Beling, Piotr, et al.
Published: (2025)

A General Technique for Searching in Implicit Sets via Function Inversion
by: Aronov, Boris, et al.
Published: (2023)

Tight Bounds for Online Scheduling in the One-Fast-Many-Slow Machines Setting
by: Jeang, John, et al.
Published: (2026)

A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks
by: Jing, Zeyu, et al.
Published: (2023)

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

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
by: Lecroq, Thierry
Published: (2024)

Amplitude amplification and estimation require inverses
by: Tang, Ewin, et al.
Published: (2025)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

How fast can you find a good hypothesis?
by: Aamand, Anders, et al.
Published: (2025)

Barter Exchange with Shared Item Valuations
by: Luque, Juan, et al.
Published: (2024)

Preprocessed 3SUM for Unknown Universes with Subquadratic Space
by: Kirkpatrick, Yael, et al.
Published: (2026)

Testing Sparse Functions over the Reals
by: Arora, Vipul, et al.
Published: (2026)

Quantum spectral method for gradient and Hessian estimation
by: Zhang, Yuxin, et al.
Published: (2024)

Near-Optimal Heaps and Dijkstra on Pointer Machines
by: van der Hoog, Ivor, et al.
Published: (2026)