|Home||Research||Publications||Teaching and Students||Contact|
In parallel computations I am particularly interested in problems related to Combinatorial Scientific Computing. In particular I have worked on various problems in the field of parallel graph algorithms. This includes, among others, load balancing in parallel sparse matrix computations, sparse Cholesky factorization, graph coloring, computing matchings, and union-find data structures.
In distributed computing I have mainly worked within the field of self stabilizing algorithms, again mainly motivated by developing algorithms for various graph problems.
See also list of publications.