Priority Search Trees

This publication has 5 references indexed in Scilit:

• A new class of balanced search trees : half-balanced binary search tress
  RAIRO. Informatique théorique, 1982
• An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
  IEEE Transactions on Computers, 1980
• A unifying look at data structures
  Communications of the ACM, 1980
• A dichromatic framework for balanced trees
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1978
• Symmetric binary B-Trees: Data structure and maintenance algorithms
  Acta Informatica, 1972