Saurabh Sawlani

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions SIAM Journal on Computing	2023-12-19	Paper
Density independent algorithms for sparsifying \(k\)-step random walks (available as arXiv preprint)	2021-07-28	Paper
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms	2021-02-02	Paper
Near-optimal fully dynamic densest subgraph Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper
Min/max-poly weighting schemes and the NL versus UL problem ACM Transactions on Computation Theory	2019-12-06	Paper
Pebbling meets coloring: reversible pebble game on trees Journal of Computer and System Sciences	2017-10-11	Paper
Polynomial min/max-weighted reachability is in unambiguous log-space	2017-04-25	Paper
Reversible pebble game on trees Lecture Notes in Computer Science	2015-10-29	Paper
On directed tree realizations of degree sets WALCOM: Algorithms and Computation	2013-04-12	Paper

Research outcomes over time

This page was built for person: Saurabh Sawlani