( en | de | ru )

 

Disambiguation of "Ostfeld, Zvi"

Author of the publication

copydeleteadd this publication to your clipboard
Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract).

, , and . STOC, page 89-98. ACM, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Albrecht Ostfeld

Elisabeth Ostfeld

Elisabeth Ostfeld

Daria Igorivna Zvirgzde

Sopiko Zviadadze

 

Other publications of authors with the same name

On the existence of special depth first search trees., and . J. Graph Theory, 19 (4): 535-547 (1995)Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms., , and . J. Algorithms, 30 (1): 106-143 (1999)Recognition of DFS trees: sequential and parallel algorithms with refined verifications., and . Discret. Math., 114 (1-3): 305-327 (1993)On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement)., , and . PODC, page 212. ACM, (1996)Phantom: a simple and effective flow control scheme., , and . Comput. Networks, 32 (3): 277-305 (2000)Flow control in high speed networks. Tel Aviv University, Israel, (1997)Tel Aviv University Library.Virtual-credit: Efficient end-to-end credit based flow control., , and . Networks in Distributed Computing, volume 45 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 1-21. DIMACS/AMS, (1997)DFS Tree Construction: Algorithms and Characterizations., and . WG, volume 344 of Lecture Notes in Computer Science, page 87-106. Springer, (1988)Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract)., , and . STOC, page 89-98. ACM, (1996)Phantom: A Simple and Effective Flow Control Scheme., , and . SIGCOMM, page 169-182. ACM, (1996)