Premio Turing (Esperanto Wikipedia)

Analysis of information sources in references of the Wikipedia article "Premio Turing" in Esperanto language version.

refsWebsite

Global rank Esperanto rank

19doi.org

2^nd place

7^th place

7acm.org

1,185^th place

79^th place

1nytimes.com

7^th place

13^th place

1web.archive.org

1^st place

1stanford.edu

179^th place

100^th place

acm.org

amturing.acm.org

doi.org

Perlis, A. J. (1967). “The Synthesis of Algorithmic Systems”, Journal of the ACM 14, p. 1. doi:10.1145/321371.321372.
Wilkes, M. V. (1968). “Computers then and Now”, Journal of the ACM 15, p. 1. doi:10.1145/321439.321440.
Hamming, R. W. (1969). “One Man's View of Computer Science”, Journal of the ACM 16, p. 3. doi:10.1145/321495.321497.
Minsky, M. (1970). “Form and Content in Computer Science (1970 ACM turing lecture)”, Journal of the ACM 17 (2), p. 197. doi:10.1145/321574.321575.
Wilkinson, J. H. (1971). “Some Comments from a Numerical Analyst”, Journal of the ACM 18 (2), p. 137. doi:10.1145/321637.321638.
Dijkstra, E. W. (1972). “The humble programmer”, Communications of the ACM 15 (10), p. 859. doi:10.1145/355604.361591.
Bachman, C. W. (1973). “The programmer as navigator”, Communications of the ACM 16 (11), p. 653. doi:10.1145/355611.362534.
Knuth, D. E. (1974). “Computer programming as an art”, Communications of the ACM 17 (12), p. 667. doi:10.1145/361604.361612.
(1959) “Finite Automata and Their Decision Problems”, IBM Journal of Research and Development 3 (2), p. 114. doi:10.1147/rd.32.0114.
Rabin, M. O. (1977). “Complexity of computations”, Communications of the ACM 20 (9), p. 625. doi:10.1145/359810.359816.
Scott, D. S. (1977). “Logic and programming languages”, Communications of the ACM 20 (9), p. 634. doi:10.1145/359810.359826.
Backus, J. (1978). “Can programming be liberated from the von Neumann style?: A functional style and its algebra of programs”, Communications of the ACM 21 (8), p. 613. doi:10.1145/359576.359579.
Iverson, K. E. (1980). “Notation as a tool of thought”, Communications of the ACM 23 (8), p. 444. doi:10.1145/358896.358899.
Hoare, C. A. R. (1981). “The emperor's old clothes”, Communications of the ACM 24 (2), p. 75. doi:10.1145/358549.358561.
(1982) “Relational database: A practical foundation for productivity”, Communications of the ACM 25 (2), p. 109. doi:10.1145/358396.358400.
Milner, R. (1993). “Elements of interaction: Turing award lecture”, Communications of the ACM 36, p. 78–89. doi:10.1145/151233.151240.
Stearns, R. E. (1994). “Turing Award lecture: It's time to reconsider time”, Communications of the ACM 37 (11), p. 95. doi:10.1145/188280.188379.
(2011) “The Mechanization of Causal Inference: A "mini" Turing Test and Beyond”, ACM Turing award lectures (mp4). doi:10.1145/1283920.2351636.
(1976) “New directions in cryptography”, IEEE Transactions on Information Theory 22 (6), p. 644–654. doi:10.1109/TIT.1976.1055638.

nytimes.com

bits.blogs.nytimes.com

Steve Lohr (2014-11-13). Google to Quadruple Computer Science Prize Winnings to $1 Million (angle). Bits. Alirita 2015-01-09 .

stanford.edu

www-ee.stanford.edu

(1976) “New directions in cryptography”, IEEE Transactions on Information Theory 22 (6), p. 644–654. doi:10.1109/TIT.1976.1055638.

web.archive.org

Turing award 2012. ACM. Arkivita el la originalo je 2013-03-18. Alirita 2017-03-11 . Arkivita kopio. Arkivita el la originalo je 2013-03-18. Alirita 2017-03-11 .

Premio Turing (Esperanto Wikipedia)

acm.org

amturing.acm.org

acm.org

dl.acm.org

awards.acm.org

doi.org

nytimes.com

bits.blogs.nytimes.com

stanford.edu

www-ee.stanford.edu

web.archive.org