DeepAI
Log In Sign Up

Practical Trade-Offs for the Prefix-Sum Problem

06/25/2020
by   Giulio Ermanno Pibiri, et al.
0

Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of the elements in A[0..i], knowing that the integers in A can be changed. It is a classic problem in data structure design with a wide range of applications in computing from coding to databases. In this work, we propose and compare several and practical solutions to this problem, showing that new trade-offs between the performance of queries and updates can be achieved on modern hardware.

READ FULL TEXT
10/22/2020

Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms

We study the problem of improving the performance of online algorithms b...
07/09/2020

The Trade-Offs of Private Prediction

Machine learning models leak information about their training data every...
03/04/2019

An Adversarial Super-Resolution Remedy for Radar Design Trade-offs

Radar is of vital importance in many fields, such as autonomous driving,...
06/09/2022

Principal Trade-off Analysis

This paper develops Principal Trade-off Analysis (PTA), a decomposition ...
05/27/2019

Contest Architecture with Public Disclosures

I study optimal disclosure policies in sequential contests. A contest de...
04/10/2022

Reducing Model Jitter: Stable Re-training of Semantic Parsers in Production Environments

Retraining modern deep learning systems can lead to variations in model ...

Code Repositories

psds

Prefix-Sum Data Structures in C++. This is the code for the paper "Practical Trade-Offs for the Prefix-Sum Problem" by Giulio Ermanno Pibiri and Rossano Venturini, https://arxiv.org/abs/2006.14552.


view repo