The group access bounds for binary search trees

Show simple item record

dc.contributor.author Chalermsook, Parinya
dc.contributor.author Gupta, Manoj
dc.contributor.author Jiamjitrak, Wanchote
dc.contributor.author Pareek, Akash
dc.contributor.author Yingchareonthawornchai, Sorrachai
dc.contributor.other International Colloquium on Automata, Languages, and Programming (ICALP 2024)
dc.coverage.spatial Estonia
dc.date.accessioned 2024-07-31T07:39:10Z
dc.date.available 2024-07-31T07:39:10Z
dc.date.issued 2024-07-08
dc.identifier.citation Chalermsook, Parinya; Gupta, Manoj; Jiamjitrak, Wanchote; Pareek, Akash and Yingchareonthawornchai, Sorrachai, "The group access bounds for binary search trees", in the International Colloquium on Automata, Languages, and Programming (ICALP 2024), Tallinn, EE, Jul. 8-12, 2024.
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/10270
dc.description.statementofresponsibility by Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek and Sorrachai Yingchareonthawornchai
dc.language.iso en_US
dc.subject Dynamic Optimality
dc.subject Binary Search Tree
dc.subject Online Algorithm
dc.title The group access bounds for binary search trees
dc.type Conference Paper


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account