マイケル・ラビン (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "マイケル・ラビン" in Japanese language version.

refsWebsite

Global rank Japanese rank

4doi.org

2^nd place

6^th place

3acm.org

1,185^th place

2,667^th place

1ibm.com

1,131^st place

838^th place

1projecteuclid.org

3,707^th place

5,131^st place

1jstor.org

26^th place

275^th place

1mit.edu

415^th place

1,150^th place

1iacr.org

5,032^nd place

9,586^th place

1ieee.org

652^nd place

1,307^th place

1archive.is

87^th place

39^th place

1education.gov.il

low place

1web.archive.org

1^st place

1dandavidprize.org

low place

acm.org

cacm.acm.org

Shasha, Dennis, "An Interview with Michael O. Rabin", Communications of the ACM, Vol. 53 No. 2, Pages 37-42, February 2010.

portal.acm.org

Karp, RM; Rabin, MO (March 1987). “Efficient randomized pattern-matching algorithms”. IBM Journal of Research and Development 31 (2): 249–260. doi:10.1147/rd.312.0249 2007年3月15日閲覧。.

awards.acm.org

ACM Turing Award Citation Archived 2012年7月14日, at Archive.is

archive.is

ACM Turing Award Citation Archived 2012年7月14日, at Archive.is

dandavidprize.org

“Dan David Prize Official Site - Laureates 2010”. 2010年3月6日時点のオリジナルよりアーカイブ。2012年8月13日閲覧。

doi.org

Rabin, MO (1969). “Decidability of second order theories and automata on infinite trees”. Trans. AMS 141: 1–35. doi:10.2307/1995086. JSTOR 1995086.
Rabin, MO (1980). “Probabilistic algorithm for testing primality”. Journal of Number Theory 12 (1): 128–138. doi:10.1016/0022-314X(80)90084-0.
Karp, RM; Rabin, MO (March 1987). “Efficient randomized pattern-matching algorithms”. IBM Journal of Research and Development 31 (2): 249–260. doi:10.1147/rd.312.0249 2007年3月15日閲覧。.
Rabin, MO; Scott, D (April 1959). “Finite Automata and Their Decision Problems” (PDF, IEEE Xplore access required). IBM Journal of Research and Development 3 (2): 114–125. doi:10.1147/rd.32.0114 2007年3月15日閲覧。.

education.gov.il

cms.education.gov.il

“Israel Prize Official Site - Recipients in 1995 (in Hebrew)”. 2012年8月13日閲覧。

iacr.org

eprint.iacr.org

Rabin, Michael O. (1981) (PDF). How to exchange secrets by oblivious transfer (Technical Report TR-81). Aiken Computation Laboratory: Harvard University. http://eprint.iacr.org/2005/187.pdf

ibm.com

domino.watson.ibm.com

Scott, Dana; Rabin, Michael, "Finite Automata and Their Decision Problems", IBM Journal of Research and Development, Volume 3, Number 2, Page 114 (1959)

ieee.org

ieeexplore.ieee.org

Rabin, MO; Scott, D (April 1959). “Finite Automata and Their Decision Problems” (PDF, IEEE Xplore access required). IBM Journal of Research and Development 3 (2): 114–125. doi:10.1147/rd.32.0114 2007年3月15日閲覧。.

jstor.org

Rabin, MO (1969). “Decidability of second order theories and automata on infinite trees”. Trans. AMS 141: 1–35. doi:10.2307/1995086. JSTOR 1995086.

mit.edu

lcs.mit.edu

Rabin, MO (January 1979). “Digital signatures and public-key functions as intractable as factorization”. MIT Laboratory of Computer Science Technical Report 2007年3月15日閲覧。.

projecteuclid.org

Rabin, MO (1969). “Decidability of second order theories and automata on infinite trees”. Trans. AMS 141: 1–35. doi:10.2307/1995086. JSTOR 1995086.

web.archive.org

“Dan David Prize Official Site - Laureates 2010”. 2010年3月6日時点のオリジナルよりアーカイブ。2012年8月13日閲覧。