References analysis of the Wikipedia article "Cartesian tree" in the English version

ams.org

mathscinet.ams.org

Hu (1961); Leclerc (1981) Hu, T. C. (1961), "The maximum capacity route problem", Operations Research, 9 (6): 898–900, doi:10.1287/opre.9.6.898, JSTOR 167055 Leclerc, Bruno (1981), "Description combinatoire des ultramétriques", Centre de Mathématique Sociale. École Pratique des Hautes Études. Mathématiques et Sciences Humaines (in French) (73): 5–37, 127, MR 0623034

arxiv.org

Kozma & Saranurak (2020). Kozma, László; Saranurak, Thatchaphol (2020), "Smooth Heaps and a Dual View of Self-Adjusting Data Structures", SIAM J. Comput., 49 (5), SIAM, arXiv:1802.05471, doi:10.1137/18M1195188

Tarjan, Levy & Timmel (2021). Tarjan, Robert E.; Levy, Caleb C.; Timmel, Stephen (2021), "Zip trees", ACM Transactions on Algorithms, 17 (4): 34:1–34:12, arXiv:1806.06726, doi:10.1145/3476830, S2CID 49298052

Park et al. (2019); Park et al. (2020); Song et al. (2021); Kim & Cho (2021); Nishimoto et al. (2021); Oizumi et al. (2022) Park, Sung Gwan; Amir, Amihood; Landau, Gad M.; Park, Kunsoo (2019), "Cartesian tree matching and indexing", in Pisanti, Nadia; Pissis, Solon P. (eds.), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy, LIPIcs, vol. 128, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 16:1–16:14, arXiv:1905.08974, doi:10.4230/LIPIcs.CPM.2019.16, ISBN 9783959771030, S2CID 162168587 Park, Sung Gwan; Bataa, Magsarjav; Amir, Amihood; Landau, Gad M.; Park, Kunsoo (2020), "Finding patterns and periods in Cartesian tree matching", Theoretical Computer Science, 845: 181–197, doi:10.1016/j.tcs.2020.09.014, S2CID 225227284 Song, Siwoo; Gu, Geonmo; Ryu, Cheol; Faro, Simone; Lecroq, Thierry; Park, Kunsoo (2021), "Fast algorithms for single and multiple pattern Cartesian tree matching", Theoretical Computer Science, 849: 47–63, doi:10.1016/j.tcs.2020.10.009, S2CID 225142815 Kim, Sung-Hwan; Cho, Hwan-Gue (2021), "A compact index for Cartesian tree matching", in Gawrychowski, Pawel; Starikovskaya, Tatiana (eds.), 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wrocław, Poland, LIPIcs, vol. 191, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 18:1–18:19, doi:10.4230/LIPIcs.CPM.2021.18, ISBN 9783959771863 Nishimoto, Akio; Fujisato, Noriki; Nakashima, Yuto; Inenaga, Shunsuke (2021), "Position heaps for Cartesian-tree matching on strings and tries", in Lecroq, Thierry; Touzet, Hélène (eds.), String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings, Lecture Notes in Computer Science, vol. 12944, Springer, pp. 241–254, arXiv:2106.01595, doi:10.1007/978-3-030-86692-1_20, ISBN 978-3-030-86691-4, S2CID 235313506 Oizumi, Tsubasa; Kai, Takeshi; Mieno, Takuya; Inenaga, Shunsuke; Arimura, Hiroki (2022), "Cartesian Tree Subsequence Matching", in Bannai, Hideo; Holub, Jan (eds.), 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic, LIPIcs, vol. 223, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 14:1–14:18, doi:10.4230/LIPIcs.CPM.2022.14, ISBN 9783959772341, S2CID 246679910

doi.org

Vuillemin (1980). Vuillemin, Jean (1980), "A unifying look at data structures", Communications of the ACM, 23 (4), New York, NY, USA: ACM: 229–239, doi:10.1145/358841.358852, S2CID 10462194

Gabow, Bentley & Tarjan (1984). Gabow, Harold N.; Bentley, Jon Louis; Tarjan, Robert E. (1984), "Scaling and related techniques for geometry problems", STOC '84: Proc. 16th ACM Symp. Theory of Computing, New York, NY, USA: ACM, pp. 135–143, doi:10.1145/800057.808675, ISBN 0-89791-133-4, S2CID 17752833

Berkman, Schieber & Vishkin (1993). Berkman, Omer; Schieber, Baruch; Vishkin, Uzi (1993), "Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values", Journal of Algorithms, 14 (3): 344–370, doi:10.1006/jagm.1993.1018

Shun & Blelloch (2014). Shun, Julian; Blelloch, Guy E. (2014), "A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction", ACM Transactions on Parallel Computing, 1: 1–20, doi:10.1145/2661653, S2CID 1912378

Hartmann et al. (2021). Hartmann, Maria; Kozma, László; Sinnamon, Corwin; Tarjan, Robert E. (2021), "Analysis of Smooth Heaps and Slim Heaps", ICALP: 79:1–79:20, doi:10.4230/LIPIcs.ICALP.2021.79

Bialynicka-Birula & Grossi (2006). Bialynicka-Birula, Iwona; Grossi, Roberto (2006), "Amortized rigidness in dynamic Cartesian trees", in Durand, Bruno; Thomas, Wolfgang (eds.), STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, Lecture Notes in Computer Science, vol. 3884, Springer, pp. 80–91, doi:10.1007/11672142_5, ISBN 978-3-540-32301-3

Gabow, Bentley & Tarjan (1984); Bender & Farach-Colton (2000). Gabow, Harold N.; Bentley, Jon Louis; Tarjan, Robert E. (1984), "Scaling and related techniques for geometry problems", STOC '84: Proc. 16th ACM Symp. Theory of Computing, New York, NY, USA: ACM, pp. 135–143, doi:10.1145/800057.808675, ISBN 0-89791-133-4, S2CID 17752833

Harel & Tarjan (1984); Schieber & Vishkin (1988). Harel, Dov; Tarjan, Robert E. (1984), "Fast algorithms for finding nearest common ancestors", SIAM Journal on Computing, 13 (2): 338–355, doi:10.1137/0213024 Schieber, Baruch; Vishkin, Uzi (1988), "On finding lowest common ancestors: simplification and parallelization", SIAM Journal on Computing, 17 (6): 1253–1262, doi:10.1137/0217079

Demaine, Landau & Weimann (2009). Demaine, Erik D.; Landau, Gad M.; Weimann, Oren (2009), "On Cartesian trees and range minimum queries", Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Lecture Notes in Computer Science, vol. 5555, pp. 341–353, doi:10.1007/978-3-642-02927-1_29, hdl:1721.1/61963, ISBN 978-3-642-02926-4

Seidel & Aragon (1996). Seidel, Raimund; Aragon, Cecilia R. (1996), "Randomized Search Trees", Algorithmica, 16 (4/5): 464–497, doi:10.1007/s004539900061 (inactive 1 November 2024){{citation}}: CS1 maint: DOI inactive as of November 2024 (link)

Levcopoulos & Petersson (1989). Levcopoulos, Christos; Petersson, Ola (1989), "Heapsort - Adapted for Presorted Files", WADS '89: Proceedings of the Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 382, London, UK: Springer-Verlag, pp. 499–509, doi:10.1007/3-540-51542-9_41, ISBN 978-3-540-51542-5

handle.net

hdl.handle.net

jstor.org

semanticscholar.org

api.semanticscholar.org