DFS Tree Construction: Algorithms and Characterizations. - Ephraim Korach; Zvi Ostfeld (WG, 1988)

Recognition of DFS trees: sequential and parallel algorithms with refined verifications. - Ephraim Korach; Zvi Ostfeld (Discret. Math., 1993)

On the existence of special depth first search trees. - Ephraim Korach; Zvi Ostfeld (J. Graph Theory, 1995)

On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement). - Yehuda Afek; Yishay Mansour; Zvi Ostfeld (PODC, 1996)

Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract). - Yehuda Afek; Yishay Mansour; Zvi Ostfeld (STOC, 1996)

Virtual-credit: Efficient end-to-end credit based flow control. - Yehuda Afek; Yishay Mansour; Zvi Ostfeld (Networks in Distributed Computing, 1997)

Flow control in high speed networks - Zvi Ostfeld (1997)

Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms. - Yehuda Afek; Yishay Mansour; Zvi Ostfeld (J. Algorithms, 1999)

Phantom: a simple and effective flow control scheme. - Yehuda Afek; Yishay Mansour; Zvi Ostfeld (Comput. Networks, 2000)