Do we really need to balance patricia tries?

This publication has 6 references indexed in Scilit:

• Some results on V-ary asymmetric tries
  Journal of Algorithms, 1988
• The evaluation of an alternative sum with applications to the analysis of some data structures
  Information Processing Letters, 1988
• Digital Search Trees Revisited
  SIAM Journal on Computing, 1986
• Some further results on digital search trees
  Lecture Notes in Computer Science, 1986
• Q-ary collision resolution algorithms in random-access systems with free or blocked channel access
  IEEE Transactions on Information Theory, 1985
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979