The following pages link to Permutation reconstruction (Q2501000):
Displaying 19 items.
- Permutation reconstruction from MinMax-betweenness constraints (Q290110) (← links)
- Permutation reconstruction from differences (Q463039) (← links)
- A note on statistical averages for oscillating tableaux (Q491542) (← links)
- Reconstructing permutations from identification minors (Q888635) (← links)
- The solution to the partition reconstruction problem (Q1003623) (← links)
- Reconstructing permutations from cycle minors (Q1010923) (← links)
- Reconstruction of sequences (Q1182969) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← links)
- Permutations resilient to deletions (Q1710995) (← links)
- Permutation reconstruction from a few large patterns (Q2049616) (← links)
- Recursive inversion models for permutations (Q2152564) (← links)
- Growth rates of permutation classes: categorization up to the uncountability threshold (Q2182018) (← links)
- Equipopularity classes in the separable permutations (Q2341048) (← links)
- Prolific permutations and permuted packings: downsets containing many large patterns (Q2403721) (← links)
- Reconstruction of permutations distorted by reversal errors (Q2462381) (← links)
- Reconstructing compositions (Q2477377) (← links)
- Permutation reconstruction from minors (Q2500985) (← links)
- Reconstructing convex permutominoes (Q2915587) (← links)
- Reconstruction Algorithm for Permutation Graphs (Q3404435) (← links)