Ronald Rivest
Multi tool use
|
Esta página ou secção cita fontes confiáveis e independentes, mas que não cobrem todo o conteúdo, o que compromete a verificabilidade (desde abril de 2014). Por favor, insira mais referências no texto. Material sem fontes poderá ser removido.
—Encontre fontes: Google (notícias, livros e acadêmico)
|
|
Ronald Rivest
|
|---|
Ronald Rivest (centro), com Alan Sherman (esquerda) e David Chaum (direita), em 2007
|
Nascimento
|
6 de maio de 1947 (71 anos)
Schenectady
|
Nacionalidade
|
Estadunidense
|
Alma mater
|
Universidade Stanford, Universidade Yale
|
Prêmios
|
Prêmio Paris Kanellakis (1996), Prêmio Turing (2002)
|
Orientador(es)
|
Robert Floyd[1][2]
|
Orientado(s)
|
Avrim Blum, Burt Kaliski, Ron Pinter, Robert Schapire, Alan Sherman
|
Instituições
|
Instituto de Tecnologia de Massachusetts
|
Campo(s)
|
Matemática e criptologia
|
Ronald Linn Rivest (Schenectady, 6 de maio de 1947) é um matemático e criptologista estadunidense.
Foi laureado com o Prêmio Turing de 2002, juntamente com Adi Shamir e Leonard Adleman, pelo algoritmo RSA.
Obras |
- com Thomas Cormen e Charles Leiserson: Introduction to Algorithms, 1990, MIT Press e McGraw Hill, 3ª Edição com Clifford Stein, 2009.
Referências
↑ Ronald Rivest (em inglês) no Mathematics Genealogy Project
↑ Knuth, Donald E. «Memorial Resolution: Robert W. Floyd (1936-2001)» (PDF). Stanford University Faculty Memorials. Stanford Historical Society
Ligações externas |
Página pessoal no MIT (em inglês)
Precedido por
Ole-Johan Dahl e Kristen Nygaard
|
Prêmio Turing
2002
com Adi Shamir e Leonard Adleman
|
Sucedido por
Alan Kay
|
Prêmio Paris Kanellakis |
1996: Adleman / Diffie / Hellman / Merkle / Rivest / Shamir ·
1997: Lempel / Ziv ·
1998: Bryant / Clarke / Emerson / McMillan ·
1999: Sleator / Tarjan ·
2000: Karmarkar ·
2001: Myers ·
2002: Franaszek ·
2003: Miller / Rabin / Solovay / Strassen ·
2004: Freund / Schapire ·
2005: Holzmann / Kurshan / Vardi / Wolper ·
2006: Brayton ·
2007: Buchberger ·
2008: Cortes / Vapnik ·
2009: Bellare / Rogaway ·
2010: Kurt Mehlhorn ·
2011: Hanan Samet ·
2012: Andrei Broder, Moses Charikar e Piotr Indyk ·
2013: Robert Blumofe e Charles Eric Leiserson
|
Prêmio Turing |
1966: Alan Perlis ·
1967: Maurice Vincent Wilkes ·
1968: Richard Hamming ·
1969: Marvin Minsky ·
1970: James Hardy Wilkinson ·
1971: John McCarthy ·
1972: Edsger Dijkstra ·
1973: Charles Bachman ·
1974: Donald Knuth ·
1975: Allen Newell e Herbert Simon ·
1976: Michael Rabin e Dana Scott ·
1977: John Backus ·
1978: Robert Floyd ·
1979: Kenneth Iverson ·
1980: Charles Antony Richard Hoare ·
1981: Edgar Frank Codd ·
1982: Stephen Cook ·
1983: Ken Thompson e Dennis Ritchie ·
1984: Niklaus Wirth ·
1985: Richard Karp ·
1986: John Hopcroft e Robert Tarjan ·
1987: John Cocke ·
1988: Ivan Sutherland ·
1989: William Kahan ·
1990: Fernando Corbató ·
1991: Robin Milner ·
1992: Butler Lampson ·
1993: Juris Hartmanis e Richard Stearns ·
1994: Edward Feigenbaum e Raj Reddy ·
1995: Manuel Blum ·
1996: Amir Pnueli ·
1997: Douglas Engelbart ·
1998: James Gray ·
1999: Fred Brooks ·
2000: Andrew Chi-Chih Yao ·
2001: Ole-Johan Dahl e Kristen Nygaard ·
2002: Ronald Rivest, Adi Shamir e Leonard Adleman ·
2003: Alan Kay ·
2004: Vint Cerf e Robert Kahn ·
2005: Peter Naur ·
2006: Frances Allen ·
2007: Edmund Clarke, Ernest Allen Emerson e Joseph Sifakis ·
2008: Barbara Liskov ·
2009: Charles Thacker ·
2010: Leslie Valiant ·
2011: Judea Pearl ·
2012: Silvio Micali e Shafrira Goldwasser ·
2013: Leslie Lamport ·
2014: Michael Stonebraker ·
2015: Martin Hellman e Whitfield Diffie ·
2016: Tim Berners-Lee ·
2017: John LeRoy Hennessy e David A. Patterson
|
Portal da educação
 |
Este artigo sobre Criptografia é um esboço. Você pode ajudar a Wikipédia expandindo-o.
|
| Controle de autoridade |
 : Q578036
- WorldCat
- VIAF: 101783249
- ACM DL: 81328490215
- BNF: 12393919f
- DBLP: RonaldLRivest
- EBID: ID
- FAST: 105014
- GND: 140222960
- ISNI: ID
- LCCN: n82220907
- MGP: 50081
- NDL: 01081506
- NKC: ctu2017963970
- NLA: 36211314
- NNDB: 000118803
- NTA: 070464596
- Scholar: 6qE0tdAAAAAJ
- SNAC: w69k8hpp
- SUDOC: 033030960
|
I6RVy0ZPAbBglvO,rb8JFWjIcXlQ3,XIVr6nZ47UN5rpEPt PPKKZI8X8,XGYLI2Y J7kPOhq1 wTCgheU
Popular posts from this blog
0
The contact form does not work, and affects loading after one try. The chrome console shows the error message: POST http://example.com/wp-json/contact-form-7/v1/contact-forms/50/feedback 404 (Not Found) send @ jquery.js?ver=1.12.4:4 ajax @ jquery.js?ver=1.12.4:4 wpcf7.submit @ scripts.js?ver=5.0.3:346 (anonymous) @ scripts.js?ver=5.0.3:53 dispatch @ jquery.js?ver=1.12.4:3 r.handle @ jquery.js?ver=1.12.4:3 How to solve this issue? thanks in advance
javascript wordpress contact-form-7
share | improve this question
edited Jul 17 '18 at 5:39
Kiran Shahi
4,745 3 16 43
...
1
SDK location should not contain whitespace, as this can cause problems with the NDK tools. It says that the path name should not contain any white spaces. But i cant rename it. There is no any rename option for that folder when right clicked. When i change the folder to which there is not any space, it says that "Target Folder is neither empty nor does it point to an existing SDK Installation."
android android-studio sdk android-ndk android-sdk-tools
share | improve this question
edited Nov 25 '18 at 17:49
Elletlar
1,515 3 15 23
...
1
I'm new to programming and started to make an application for school. For that I use C# WPF and for a good-looking Application i installed Material Design. First i started the Demo of Material Design, where you can see what things you can use etc. with the good to copy. So after a quick view I found a nice TextBox with a border and a Checkbox on top of it. The code to copy was this <StackPanel> <CheckBox x:Name="MaterialDesignOutlinedTextFieldTextBoxEnabledComboBox" IsChecked="True" Margin="32,0,0,8"> Enabled </CheckBox> <TextBox Style="{StaticResource MaterialDesignOutlinedTextFieldTextBox}" Margin="32,0,0,0" VerticalAlignment="Top" Height="100" AcceptsReturn=...
: 
