„binary search trees“

Suchergebnisse

63 Treffer

• Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima
  Munro, J. Ian ; Nicholson, Patrick K. ; Seelbach Benkner, Louisa ; Wild, Sebastian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Pinning down the Strong Wilber 1 Bound for Binary Search Trees
  Chalermsook, Parinya ; Chuzhoy, Julia ; Saranurak, Thatchaphol 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Settling the Relationship Between Wilber’s Bounds for Dynamic Optimality
  Lecomte, Victor ; Weinstein, Omri 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Amortized Analysis of a Non-blocking Chromatic Tree
  Ko, Jeremy 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Multi-Finger Binary Search Trees
  Chalermsook, Parinya ; Goswami, Mayank ; Kozma, László ; Mehlhorn, Kurt ; Saranurak, Thatchaphol 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs
  Munro, J. Ian ; Wild, Sebastian 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dynamic Trees with Almost-Optimal Access Cost
  Golin, Mordecai ; Iacono, John ; Langerman, Stefan ; Munro, J. Ian ; Nekrich, Yakov 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees
  Dorfman, Dani ; Kaplan, Haim ; Kozma, László ; Pettie, Seth ; Zwick, Uri 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Improved Bound for Random Binary Search Trees with Concurrent Insertions
  Giakkoupis, George ; Woelfel, Philipp 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Strategies for Generalized Binary Search in Weighted Trees
  Dereniowski, Dariusz ; Kosowski, Adrian ; Uznanski, Przemyslaw ; Zou, Mengchuan 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Deletion without Rebalancing in Non-Blocking Binary Search Trees
  He, Meng ; Li, Mengdu 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Learning Binary Search Trees Through Serious Games
  Rojas-Salazar, Alberto ; Ramírez-Alfaro, Paula ; Haahr, Mads 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An analytic approach to the height of binary search trees
  Drmota, M.
• One-sided variations on binary search trees
  Mahmoud, Hosam M.
• Calculating a functional module for binary search trees
  Dosch, Walter ; Möller, Bernhard ; Berghammer, Rudolf 1993 Universität Augsburg
• Concurrent perfect balancing of binary search trees
  Eckerle, Jürgen ; Nurmi, Otto 1994 Inst. für Informatik
• On a sublinear time parallel construction of optimal binary search trees
  Karpiński, Marek ; Rytter, Wojciech 1993 Inst. für Informatik
• (Un)expected path lengths of assymetric binary search trees
  Trier, Uwe 1992 Fachbereich Informatik, Univ.
• An estimate of mean efficiency of search trees for arbitrary sets of binary words
  Ryabko, B.Ya. ; Fedotov, A.A.
• Binary search trees with limited rotation
  Huang, Shou-Hsuan Stephen ; Wong, C. K.