Some of my papers.

Content
  • Networking
  • Distributed Computing
  • Self-Stabilization
  • Seminar Day June 11

    Networking

    1. Restoration by Path Concatenation: Fast Recovery of MPLS Paths , by Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, and Michael Merritt Submitted for publication.
    2. Trainet: A new label switching scheme , by Yehuda Afek and, Anat Bremler-Barr INFOCOM-2000.
    3. Routing with a clue , by Yehuda Afek, Anat Bremler-Barr, and Sariel Har-Peled Submitted for journal publication. A preliminary version of this paper was presented in ACM SIGCOMM-99, Harvard University, Cambridge MA, (Aug, 1999).
    4. Phantom: A Simple and Effective Flow Control Scheme , by Yehuda Afek, Yishay Mansour and Zvi Ostfeld COMPUTER NETWORS 2000, Elsevier. A preliminary version of this paper was presented in ACM SIGCOMM-96, Stanford University, CA, (Aug, 1996) 169-182.
    5. Space Efficient Fair Queuing by Stochastic Memory Multiplexing , by Yehuda Afek, Yishay Mansour and Zvi Ostfeld Submitted for publication. Technical Report 322/97, Dept. of Computer Science, Tel-Aviv University, August 1997.
    6. Dynamic Bandwidth Allocation Policies. , by Yehuda Afek, Menashe Cohen, Eyal Haalman, and Yishay Mansour, INFOCOM 1996.
    7. A generic web-based network management application , by Yehuda Afek, and Yoram Cohen Proceedings of 7th IFIP//IEEE International Workshop on Distributed Systems Operations and Management (DSOM-96), Oct. 1996.
    8. Remote Object Oriented Programming with Quality of Service or Java's RMI over ATM , by Yehuda Afek, Michael Merrit, and Gideon Stupp. MASCOT January 1996, Eilat, Israel.
    9. Distributed Synchronization Protocols for SDH Networks , by Yehuda Afek, and Tal Lev. Manuscript, submitted for publication, January 1996, Israel.
    10. Virtual-Credit: Efficient End-to-End Credit Based Flow Control , by Yehuda Afek, Yishay Mansour and Zvi Ostfeld Submitted for publication.
    11. Convergence Complexity of Optimistic Rate Based Flow Control Algorithms , by Yehuda Afek, Yishay Mansour and Zvi Ostfeld, Submitted for journal publication. A preliminary version of this paper was presented in The 28th Annual ACM Symposium on Theory of Computing Philadelphia, PA (May, 1996), 89-98 and in The 15th Annual ACM symposium on Principles of Distributed Computing (as a brief announcement), Philadelphia, PA (May, 1996), 212.

    Distributed Computing

    1. Bounds in the shared memory requirements for Long-Lived & Adaptive objects by Y. Afek, P. Boxer, and D. Touitou PODC-2000 Aug. 2000.
    2. Long-lived Adaptive Collect with Applications by Y. Afek, G. Stupp, and D. Touitou Proceedings of The 40th Annual Symposium on Foundations of Computer Science (FOCS-99), October 1999.
    3. Long-Lived Renaming Made Adaptive by Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou Proceedings of 18th ACM Symposium on Principles of Distributed Computing (PODC-99), March 1999.
    4. Adaptive Long-Lived Renaming Using bounded Memory by Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou Manuscript. March 1999
    5. Adaptive algorithms utilyzing collect and snapshot by Y. Afek, and M. Merritt Submitted for journal publication. A preliminary version of this paper was presented in Proceedings of 18th ACM Symposium on Principles of Distributed Computing (PODC-99), March 1999.
    6. Adaptive algorithms utilyzing collect and snapshot by Y. Afek, E. Gafni, and M. Merritt Submitted for journal publication. A preliminary version of this paper was presented in Proceedings of 18th ACM Symposium on Principles of Distributed Computing (PODC-99), March 1999.
    7. Disentangling Multi-object Operations by Y. Afek, M. Merritt, G. Taubenfeld, and D. Touitou Proceedings of 16th ACM Symposium on Principles of Distributed Computing (PODC), August 1997, 111-120.
    8. The Power of Multi-objects by Y. Afek, M. Merritt, and G. Taubenfeld, Proceedings of 15th ACM Symposium on Principles of Distributed Computing (PODC), May 1996, 213-222.
    9. Wait-free Made Fast. by Yehuda Afek Dalia Dauber and Dan Touitou, In Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, pages, May-June 1995.
    10. Delimiting the power of bounded size synchronization objects. , by Yehuda Afek and Gideon Stupp, In Proc. of the 13th Ann. ACM Symp. on Principles of Distributed Computing, pages 42-51, August 1994.
    11. Synchronization power depends on the register size. , by Yehuda Afek and Gideon Stupp, In Proc. of the 34th Ann. IEEE Symp. on Foundations of Computer Science, pages 196-205, November 1993.
    12. The Bit Complexity of the Predecessor Problem. , by Yehuda Afek, Menashe Cohen, and Eyal Haalman, Information Processing Letters 63 (1997) 109-112.
    13. Benign Failure Models for Shared Memory by Y. Afek, M. Merritt, and G. Taubenfeld, Springer-Verlag Proceedings, 7th International Workshop on Distributed Algorithms, Lausanne, Switzerland, September 27-29, 1993.
    14. The Instancy of Snapshots and Commuting Objects July, 1995. by Y. Afek and E. Weisberger,
    15. A completeness theorem for a class of synchronization objects by Y. Afek, E. Weisberger, and H. Weisman, In Proceedings, of the Twelfth ACM Symposium on Principles of Distributed Computing, Ithaca, New-York, August 1993.
    16. On the complexity of global computation in the presence of link failures: The general case by Y. Afek and D. Hendler, In Distributed Computing Journal, Vol. 8 Pages 115-120, 1995.
    17. Sparser: A paradigm for running distributed algorithms by Y. Afek and M. Ricklin, In Journal of Algorithms, volume 14, Pg. 316-328, 1993.
    18. Distributed Agorithms for Unidirectional Networks, by Y. Afek and E. Gafni In Siam Journal on Computing, 23:6 (1994), 1152-1178.
    19. Time and Message bounds for Election in Synchronous and Asynchronous Complete Networks by Y. Afek and E. Gafni In Siam Journal on Computing, 20:2 (1991), 376-394.
    20. Local Management of a Global Resource in a Communication Network, Y. Afek, B. Awerbuch, S. Plotkin, M. Saks, In JACM 43:1 (1996), 1-19.
    21. Randomized Test and Set by Y. Afek, E. Gafni, Tromp, and P. Vitnayi, In Springer-Verlag Proceedings, 6th International Workshop on Distributed Algorithms, Haifa, Israel November 1992.
    22. Computing with Faulty Shared Memory by Y. Afek, D. Greenberg, M. Merritt, and G. Taubenfeld, In Proceedings, of the Eleventh ACM Symposium on Principles of Distributed Computing (PODC), Pages 47-58, Vancouver, Canada, August 1992. (Final version accepted to Journal of the ACM June 1995).
    23. The Slide Mechanism with Applications in Dynamic Networks by Y. Afek, E. Gafni, and A. Rosen, In Proceedings, ACM Symposium on Principles of Distributed Computing, (PODC), Pages 35-46, Vancouver, Canada, August 1992.
    24. A Bounded First-In, First-Enabled Solution to the L-Exclusion Problem by Y. Afek, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, In ACM Trans. on Programming Languages ans Systems, (TOPLAS) 16:3 939-953, 1994. Also In Springer-Verlag Proceedings, 4th International Workshop on Distributed Algorithms, Pages 422-431, Serra Alimini, Italy September 1990.
    25. Atomic Snapshots by Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, In JACM 40:4, 873-890, 1993 (Also PODC90).
    26. Bootstrap Network Resynchronization: An efficient Technique for End-to-end Communication Y. Afek, and E. Gafni In Proceedings, ACM Symposium on Principles of Distributed Computing (PODC 91), Pages 295-307, Montreal, Canada, August 1991.
    27. Upper and Lower Bounds for Routing Schemes in Dynamic Networks Y. Afek, E. Gafni, and M. Ricklin, In Proc. of 30'th IEEE Annual Symposium on Foundations of Computer Science (FOCS-89), 370-375, October 1989.
    28. Elections in Anonymous Networks Y. Afek and Y. Matias In Information and Computation Journal 113:2, pages 312-330, 1994.
    29. Lazy Caching Y. Afek, G. M. Brown, and M. Merritt, In ACM Transactions on Programming Languages and Systems (ACM-TOPLAS), volume 15, No 1, Pages 182-205, January 1993. Alos In Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, New Mexico, June 18-21, 1989.

    Self-Stabilization

    1. Self-Stabilizing Unidirectional Network Algorithms by Power-Supply , by Yehuda Afek, and Anat Bremler Chicago Journal of Theoretical Computer Science . preliminary version of this paper was presented in Symposium on Discrete Algorithms (SODA) January 1997.
    2. Local Stabilizer , by Y. Afek, S. Dolev , Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems (ISTCS97), Bar-Ilan, Israel (June 1997) 74-84.
    3. The Local Detection Paradigm and its Applications to Self-Stabilization by Y. Afek, S. Kutten, and M. Yung, In Springer-Verlag Proceedings, 4th International Workshop on Distributed Algorithms, Pages 15-28, Serra Alimini, Italy September 1990
    4. Self-Stabilization Over Unreliable Communication Media by Yehuda Afek and Geoffrey M. Brown, Distributed Computing Journal, Vol. 7 Pages 27-34, 1993.