曼纽尔·布卢姆 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "曼纽尔·布卢姆" in Chinese language version.

refsWebsite

Global rank Chinese rank

4doi.org

2^nd place

23^rd place

3web.archive.org

1^st place

2siam.org

low place

2acm.org

1,185^th place

809^th place

1nodak.edu

5,218^th place

3,464^th place

1archive-it.org

910^th place

767^th place

1dblp.org

low place

1wikidata.org

43^rd place

1,123^rd place

1microsoft.com

153^rd place

238^th place

1elsevier.com

610^th place

388^th place

1worldcat.org

5^th place

12^th place

acm.org

awards.acm.org

ACM Turing Award Citation Archive-It的存檔，存档日期2012-07-03, retrieved 2010-01-24.

dl.acm.org

Manuel Blum. A Machine-Independent Theory of the Complexity of Recursive Functions. Journal of the ACM (JACM). 1967-04-01, 14 (2): 322–336 [2018-04-02]. ISSN 0004-5411. doi:10.1145/321386.321395.

archive-it.org

wayback.archive-it.org

ACM Turing Award Citation Archive-It的存檔，存档日期2012-07-03, retrieved 2010-01-24.

dblp.org

曼纽尔·布卢姆在数字书目索引与图书馆项目中的页面

doi.org

dx.doi.org

Manuel Blum, Silvio Micali. How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. SIAM Journal on Computing. 2006-07-13, 13 (4): 850–864 [2018-04-02]. doi:10.1137/0213053. （原始内容存档于2019-06-25）（英语）.
Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences: 448–461. [2018-04-02]. doi:10.1016/s0022-0000(73)80033-9. （原始内容存档于2021-02-24）.
Manuel Blum. A Machine-Independent Theory of the Complexity of Recursive Functions. Journal of the ACM (JACM). 1967-04-01, 14 (2): 322–336 [2018-04-02]. ISSN 0004-5411. doi:10.1145/321386.321395.
L. Blum, M. Blum, M. Shub. A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing. 2006-07-13, 15 (2): 364–383 [2018-04-02]. doi:10.1137/0215025. （原始内容存档于2019-06-26）（英语）.

elsevier.com

linkinghub.elsevier.com

Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences: 448–461. [2018-04-02]. doi:10.1016/s0022-0000(73)80033-9. （原始内容存档于2021-02-24）.

microsoft.com

academic.research.microsoft.com

微軟學術搜尋上的出版列表

nodak.edu

genealogy.math.ndsu.nodak.edu

Manuel Blum在數學譜系計畫的資料。.

siam.org

epubs.siam.org

Manuel Blum, Silvio Micali. How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. SIAM Journal on Computing. 2006-07-13, 13 (4): 850–864 [2018-04-02]. doi:10.1137/0213053. （原始内容存档于2019-06-25）（英语）.
L. Blum, M. Blum, M. Shub. A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing. 2006-07-13, 15 (2): 364–383 [2018-04-02]. doi:10.1137/0215025. （原始内容存档于2019-06-26）（英语）.

web.archive.org

Manuel Blum, Silvio Micali. How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. SIAM Journal on Computing. 2006-07-13, 13 (4): 850–864 [2018-04-02]. doi:10.1137/0213053. （原始内容存档于2019-06-25）（英语）.
Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences: 448–461. [2018-04-02]. doi:10.1016/s0022-0000(73)80033-9. （原始内容存档于2021-02-24）.
L. Blum, M. Blum, M. Shub. A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing. 2006-07-13, 15 (2): 364–383 [2018-04-02]. doi:10.1137/0215025. （原始内容存档于2019-06-26）（英语）.

wikidata.org

曼纽尔·布卢姆在数字书目索引与图书馆项目中的页面

worldcat.org

Manuel Blum. A Machine-Independent Theory of the Complexity of Recursive Functions. Journal of the ACM (JACM). 1967-04-01, 14 (2): 322–336 [2018-04-02]. ISSN 0004-5411. doi:10.1145/321386.321395.