@article{discovery1406959,
         journal = {Computer Physics Communications},
            year = {2011},
           title = {Efficiency of linked cell algorithms},
          number = {3},
           month = {March},
           pages = {611--615},
            note = {{\copyright} 2011. This manuscript version is published under a Creative Commons Attribution Non-commercial Non-derivative 4.0 International licence (CC BY-NC-ND 4.0). This licence allows you to share, copy, distribute and transmit the work for personal and non-commercial use providing author and publisher attribution is clearly stated. Further details about CC BY licences are available at http://creativecommons.org/licenses/by/4.0.},
          volume = {182},
            issn = {0010-4655},
          author = {Welling, U and Germano, G},
        abstract = {The linked cell algorithm is an essential part of molecular simulation software, both molecular dynamics and Monte Carlo. Though it scales linearly with the number of particles, there has been a constant interest in increasing its performance, because a large part of CPU time is spent to identify the interacting particles. Several recent publications proposed improvements to the algorithm and investigated their efficiency by applying them to particular setups. Here we develop a general method to evaluate the efficiency of these algorithms which is mostly independent of the parameters of the simulation, and test it for a number of linked cell algorithms. We also propose a combination of linked cell reordering and interaction sorting that performs well for a broad range of simulation setups.},
             url = {http://dx.doi.org/10.1016/j.cpc.2010.11.002},
        keywords = {Molecular simulation, Molecular dynamics, Monte Carlo, Neighbour list, Linked cell list, Linked cell reordering, Interaction sorting}
}