Image de couverture de livre

A Sierpinski Triangle Data Structure for Efficient Array Value Update and Prefix Sum Calculation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Harrison, Brent, Necaise, Jason, Projansky, Andrew, Whitfield, James D.
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Sierpinski Triangle Fermion-to-Qubit Transform
par: Harrison, Brent, et autres
Publié: (2024)

Prefix Sums via Kronecker Products
par: Sobczyk, Aleksandros, et autres
Publié: (2025)

Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries
par: Kempa, Dominik, et autres
Publié: (2025)

Cover Edge-Based Novel Triangle Counting
par: Bader, David A., et autres
Publié: (2024)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
par: Madani, Amirali, et autres
Publié: (2025)

Prefix-free parsing for merging big BWTs
par: Diaz-Dominguez, Diego, et autres
Publié: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
par: Yang, Chenxu, et autres
Publié: (2023)

Small Space Encoding and Recognition of $k$-Palindromic Prefixes
par: Bathie, Gabriel, et autres
Publié: (2024)

Revisit the Partial Coloring Method: Prefix Spencer and Sampling
par: Cai, Dongrun, et autres
Publié: (2024)

LLM Query Scheduling with Prefix Reuse and Latency Constraints
par: Dexter, Gregory, et autres
Publié: (2025)

Bubble-Flip -- A New Generation Algorithm for Prefix Normal Words
par: Cicalese, Ferdinando, et autres
Publié: (2017)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
par: Kempa, Dominik, et autres
Publié: (2023)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
par: Kikuchi, Masaru, et autres
Publié: (2024)

A PTAS for Weighted Triangle-free 2-Matching
par: Bosch-Calvo, Miguel, et autres
Publié: (2026)

Two Linear Passes Are Necessary for Sum-Exclude-Self Under Sublinear Space
par: Au, Andrew
Publié: (2026)

Suffixient Arrays: a New Efficient Suffix Array Compression Technique
par: Cenzato, Davide, et autres
Publié: (2024)

An Improved Approximation Algorithm for Metric Triangle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

On the Structural Parameterizations of 2-Club with Triangle Constraints
par: Jacob, Ashwin, et autres
Publié: (2025)

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
par: Assadi, Sepehr, et autres
Publié: (2026)

Space-efficient Data Structure for Next/Previous Larger/Smaller Value Queries
par: Jo, Seungbum, et autres
Publié: (2022)

Finding Triangles or Independent Sets; and Other Dual Pair Approximations
par: Dumitrescu, Adrian
Publié: (2021)

Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering
par: Adriaens, Florian, et autres
Publié: (2026)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
par: Bishnu, Arijit, et autres
Publié: (2024)

Efficient Matroid Intersection via a Batch-Update Auction Algorithm
par: Blikstad, Joakim, et autres
Publié: (2024)

Towards Efficient Data Structures for Approximate Search with Range Queries
par: Kian, Ladan, et autres
Publié: (2026)

Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries
par: Bishnu, Arijit, et autres
Publié: (2025)

Publishing Below-Threshold Triangle Counts under Local Weight Differential Privacy
par: Pfisterer, Kevin, et autres
Publié: (2026)

A Faster Algorithm for Pigeonhole Equal Sums
par: Jin, Ce, et autres
Publié: (2024)

Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters
par: Zhao, Zhuowei, et autres
Publié: (2024)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
par: Dumitrescu, Adrian
Publié: (2024)

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
par: Xuan, Wei, et autres
Publié: (2025)

Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
par: Meng, Lingkai, et autres
Publié: (2025)

Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem
par: Kobayashi, Yusuke, et autres
Publié: (2024)

Approximate Min-Sum Subset Convolution
par: Stoian, Mihail
Publié: (2024)

FPT Approximation for Capacitated Sum of Radii
par: Jaiswal, Ragesh, et autres
Publié: (2024)

Beating Bellman's Algorithm for Subset Sum
par: Bringmann, Karl, et autres
Publié: (2024)

Distribution Testing Meets Sum Estimation
par: Pradhan, Pinki, et autres
Publié: (2025)

Derandomizing Pseudopolynomial Algorithms for Subset Sum
par: Chan, Timothy M.
Publié: (2026)

Sparsifying Sums of Positive Semidefinite Matrices
par: Basu, Arpon, et autres
Publié: (2025)

An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
par: Sanaullah, Ahsan, et autres
Publié: (2025)