The radix tree caching mechanism is interesting, and seems very general. I'm new to techniques of randomized algorithm analysis, so I can't whip up a perspective of my own yet.
Does anyone else recognize this? Has it been rigorously treated? Seems like a similar approach to more applications in general using bagwell tries would be useful for both scala and clojure.
Does anyone else recognize this? Has it been rigorously treated? Seems like a similar approach to more applications in general using bagwell tries would be useful for both scala and clojure.