Trace reconstruction: generalized and parameterized
From MaRDI portal
Recommendations
Cites work
- Efficiently learning mixtures of two Gaussians
- scientific article; zbMATH DE number 5764889 (Why is no real title available?)
- scientific article; zbMATH DE number 5764890 (Why is no real title available?)
- Learning mixtures of arbitrary Gaussians
- Learning Mixtures of Product Distributions over Discrete Domains
- Learning mixtures of structured distributions over discrete domains
- Learning Theory
- Littlewood-type problems on subarcs of the unit circle
- Lower bounds for trace reconstruction
- Mixture models, robustness, and sum of squares proofs
- On a reconstruction problem for sequences
- Optimal mean-based algorithms for trace reconstruction
- Polynomial Learning of Distribution Families
- Reconstructing strings from random traces
- Reconstruction of matrices from submatrices
- Tight bounds for learning a mixture of two Gaussians (extended abstract)
- Trace reconstruction revisited
- Trace reconstruction with \(\exp(O(n^{1/3}))\) samples
- Trace reconstruction with varying deletion probabilities
Cited in
(9)- Reconstructing trees from traces
- The trace reconstruction problem for spider graphs
- Lower bounds for trace reconstruction
- scientific article; zbMATH DE number 936308 (Why is no real title available?)
- Tree trace reconstruction using subtraces
- Trace reconstruction from local statistical queries
- Polynomial-time trace reconstruction in the smoothed complexity model
- Circular trace reconstruction
- An optimal endpoint trace embedding
This page was built for publication: Trace reconstruction: generalized and parameterized
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075814)
