Barbara Liskov

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Barbara Liskov

Barbara Huberman [1]

Barbara Liskov, (née Barbara Jane Huberman in 1939)
an American mathematician, computer scientist and Ford Professor at MIT School of Engineering at Massachusetts Institute of Technology. In 1968 Stanford University made her the first woman in the United States to be awarded a Ph.D. from a computer science department, advised by John McCarthy. The topic of her Ph.D. thesis was a computer program to play chess end games, where she proposed the Killer Heuristic [2] [3]. Huberman's program could solve KQK, KRK, KBBK, KBNK, and KNNNK [4].

Turing Award

Barbara Liskov received the 2008 ACM Turing Award for her work on practical and theoretical foundations of programming language and systems design, especially related to data abstraction, fault tolerance, and distributed computing [5]

Selected Publications


External Links

A lecture given on the occasion of Princeton University's centennial celebration of Alan Turing, May 11, 2012


  1. The Programmer Dress Code – Part Deux | CodeThinked by Justin Etheredge, December 11, 2007
  2. Jos Uiterwijk (1992). The Countermove Heuristic. ICCA Journal, Vol. 15, No. 1, pp. 8, The killer heuristic
  3. Barbara J. Huberman (1968). A Program to Play Chess End Games. Technical Report no. CS-106, Ph.D. thesis. Stanford University
  4. Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227, Chess programs: Huberman
  5. Barbara Liskov Wins Turing Award from Dr. Dobb's Journal, March 10, 2009
  6. dblp: Barbara Liskov

Up one level