Grigory Yaroslavtsev | Academic Influence

Grigory Yaroslavtsev's AcademicInfluence.com Rankings

Grigory Yaroslavtsev

Computer Science

#3198

World Rank

#3351

Historical Rank

Machine Learning

#3081

World Rank

#3119

Historical Rank

Computational Linguistics

#3261

World Rank

#3305

Historical Rank

Artificial Intelligence

#6503

World Rank

#6623

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Grigory Yaroslavtsev's Degrees

Bachelors Computer Science Moscow State University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Grigory Yaroslavtsev Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Grigory Yaroslavtsev is a Russian-American computer scientist. He is an assistant professor of computer science at George Mason University. Previously he was an assistant professor of computer science at Indiana University and the founding director of the Center for Algorithms and Machine Learning at Indiana University.

(See a Problem?)

Grigory Yaroslavtsev's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Private Analysis of Graph Structure (2014) (201)
Parallel algorithms for geometric graph problems (2013) (156)
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model (2016) (99)
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (2014) (86)
Lower Bounds for Testing Properties of Functions over Hypergrid Domains (2014) (50)
Accurate and efficient private release of datacubes and contingency tables (2012) (46)
Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under $\ell_p$-Distances (2017) (45)
Approximation algorithms for spanner problems and Directed Steiner Forest (2013) (43)
Finding Efficient Circuits Using SAT-Solvers (2009) (40)
Lp-testing (2014) (33)
Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (2013) (32)
Hierarchical Clustering for Euclidean Data (2018) (32)
New upper bounds on the Boolean circuit complexity of symmetric functions (2010) (31)
Private algorithms for the protected in social network search (2016) (30)
Private analysis of graph structure (2011) (28)
Beyond set disjointness: the communication complexity of finding the intersection (2014) (27)
Learning pseudo-Boolean k-DNF and submodular functions (2012) (23)
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection (2019) (21)
Tight Bounds for Linear Sketches of Approximate Matchings (2015) (19)
Certifying Equality With Limited Interaction (2016) (16)
Objective-Based Hierarchical Clustering of Deep Embedding Vectors (2020) (14)
Adversarially Robust Submodular Maximization under Knapsack Constraints (2019) (14)
Online Algorithms for Machine Minimization (2014) (14)
"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack (2019) (12)
Linear Sketching over F_2 (2018) (12)
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent (2019) (12)
Steiner transitive-closure spanners of low-dimensional posets (2010) (12)
Optimality of linear sketching under modular updates (2018) (10)
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs (2012) (9)
Privacy for the Protected (Only) (2015) (6)
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (2015) (6)
Linear Sketching over 𝔽2 (2016) (3)
Going for Speed: Sublinear Algorithms for Dense r-CSPs (2014) (3)
Approximate F2-Sketching of Valuation Functions (2019) (3)
Escaping Saddle Points with Compressed SGD (2021) (2)
Steiner transitive-closure spanners of low-dimensional posets (2010) (2)
"efficient Combinatorial Methods in Sparsification, Summarization and Testing of Large Datasets" (2013) (1)
Certifying Equality With Limited Interaction (2016) (1)
Linear Sketching over $\mathbb F_2$ (2016) (1)
HOUDINI: Escaping from Moderately Constrained Saddles (2022) (0)
Approximate $\mathbb{F}_2$-Sketching of Valuation Functions (2019) (0)
Tree Learning: Optimal Algorithms and Sample Complexity (2023) (0)
Fast Fourier Sparsity Testing (2019) (0)
The Round Complexity of Small Set Intersection (2013) (0)
1 1 N ov 2 01 6 Linear Sketching over F 2 (2016) (0)
The Information Complexity of Equality and Finding the Intersection (2013) (0)

This paper list is powered by the following services:

Other Resources About Grigory Yaroslavtsev

en.wikipedia.org

What Schools Are Affiliated With Grigory Yaroslavtsev?

Grigory Yaroslavtsev is affiliated with the following schools: