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

Blog

#pagerank

Date of publication: 4 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

Events

Data Science Summit 2020

Adam Witkowski, Data Scientist and programmer from MIM Solution will take part in the upcoming Data Science Summit 2020 starting on the 16th of October.

News

We are conquering Dubai!

MIM Solutions became a part of the Polish Tech Bridges Programme organized by the Polish Investment and Trade Agency. The Agency implements pro-export projects dedicated