scientific article; zbMATH DE number 7375825

DOI10.4230/LIPIcs.APPROX-RANDOM.2017.20zbMath1467.62024MaRDI QIDQ5002623

Maciej Obremski, Maciej Skórski

Publication date: 28 July 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex optimizationRenyi entropysample complexityentropy estimation

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Statistical aspects of information-theoretic topics (62B10)

Related Items (1)

Concentration of the collision estimator

Cites Work

• Unnamed Item
• Parallel collision search with cryptanalytic applications
• A thresholding method based on two-dimensional Renyi's entropy
• Estimating Renyi Entropy of Discrete Distributions
• On Testing Expansion in Bounded-Degree Graphs
• RÉnyi Entropy, Guesswork Moments, and Large Deviations
• The complexity of approximating entropy
• A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
• Estimation of Entropy and Mutual Information
• An inequality on guessing and its application to sequential decoding
• Generalized privacy amplification
• Overcoming Weak Expectations
• Leftover Hash Lemma, Revisited
• Guessing Revisited: A Large Deviations Approach
• Information Theory of DNA Shotgun Sequencing
• The Complexity of Estimating Rényi Entropy
• Testing Closeness of Discrete Distributions
• Estimating the unseen
• Inequalities: theory of majorization and its applications

This page was built for publication: