Grigory Yaroslavtsev

Grigory Yaroslavtsev is a computer scientist, an assistant professor of computer science at Indiana University, and the founding director of the Center for Algorithms and Machine Learning (CAML) at Indiana University.

Grigory Yaroslavtsev
Born1987
Leningrad
Alma materSt. Petersburg Polytechnic University (B.S.)
Pennsylvania State University (PhD)
Scientific career
InstitutionsIndiana University
Doctoral advisorSofya Raskhodnikova

Early education and competitive programing

Yaroslavtsev was born in St. Petersburg, then Leningrad, in 1987. He attended the St. Petersburg Classical Gymnasium through 9th grade. In 2004, Yaroslavtsev graduated from the Physics and Technology School in St. Petersburg,[1] a high school founded by Zhores Alferov. Yaroslavtsev completed a B.S. in applied physics at St. Petersburg Polytechnic University in 2008. In 2010, he received his M.S. from St. Petersburg Academic University as the first student in a pilot theoretical computer science program.[2]

Yaroslavtsev was active through 2011 in international programming competitions. He was one of 24 world finalists in algorithms in the 2010 TopCoder Open competition and is a member of the TCO hall of fame.[3][4] Yaroslavtsev also coached the high school team of the Physics and Technology School in 2009, when the team placed first in St. Petersburg.[5]

Career

Yaroslavtsev completed his PhD in computer science in three years in 2013 at Pennsylvania State University, advised by Sofya Raskhodnikova.[6] His dissertation was titled Efficient Combinatorial Techniques in Sparsification, Summarization and Testing of Large Datasets.[7] After an ICERM institute postdoctoral fellowship at Brown University, he joined the University of Pennsylvania in the first cohort of fellows at the Warren Center for Network and Data Science, founded by Michael Kearns.

In 2016, Yaroslavtsev joined the faculty at Indiana University in the Department of Computer Science and founded the Center for Algorithms and Machine Learning (CAML) at Indiana University.[8] He holds a secondary appointment in the Department of Statistics at Indiana University. Yaroslavtsev held a visiting position at the Alan Turing Institute in 2019.

Yaroslavtsev is best known for his work on massively parallel computing and algorithms for big data,[9][10] clustering analysis including correlation clustering,[11] and privacy in network analysis and targeted search.[12][13][14]

gollark: I mean, it's pretty much only used as an argument on this particular issue or adjacent ones.
gollark: Indeed. I wrote about this on my blog nobody reads: https://osmarks.net/osbill/.
gollark: And yet they do anyway.
gollark: The UK is much more sophisticated, so the argument *here* is something something something terrorism something something child safety.
gollark: The US government has been complaining about that lots too because something something terrorism.

References
  1. Kropp, Victor. "Academic Lyceum Physics and Technology School - Graduates". Retrieved 10 November 2019.
  2. "Alumni: Theoretical Computer Science". The Department of Mathematics and Information Technology in SPbAU RAS. Retrieved 10 November 2019.
  3. "TCO Hall of Fame". TopCoder. Retrieved 10 November 2019.
  4. "Members - Griffon". TopCoder. Retrieved 10 November 2019.
  5. Stankevich, Andrey. "Season 2008-2009, School Olympiads: XVI St. Petersburg School Programming Championship". NEERC IFMO Computer Science Olympiads. Retrieved 10 November 2019.
  6. "Grigory Yaroslavtsev". Mathematics Genealogy Project. Department of Mathematics, North Dakota State University. Retrieved 10 November 2019.
  7. Yaroslavtsev, Grigory (May 2014). Efficient Combinatorial Techniques in Sparsification, Summarization and Testing of Large Datasets (Thesis). The Graduate School of The Pennsylvania State University. Retrieved 10 November 2019.
  8. "Grigory Yaroslavtsev". Luddy School of Informatics, Computing, and Engineering. Indiana University Bloomington. Retrieved 10 November 2019.
  9. "DIMACS Workshop on Big Data through the Lens of Sublinear Algorithms". DIMACS: Center for Discrete Mathematics and Theoretical Computer Science. 29 October 2015. Retrieved 10 November 2019.
  10. "STOC 2015: 47th Annual Symposium on Theory of Computing". ACM STOC. Association for Computing Machinery (ACM). Retrieved 10 November 2019.
  11. "FOCS 2017 58th Annual IEEE Symposium on Foundations of Computer Science". FOCS17. Simons Institute at Berkeley. Retrieved 10 November 2019.
  12. Akpan, Nsikan (2 June 2016). "The secret things you give away through your phone metadata". NewsHour Productions LLC. PBS News Hour. Retrieved 10 November 2019.
  13. Collins, Nathan (3 May 2017). "Searching Private Data, and Ensuring it Stays Private". The Social Justice Foundation. Pacific Standard. Retrieved 10 November 2019.
  14. Lerner, Evan (4 March 2016). "Balancing Privacy and Security in Network Analysis". PennToday at UPenn. PennToday. Retrieved 10 November 2019.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.