Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!unix.cis.pitt.edu!dsinc!netnews.upenn.edu!msuinfo!rang From: rang@cs.wisc.edu (Anton Rang) Newsgroups: comp.compression Subject: Re: How do I patent-proof an algorithm? Message-ID: Date: 8 Apr 91 20:46:38 GMT References: <1991Apr9.113446.24904@kcbbs.gen.nz> Sender: news@msuinfo.cl.msu.edu Organization: UW-Madison CS department Lines: 14 In-Reply-To: Peter_Gutmann@kcbbs.gen.nz's message of 9 Apr 91 11:34:46 GMT In article <1991Apr9.113446.24904@kcbbs.gen.nz> Peter_Gutmann@kcbbs.gen.nz (Peter Gutmann) writes: >Let's say I've developed a new super-duper compression algorithm >which compresses twice as well in half the time, which I don't patent >- how do I stop others from patenting it? Publish a description of your algorithm. It will be "prior art" and hence no patents filed by anyone else on it after the date of publication will be granted. (Publication on USENET would probably count if you could prove the date, but putting it in a journal or conference would be better.) Anton +---------------------------+------------------+-------------+----------------+ | Anton Rang (grad student) | rang@cs.wisc.edu | UW--Madison | "VMS Forever!" | +---------------------------+------------------+-------------+----------------+