From nowick@cs.columbia.edu Mon Jun 19 23:12:49 1995 Date: Mon, 19 Jun 95 18:06:19 EDT From: Steven Nowick To: asynchronous-private@cs.columbia.edu Subject: [olly@dibe.unige.it (Mauro Olivieri): Re: [Mark Greenstreet : Carry-chain length]] Reply-To: asynchronous@hohum.stanford.edu Content-Length: 1736 X-Lines: 40 Status: RO Received: from cs.columbia.edu (cs.columbia.edu [128.59.10.13]) by ober.cs.columbia.edu (8.6.12/8.6.6) with ESMTP id FAA05207 for ; Thu, 15 Jun 1995 05:36:34 -0400 Received: from hohum.Stanford.EDU (hohum.Stanford.EDU [36.22.0.200]) by cs.columbia.edu (8.6.12/8.6.6) with SMTP id FAA01845 for ; Thu, 15 Jun 1995 05:36:30 -0400 Received: by hohum.Stanford.EDU (5.57/Ultrix3.0-C) id AA11398; Thu, 15 Jun 95 02:05:20 PDT Received: by cpsi9 (5.57/Ultrix3.0-C) id AA08755; Thu, 15 Jun 95 11:35:19 GMT From: olly@dibe.unige.it (Mauro Olivieri) Message-Id: <9506151135.AA08755@cpsi9> Subject: Re: [Mark Greenstreet : Carry-chain length] To: asynchronous@hohum.stanford.edu Date: Thu, 15 Jun 1995 11:35:19 +0000 (WET) In-Reply-To: from "Steven Nowick" at Jun 14, 95 11:48:20 am Content-Type: text Content-Length: 802 > >> Does anybody know/have the reference to the Von Neuman paper where he >> proves that the average length of the longest carry chain in an >> addition is logarithmic on the number of bits? > Anyway, the work by Von Neuman is not the ultimate one the subject. For completeness, here is the list of the most important references on self-timed addition: Briley, IRE trans. on Comp. vol. 22, 1973 - the latest I know Gilchrist, Pomerene, Wong, IRE trans. on Electr. Comp., vol. 4, 1955, reporting experimental results. Burks, Goldstin, Von Neumann, Tech. report of The Inst. for Adv. Study, Princeton, 1947. Available in several collections. Again, if anyone can give pointers to new results or applications, I think this is a very interesting subject for the async community. -- Mauro Olivieri