Randomized trace estimation is a popular and well-studied technique that approximates the
trace of a large-scale matrix B by computing the average of x^ T Bx x TB x for many samples …

We study distributed algorithms built around minor-based vertex sparsifiers, and give the first
algorithm in the CONGEST model for solving linear systems in graph Laplacian matrices to …

We demonstrate that for expander graphs, for all ε> 0, there exists a data structure of size Õ
(n ε-1) which can be used to return (1+ ε)-approximations to effective resistances in Õ (1) …

We introduce a new graph sparsification method that targets the neighborhood information
available for each node. Our approach is motivated by the fact that neighborhood …

In this thesis we propose and analyze algorithms for some numerical linear algebra tasks:
finding low-rank approximations of matrices, computing matrix functions, and estimating the …

Graph problems have been widely researched and possess a broad class of applications.
The increasing large-scale graphs in various applications have necessitated the …

This intership will take place within the ANR project COREGRAPHIE 1 and will be co-
supervised by Michel Habib (IRIF-Paris), Mohammed Haddad and Hamida Seba (LIRIS …