Author of the publication

Reversible Pebble Game on Trees.

, , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 83-94. Springer, (2015)

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.

 

Other publications of authors with the same name

$\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)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).On Directed Tree Realizations of Degree Sets., , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 274-285. Springer, (2013)Near-optimal fully dynamic densest subgraph., and . STOC, page 181-193. ACM, (2020)Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions., , , , , and . FOCS, page 361-372. IEEE Computer Society, (2018)$\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent., , and . COLT, volume 75 of Proceedings of Machine Learning Research, page 1626-1656. PMLR, (2018)Faster width-dependent algorithm for mixed packing and covering LPs., , and . NeurIPS, page 15253-15262. (2019)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)