Search
Close this search box.
Search
Close this search box.

Blog

#pagerank

Date of publication: 3 years ago

Share this:

#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

We train Poles during SkillUp Academy

The MIM Solutions training on advertising graphics using explainable neural networks is available online as part of the ongoing SkillUp Academy. The SkillUp Academy was

News

We challenge other startups!

We couldn’t be more proud! In the upcoming weeks, we’re going to participate in Huawei Startup Challenge organised by Huawei Polska and Startup Academy. We