I am with 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.
I am looking for excellent graduate students and postdocs that are interested in research in these areas. Requirements: strong background in algorithms and math. Background in distributed computing is not necessary.
From Communications of the ACM
- Researchers Simplify Parallel Programming, by Gary Anthes.
- 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.