Pages that link to "Item:Q2976660"
From MaRDI portal
The following pages link to Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels (Q2976660):
Displayed 9 items.
- Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← links)
- Correlated randomly growing graphs (Q2135266) (← links)
- Efficient random graph matching via degree profiles (Q2660385) (← links)
- (Q5053318) (← links)
- Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks (Q5066493) (← links)
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)
- Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality (Q6072327) (← links)
- Testing correlation of unlabeled random graphs (Q6109918) (← links)
- Matching recovery threshold for correlated random graphs (Q6183756) (← links)