Outerplanar metrics admit an O(k^5) recognition algorithm but no O(1)-point local characterization, proved via a repelling-paths condition on shortest-path structures.
arXiv preprint arXiv:2102.05077 , year=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Under a roughly-synchronous stochastic scheduler, O(1) hardware registers (plus one CAS) implement contention-tolerant R/W and CAS objects with O(log P) latency w.h.p., with a matching space-latency lower bound.
BIDS algorithm for batched single-index global MAB with covariates achieves minimax-optimal regret rates when a pilot direction is accurate and K is fixed, avoiding the curse of dimensionality.
citing papers explorer
-
Paths and Intersections: Recognizing Outerplanar Metrics
Outerplanar metrics admit an O(k^5) recognition algorithm but no O(1)-point local characterization, proved via a repelling-paths condition on shortest-path structures.
-
Fast Concurrent Primitives Despite Contention
Under a roughly-synchronous stochastic scheduler, O(1) hardware registers (plus one CAS) implement contention-tolerant R/W and CAS objects with O(log P) latency w.h.p., with a matching space-latency lower bound.
-
Batched Single-Index Global Multi-Armed Bandits with Covariates
BIDS algorithm for batched single-index global MAB with covariates achieves minimax-optimal regret rates when a pilot direction is accurate and K is fixed, avoiding the curse of dimensionality.