Saurabh Sawlani
Saurabh Sawlani
SoundHound Inc.
Verified email at soundhound.com - Homepage
Title
Cited by
Cited by
Year
Graph sparsification, spectral sketches, and faster resistance computation via short cycle decompositions
T Chu, Y Gao, R Peng, S Sachdeva, S Sawlani, J Wang
SIAM Journal on Computing, FOCS18-85-FOCS18-157, 2020
392020
ZeroER: Entity Resolution using Zero Labeled Examples
R Wu, S Chaba, S Sawlani, X Chu, S Thirumuruganathan
Proceedings of the 2020 ACM SIGMOD International Conference on Management of …, 2020
212020
Parallel batch-dynamic graphs: Algorithms and lower bounds
L Dhulipala, D Durfee, J Kulkarni, R Peng, S Sawlani, X Sun
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
16*2020
Density Independent Algorithms for Sparsifying -Step Random Walks
G Jindal, P Kolev, R Peng, S Sawlani
APPROX-RANDOM 81, 14:1--14:17, 2017
162017
Graph sketching against adaptive adversaries applied to the minimum degree algorithm
M Fahrbach, GL Miller, R Peng, S Sawlani, J Wang, SC Xu
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
102018
Near-optimal fully dynamic densest subgraph
S Sawlani, J Wang
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
92020
Pebbling meets coloring: Reversible pebble game on trees
B Komarath, J Sarma, S Sawlani
Journal of Computer and System Sciences 91, 33-41, 2018
9*2018
Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent
D Durfee, KA Lai, S Sawlani
Conference on Learning Theory 75, 1626--1656, 2018
92018
A study of performance of optimal transport
Y Dong, Y Gao, R Peng, I Razenshteyn, S Sawlani
arXiv preprint arXiv:2005.01182, 2020
62020
Flowless: Extracting densest subgraphs without flow computations
D Boob, Y Gao, R Peng, S Sawlani, C Tsourakakis, D Wang, J Wang
Proceedings of The Web Conference 2020, 573-583, 2020
32020
Faster width-dependent algorithm for mixed packing and covering LPs
D Boob, S Sawlani, D Wang
arXiv preprint arXiv:1909.12387, 2019
12019
Min/Max-Poly Weighting Schemes and the NL versus UL Problem
A Dhayal, J Sarma, S Sawlani
ACM Transactions on Computation Theory (TOCT) 9 (2), 1-25, 2017
1*2017
On Directed Tree Realizations of Degree Sets
P Kumar, MNJ Sarma, S Sawlani
International Workshop on Algorithms and Computation, 274-285, 2013
12013
Dual Algorithms for the Densest Subgraph Problem
SSS Sawlani
Georgia Institute of Technology, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–14