( en | de | ru )

 

Disambiguation of "Sawlani, Saurabh"

Author of the publication

copydeleteadd this publication to your clipboard
On Computing Min-Degree Elimination Orderings.

, , , , , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Saurabh Sanatani

Saurabh Srivastava

Saurabh Bhavsar

Saurabh Ray

Saurabh Panjwani

 

Other publications of authors with the same name

Dual Algorithms for the Densest Subgraph Problem.. Georgia Institute of Technology, Atlanta, GA, USA, (2020)base-search.net (ftgeorgiatech:oai:repository.gatech.edu:1853/63582).Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions., , , , , and . SIAM J. Comput., 52 (6): S18-85 (December 2023)Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds., , , , , and . CoRR, (2019)Pebbling meets coloring: Reversible pebble game on trees., , and . J. Comput. Syst. Sci., (2018)$\ell_1$ Regression using Lewis Weights Preconditioning., , and . CoRR, (2017)Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm., , , , , and . FOCS, page 101-112. IEEE Computer Society, (2018)Reversible Pebble Game on Trees., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 83-94. Springer, (2015)Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space., , and . FSTTCS, volume 29 of LIPIcs, page 597-609. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)A Study of Performance of Optimal Transport., , , , and . CoRR, (2020)Density of states for fast embedding node-attributed graphs., , and . Knowl. Inf. Syst., 65 (6): 2455-2483 (June 2023)