2013.01.04 06:50:00 (287073371563372544) from Daniel J. Bernstein, replying to "You and 52 others (@bahstgwamt)" (287057627899383809):
@kragen @zooko Crit-bit trees (2 control words per string) are more streamlined than PATRICIA trees (5 control words per string).
2012.12.31 18:08:42 (285794623971028992) from "zooko❤ⓩ🛡🦓🦓🦓 (@zooko)":
The CCC talk on hash-flooding DoS makes me want to explore balanced trees more: https://www.youtube.com/watch?v=wGYj8fhhUVA
2013.01.01 15:26:54 (286116291499151362) from Daniel J. Bernstein, replying to "zooko❤ⓩ🛡🦓🦓🦓 (@zooko)" (285794623971028992):
If you're not tied to hash tables then I recommend crit-bit trees. See also http://cr.yp.to/talks.html#2012.10.22 ("Data-structure lock-in"). @zooko
2013.01.04 05:47:26 (287057627899383809) from "You and 52 others (@bahstgwamt)":
@hashbreaker BTW, why do you call them crit-bit trees instead of Patricia trees? Is there a difference? cc @zooko