I am an assistant professor at the Department of Computer Science at the Technion. My research interests are mainly in distributed computing, especially probabilistic algorithms and lower bounds, and theory of computing in general.

This is my CV, and this is a link to my DBLP entry.

I am looking for excellent graduate students that are interested in research in these areas. Requirements: being fond of algorithms and graph theory, and not being intimidated by probability. Background in distributed computing is not necessary.

## Some Talks

TCE Conference, Technion 2015: Are Lock-Free Algorithms Practically Wait-Free?

The 8th Israel CS Theory Day, The Open University 2016: Optimal Dynamic Distributed MIS

## From Communications of the ACM

- Researchers Simplify Parallel Programming, by Gary Anthes.

## From MITnews

- Breaking bottlenecks, by Larry Hardesty.
- New approach to vertex connectivity could maximize networks’ bandwidth, by Helen Knight.
- Parallel programming may not be so daunting, by Larry Hardesty.