Longest Increasing Subsequence under Persistent Comparison Errors
Sign Up to like & getrecommendations! Published in 2020 at "Theory of Computing Systems"
DOI: 10.1007/s00224-020-09966-9
Abstract: We study the problem of computing a longest increasing subsequence in a sequence S of n distinct elements in the presence of persistent comparison errors. In this model, Braverman and Mossel ( Noisy sorting without… read more here.
Keywords: persistent comparison; log; subsequence; longest increasing ... See more keywords