Cynthia Dwork

Cynthia Dwork

Cynthia Dwork (born 1958) is a distinguished scientist at Microsoft Research who works on distributed computing, cryptography, and e-mail spam prevention.

She received the Dijkstra Prize in 2007 for her work on consensus problems together with Nancy Lynch and Larry Stockmeyer.[1][2] She was elected as a Fellow of the American Academy of Arts and Sciences (AAAS) in 2008,[3][4] and as a member of the National Academy of Engineering in 2008.[5]

Dwork received her Ph.D. from Cornell University in 1983. Her advisor was John Hopcroft.

Contents

Publications

Notes

References

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Dwork — is a surname and may refer to: Bernard Dwork (1923 1998), mathematician David J. Dwork (? 1997), mayor, suicide Cynthia Dwork (b. 1958), computer scientist Deborah Dwork, historian This page or section lists people with the surname Dwork. If an …   Wikipedia

  • Bernard Dwork — Bernard M. Dwork (* 27. Mai 1923 in der Bronx in New York City; † 9. Mai 1998 in New Brunswick) war ein US amerikanischer Mathematiker, der auf dem Gebiet der Zahlentheorie und arithmetischen algebraischen Geometrie arbeitete. Inhaltsverzeichnis… …   Deutsch Wikipedia

  • Differential privacy — aims to provide means to maximize the accuracy of queries from statistical databases while minimizing the chances of identifying its records. Contents 1 Situation 2 ε differential privacy 3 Motivation 3.1 …   Wikipedia

  • Memory bound function — Memory bound refers to a situation in which the time to complete a given computational problem is decided primarily by the amount of available memory to hold data. In other words, the limiting factor of solving a given problem is the memory… …   Wikipedia

  • Deniable encryption — In cryptography and steganography, deniable encryption is encryption that allows its users to convincingly deny that the data is encrypted, or that they are able to decrypt it[citation needed]. Such convincing denials may or may not be genuine.… …   Wikipedia

  • Proof-of-work system — A Proof of work ( POW ) system (or protocol, or function) is an economic measure to deter denial of service attacks and other service abuses such as spams on a network by requiring some work from the service requester, usually meaning processing… …   Wikipedia

  • Symmetric Turing machine — Definition of symmetric Turing machines: SL was first defined in 1982 by Lewis and Papadimitriou, [Jesper Jansson. [http://www.df.lth.se/ jj/Publications/STCON2.ps Deterministic Space Bounded Graph Connectivity Algorithms] . Manuscript. 1998.]… …   Wikipedia

  • Премия Дейкстры — (англ. Edsger W. Dijkstra Prize in Distributed Computing)  премия имени Эдсгера В. Дейкстры в области распределенных вычислений, вручаемая за выдающиеся работы, значимость и влияние которых были заметны на протяжении не менее десяти лет …   Википедия

  • Cifrado negable — En la criptografía y la esteganografía, el cifrado negable es un tipo de cifrado que permite negar en modo convincente que los datos están cifrados, o de ser capaz de descifrarlos. La negación, aunque falsa, no puede ser verificada por el… …   Wikipedia Español

  • Prix Dijkstra — Le prix Edsger W. Dijkstra en algorithmique répartie, anciennement prix PoDC de l article influent, est décerné chaque année, depuis 2000, aux auteurs d un article dont l impact est particulièrement important pour la théorie ou la pratique des… …   Wikipédia en Français

Share the article and excerpts

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