pith. sign in

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.

4 Pith papers citing it

citation-role summary

background 2

citation-polarity summary

years

2026 4

verdicts

UNVERDICTED 4

roles

background 2

polarities

background 2

representative citing papers

Faster Algorithms for Shortest Unique or Absent Substrings

cs.DS · 2026-05-06 · unverdicted · novelty 7.0

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

cs.CR · 2026-05-04 · unverdicted · novelty 7.0

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

quant-ph · 2026-05-04 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 4 of 4 citing papers.

  • Faster Algorithms for Shortest Unique or Absent Substrings cs.DS · 2026-05-06 · unverdicted · none · ref 34

    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 cs.CR · 2026-05-04 · unverdicted · none · ref 20

    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 quant-ph · 2026-05-04 · unverdicted · none · ref 74

    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 math.CO · 2026-05-06 · unverdicted · none · ref 23

    New degree-sequence lower bounds on hard-core independent set sizes via multivariate local occupancy and spectral analysis.