Imagen de Portada

Analyzing Collection Strategies: A Computational Perspective on the Coupon Collector Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abraham, Hadas, Feldman, Ido, Yaakobi, Eitan
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Robust Gray Codes Approaching the Optimal Rate
por: Con, Roni, et al.
Publicado: (2024)

A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities
por: Rivkin, Joey, et al.
Publicado: (2024)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
por: Ahmadypour, Niloufar, et al.
Publicado: (2020)

A probabilistic analysis on general probabilistic scheduling problems
por: Suruga, Daiki
Publicado: (2024)

A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data
por: Smart, Bridget, et al.
Publicado: (2025)

An Instance-Based Approach to the Trace Reconstruction Problem
por: Mazooji, Kayvon, et al.
Publicado: (2024)

Quantum Channel Certification with Incoherent Strategies
por: Fawzi, Omar, et al.
Publicado: (2023)

Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
por: Löffler, Maarten, et al.
Publicado: (2026)

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
por: Alaoui, Ziad Ismaili, et al.
Publicado: (2026)

An Additive Approximation Scheme for Generating Dyadic Codings for the Outputs of an LLM
por: Bar-Lev, Daniella, et al.
Publicado: (2026)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
por: Ly, Hoang, et al.
Publicado: (2025)

Key Compression Limits for $k$-Minimum Value Sketches
por: Dickens, Charlie, et al.
Publicado: (2024)

Information Theoretic Limits of Cardinality Estimation: Fisher Meets Shannon
por: Pettie, Seth, et al.
Publicado: (2020)

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation
por: Wang, Ziao, et al.
Publicado: (2023)

Capacity-Achieving Gray Codes
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

Investigations on Algorithm Selection for Interval-Based Coding Methods
por: Strutz, Tilo, et al.
Publicado: (2024)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
por: Jeronimo, Fernando Granha, et al.
Publicado: (2025)

Pcodec: Better Compression for Numerical Sequences
por: Loncaric, Martin, et al.
Publicado: (2025)

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
por: Peikert, Chris, et al.
Publicado: (2025)

Old and New Results on Alphabetic Codes
por: Bruno, Roberto, et al.
Publicado: (2025)

Lower Bounds on Adaptive Sensing for Matrix Recovery
por: Kacham, Praneeth, et al.
Publicado: (2023)

Efficient $\varepsilon$-approximate minimum-entropy couplings
por: Compton, Spencer
Publicado: (2025)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
por: Ashvinkumar, Vikrant, et al.
Publicado: (2025)

Graph Reconstruction from Noisy Random Subgraphs
por: McGregor, Andrew, et al.
Publicado: (2024)

More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
por: Ghentiyala, Surendra, et al.
Publicado: (2024)

Continuous Optimization for Decoding Errors
por: Srivastava, Shashank
Publicado: (2024)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
por: Bruno, Roberto, et al.
Publicado: (2025)

Efficiency of ANS Entropy Encoders
por: Kosolobov, Dmitry
Publicado: (2022)

Worst-case optimal adaptive alphabetic prefix-free coding
por: Gagie, Travis
Publicado: (2021)

Satisfying the Restricted Isometry Property with the Optimal Number of Rows and Slightly Less Randomness
por: Rao, Shravas
Publicado: (2023)

Towards Optimal Grammars for RNA Structures
por: Onokpasa, Evarista, et al.
Publicado: (2024)

Kernels for Storage Capacity and Dual Index Coding
por: Haviv, Ishay
Publicado: (2025)

Scheduling Multi-Server Jobs is Not Easy
por: Vaze, Rahul
Publicado: (2024)

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

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
por: Wang, Ziao, et al.
Publicado: (2022)

Hyperbolic Sets in Incomplete Tables
por: Bernal, J. J., et al.
Publicado: (2025)

Semidefinite Programming for the Asymmetric Stochastic Block Model
por: Gaudio, Julia, et al.
Publicado: (2025)

Testing (Conditional) Mutual Information
por: Seyfried, Jan, et al.
Publicado: (2025)

Uniform Universal Sets, Splitters, and Bisectors
por: Burjons, Elisabet, et al.
Publicado: (2025)

Improved Approximation Algorithms for Index Coding
por: Chawin, Dror, et al.
Publicado: (2024)