3 papers
cs.NI2026
RNG: Flat Datacenter Networks at Scale
Giacomo Bernardi, Ratul Mahajan, C. Seshadhri +8
We design and deploy in production the first flat datacenter networks. Our design, called RNG, is based on quasi-random graphs. While the cost and fault-tolerance benefits of such…
cs.DS2026
A note on approximating the average degree of bounded arboricity graphs
Talya Eden, C. Seshadhri
Estimating the average degree of graph is a classic problem in sublinear graph algorithm. Eden, Ron, and Seshadhri (ICALP 2017, SIDMA 2019) gave a simple algorithm for this problem…
cs.DS2024
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
Sabyasachi Basu, Nadia Kōshima, Talya Eden +2
Computing distances and finding shortest paths in massive real-world networks is a fundamental algorithmic task in network analysis. There are two main approaches to solving this t…