Aviezri Fraenkel

Aviezri Fraenkel

Infobox Scientist
box_width =
name = Aviezri Frankel


image_size =
caption = Aviezri Frankel in 2005
birth_date = 1929
birth_place = Munich,Germany
death_date =
death_place =
residence =
citizenship =
nationality = Israeli
ethnicity =
fields = Mathematics
workplaces = Weizmann Institute of Science
alma_mater =
doctoral_advisor =
academic_advisors =
doctoral_students =
notable_students =
known_for =
author_abbrev_bot =
author_abbrev_zoo =
influences =
influenced =
awards = 2005 Euler Medal, "WEIZAC Medal"
religion = Jewish


footnotes =

Aviezri Siegmund Fraenkel ( _he. אביעזרי פרנקל) is an Israeli Mathematician, who has made notable contributions to combinatorial game theory. He was born in Munich Germany in 1929 but his family moved to Switzerland soon after. In 1939 his family moved once more to Jerusalem, Israel.

Fraenkel received his Ph.D. in 1961 from the University of California, Los Angeles. [MathGenealogy|id=18990] He was a recipient of the 2005 Euler Medal together with Ralph Faudree. On December 5, 2006, he received the "WEIZAC Medal" from the IEEE as a member of the team who built the WEIZAC,one of the first computers in the world.

External links and references

* [http://www.combinatorics.org/Volume_8/v8i2i1.html Biography by Shaula Fraenkel]
* [http://www.wisdom.weizmann.ac.il/~fraenkel/ Personal Homepage]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Fränkel — (or Fraenkel) is a surname and may refer to:* Adolf Abraham Halevi Fraenkel (1891 – 1965), German Israeli mathematician, known for Zermelo–Fraenkel set theory * Albert Fränkel (1848 – 1916), German physician * Aviezri Fraenkel (born 1929),… …   Wikipedia

  • Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence …   Wikipédia en Français

  • Médaille Euler — La médaille Euler, ainsi nommée d après le mathématicien suisse du XVIIIe siècle Leonhard Euler, est une récompense donnée annuellement par l ICA (Institute of Combinatorics and its Applications (en)), institut canadien promouvant les… …   Wikipédia en Français

  • P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

  • COMPUTER SCIENCE — The term Computer Science encompasses three different types of research areas: computability, efficiency, and methodology. General Introduction Computability deals with the question of what is mechanically computable. The most natural way to… …   Encyclopedia of Judaism

  • EXPTIME — EXP redirects here; for other uses, see exp. In computational complexity theory, the complexity class EXPTIME (sometimes called EXP) is the set of all decision problems solvable by a deterministic Turing machine in O(2 p ( n )) time, where p ( n… …   Wikipedia

  • Computer chess — 1990s Pressure sensory chess computer with LCD screen Chess+ For the iPad …   Wikipedia

  • Game complexity — Combinatorial game theory has several ways of measuring game complexity. This article describes five of them: state space complexity, game tree size, decision complexity, game tree complexity, and computational complexity. Contents 1 Measures of… …   Wikipedia

  • Richard K. Guy — Richard Kenneth Guy (born 1916, Nuneaton, Warwickshire) is a British mathematician, Professor Emeritus in the Department of Mathematics at the University of Calgary.He is best known for co authorship (with John Conway and Elwyn Berlekamp) of… …   Wikipedia

  • Euler Medal — The Euler Medal, named after the eighteenth century mathematician Leonhard Euler (pronounced oiler ), is an honor awarded annually by the Institute of Combinatorics and its Applications to mathematicians with a distinguished lifetime contribution …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”