Author

Ian D'Ambrosio

h-index 0 View on Semantic Scholar

4 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Always-Correct Succinct Dynamic Fusion Nodes Are Impossible: A Cell-Probe Lower Bound in the Small-Set, Large-Universe Regime

Lean 4 checks the complete packed-memory and fresh-random indexed models, hard distribution, communication bounds, separator, nested-forest accounting, deterministic and Las Vegas lower bounds, strict-predecessor reduction, and redundancy corollaries.

Ian D'Ambrosio · 1 citation · ⚡1

Preprint Aug 2026

A Deterministic Constant-Competitive Algorithm for Dynamic Mixture-of-Experts Serving

A deterministic O(1)-competitive algorithm that allocates k replica GPUs among m experts as workloads change and is machine-checked in Lean 4 relative to the positive-body result as the sole scientific source premise.

Ian D'Ambrosio · 0 citations

Preprint Aug 2026

A Tight Linear Deterministic Competitive Ratio for Fully Online KV-Cache Scheduling

A fully online model for batching nonpreemptive LLM requests under a growing KV-cache memory constraint and it is proved that every deterministic algorithm has competitive ratio Omega(sqrt(n), while the elementary sequential upper bound is n.

Ian D'Ambrosio · 0 citations

#machine learning Preprint Aug 2026

A Constant-Competitive Algorithm for Dynamic Mixture-of-Experts Serving

It is proved that the randomized primal competitive ratio is in fact Theta(1) for arbitrary numbers of experts and the upper bound reduces reciprocal-max service costs to chasing positive bodies with covering row sparsity two.

Ian D'Ambrosio · 0 citations