Edward McCreight is a Retired principal Computer Scientist at Adobe Systems Incorporated, whose foundational contributions to computer science have shaped the field for more than half a century. McCreight completed his Ph.D. in computer science at Carnegie Mellon University in 1968, where his dissertation examined classes of computable functions defined by bounds on computation—work that contributed to computational complexity theory. He then joined Xerox PARC (Palo Alto Research Center), where he made two contributions that remain standard curriculum in computer science programs worldwide. With Rudolf Bayer he co-invented the B-tree, a balanced tree data structure that became the organizational backbone of most database and file systems. He also devised the suffix array, a compact and efficient data structure for string searching that is widely used in bioinformatics and text indexing.
EDUCATION
Graduate Studies
Carnegie Mellon University
Computer Science
Graduate Thesis
Classes of Computable Functions Defined by Bounds on Computation
IMPACT STORY
Lorem ipsum dolor sit amet, consecteta aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in.ur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in.
READ MOREGET IN TOUCH WITH Edward McCreight
Lorem ipsum dolor sit amet, consecteta aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in.ur adipiscing elit,
