Repository logo
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. IIT Gandhinagar
  3. Computer Science and Engineering
  4. CSE Theses (PhD & Masters)
  5. Online binary search trees: insights from pattern avoidance and group access bounds
 
  • Details

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

Source
Indian Institute of Technology, Gandhinagar
Date Issued
2024-01-01
Author(s)
Pareek, Akash
URI
http://repository.iitgn.ac.in0/handle/IITG2025/32906
Subjects
19310021
Ph.D
Computer Science and Engineering
Binary search trees (BSTs)
BST algorithm
GREEDY algorithm
Group access bound
Classical access lemma
IITGN Knowledge Repository Developed and Managed by Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify