Burton Howard Bloom
From EverybodyWiki Bios & Wiki
Burton Howard Bloom is a computer scientist. He studied computer science at the Massachusetts Institute of Technology from 1963 to 1965.[citation needed] In 1970, while employed by the Computer Usage Company, he developed and published a space-efficient probabilistic data structure that later became famous as Bloom Filter.[citation needed]
Some of his other works include:
- Space/time trade-offs in hash coding with allowable errors (July 1970)[1]
- Some techniques and trade-offs affecting large data base retrieval times (August 1969)[2]
References[edit]
- ↑ Bloom, Burton H. (1970-07-01). "Space/time trade-offs in hash coding with allowable errors". Communications of the ACM. 13 (7): 422–426. doi:10.1145/362686.362692. ISSN 0001-0782.
- ↑ Bloom, Burton H. (1969-08-26). "Some techniques and trade-offs affecting large data base retrieval times". ACM: 83–95. doi:10.1145/800195.805920.
This article "Burton Howard Bloom" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Burton Howard Bloom. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
