Path: utzoo!dciem!nrcaer!scs!spl1!laidbak!att!pacbell!lll-tis!helios.ee.lbl.gov!pasteur!agate!ig!uwmcsd1!bbn!rochester!udel!kelly
From: kelly@udel.EDU (John Kelly)
Newsgroups: comp.arch
Subject: I need the paper describing fast BitBlts.
Message-ID: <2869@louie.udel.EDU>
Date: 3 Jun 88 19:22:05 GMT
Article-I.D.: louie.2869
Reply-To: kelly@udel.EDU (John Kelly)
Organization: University of Delaware
Lines: 16

I've exhausted the resources available to me in the search for the
paper referenced by Martin in his February 29th posting.  He mentions
a scheme for fast and simple implementation of BitBlts.  The reference
was:

%T Fast bitblt() with asm() and cpp
%A Bart Locanthi
%J Proceedings of the EUUG Conference
%D September 21-25, 1987
%C Dublin, Ireland
%P 243-259

This paper seems to have relevance to my research.  A timely response
would much appreciated.

John