( en | de | ru )

 

Disambiguation of "Arora, Sanjeev"

Author of the publication

copydeleteadd this publication to your clipboard
On Winning Strategies in Ehrenfeucht-Fraïssé Games.

, and . Theor. Comput. Sci., 174 (1-2): 97-121 (1997)

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.

Sanjeev Kumar

Sachin Arora

Sanjeev Sarpal

Deepika Arora

Deepak Arora

 

Other publications of authors with the same name

O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n2) Time., , and . SIAM J. Comput., 39 (5): 1748-1771 (2010)Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems., and . Algorithmica, 40 (3): 189-210 (2004)A randomized online algorithm for bandwidth utilization., and . SODA, page 535-539. ACM/SIAM, (2002)A Practical Algorithm for Topic Modeling with Provable Guarantees, , , , , , , and . CoRR, (2012)Learning topic models - provably and efficiently., , , , , , , and . Commun. ACM, 61 (4): 85-93 (2018)An Exponential Learning Rate Schedule for Deep Learning., and . ICLR, OpenReview.net, (2020)On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization., , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 244-253. PMLR, (2018)A Convergence Analysis of Gradient Descent for Deep Linear Neural Networks., , , and . ICLR (Poster), OpenReview.net, (2019)A Compressed Sensing View of Unsupervised Text Embeddings, Bag-of-n-Grams, and LSTMs., , , and . ICLR (Poster), OpenReview.net, (2018)Exploring complexity through reductions.. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)