|Born||1963 (age 54–55)|
|Residence||United States of America|
|Alma mater||University College London (BSc)|
University of Cambridge (PhD)
|Known for||Burrows–Wheeler transform|
|Awards||Fellow of the Royal Society (2013)|
University of Cambridge
Digital Equipment Corporation
|Thesis||Efficient Data Sharing (1988)|
|Doctoral advisor||David Wheeler|
Michael Burrows, FRS (born 1963) is a British computer scientist and the creator of the Burrows–Wheeler transform currently working for Google. Born in Britain, as of 2018 he lives in the United States, although he remains a British citizen.
Burrows studied Electronic Engineering with Computer Science at University College London and then completed his PhD in the Computer Laboratory, University of Cambridge, where he was a postgraduate student of Churchill College, Cambridge supervised by David Wheeler.
Upon leaving Cambridge, he moved to USA and worked at the Systems Research Center (SRC) at Digital Equipment Corporation (DEC) where, with Louis Monier, he was one of the two main creators of AltaVista.
After his early work at the University of Cambridge, where he researched microkernels and basic matters of security, he went on to enlarge upon that work as systems were deployed at large scale on the Internet.
Awards and honours
|“||Dr Michael Burrows is distinguished for his pioneering work on web search and indexing. He was one of the designers of the early search engine Altavista. He was also one of the pioneers of the application of formal logic to the verification of security protocols. He has made seminal contributions to many other areas of computer science and engineering ranging from compression through synchronisation to performance measurement. He is one of the engineers who led the design of Google's distributed computing infrastructure.||”|
- Burrows, Michael; Wheeler, David J. (1994), A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation
- Salson, M.; Lecroq, T.; Léonard, M.; Mouchard, L. (2009). "A four-stage algorithm for updating a Burrows–Wheeler transform". Theoretical Computer Science. 410 (43): 4350. doi:10.1016/j.tcs.2009.07.016.
- Anon (2013). "Dr Michael Burrows FRS". London: royalsociety.org. Archived from the original on 23 November 2015. One or more of the preceding sentences incorporates text from the royalsociety.org website where:
"All text published under the heading 'Biography' on Fellow profile pages is available under Creative Commons Attribution 4.0 International License." --"Royal Society Terms, conditions and policies". Archived from the original on 25 September 2015. Retrieved 9 March 2016.
- Burrows, Michael (1988). Efficient Data Sharing (PDF) (PhD thesis). University of Cambridge.
- Michael Burrows at the Mathematics Genealogy Project
- Michael Burrows at DBLP Bibliography Server
- Savage, S.; Burrows, M.; Nelson, G.; Sobalvarro, P.; Anderson, T. (1997). "Eraser: A dynamic data race detector for multithreaded programs". ACM Transactions on Computer Systems. 15 (4): 391. doi:10.1145/265924.265927.
- Abadi, M. N.; Burrows, M.; Lampson, B.; Plotkin, G. (1993). "A calculus for access control in distributed systems" (PDF). ACM Transactions on Programming Languages and Systems. 15 (4): 706. doi:10.1145/155183.155225.
- Burrows, M.; Abadi, M.; Needham, R. M. (1989). "A Logic of Authentication". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 426 (1871): 233. Bibcode:1989RSPSA.426..233B. doi:10.1098/rspa.1989.0125.
- BURROWS, Dr. Michael. ukwhoswho.com. Who's Who. 2017 (online Oxford University Press ed.). A & C Black, an imprint of Bloomsbury Publishing plc. (subscription required)
- "1996 Dvorak Awards Winners". citivu.com. Archived from the original on 8 August 2007.
- "Michael Burrows". angreiter.com.
- Lu, Crystal (12 January 2007). "The Genius: Mike Burrows' self-effacing journey through Silicon Valley". The Cardinal Inquirer. Archived from the original on 17 February 2008. Retrieved 1 July 2008.
|This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it.|