„longest common increasing subsequence“

Suchergebnisse

7 Treffer

• Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
  Duraj, Lech ; Künnemann, Marvin ; Polak, Adam 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence
  Cheng, Kuan ; Farhadi, Alireza ; Hajiaghayi, MohammadTaghi ; Jin, Zhengzhong ; Li, Xin ; Rubinstein, Aviad ; Seddighin, Saeed ; Zheng, Yu 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
  Agrawal, Anadi ; Gawrychowski, Paweł 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem
  Duraj, Lech 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A faster algorithm for computing a longest common increasing subsequence
  Katriel, Irit ; Kutz, Martin 2005 MPI Informatik, Bibliothek & Dokumentation
• Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
  Duraj, Lech ; Künnemann, Marvin ; Polak, Adam
• The longest commonly positioned increasing subsequences problem
  He, Xiaozhou ; Xu, Yinfeng