Yefim Dinitz

Current teaching:

· Design of Algorithms
· Optimization, Matching, and Search Algorithms

Previous Teaching (selected):

· Design of Algorithms - Tais

Proposed topics for an M.Sc. thesis:

1. How many k-way minimum cuts may be in a graph? (may be a topic for ** Undergraduate Project **)

2. Off-line coordination of mutually supporting entities (agents): continuation of the work ps file of the paper .

3. In theory of distributed computing: continuation of the work pdf file of the paper .

4. In Tower of Hanoi algorithms and bounds; continuation of the work pdf file of the paper .

5. Fast finding of similar parts of a program, based on the method of paper ps file of the paper and on the concept of Program Dependency.

6. Computing near-optimal bus routes in Israel.

7. Visualization for Basic Algorithms. (Some relevant information).

Administration:

Dept.’s Committee for grad student’s research excellence

Other interests:

· Kabbalah (Zoar - ARI - Baal Sulam - M. Laitman):

-- Bnej Baruch World Center for Kabbalah Studies: multi-lingual site

-- my old paper on Kabbalah (2003, in Russian): htm file

· Hiking

· Dancing