Presenter

Lukas received his MSc in Computer Science from ETH Zurich. His research focuses on graph algorithms and communication efficiency, with a special interest in randomized approaches. For his work on parallel minimum cut algorithms he won the best paper award at SPAA'18. He was a best paper finalist at SPAA'20 for his work on parallel subgraph isomorphism algorithms.