Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!yale!cmcl2!stealth.acf.nyu.edu!brnstnd
From: brnstnd@stealth.acf.nyu.edu
Newsgroups: comp.lang.c
Subject: Re: Recognizing abbreviated commands using `tries'
Message-ID: <6164@stealth.acf.nyu.edu>
Date: 11 Jan 90 01:06:15 GMT
References: <SCOTT.90Jan9153157@harpo.med.ge.com>
Reply-To: brnstnd@stealth.acf.nyu.edu (Dan Bernstein)
Distribution: comp
Organization: IR
Lines: 7

Speaking of tries, 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