[1]   Noga Alon and Baruch Schieber: Optimal preprocessing for answering on-line product queries. Technical Report 71/87, Inst. Computer Science, Tel Aviv University, 1987. [arXiv:2406.06321]

[2]   Michael A. Bender and Martin Farach-Colton: The LCA problem revisited. In Proc. Latin American Symp. on Theoretical Informatics (LATIN’00), pp. 88–94. Springer, 2000. [doi:10.1007/10719839_9]

[3]   Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, and Pavel Sumazin: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms, 57(2):75–94, 2005. [doi:10.1016/j.jalgor.2005.08.001]

[4]   Omer Berkman and Uzi Vishkin: Recursive star-tree parallel data structure. SIAM J. Comput., 22(2):221–242, 1993. [doi:10.1137/0222017]

[5]   Peter Butkovič: Max-linear Systems: Theory and Algorithms. Springer, 2010. [doi:10.1007/978-1-84996-299-5]

[6]   Bernard Chazelle and Burton Rosenberg: The complexity of computing partial sums off-line. Internat. J. Comput. Geom. Appl., 1(1):33–45, 1991. [doi:10.1142/S0218195991000049]

[7]   Peter M. Fenwick: A new data structure for cumulative frequency tables. Softw., Pract. Exper., 24(3):327–336, 1994. [doi:10.1002/spe.4380240306]

[8]   Johannes Fischer and Volker Heun: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In Proc. Annual Symp. on Combinatorial Pattern Matching (CPM’06), pp. 36–48. Springer, 2006. [doi:10.1007/11780441_5]

[9]   Michael J. Fischer and Albert R. Meyer: Boolean matrix multiplication and transitive closure. In Proc. 12th Annual Symp. on Switching and Automata Theory (SWAT’71), pp. 129–131. IEEE Comp. Soc., 1971. [doi:10.1109/SWAT.1971.4]

[10]   François Le Gall: Powers of tensors and fast matrix multiplication. In Proc. 39th Internat. Symp. Symbolic and Algebraic Computation (ISSAC’14), pp. 296–303. ACM Press, 2014. [doi:10.1145/2608628.2608664]

[11]   James A. Green and David Rees: On semi-groups in which x^r = x. Math. Proc. Cambridge Phil. Soc., 48(1):35–40, 1952. [doi:10.1017/S0305004100027341]

[12]   Dima Grigoriev and Vladimir V. Podolskii: Complexity of tropical and min-plus linear prevarieties. Comput. Complexity, 24(1):31–64, 2015. [doi:10.1007/s00037-013-0077-5]

[13]   Alon Itai and Michael Rodeh: Finding a minimum circuit in a graph. SIAM J. Comput., 7(4):413–423, 1978. [doi:10.1137/0207033]

[14]   Stasys Jukna: Boolean Function Complexity - Advances and Frontiers. Volume 27 of Algorithms and Combinatorics. Springer, 2012. [doi:10.1007/978-3-642-24508-4]

[15]   Stasys Jukna: Tropical complexity, Sidon sets, and dynamic programming. SIAM J. Discr. Math., 30(4):2064–2085, 2016. [doi:10.1137/16M1064738]

[16]   Donald Ervin Knuth: The Art of Computer Programming, Volume II: Seminumerical Algorithms, 3rd Edition. Addison-Wesley, 1997. Available via ACM DL.

[17]   Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, and Vladimir Podolskii: Complexity of linear operators. In Proc. Internat. Symp. on Algorithms and Computation (ISAAC’19), pp. 17:1–12. Springer, 2019.

[18]   Hanna Neumann: Varieties of Groups. Springer, 1967. [doi:10.1007/978-3-642-88599-0]

[19]   Robert Endre Tarjan: Efficiency of a good but not linear set union algorithm. J. ACM, 22(2):215–225, 1975. [doi:10.1145/321879.321884]

[20]   Virginia Vassilevska Williams: Multiplying matrices faster than Coppersmith–Winograd. In Proc. 44th STOC, pp. 887–898. ACM Press, 2012. [doi:10.1145/2213977.2214056]

[21]   Virginia Vassilevska Williams and R. Ryan Williams: Subcubic equivalences between path, matrix, and triangle problems. J. ACM, 65(5):27:1–38, 2018. Preliminary version in FOCS’10. [doi:10.1145/3186893]

[22]   R. Ryan Williams: Faster all-pairs shortest paths via circuit complexity. SIAM J. Comput., 47(5):1965–1985, 2018. Preliminary version in STOC’14. [doi:10.1137/15M1024524]

[23]   Andrew Chi-Chih Yao: Space-time tradeoff for answering range queries (extended abstract). In Proc. 14th STOC, pp. 128–136. ACM Press, 1982. [doi:10.1145/800070.802185]