Blog

#pagerank

Date of publication: 3 years ago

Share this:

Blog

#pagerank

Years ago when I learned about Google PageRank algorithm, my first reaction was this is not the way it should be done! There should be some proof. This probably just shows that my CS education was too theoretical ;). Years later I have learned that indeed there are some nice tools to argue about the running time of PageRank algorithm. And very recently we were able to give some new parallel (in MPC model) algorithms for computing vanilla PageRank. We improved the number of rounds needed from O(log n) to O(log^2 log n) time. You can hear Solbodan talking out it here:

https://lnkd.in/eT2T3aY. #pagerank

https://www.linkedin.com/posts/piotr-sankowski-80a6875_session-3a-walking-randomly-massively-activity-6696850845469859840-M5LW

Other posts

Breaking news from MIM Solutions

Follow us

News

RecSys Challenge 2016

MIM Solution’s team came second in the RecSys Challenge 2016 in Boston, USA. The ACM Recommender Systems conference (RecSys) is the premier international forum for

News

MedTech News: November 2022

  Multiple FDA clearances for AI-powered products!   The United States Food and Drug Administration is an agency which certifies medical products in the United