1. R. Beigel, B. Gasarch, M. Li, L. Zhang, Addition in log2 n+O(1) Steps on Average: A Simple Analysis, ECCC, TR96-051, 1996.
2. G. Bilardi, F. Preparata, Size-Time Complexity of Boolean Networks for Prefix Computations, J. of the ACM 36, 1989, 362–382.
3. G. Bilardi, F. Preparata, Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size, SIAM J. Comput 19, 1990, 246–255.
4. B. E. Briley, Some New Results on Average Worst Case Carry, IEEE Trans. Computers, C-22:5, 1973.
5. A. W. Burks, H. H. Goldstine, J. vonNeumann, Preliminary Discussion of the Logical Design of an Electronic Computing Instrument, John von Neumann Collected Works, Band 5, Editor A. H. Taub, 1961.