Randomized LOCAL algorithm computes 2-ruling sets in O(log log n) rounds w.h.p. on graphs with arboricity O(log log n), nearly matching lower bounds and exponentially improving prior combinations of results.
and Nirkhe, Chinmay , title =
5 Pith papers cite this work, alongside 15 external citations. Polarity classification is still indexing.
5
Pith papers citing it
15
external citations · external index
years
2026 5verdicts
UNVERDICTED 5representative citing papers
A randomized algorithm maintains O(Δ / ln Δ) coloring of dynamically changing triangle-free graphs with amortized Δ^{o(1)} log n update time per edge update against an adaptive adversary.
Any n-qubit QC Hamiltonian sparsifies to Õ(n/ε²) terms preserving all state energies within 1±ε using invariant subspace decomposition and the Alon-Kozma operator inequality.
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
Every class with Gaussian surface area at most Gamma admits degree O-tilde(Gamma squared over epsilon squared) non-negative L1-approximating polynomials for its indicators under the standard Gaussian.
citing papers explorer
-
Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity
Randomized LOCAL algorithm computes 2-ruling sets in O(log log n) rounds w.h.p. on graphs with arboricity O(log log n), nearly matching lower bounds and exponentially improving prior combinations of results.
-
Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
A randomized algorithm maintains O(Δ / ln Δ) coloring of dynamically changing triangle-free graphs with amortized Δ^{o(1)} log n update time per edge update against an adaptive adversary.
-
Quantum Cut Sparsifiers
Any n-qubit QC Hamiltonian sparsifies to Õ(n/ε²) terms preserving all state energies within 1±ε using invariant subspace decomposition and the Alon-Kozma operator inequality.
-
An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
-
A Note on Non-Negative $L_1$-Approximating Polynomials
Every class with Gaussian surface area at most Gamma admits degree O-tilde(Gamma squared over epsilon squared) non-negative L1-approximating polynomials for its indicators under the standard Gaussian.