Saurabh Sawlani

According to our database1, Saurabh Sawlani authored at least 22 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions.
SIAM J. Comput., December, 2023

Density of states for fast embedding node-attributed graphs.
Knowl. Inf. Syst., June, 2023

2022
Graph Anomaly Detection with Unsupervised GNNs.
CoRR, 2022

2021
Fast Attributed Graph Embedding via Density of States.
Proceedings of the IEEE International Conference on Data Mining, 2021

2020
Dual Algorithms for the Densest Subgraph Problem.
PhD thesis, 2020

A Study of Performance of Optimal Transport.
CoRR, 2020

Flowless: Extracting Densest Subgraphs Without Flow Computations.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Near-optimal fully dynamic densest subgraph.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

ZeroER: Entity Resolution using Zero Labeled Examples.
Proceedings of the 2020 International Conference on Management of Data, 2020

2019
AutoER: Automated Entity Resolution using Generative Modelling.
CoRR, 2019

Faster width-dependent algorithm for mixed packing and covering LPs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Pebbling meets coloring: Reversible pebble game on trees.
J. Comput. Syst. Sci., 2018

Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

$\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent.
Proceedings of the Conference On Learning Theory, 2018

2017
Min/Max-Poly Weighting Schemes and the NL versus UL Problem.
ACM Trans. Comput. Theory, 2017

On Computing Min-Degree Elimination Orderings.
CoRR, 2017

$\ell_1$ Regression using Lewis Weights Preconditioning.
CoRR, 2017

Density Independent Algorithms for Sparsifying k-Step Random Walks.
Proceedings of the Approximation, 2017

2015
Reversible Pebble Game on Trees.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
On Directed Tree Realizations of Degree Sets.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013


  Loading...