The author introduces novel algorithms for local computation on random graphs, focusing on spanners and connected subgraphs, achieving superior sparsity-stretch trade-offs.
