Cartesian tree: Difference between revisions

Content deleted Content added

Revision as of 22:48, 11 December 2024 edit 2a02:3100:187a:3600:6498:93e:84aa:819 (talk) No edit summary ← Previous edit		Latest revision as of 21:45, 11 July 2025 edit undo Citation bot (talk \| contribs) Bots 5,865,329 edits Altered doi-broken-date. \| Use this bot. Report bugs. \| #UCB_CommandLine
(3 intermediate revisions by 2 users not shown)
Line 163: \| pages = 79:1–79:20 \| title = Analysis of Smooth Heaps and Slim Heaps \| series = Leibniz International Proceedings in Informatics (LIPIcs) \| year = 2021\| doi-access = free▼ \| year = 2021\| volume = 198 ▲ ~~\| year = 2021~~\| doi-access = free \| isbn = 978-3-95977-195-5 }} {{citation\|title=The maximum capacity route problem\|first=T. C.\|last=Hu\|author-link=T. C. Hu\|journal=Operations Research\|volume=9\|issue=6\|year=1961\|pages=898–900\|jstor=167055\|doi=10.1287/opre.9.6.898\|doi-access=free}} Line 186 ⟶ 189: \| doi = 10.1137/18M1195188 \| number = 5 \| journal = [[SIAM J. Comput.]] \| publisher = SIAM \| title = Smooth Heaps and a Dual View of Self-Adjusting Data Structures Line 294 ⟶ 297: \| url = http://citeseer.ist.psu.edu/seidel96randomized.html \| volume = 16 \| year = 1996\| doi-broken-date = 1 ~~November~~July ~~2024~~2025 }} {{citation \| last1 = Schieber \| first1 = Baruch