Ken Thompson
Bell Labs
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Ken Thompson.
Communications of The ACM | 1968
Ken Thompson
A method for locating specific character strings embedded in character text is described and an implementation of this method in the form of a compiler is discussed. The compiler accepts a regular expression as source language and produces an IBM 7094 program as object language. The object program then accepts the text to be searched as input and produces a signal every time an embedded string in the text matches the given regular expression. Examples, problems, and solutions are also presented.
Communications of The ACM | 1979
Robert H. Morris; Ken Thompson
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to penetrate the system. The result is a compromise between extreme security and ease of use.
Communications of The ACM | 1984
Ken Thompson
To what extent should one trust a statement that a program is free of Trojan horses? Perhaps it is more important to trust the people who wrote the software.
Operating Systems Review | 1993
Rob Pike; David L. Presotto; Ken Thompson; Howard Trickey; Phil Winterbottom
Plan 9 is a distributed system built at the Computing Sciences Research Center of AT&T Bell Laboratories over the last few years. Its goal is to provide a production-quality system for software development and general computation using heterogeneous hardware and minimal software. A Plan 9 system comprises CPU and file servers in a central location connected together by fast networks. Slower networks fan out to workstation-class machines that serve as user terminals. Plan 9 argues that given a few carefully implemented abstractions it is possible to produce a small operating system that provides support for the largest systems on a variety of architectures and networks. The foundations of the system are built on two ideas: a per-process name space and a simple message-oriented file system protocol.
Computer chess compendium | 1988
Joe Condon; Ken Thompson
The computer chess program BELLE is currently the World Computer Chess Champion and the North American Computer Chess Champion. In human play, BELLE has consistently obtained master performance ratings. This paper describes the special-purpose hardware that gives BELLE its advantage: speed.
Proceedings of the ACM '81 conference on | 1981
Ben Mittman; Tony Marsland; Monroe Newborn; Kathe Spracklen; Ken Thompson
Two papers will be presented and a general discussion period will then follow. The panel members are all members of the ACM Computer Chess Committee. The first paper, which appears elsewhere in the Proceedings, is the work of Tony Marsland. It is entitled “A survey of enhancements to the alpha-beta algorithm.” The paper reviews move ordering and search reduction techniques which improve the effectiveness of the alpha-beta algorithm when used in a chess program. A critical review of these search modifications is provided, and a recursive formula to estimate the search time is proposed, one which reflects the characteristics of the strongly ordered trees produced through improved use of the alpha-beta algorithm.
Computing Systems | 1995
Rob Pike; David L. Presotto; Sean Matthew Dorward; Bob Flandrena; Ken Thompson; Howard Trickey; Phil Winterbottom
ICGA Journal | 1986
Ken Thompson
Archive | 1973
Ken Thompson; Dennis M. Ritchie
ICGA Journal | 1996
Ken Thompson