pith. sign in

Title resolution pending

Tom Leighton, Satish Rao · 1999 · arXiv 1524.331526

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
read on arXiv browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1 cs.NI 1

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

Multi-Source Reachability in Near-Optimal Time

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

Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.

Throughput-Optimized Networks at Scale

cs.NI · 2026-05-27 · unverdicted · novelty 6.0

TONS uses linear optimization and heuristics to synthesize deadlock-free network topologies and routing for datacenter AI training, reporting 2.1x and 1.6x geometric mean speedups over best TPU torus variants for uniform random and all-to-all traffic in simulation.

citing papers explorer

Showing 2 of 2 citing papers.

  • Multi-Source Reachability in Near-Optimal Time cs.DS · 2026-06-24 · unverdicted · none · ref 145

    Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.

  • Throughput-Optimized Networks at Scale cs.NI · 2026-05-27 · unverdicted · none · ref 51

    TONS uses linear optimization and heuristics to synthesize deadlock-free network topologies and routing for datacenter AI training, reporting 2.1x and 1.6x geometric mean speedups over best TPU torus variants for uniform random and all-to-all traffic in simulation.