Zvi Ostfeld

According to our database, Zvi Ostfeld authored at least 9 papers between 1988 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2000

Phantom: a simple and effective flow control scheme.

Yehuda Afek, Yishay Mansour, Zvi Ostfeld

Comput. Networks, 2000

1999

Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms.

Yehuda Afek, Yishay Mansour, Zvi Ostfeld

J. Algorithms, 1999

1997

Flow control in high speed networks

Zvi Ostfeld

PhD thesis, 1997

Virtual-credit: Efficient end-to-end credit based flow control.

Yehuda Afek, Yishay Mansour, Zvi Ostfeld

Proceedings of the Networks in Distributed Computing, 1997

1996

Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract).

Yehuda Afek, Yishay Mansour, Zvi Ostfeld

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement).

Yehuda Afek, Yishay Mansour, Zvi Ostfeld

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

On the existence of special depth first search trees.

Ephraim Korach, Zvi Ostfeld

J. Graph Theory, 1995

1993

Recognition of DFS trees: sequential and parallel algorithms with refined verifications.

Ephraim Korach, Zvi Ostfeld

Discret. Math., 1993

1988

DFS Tree Construction: Algorithms and Characterizations.

Ephraim Korach, Zvi Ostfeld

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988