Document Open Access Logo

Range Longest Increasing Subsequence and Its Relatives

Authors Karthik C. S. , Saladi Rahul

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITCS.2026.87.pdf
  • Filesize: 1.03 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Data structures design and analysis
  • Theory of computation → Computational geometry
Keywords
  • Longest Increasing Subsequence
  • Range Query
  • Fine-Grained Complexity

Metrics

Abstract

Longest increasing subsequence (LIS) is a classical textbook problem which is still actively studied in various computational models. In this work, we present a few results for the range longest increasing subsequence problem (Range-LIS) and its variants. The input to Range-LIS is a sequence 𝒮 of n real numbers and a collection 𝒬 of m query ranges and for each query in 𝒬, the goal is to report the LIS of the sequence 𝒮 restricted to that query. Our two main results are for the following generalizations of the Range-LIS problem: 
2D Range Queries: In this variant of the Range-LIS problem, each query is a pair of ranges, one of indices and the other of values, and we provide a randomized algorithm with running time Õ(mn^{1/2}+ n^{3/2})+O(k), where k is the cumulative length of the m output subsequences. This improves on the elementary Õ(mn) runtime algorithm when m = Ω(√n). Previously, the only known result breaking the quadratic barrier was of Tiskin [SODA'10] which could only handle 1D range queries (i.e., each query was a range of indices) and also just outputted the length of the LIS (instead of reporting the subsequence achieving that length). Subsequent to our paper, Gawrychowski, Gorbachev, and Kociumaka in a preprint have extended Tiskin’s approach to handle reporting 1D range queries in O(n(log n)³+m+k) time.
Colored Sequences: In this variant of the Range-LIS problem, each element in 𝒮 is colored and for each query in 𝒬, the goal is to report a monochromatic LIS contained in the sequence 𝒮 restricted to that query. For 2D queries, we provide a randomized algorithm for this colored version with running time Õ(mn^{2/3}+ n^{5/3})+O(k). Moreover, for 1D queries, we provide an improved algorithm with running time Õ(mn^{1/2}+ n^{3/2})+O(k). Thus, we again improve on the elementary Õ(mn) runtime algorithm. Additionally, we prove that assuming the well-known Combinatorial Boolean Matrix Multiplication Hypothesis, that the runtime for 1D queries is essentially tight for combinatorial algorithms. 

Our algorithms combine several tools such as dynamic programming (to precompute increasing subsequences with some desirable properties), geometric data structures (to efficiently compute the dynamic programming entries), random sampling (to capture elements which are part of the LIS), classification of query ranges into large LIS and small LIS, and classification of colors into light and heavy. We believe that our techniques will be of interest to tackle other variants of LIS problem and other range-searching problems.

Cite As Get BibTex

Karthik C. S. and Saladi Rahul. Range Longest Increasing Subsequence and Its Relatives. In 17th Innovations in Theoretical Computer Science Conference (ITCS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 362, pp. 87:1-87:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ITCS.2026.87

Author Details

Karthik C. S.
  • Rutgers University, New Brunswick, NJ, USA
Saladi Rahul
  • Indian Institute of Science, Bangalore, India

Funding

  • Karthik C. S.: This work was supported by the National Science Foundation under Grant CCF-2313372 and by the Simons Foundation, Grant Number 825876, Awardee Thu D. Nguyen.
  • Rahul, Saladi: This work supported in part by the Walmart Center for Tech Excellence at IISc (CSR Grant WMGT-23-0001).

Acknowledgements

We thank the anonymous reviewers for several helpful comments that improved the presentation of our results.

References

  1. Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, and Raghu Meka. New graph decompositions and combinatorial boolean matrix multiplication algorithms. In STOC, 2024. To appear. Google Scholar
  2. Amir Abboud and Virginia Vassilevska Williams. Popular conjectures imply strong lower bounds for dynamic problems. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pages 434-443. IEEE, 2014. URL: https://doi.org/10.1109/FOCS.2014.53.
  3. Peyman Afshani, Lars Arge, and Kasper Dalgaard Larsen. Orthogonal range reporting in three and higher dimensions. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 149-158, 2009. URL: https://doi.org/10.1109/FOCS.2009.58.
  4. Peyman Afshani, Gerth Stolting Brodal, and Norbert Zeh. Ordered and unordered top-k range reporting in large data sets. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 390-400, 2011. URL: https://doi.org/10.1137/1.9781611973082.31.
  5. Pankaj K. Agarwal and Jeff Erickson. Geometric range searching and its relatives. Advances in Discrete and Computational Geometry, pages 1-56, 1998. Google Scholar
  6. Pankaj K. Agarwal, Sathish Govindarajan, and S. Muthukrishnan. Range searching in categorical data: Colored range searching on grid. In Proceedings of European Symposium on Algorithms (ESA), pages 17-28, 2002. URL: https://doi.org/10.1007/3-540-45749-6_6.
  7. Miklós Ajtai, TS Jayram, Ravi Kumar, and D Sivakumar. Approximate counting of inversions in a data stream. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 370-379, 2002. Google Scholar
  8. Michael H Albert, Alexander Golynski, Angèle M Hamel, Alejandro López-Ortiz, S Srinivasa Rao, and Mohammad Ali Safari. Longest increasing subsequences in sliding windows. Theoretical Computer Science, 321(2-3):405-414, 2004. URL: https://doi.org/10.1016/J.TCS.2004.03.057.
  9. Stephen F Altschul, Warren Gish, Webb Miller, Eugene W Myers, and David J Lipman. Basic local alignment search tool. Journal of molecular biology, 215(3):403-410, 1990. Google Scholar
  10. Alexandr Andoni, Negev Shekel Nosatzki, Sandip Sinha, and Clifford Stein. Estimating the longest increasing subsequence in nearly optimal time. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 708-719, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00073.
  11. Lars Arge. The buffer tree: A technique for designing batched external data structures. Algorithmica, 37(1):1-24, 2003. URL: https://doi.org/10.1007/S00453-003-1021-X.
  12. Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz. Graph expansion and communication costs of fast matrix multiplication. Journal of the ACM (JACM), 59(6):1-23, 2013. URL: https://doi.org/10.1145/2395116.2395121.
  13. Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 3rd edition, 2008. Google Scholar
  14. Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, and Athanasios K. Tsakalidis. New upper bounds for generalized intersection searching problems. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 464-474, 1995. URL: https://doi.org/10.1007/3-540-60084-1_97.
  15. Gerth Stolting Brodal. External memory three-sided range reporting and top-k queries with sublogarithmic updates. In Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS), volume 47, pages 23:1-23:14. 2016. URL: https://doi.org/10.4230/LIPIcs.STACS.2016.23.
  16. Gerth Stølting Brodal, Pooya Davoodi, and S. Srinivasa Rao. On space efficient two dimensional range minimum data structures. In Proceedings of European Symposium on Algorithms (ESA), pages 171-182, 2010. URL: https://doi.org/10.1007/978-3-642-15781-3_15.
  17. Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, and Alejandro Lopez-Ortiz. Online sorted range reporting. In International Symposium on Algorithms and Computation (ISAAC), pages 173-182, 2009. URL: https://doi.org/10.1007/978-3-642-10631-6_19.
  18. Gerth Stølting Brodal, Beat Gfeller, Allan Gronlund Jorgensen, and Peter Sanders. Towards optimal range medians. Theoretical Computer Science, 412(24):2588-2601, 2011. URL: https://doi.org/10.1016/J.TCS.2010.05.003.
  19. Gerth Stølting Brodal and Kasper Green Larsen. Optimal planar orthogonal skyline counting queries. In Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pages 110-121, 2014. URL: https://doi.org/10.1007/978-3-319-08404-6_10.
  20. Gerth Stolting Brodal and Konstantinos Tsakalidis. Dynamic planar range maxima queries. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 256-267, 2011. Google Scholar
  21. Timothy M Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, and Bryan T Wilkinson. Linear-space data structures for range mode query in arrays. Theory of Computing Systems, 55(4):719-741, 2014. URL: https://doi.org/10.1007/S00224-013-9455-2.
  22. Timothy M. Chan, Qizheng He, and Yakov Nekrich. Further results on colored range searching. In International Symposium on Computational Geometry (SoCG), pages 28:1-28:15, 2020. URL: https://doi.org/10.4230/LIPIcs.SOCG.2020.28.
  23. Timothy M. Chan and Zhengcheng Huang. Dynamic colored orthogonal range searching. In Proceedings of European Symposium on Algorithms (ESA), volume 204, pages 28:1-28:13, 2021. URL: https://doi.org/10.4230/LIPIcs.ESA.2021.28.
  24. Timothy M. Chan, Kasper Green Larsen, and Mihai Patrascu. Orthogonal range searching on the ram, revisited. In Proceedings of Symposium on Computational Geometry (SoCG), pages 1-10, 2011. URL: https://doi.org/10.1145/1998196.1998198.
  25. Timothy M. Chan and Yakov Nekrich. Better data structures for colored orthogonal range reporting. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 627-636, 2020. URL: https://doi.org/10.1137/1.9781611975994.38.
  26. Funda Ergun and Hossein Jowhari. On distance to monotonicity and longest increasing subsequence of a data stream. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 730-736, 2008. Google Scholar
  27. Michael L Fredman. On computing the length of longest increasing subsequences. Discrete Mathematics, 11(1):29-35, 1975. URL: https://doi.org/10.1016/0012-365X(75)90103-X.
  28. Anna Gál and Parikshit Gopalan. Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence. SIAM Journal on Computing, 39(8):3463-3479, 2010. URL: https://doi.org/10.1137/090770801.
  29. Pawel Gawrychowski, Egor Gorbachev, and Tomasz Kociumaka. Core-sparse monge matrix multiplication: Improved algorithm and applications. CoRR, abs/2408.04613, 2024. URL: https://doi.org/10.48550/arXiv.2408.04613.
  30. Paweł Gawrychowski and Wojciech Janczewski. Conditional lower bounds for variants of dynamic LIS. arXiv preprint arXiv:2102.11797, 2021. Google Scholar
  31. Pawel Gawrychowski and Wojciech Janczewski. Fully dynamic approximation of LIS in polylogarithmic time. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 654-667, 2021. URL: https://doi.org/10.1145/3406325.3451137.
  32. Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, and Ravi Kumar. Estimating the sortedness of a data stream. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 318-327, 2007. URL: http://dl.acm.org/citation.cfm?id=1283383.1283417.
  33. Prosenjit Gupta, Ravi Janardan, Saladi Rahul, and Michiel H. M. Smid. Computational geometry: Generalized (or colored) intersection searching. In Handbook of Data Structures and Applications, CRC Press, 2nd edition, pages 1042-1057, 2018. Google Scholar
  34. Prosenjit Gupta, Ravi Janardan, and Michiel H. M. Smid. Further results on generalized intersection searching problems: Counting, reporting, and dynamization. Journal of Algorithms, 19(2):282-317, 1995. URL: https://doi.org/10.1006/JAGM.1995.1038.
  35. Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pages 21-30, 2015. URL: https://doi.org/10.1145/2746539.2746609.
  36. Xiaocheng Hu, Miao Qiao, and Yufei Tao. Independent range sampling. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 246-255, 2014. URL: https://doi.org/10.1145/2594538.2594545.
  37. Ravi Janardan and Mario A. Lopez. Generalized intersection searching problems. International Journal of Computational Geometry and Applications, 3(1):39-69, 1993. URL: https://doi.org/10.1142/S021819599300004X.
  38. Ruoming Jin, Scott McCallen, and Eivind Almaas. Trend motif: A graph mining approach for analysis of dynamic complex networks. In Proceedings of International Conference on Management of Data (ICDM), pages 541-546, 2007. URL: https://doi.org/10.1109/ICDM.2007.92.
  39. Haim Kaplan, Natan Rubin, Micha Sharir, and Elad Verbin. Counting colors in boxes. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 785-794, 2007. URL: http://dl.acm.org/citation.cfm?id=1283383.1283467.
  40. Haim Kaplan, Micha Sharir, and Elad Verbin. Colored intersection searching via sparse rectangular matrix multiplication. In Proceedings of Symposium on Computational Geometry (SoCG), pages 52-60, 2006. URL: https://doi.org/10.1145/1137856.1137866.
  41. Marek Karpinski and Yakov Nekrich. Top-k color queries for document retrieval. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 401-411, 2011. URL: https://doi.org/10.1137/1.9781611973082.32.
  42. Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, and Jun Tarui. Space-efficient algorithms for longest increasing subsequence. In Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS), 2018. Google Scholar
  43. Tomasz Kociumaka and Saeed Seddighin. Improved dynamic algorithms for longest increasing subsequence. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 640-653, 2021. URL: https://doi.org/10.1145/3406325.3451026.
  44. Danny Krizanc, Pat Morin, and Michiel H. M. Smid. Range mode and range median queries on lists and trees. Nordic Journal of Computing, 12(1):1-17, 2005. Google Scholar
  45. Ying Kit Lai, Chung Keung Poon, and Benyun Shi. Approximate colored range and point enclosure queries. Journal of Discrete Algorithms, 6(3):420-432, 2008. URL: https://doi.org/10.1016/J.JDA.2007.10.001.
  46. Kasper Green Larsen and Rasmus Pagh. I/O-efficient data structures for colored range and prefix reporting. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 583-592, 2012. URL: https://doi.org/10.1137/1.9781611973099.49.
  47. Kasper Green Larsen and Freek van Walderveen. Near-optimal range reporting structures for categorical data. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 265-276, 2013. URL: https://doi.org/10.1137/1.9781611973105.20.
  48. Lillian Lee. Fast context-free grammar parsing requires fast boolean matrix multiplication. Journal of the ACM (JACM), 49(1):1-15, 2002. URL: https://doi.org/10.1145/505241.505242.
  49. Youhuan Li, Lei Zou, Huaming Zhang, and Dongyan Zhao. Longest increasing subsequence computation over streaming sequences. IEEE Transactions on Knowledge and Data Engineering (TKDE), 30(6):1036-1049, 2017. URL: https://doi.org/10.1109/TKDE.2017.2761345.
  50. David Liben-Nowell, Erik Vee, and An Zhu. Finding longest increasing and common subsequences in streaming data. Journal of Combinatorial Optimization, 11:155-175, 2006. URL: https://doi.org/10.1007/S10878-006-7125-X.
  51. Colin L Mallows. Patience sorting. SIAM Review, 4(2):148-149, 1962. Google Scholar
  52. Colin L Mallows. Patience sorting. SIAM Review, 5(4):375, 1963. Google Scholar
  53. Michael Mitzenmacher and Saeed Seddighin. Dynamic algorithms for LIS and distance to monotonicity. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 671-684, 2020. URL: https://doi.org/10.1145/3357713.3384240.
  54. S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 657-666, 2002. URL: http://dl.acm.org/citation.cfm?id=545381.545469.
  55. Yakov Nekrich. Efficient range searching for categorical and plain data. ACM Transactions on Database Systems (TODS), 39(1):9, 2014. Google Scholar
  56. Yakov Nekrich and Saladi Rahul. 4d range reporting in the pointer machine model in almost-optimal time. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1862-1876, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH71.
  57. Yakov Nekrich and Jeffrey Scott Vitter. Optimal color range reporting in one dimension. In Proceedings of European Symposium on Algorithms (ESA), pages 743-754, 2013. URL: https://doi.org/10.1007/978-3-642-40450-4_63.
  58. Ilan Newman and Nithin Varma. New sublinear algorithms and lower bounds for LIS estimation. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 100:1-100:20, 2021. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.100.
  59. Manish Patil, Sharma V. Thankachan, Rahul Shah, Yakov Nekrich, and Jeffrey Scott Vitter. Categorical range maxima queries. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 266-277, 2014. URL: https://doi.org/10.1145/2594538.2594557.
  60. Saladi Rahul. Approximate range counting revisited. In 33rd International Symposium on Computational Geometry (SoCG), volume 77, pages 55:1-55:15, 2017. URL: https://doi.org/10.4230/LIPIcs.SOCG.2017.55.
  61. Saladi Rahul. Approximate range counting revisited. Journal of Computational Geometry, 12(1):40-69, 2021. URL: https://doi.org/10.20382/JOCG.V12I1A3.
  62. Saladi Rahul and Ravi Janardan. Algorithms for range-skyline queries. In Proceedings of ACM Symposium on Advances in Geographic Information Systems (GIS), pages 526-529, 2012. URL: https://doi.org/10.1145/2424321.2424406.
  63. Saladi Rahul and Yufei Tao. On top-k range reporting in 2d space. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 265-275, 2015. URL: https://doi.org/10.1145/2745754.2745777.
  64. Saladi Rahul and Yufei Tao. Efficient top-k indexing via general reductions. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 277-288, 2016. URL: https://doi.org/10.1145/2902251.2902290.
  65. Saladi Rahul and Yufei Tao. A guide to designing top-k indexes. SIGMOD Record, 48(2):6-17, 2019. URL: https://doi.org/10.1145/3377330.3377332.
  66. Liam Roditty and Uri Zwick. On dynamic shortest paths problems. Algorithmica, 61:389-401, 2011. URL: https://doi.org/10.1007/S00453-010-9401-5.
  67. Aviad Rubinstein, Saeed Seddighin, Zhao Song, and Xiaorui Sun. Approximation algorithms for lcs and LIS with truly improved running times. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1121-1145, 2019. URL: https://doi.org/10.1109/FOCS.2019.00071.
  68. Michael Saks and C Seshadhri. Estimating the longest increasing sequence in polylogarithmic time. SIAM Journal of Computing, 46(2):774-823, 2017. URL: https://doi.org/10.1137/130942152.
  69. Neil Sarnak and Robert Endre Tarjan. Planar point location using persistent search trees. Communications of the ACM (CACM), 29(7):669-679, 1986. URL: https://doi.org/10.1145/6138.6151.
  70. Giorgio Satta. Tree-adjoining grammar parsing and boolean matrix multiplication. Computational linguistics, 20(2):173-191, 1994. Google Scholar
  71. Qingmin Shi and Joseph JáJá. Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. Information Processing Letters (IPL), 95(3):382-388, 2005. URL: https://doi.org/10.1016/J.IPL.2005.04.008.
  72. Xiaoming Sun and David P Woodruff. The communication and streaming complexity of computing the longest common and increasing subsequences. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 336-345, 2007. URL: http://dl.acm.org/citation.cfm?id=1283383.1283419.
  73. Yufei Tao. Algorithmic techniques for independent query sampling. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), pages 129-138, 2022. URL: https://doi.org/10.1145/3517804.3526068.
  74. Alexander Tiskin. Semi-local longest common subsequences in subquadratic time. Journal of Discrete Algorithms, 6(4):570-581, 2008. URL: https://doi.org/10.1016/J.JDA.2008.07.001.
  75. Alexander Tiskin. Fast distance multiplication of unit-monge matrices. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1287-1296, 2010. URL: https://doi.org/10.1137/1.9781611973075.103.
  76. Alexandre Tiskin. Semi-local string comparison: Algorithmic techniques and applications. Math. Comput. Sci., 1(4):571-603, 2008. URL: https://doi.org/10.1007/S11786-007-0033-3.
  77. Jie Xue. Colored range closest-pair problem under general distance functions. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 373-390, 2019. URL: https://doi.org/10.1137/1.9781611975482.24.
  78. Jie Xue, Yuan Li, Saladi Rahul, and Ravi Janardan. Searching for the closest-pair in a query translate. Journal of Computational Geometry, 11(2):26-61, 2020. URL: https://doi.org/10.20382/JOCG.V11I2A3.
  79. Jie Xue, Yuan Li, Saladi Rahul, and Ravi Janardan. New bounds for range closest-pair problems. Discrete & Computational Geometry, 68(1):1-49, 2022. URL: https://doi.org/10.1007/S00454-022-00388-7.
  80. Hongyu Zhang. Alignment of blast high-scoring segment pairs based on the longest increasing subsequence algorithm. Bioinformatics, 19(11):1391-1396, 2003. URL: https://doi.org/10.1093/BIOINFORMATICS/BTG168.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact