Brian Kernighan

From Wikipedia, the free encyclopedia

(Redirected from Brian Wilson Kernighan)
Jump to: navigation, search

Brian Wilson Kernighan (pronounced /ˈkɛrnɪhæn/, the 'g' is silent), (born 1942 in Toronto, Ontario, Canada) is a computer scientist who worked at Bell Labs alongside Unix creators Ken Thompson and Dennis Ritchie and contributed greatly to Unix and its school of thought. He is also coauthor of the AWK and AMPL programming languages.

Kernighan's name became widely known through co-authorship of the first book on the C programming language with Dennis Ritchie. Kernighan has said that he had no part in the design of the C language ('it's entirely Dennis Ritchie's work'). He authored many Unix programs, including ditroff.

In collaboration with Shen Lin he devised well-known heuristics for two NP-complete optimization problems: graph partitioning and the travelling salesman problem. (In a display of authorial equity, the former is usually called the Kernighan-Lin algorithm, while the latter is styled Lin-Kernighan.)

Kernighan was also software editor for Prentice-Hall International. His Software Tools series spread the essence of 'C/Unix thinking' with makeovers for BASIC, FORTRAN, and Pascal - and most notably his 'Ratfor' (rational FORTRAN) was put in the public domain.

He has said that if stranded on an island with only one programming language it would have to be C.

The 'K' of K&R C and the 'K' in AWK stand for 'Kernighan'.

He received his Bachelor's degree in Engineering Physics from the University of Toronto. He received his PhD in electrical engineering from Princeton University, where he has held a professorship in the department of computer science since 2000. Each fall he teaches a course called "Computers in Our World", which introduces the fundamentals of computing to non-majors.

He has on occasion revealed it was his own pun which led to the use of the name 'Unix' (initially 'Unics') for the operating system Ken Thompson and Dennis Ritchie were working on.

Wikiquote has a collection of quotations related to:
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.