# | Title | Journal | Year | Citations |
---|
1 | ImageNet classification with deep convolutional neural networks | Communications of the ACM | 2017 | 21,454 |
2 | Random sample consensus | Communications of the ACM | 1981 | 19,053 |
3 | MapReduce | Communications of the ACM | 2008 | 12,395 |
4 | A method for obtaining digital signatures and public-key cryptosystems | Communications of the ACM | 1978 | 11,308 |
5 | How to share a secret | Communications of the ACM | 1979 | 10,025 |
6 | WordNet | Communications of the ACM | 1995 | 9,728 |
7 | A view of cloud computing | Communications of the ACM | 2010 | 7,593 |
8 | Time, clocks, and the ordering of events in a distributed system | Communications of the ACM | 1978 | 6,713 |
9 | The size of the IT job market | Communications of the ACM | 2008 | 6,451 |
10 | Maintaining knowledge about temporal intervals | Communications of the ACM | 1983 | 5,640 |
11 | Space/time trade-offs in hash coding with allowable errors | Communications of the ACM | 1970 | 5,597 |
12 | Multidimensional binary search trees used for associative searching | Communications of the ACM | 1975 | 5,351 |
13 | A vector space model for automatic indexing | Communications of the ACM | 1975 | 5,345 |
14 | Use of the Hough transformation to detect lines and curves in pictures | Communications of the ACM | 1972 | 5,098 |
15 | A relational model of data for large shared data banks | Communications of the ACM | 1970 | 5,087 |
16 | Generative adversarial networks | Communications of the ACM | 2020 | 4,910 |
17 | Computational thinking | Communications of the ACM | 2006 | 4,265 |
18 | Probabilistic topic models | Communications of the ACM | 2012 | 3,743 |
19 | An axiomatic basis for computer programming | Communications of the ACM | 1969 | 3,676 |
20 | Communicating sequential processes | Communications of the ACM | 1978 | 3,567 |
21 | A method for obtaining digital signatures and public-key cryptosystems | Communications of the ACM | 1983 | 3,521 |
22 | On the criteria to be used in decomposing systems into modules | Communications of the ACM | 1972 | 3,394 |
23 | A theory of the learnable | Communications of the ACM | 1984 | 3,329 |
24 | Untraceable electronic mail, return addresses, and digital pseudonyms | Communications of the ACM | 1981 | 3,272 |
25 | Algorithm 368: Numerical inversion of Laplace transforms [D5] | Communications of the ACM | 1970 | 3,025 |
26 | Recommender systems | Communications of the ACM | 1997 | 2,991 |
27 | A bridging model for parallel computation | Communications of the ACM | 1990 | 2,860 |
28 | Algorithm 97: Shortest path | Communications of the ACM | 1962 | 2,847 |
29 | Using collaborative filtering to weave an information tapestry | Communications of the ACM | 1992 | 2,791 |
30 | Wireless integrated network sensors | Communications of the ACM | 2000 | 2,601 |
31 | ELIZA—a computer program for the study of natural language communication between man and machine | Communications of the ACM | 1966 | 2,559 |
32 | The JPEG still picture compression standard | Communications of the ACM | 1991 | 2,537 |
33 | Illumination for computer generated pictures | Communications of the ACM | 1975 | 2,412 |
34 | Fab | Communications of the ACM | 1997 | 2,408 |
35 | Efficient string matching | Communications of the ACM | 1975 | 2,403 |
36 | Arithmetic coding for data compression | Communications of the ACM | 1987 | 2,287 |
37 | Scratch | Communications of the ACM | 2009 | 2,279 |
38 | A machine program for theorem-proving | Communications of the ACM | 1962 | 2,256 |
39 | Password authentication with insecure communication | Communications of the ACM | 1981 | 2,248 |
40 | Electronic markets and electronic hierarchies | Communications of the ACM | 1987 | 2,181 |
41 | Symbolic execution and program testing | Communications of the ACM | 1976 | 2,157 |
42 | Can programming be liberated from the von Neumann style? | Communications of the ACM | 1978 | 1,990 |
43 | Reputation systems | Communications of the ACM | 2000 | 1,949 |
44 | GroupLens | Communications of the ACM | 1997 | 1,948 |
45 | Probabilistic robotics | Communications of the ACM | 2002 | 1,921 |
46 | A fast parallel algorithm for thinning digital patterns | Communications of the ACM | 1984 | 1,902 |
47 | Algorithm 457: finding all cliques of an undirected graph | Communications of the ACM | 1973 | 1,884 |
48 | An algorithm for planning collision-free paths among polyhedral obstacles | Communications of the ACM | 1979 | 1,881 |
49 | A few useful things to know about machine learning | Communications of the ACM | 2012 | 1,877 |
50 | Groupware: some issues and experiences | Communications of the ACM | 1991 | 1,851 |