Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance

DOI10.1137/1.9781611973105.122zbMath1422.68333arXiv1204.1098OpenAlexW2952737961MaRDI QIDQ5741831

C. Seshadhri, Michael E. Saks

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.1098

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Dynamic programming (90C39) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Related Items (5)

On the monotonicity of a data stream ⋮ Space-Efficient Algorithms for Longest Increasing Subsequence ⋮ Space-efficient algorithms for longest increasing subsequence ⋮ Estimating the Longest Increasing Sequence in Polylogarithmic Time ⋮ Unnamed Item

This page was built for publication: Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance