Imagen de Portada

With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Canonne, Clément L., Chen, Kenny, Mestre, Julián
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

Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
por: Canonne, Clément L., et al.
Publicado: (2025)

Instance-Optimal Uniformity Testing and Tracking
por: Blanc, Guy, et al.
Publicado: (2025)

Locally Private Histograms in All Privacy Regimes
por: Canonne, Clément L., et al.
Publicado: (2024)

Online Algorithms with Randomly Infused Advice
por: Emek, Yuval, et al.
Publicado: (2023)

Improving Online Bin Covering with Little Advice
por: Brodnik, Andrej, et al.
Publicado: (2025)

Uniformity Testing under User-Level Local Privacy
por: Canonne, Clément L., et al.
Publicado: (2025)

The Discrete Gaussian for Differential Privacy
por: Canonne, Clément L., et al.
Publicado: (2020)

Uniformity testing when you have the source code
por: Canonne, Clément L., et al.
Publicado: (2024)

Online Computation with Untrusted Advice
por: Angelopoulos, Spyros, et al.
Publicado: (2019)

Constraint Satisfaction Problems with Advice
por: Ghoshal, Suprovat, et al.
Publicado: (2024)

On the Advice Complexity of Online Matching on the Line
por: Csaba, Béla, et al.
Publicado: (2024)

High Probability Work Efficient Parallel Algorithms
por: Hutton, Chase, et al.
Publicado: (2026)

Why is My Route Different Today? An Algorithm for Explaining Route Selection
por: Schild, Aaron, et al.
Publicado: (2025)

Learning bounded-degree polytrees with known skeleton
por: Choo, Davin, et al.
Publicado: (2023)

Contract Scheduling with Distributional and Multiple Advice
por: Angelopoulos, Spyros, et al.
Publicado: (2024)

Distributed Algorithms for Euclidean Clustering
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

A Little Clairvoyance Is All You Need
por: Gupta, Anupam, et al.
Publicado: (2025)

Sublinear Spectral Clustering Oracle with Little Memory
por: Shen, Ranran, et al.
Publicado: (2026)

Removable Online Knapsack and Advice
por: Böckenhauer, Hans-Joachim, et al.
Publicado: (2020)

Streaming Algorithms for Network Design
por: Chekuri, Chandra, et al.
Publicado: (2025)

Embedding Probability Distributions into Low Dimensional $\ell_1$: Tree Ising Models via Truncated Metrics
por: Charikar, Moses, et al.
Publicado: (2023)

A Simple Algorithm for Clustering Discrete Distributions
por: Mitra, Pradipta
Publicado: (2026)

Hardness of Dynamic Tree Edit Distance and Friends
por: Hu, Bingbing, et al.
Publicado: (2025)

From Dynamic Programs to Greedy Algorithms
por: van Melkebeek, Dieter
Publicado: (2025)

Discrete Effort Distribution via Regret-enabled Greedy Algorithm
por: Cao, Song, et al.
Publicado: (2025)

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
por: Meel, Kuldeep S., et al.
Publicado: (2025)

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
por: Kothalawala, Buddhi, et al.
Publicado: (2026)

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
por: Dogeas, Konstantinos, et al.
Publicado: (2023)

Estimating Random-Walk Probabilities in Directed Graphs
por: Bertram, Christian, et al.
Publicado: (2025)

Differentially Private Learning of Exponential Distributions: Simple Algorithms and Tight Bounds
por: Mahpud, Bar, et al.
Publicado: (2025)

Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models
por: Huang, Zengfeng, et al.
Publicado: (2025)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
por: Chekuri, Chandra, et al.
Publicado: (2024)

Exploiting New Properties of String Net Frequency for Efficient Computation
por: Guo, Peaker, et al.
Publicado: (2024)

A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
por: Bringmann, Karl, et al.
Publicado: (2024)

Computing All Restricted Skyline Probabilities on Uncertain Datasets
por: Gao, Xiangyu, et al.
Publicado: (2023)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
por: Großmann, Ernestine, et al.
Publicado: (2025)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
por: Blank, Lotte, et al.
Publicado: (2025)

Entropy Equivalence Testing
por: Canonne, Clément L., et al.
Publicado: (2026)

FORWARD: Feasibility Oriented Random-Walk Inspired Algorithm for Radial Reconfiguration in Distribution Networks
por: Vendrell, Joan, et al.
Publicado: (2024)

On the Advice Complexity of Online Unit Clustering
por: Nagy-György, Judit
Publicado: (2023)