Exact samplers for permutations with fixed LIS length k: O(n log log n) expected time rejection sampler when k=Theta(n), and tilde O(n^3 k^4) RS-based sampler for arbitrary k via determinant oracles on Hankel moment matrices.
Improved Dynamic Algorithms for Longest Increasing Subsequence , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces approximation-preserving coresets that guarantee cost preservation for near-optimal solutions and proves that even tiny approximation-factor distortion forbids coresets of that size.
citing papers explorer
-
Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
Exact samplers for permutations with fixed LIS length k: O(n log log n) expected time rejection sampler when k=Theta(n), and tilde O(n^3 k^4) RS-based sampler for arbitrary k via determinant oracles on Hankel moment matrices.
-
Approximation Preserving Coresets
Introduces approximation-preserving coresets that guarantee cost preservation for near-optimal solutions and proves that even tiny approximation-factor distortion forbids coresets of that size.