Ryutaro Yonezu

Randomization Collapses the Idle-Start Memory Barrier for Anonymous Dynamic Broadcast

We study stabilizing broadcast in anonymous, port-indistinguishable, synchronous, 1-interval-connected dynamic networks. For deterministic idle-start algorithms, prior work establishes a superconstant local-memory lower bound, while the Countdown algorithm uses O(log n) memory. W...

Two-Orbit Packing for Exact State Complexity of Explicit Binary Consensus in Anonymous Dynamic Networks with Periodic Time

We study deterministic binary consensus with explicit termination in anonymous synchronous 1-interval-connected dynamic networks under one-bit broadcast-counting communication with a free globally aligned phase φ_t = t mod P. For known dynamic diameter D and unknown network size,...

Dynamic Regular Witnesses for Near-Exact State Complexity of Explicit Binary Consensus with Periodic Time

We study deterministic binary consensus with explicit termination in anonymous synchronous 1-interval-connected dynamic networks under one-bit broadcast-counting communication with a free globally aligned phase phi_t = t mod P. For every n >= 15, we prove 2 + ceil((n - 13)/P) <=...

Two-Orbit Packing for Exact State Complexity of Explicit Binary Consensus in Anonymous Dynamic Networks with Periodic Time

We study deterministic binary consensus with explicit termination in anonymous synchronous 1-interval-connected dynamic networks under one-bit broadcast-counting communication with a free globally aligned phase φ_t = t mod P. For known dynamic diameter D and unknown network size,...

Capacity-Aware Completion Bounds for Exact Fixed-Permutation Electric Vehicle Routing Decoding

We study exact decoding of a fixed customer permutation in electric vehicle routing under the recently introduced Fixed-Permutation Splitting and Charging Problem (FPSCP) and its exact forward-labeling decoder FP-FLA. The contribution is deliberately narrow. Completion bounds and...

Capacity-Aware Completion Bounds for Exact Fixed-Permutation Electric Vehicle Routing Decoding

We study exact decoding of a fixed customer permutation in electric vehicle routing under the recently introduced Fixed-Permutation Splitting and Charging Problem (FPSCP) and its exact forward-labeling decoder FP-FLA. The contribution is deliberately narrow. Completion bounds and...

A 75/61 Upper Bound on the Universal Price of Three-Arm Gaussian Best-Arm Identification

For fixed-budget best-arm identification with three unit-variance Gaussian arms, this preprint gives a constructive upper bound on the universal price of best-arm identification: P₃ ≤ 75/61 = 1.229508196721312… The proposed two-stage soft-freeze policy uses a uniform pilot, freez...

A 75/61 Upper Bound on the Universal Price of Three-Arm Gaussian Best-Arm Identification

For fixed-budget best-arm identification with three unit-variance Gaussian arms, this preprint gives a constructive upper bound on the universal price of best-arm identification: P₃ ≤ 75/61 = 1.229508196721312… The proposed two-stage soft-freeze policy uses a uniform pilot, freez...