Modular subset sum, dynamic strings, and zero-sum sets

DOI10.1137/1.9781611976496.5MaRDI QIDQ6538742zbMATH OpenFDO

Authors Jean Cardinal, John Iacono

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611976496.5

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(8)

• A textbook solution for dynamic strings
• Minimizing tardy processing time on a single machine in near-linear time
• Minimizing tardy processing time on a single machine in near-linear time
• Logarithmic-time internal pattern matching queries in compressed and dynamic texts
• Fast n-fold Boolean convolution via additive combinatorics
• Knapsack and subset sum with small items
• A textbook solution for dynamic strings
• Does subset sum admit short proofs?

This page was built for publication: Modular subset sum, dynamic strings, and zero-sum sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538742)