A representation for linear lists with movable fingers

DOI10.1145/800133.804328zbMath1282.68094OpenAlexW2057625954MaRDI QIDQ5402537

Mark R. Brown, Robert Endre Tarjan

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800133.804328

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items

Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings, The longest common subsequence problem revisited, Fast linear-space computations of longest common subsequences, Efficient detection of quasiperiodicities in strings