Cartesian tree: Difference between revisions

Content deleted Content added
added alternative algorithm for construction, it is theorem 4.1 in the referenced paper at https://arxiv.org/pdf/1802.05471
No edit summary
Line 169:
| year = 2021| doi-access = free
| isbn = 9783959771863
}}
*{{citation
| last1 = Kozma | first1 = Laszlo
| last2 = Saranurak | first2 = Thatchaphol
| doi = 10.1137/18M1195188
| number = 5
| journal = [[SIAM J. Comput]]
| publisher = SIAM
| title = Smooth Heaps and a Dual View of Self-Adjusting Data Structures
| volume = 49
| year = 2020
}}
*{{citation
Line 329 ⟶ 340:
| volume = 23
| year = 1980| s2cid = 10462194 | doi-access = free
}}
*{{citation
| last1 = Kozma | first1 = Laszlo
| last2 = Saranurak | first2 = Thatchaphol
| doi = 10.1137/18M1195188
| number = 5
| journal = [[SIAM J. Comput]]
| publisher = SIAM
| title = Smooth Heaps and a Dual View of Self-Adjusting Data Structures
| volume = 49
| year = 2020
}}
{{refend}}