Online binary search trees: insights from pattern avoidance and group access bounds

dc.contributor.advisor	Gupta, Manoj
dc.contributor.author	Pareek, Akash
dc.date.accessioned	2025-09-11T15:52:53Z
dc.date.available	2025-09-11T15:52:53Z
dc.date.issued	2024
dc.identifier.citation	Pareek, Akash. (2024). Online binary search trees: insights from pattern avoidance and group access bounds. Gandhinagar: Indian Institute of Technology Gandhinagar, 89p. (Acc. No.: T01333)
dc.identifier.uri	https://repository.iitgn.ac.in/handle/123456789/11960
dc.description.statementofresponsibility	by Akash Pareek
dc.format.extent	xxvi, 89p.: hbk.: 30 cm
dc.language.iso	en_US
dc.publisher	Indian Institute of Technology Gandhinagar
dc.subject	19310021
dc.subject	Ph.D
dc.subject	Computer Science and Engineering
dc.subject	Binary search trees (BSTs)
dc.subject	BST algorithm
dc.subject	GREEDY algorithm
dc.subject	Group access bound
dc.subject	Classical access lemma
dc.title	Online binary search trees: insights from pattern avoidance and group access bounds
dc.type	Thesis
dc.contributor.department	Computer Science and Engineering
dc.description.degree	Ph.D.