From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,db4c6f5da20a62de X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-10-03 10:47:03 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!sn-xit-03!sn-xit-06!sn-post-01!supernews.com!corp.supernews.com!not-for-mail From: "Randy Brukardt" Newsgroups: comp.lang.ada Subject: Re: request for incremental hashing paper Date: Thu, 3 Oct 2002 12:48:11 -0500 Organization: Posted via Supernews, http://www.supernews.com Message-ID: References: X-Newsreader: Microsoft Outlook Express 4.72.3612.1700 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3719.2500 X-Complaints-To: abuse@supernews.com Xref: archiver1.google.com comp.lang.ada:29495 Date: 2002-10-03T12:48:11-05:00 List-Id: Matthew Heaney wrote in message ... >I'm looking for a paper about incremental hashing that appeared in Embedded >Systems Programming: > >State of the Art: Hash It > >P.J. Plauger > >Embedded Systems Programming, September 1998 > >Does anyone have access to this publication, and can send me a copy? Gee, if you would have asked last month, I probably could have found it. But I dumped most of our old magazines when we moved to a new office. Did you try their website? Randy.