• In computer science, the prefix sum, cumulative sum, inclusive scan, or simply scan of a sequence of numbers x0, x1, x2, ... is a second sequence of numbers...
    46 KB (5,591 words) - 23:34, 28 April 2025
  • with a butterfly algorithm achieves the same asymptotic runtime. The prefix-sum or scan operation is used to collect data or partial results from different...
    22 KB (2,529 words) - 09:48, 9 April 2025
  • some basic communication primitives such as Broadcast, All-Reduce, and Prefix sum. The processing elements are numbered 0 {\displaystyle 0} through 2 d...
    10 KB (1,647 words) - 05:47, 17 February 2025
  • Thumbnail for Fenwick tree
    compute a prefix sum or search for a prefix length. An array of prefix sums can return a prefix sum in constant time, and search for a prefix length in...
    15 KB (2,396 words) - 17:10, 25 March 2025
  • processors. The algorithm can also be adapted to perform a reduction or prefix sum. A broadcast sends a message from a specified root processor to all other...
    16 KB (1,968 words) - 08:11, 11 January 2024
  • Thumbnail for Maximum subarray problem
    algorithm that solves the one-dimensional problem in O(n2) time using prefix sum, improving the brute force running time of O(n3). When Michael Shamos...
    20 KB (2,467 words) - 15:17, 26 February 2025
  • do global build prefix sum over size of Q // get offsets and total number of vertices in this step offset = nrOfVerticesProcessed + sum(Qi, i = 0 to j...
    23 KB (3,170 words) - 01:52, 12 February 2025
  • A prefix code is a type of code system distinguished by its possession of the prefix property, which requires that there is no whole code word in the system...
    11 KB (1,516 words) - 12:06, 12 May 2025
  • Thumbnail for Load balancing (computing)
    tasks allows to reach an optimal load distribution (see algorithm of prefix sum). Unfortunately, this is in fact an idealized case. Knowing the exact...
    49 KB (6,559 words) - 10:27, 8 May 2025
  • is also known as the prefix sum in computer science. The inverse transformation for recovering a sequence from its partial sums is the finite difference...
    79 KB (12,851 words) - 09:10, 17 May 2025
  • the number of objects that possess distinct key values, and applying prefix sum on those counts to determine the positions of each key value in the output...
    12 KB (1,591 words) - 06:08, 23 January 2025
  • In computer science, a segmented scan is a modification of the prefix sum with an equal-sized array of flag bits to denote segment boundaries on which...
    1 KB (267 words) - 18:45, 9 February 2024
  • example, for a function sum {\displaystyle \operatorname {sum} } that returns the sum of all values in an array, the range query sum q ⁡ ( l , r ) {\displaystyle...
    32 KB (5,468 words) - 03:54, 10 April 2025
  • equivalently be viewed as performing a prefix sum operation on the given list, in which the values to be summed are all equal to one. The list ranking...
    4 KB (471 words) - 01:13, 21 May 2024
  • Thumbnail for Euler tour technique
    of the following problems can be solved in O(Prefix sum(n)) (the time it takes to solve the prefix sum problem in parallel for a list of n items): Classifying...
    6 KB (977 words) - 05:40, 19 May 2025
  • Thumbnail for Parallel external memory
    partitioning algorithm (PEM_DIST_SORT) uses a PEM prefix sum algorithm to calculate the prefix sum with the optimal O ( N P B + log ⁡ P ) {\displaystyle...
    16 KB (1,961 words) - 08:49, 16 October 2023
  • Thumbnail for Summed-area table
    floating-point data, error can be reduced using compensated summation. Prefix sum Lewis, J.P. (1995). Fast template matching. Proc. Vision Interface. pp...
    10 KB (1,477 words) - 22:52, 6 May 2025
  • product of the outcomes of several bets in sequence. Running average Prefix sum Programmed Data Processor-1 Manual (PDF). Maynard, Massachusetts: Digital...
    4 KB (501 words) - 06:23, 11 February 2024
  • approaches to reducing this memory overhead exist. Packing the 3D array with a prefix sum scan, or linearizing, removed the unused memory issue but requires an...
    10 KB (1,108 words) - 17:11, 8 June 2024
  • algebra Minkowski addition, a sum of two subsets of a vector space Power sum symmetric polynomial, in commutative algebra Prefix sum, in computing Pushout (category...
    4 KB (620 words) - 12:25, 27 December 2024
  • printed text or printed sheet music Port scanner, in computer networking Prefix sum, an operation on lists that is also known as the scan operator Raster...
    3 KB (454 words) - 12:12, 19 July 2024
  • Thumbnail for Monoid
    operations ensures that the operation can be parallelized by employing a prefix sum or similar algorithm, in order to utilize multiple cores or processors...
    35 KB (4,462 words) - 23:51, 18 April 2025
  • Thumbnail for Erik Demaine
    including his work on the carpenter's rule problem, hinged dissection, prefix sum data structures, competitive analysis of binary search trees, graph minors...
    11 KB (887 words) - 18:53, 29 March 2025
  • Thumbnail for Quicksort
    The partitioning step is accomplished through the use of a parallel prefix sum algorithm to compute an index for each array element in its section of...
    71 KB (9,929 words) - 08:31, 21 May 2025
  • Andrey Kolmogorov. He did important early work on parallel algorithms for prefix sums and their application in the design of Boolean circuits for addition...
    2 KB (235 words) - 09:42, 7 November 2024
  • called prefix sum by using the Euler tour technique. With the Euler tour technique, a tree could be represented in a flat style, and thus prefix sum could...
    14 KB (2,215 words) - 20:24, 26 October 2023
  • Thumbnail for Kalman filter
    García-Fernández (2021). The filter solution can then be retrieved by the use of a prefix sum algorithm which can be efficiently implemented on GPU. This reduces the...
    130 KB (20,726 words) - 13:21, 13 May 2025
  • Thumbnail for ISBN
    standard ISO 2108 (any 9-digit SBN can be converted to a 10-digit ISBN by prefixing it with a zero). Privately published books sometimes appear without an...
    63 KB (6,748 words) - 11:32, 28 April 2025
  • number can be described as a prefix sum of the bits in the Gray code, where each individual summation operation in the prefix sum is performed modulo two....
    181 KB (15,921 words) - 03:34, 5 May 2025
  • Catamorphism, a generalization of fold Homomorphism Map (higher-order function) Prefix sum Recursive data type Reduction operator Structural recursion "Haskell unit...
    39 KB (2,787 words) - 17:28, 5 December 2024