Introduction: Privacy-preserving computation is a crucial discipline that protects the privacy of confidential data while facilitating secure analysis. In graph problems, secure multiparty computation (SMC) presents a promising approach to performing these functionalities. This article delves into the notable advancements in privacy-preserving parallel algorithms recently introduced in a Ph.D. thesis. By integrating graph algorithms with […]

Kea Kohv, Master Student in Data Science An interactive tool developed by Data Science Master’s student Kea Kohv helps find highly rated and popular data science books sold on Amazon. A query for data science books on Amazon returns thousands of results. That is a lot to skim through. In addition, if searching for highly […]

Jaak Vilo, Kallol Roy Algorithmics (MTAT.03.238) is an obligatory course in the Computer Science MSc curriculum. As such it is intended to remind everyone of the foundations of algorithms and data structures but also to go beyond and teach some more advanced concepts (like succinct data structures, for example).  The course aims at linking different […]

We are living in a world in which data is not just getting bigger; it is also getting more and more interconnected. Large graph analytics is a useful tool for gaining insights from large volumes of interconnected data and has applications in various fields such as social media, biology, and telecommunications. An example of the […]