Yes, it's that Aho. The other two authors are also well-known in the field. For example, Hopcroft won the Turing Award in 1986.
On Fri, Mar 7, 2014 at 4:56 AM, Jim Russell <[email protected]> wrote: > The Aho of AWK fame I presume? > > > On Mar 6, 2014, at 8:10 PM, Roger Hui <[email protected]> wrote: > > > > Probably not. It's not related to the problem of finding the minimum > that > > I know of. It's the general problem of how you avoid initializing a > large > > but sparse array. Recently, I did use the idea in a case of x i. y (you > > know, the problem I've been working on for 30 years :-). > > > > Anyway, here it is: In the book *The Design and Analysis of Computer > > Algorithms*, by Aho, Hopcroft, and Ullman, Addison-Wesley, 1974, Exercise > > 2.12: > > > > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
