Content deleted Content added
Undid revision 1212797346 by Mildsunrise (talk) needs a clearer definition, and a source specifically stating the connection between these trees and Catalan numbers |
Citation bot (talk | contribs) Add: doi-broken-date, isbn. | Use this bot. Report bugs. | Suggested by Abductive | Category:Sorting algorithms | #UCB_Category 40/48 |
||
Line 102:
| title = STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings
| volume = 3884
| year = 2006
}}
*{{citation|contribution=On Cartesian trees and range minimum queries|first1=Erik D.|last1=Demaine|author1-link=Erik Demaine|first2=Gad M.|last2=Landau|first3=Oren|last3=Weimann|series=Lecture Notes in Computer Science|volume=5555|year=2009|pages=341–353|doi=10.1007/978-3-642-02927-1_29|title=Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009|isbn=978-3-642-02926-4|hdl=1721.1/61963|hdl-access=free}}
*{{citation
Line 186 ⟶ 187:
| title = WADS '89: Proceedings of the Workshop on Algorithms and Data Structures
| volume = 382
| year = 1989
}}
*{{citation
| last1 = Nishimoto | first1 = Akio
Line 202 ⟶ 204:
| title = String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings
| volume = 12944
| year = 2021|
| s2cid = 235313506
}}
*{{citation
Line 263 ⟶ 266:
| url = http://citeseer.ist.psu.edu/seidel96randomized.html
| volume = 16
| year = 1996| doi-broken-date = 2024-06-10 }}
*{{citation
| last1 = Schieber | first1 = Baruch
| |||