New algorithms compute shortest unique and absent substrings in O(n log σ / sqrt(log n)) time by decomposing on length and period then reducing to geometric queries via synchronizing sets, runs, and wavelet trees.
In: 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27-30
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 2polarities
background 2representative citing papers
A technique for enforcing differential privacy in temporal runtime monitoring by analyzing dependencies and injecting noise into specifications while using tree mechanisms to limit accuracy loss.
Many r-local Hamiltonians, including Pauli strings, random high-rank operators, and high-rank operators, admit sparsifications with o(n^r) terms that (1±ε)-approximate the original Hamiltonian on all states.
New degree-sequence lower bounds on hard-core independent set sizes via multivariate local occupancy and spectral analysis.
citing papers explorer
-
Faster Algorithms for Shortest Unique or Absent Substrings
New algorithms compute shortest unique and absent substrings in O(n log σ / sqrt(log n)) time by decomposing on length and period then reducing to geometric queries via synchronizing sets, runs, and wavelet trees.
-
Differentially Private Runtime Monitoring
A technique for enforcing differential privacy in temporal runtime monitoring by analyzing dependencies and injecting noise into specifications while using tree mechanisms to limit accuracy loss.
-
Many Hamiltonians Are Sparsifiable
Many r-local Hamiltonians, including Pauli strings, random high-rank operators, and high-rank operators, admit sparsifications with o(n^r) terms that (1±ε)-approximate the original Hamiltonian on all states.
-
Degree-sequence bounds for independent sets via multivariate local occupancy
New degree-sequence lower bounds on hard-core independent set sizes via multivariate local occupancy and spectral analysis.