Science Explorer Back to mapMap

Most cited papers in Cellular Automata and Applications

Cellular Automata and Applications

What are the most cited papers in Cellular Automata and Applications?

The most cited paper in Cellular Automata and Applications is "Array programming with NumPy" (Cr Harris et al., 2020), with 18,804 citations. Next come "Network Flows: Theory, Algorithms, and Applications." (8,169) and "Network information flow" (7,890).

Showing 50 of 100 papers. Every paper with more than 681 citations is listed.

Most cited papers, sortable by citations and release date
#Paper
1 Array programming with NumPy Cr Harris et al. · RePEc: Research Papers in Economics Open access 17 Sep 2020 18,804
2 Network Flows: Theory, Algorithms, and Applications. David Keith Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society Nov 1994 8,169
3 Network information flow Rudolf Ahlswede, Ning Cai, Shuo Li et al. · IEEE Transactions on Information Theory Jul 2000 7,890
4 Computing Machinery and Intelligence (1950) Alan Mathison Turing Book chapter 9 Sep 2004 6,187
5 Disordered electronic systems Patrick A. Lee, T. V. Ramakrishnan · Reviews of Modern Physics Apr 1985 6,130
6 A universal algorithm for sequential data compression J. Ziv, Abraham Lempel · IEEE Transactions on Information Theory May 1977 5,517
7 Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) L.R. Bahl, John Cocke, F. Jelinek et al. · IEEE Transactions on Information Theory Mar 1974 5,204
8 Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels Erdal Arıkan · IEEE Transactions on Information Theory Open access 16 Jun 2009 4,564
9 A cellular automaton model for freeway traffic Kai Nagel, Michael Schreckenberg · Journal de Physique I Open access Dec 1992 3,868
10 Simulating Microscopic Hydrodynamic Phenomena with Dissipative Particle Dynamics P. J. Hoogerbrugge, J. M. V. A. Koelman · Europhysics Letters (EPL) Jun 1992 3,833
11 Writing on dirty paper (Corresp.) Mónica Isabel Teixeira Costa · IEEE Transactions on Information Theory May 1983 3,826
12 The university of Florida sparse matrix collection Timothy A. Davis, Yifan Hu · ACM Transactions on Mathematical Software Nov 2011 3,709
13 Sphere Packings, Lattices and Groups. H. S. M. Coxeter, J. H. Conway, Neil J.A. Sloane · American Mathematical Monthly Jun 1989 3,486
14 Compression of individual sequences via variable-rate coding J. Ziv, Abraham Lempel · IEEE Transactions on Information Theory Sep 1978 3,474
15 Linear network coding Shuo Li, Raymond W. Yeung, Ning Cai · IEEE Transactions on Information Theory Feb 2003 3,467
16 Broadcast channels with confidential messages Imre Csiszár, János Körner · IEEE Transactions on Information Theory May 1978 3,391
17 Disordered electronic systems M. Pollak, M. Ortuño, A. Frydman · Cambridge University Press eBooks Book chapter 20 Dec 2012 3,271
18 Surface codes: Towards practical large-scale quantum computation Austin G. Fowler, M. Mariantoni, John M. Martinis et al. · Physical Review A Open access 18 Sep 2012 3,166
19 Statistical mechanics of cellular automata Stephen Wolfram · Reviews of Modern Physics Jul 1983 3,158
20 Femtocell networks: a survey Vikram Chandrasekhar, Jeffrey G. Andrews, Alan Gatherer · IEEE Communications Magazine Open access Sep 2008 3,063
21 Lattice-Gas Automata for the Navier-Stokes Equation U. Frisch, B. Hasslacher, Yves Pomeau · Physical Review Letters Open access 7 Apr 1986 2,791
22 On the Complexity of Finite Sequences Abraham Lempel, J. Ziv · IEEE Transactions on Information Theory 1976 2,784
23 Cellular neural networks: applications Leon Ong Chua, Liu Yang · IEEE Transactions on Circuits and Systems Oct 1988 2,391
24 Statistical physics of vehicular traffic and some related systems D Chowdhury · Physics Reports Open access May 2000 2,303
25 Why systolic architectures? Kung · Computer 1982 2,294
26 Shift-register synthesis and BCH decoding J. Massey · IEEE Transactions on Information Theory 1969 2,209
27 SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS Gonzalo Álvarez, Shujun Li · International Journal of Bifurcation and Chaos Open access Aug 2006 2,114
28 Quad trees a data structure for retrieval on composite keys Raphael A. Finkel, Jon Louis Bentley · Acta Informatica 1974 2,042
29 Universality and complexity in cellular automata Stephen Wolfram · Physica D Nonlinear Phenomena 1984 1,944
30 The small-world phenomenon Jon Kleinberg Conference paperOpen access May 2000 1,916
31 Rate-compatible punctured convolutional codes (RCPC codes) and their applications Joachim Hagenauer · IEEE Transactions on Communications Apr 1988 1,838
32 Statistical Physics of Vehicular Traffic and Some Related Systems Debashish Chowdhury, Ludger Santen, Andreas Schadschneider 2000 1,829
33 Polyphase codes with good periodic correlation properties (Corresp.) Delin Chu · IEEE Transactions on Information Theory Jul 1972 1,739
34 Broadcast channels Thomas M. Cover · IEEE Transactions on Information Theory 1972 1,730
35 Computation at the edge of chaos: Phase transitions and emergent computation Chris G. Langton · Physica D Nonlinear Phenomena Open access Jun 1990 1,578
36 Intelligence Without Reason Rodney A. Brooks Book chapterOpen access 15 May 2018 1,555
37 Cellular automata as models of complexity Stephen Wolfram · Nature Oct 1984 1,525
38 Cellpose 2.0: how to train your own model Marius Pachitariu, Carsen Stringer · Nature Methods Open access 7 Nov 2022 1,507
39 A Self-Modifying Cellular Automaton Model of Historical Urbanization in the San Francisco Bay Area Keith Clarke, Stacy Hoppen, Leonard Gaydos · Environment and Planning B Planning and Design Apr 1997 1,453
40 Recursive functions of symbolic expressions and their computation by machine, Part I John McCarthy · Communications of the ACM Open access Apr 1960 1,396
41 Relationships between nondeterministic and deterministic tape complexities Walter J. Savitch · Journal of Computer and System Sciences Open access Apr 1970 1,378
42 Stochastic Theory of a Data-Handling System with Multiple Sources David J. Anick, Debasis Mitra, M. M. Sondhi · Bell System Technical Journal Oct 1982 1,303
43 The input/output complexity of sorting and related problems Alok Aggarwal, Jeffrey,S. Vitter · Communications of the ACM Open access Sep 1988 1,246
44 Turbo equalization: principles and new results M. Tüchler, R. Koetter, Andrew C. Singer · IEEE Transactions on Communications May 2002 1,221
45 Efficient erasure correcting codes Michael G. Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi et al. · IEEE Transactions on Information Theory Open access 2001 1,195
46 Universal codeword sets and representations of the integers Peter Eliaš · IEEE Transactions on Information Theory Mar 1975 1,185
47 A digital fountain approach to reliable distribution of bulk data John W. Byers, Michael G. Luby, Michael Mitzenmacher et al. Conference paper Oct 1998 1,161
48 Cellular Automata and Fractal Urban Form: A Cellular Modelling Approach to the Evolution of Urban Land-Use Patterns Roger W. White, Guy Engelen · Environment and Planning A Economy and Space Aug 1993 1,119
49 Schnelle Multiplikation großer Zahlen Arnold Schönhage, Volker Strassen · Computing Sep 1971 1,111
50 Fast simulated annealing Harold H Szu, Ralph L. Hartley · Physics Letters A Jun 1987 1,093

Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.