Semantic Scholar uses AI to extract papers important to this topic.
Abstract For about 35 years since its creation, the suite of atomic structure codes created by R.D. Cowan remains the working… Expand Neighbor identification is the most computationally intensive step in particle based simulations. To contain its cost, a common… Expand Sorting by Exchanging We show that exchanging of pairs in an array which are in incorrect order leads to sorted array. It… Expand Distributed hash tables (DHT) are used for data management in P2P environments. However, since most hash functions ignore… Expand Algorithmic skeletons intend to simplify parallel programming by providing recurring forms of program structure as predefined… Expand Compilers employ system models, sometimes implicitly, to make code optimization decisions. These models are analytic; they… Expand Given a k-character query string and an array of n strings arranged in lexicographical order, computing the rank of the query… Expand We consider computational and implementation issues for the completion of monomial sets to involution using different involutive… Expand Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of… Expand Asymptotic results for the sum-of-digits function with respect to Standard-Gray-code representation of positive integers are… Expand