Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!cs.utexas.edu!yale!cmcl2!stealth.acf.nyu.edu!brnstnd
From: brnstnd@stealth.acf.nyu.edu
Newsgroups: comp.theory
Subject: Any previous work on space-efficient, time-efficient tries?
Message-ID: <3671@stealth.acf.nyu.edu>
Date: 10 Jan 90 02:07:47 GMT
Reply-To: brnstnd@stealth.acf.nyu.edu (Dan Bernstein)
Distribution: usa
Organization: IR
Lines: 6

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