[comp.theory] Any previous work on space-efficient, time-efficient tries?

brnstnd@stealth.acf.nyu.edu (01/10/90)

I've found a method of storing tries in constant space per node with
the usual operations (searching down one level, inserting a new node)
running in constant time, independent of the alphabet size. Has this
been done before? I haven't found anything in the usual journals.

---Dan