ד"ר אריה פורן

H. Attiya and A. Fouren : “Lower Bounds on the Amortized Time Complexity of Shared Objects”. Leibniz International Proceedings in Informatics (LIPIcs) Vol. 95. 2018.

H. Attiya and A. Fouren: "Poly-Logarithmic Adaptive Algorithms Require Revealing Primitives". Journal of Parallel and Distributed Computing, June 2017.

H. Attiya and A. Fouren: "Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives". LIPIcs-Leibniz International Proceedings in Informatics Vol. 46. 2016

H. Attiya and A. Fouren, "Algorithms Adapting to Point Contention",
Journal of the ACM, Vol. 50, No. 4 (July 2003), pp. 444-468.

. Attiya, A. Fouren and E. Gafni,”An Adaptive Collect Algorithm with Applications'', Distributed Computing, Vol. 15, No. 2 (2002), pp. 87-96.

H. Attiya and A. Fouren: “Adaptive and Efficient Wait-Free Algorithms for Lattice Agreement and Renaming'', SIAM Journal on Computing, Vol. 31, No. 2 (2001), pp. 642-664.

H. Attiya and A. Fouren: “Polynomial and Adaptive Long-Lived (2k-1) Renaming'', Proceedings of the 14th International Conference on Distributed Computing, 2000

Y. Afek, H. Attiya, A. Fouren, G. Stupp and D. Touitou: “Long-Lived Renaming Made Adaptive,'' Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, 1999

Y. Afek, H. Attiya, A. Fouren, G. Stupp and Dan Touitou: "Adaptive Long-Lived Renaming Using Bounded Memory (Extended Abstract). Proceedings of the 40th IEEE Ann. Symp. on Foundations of Computer Science. 1999.

H. Attiya and A. Fouren: “Adaptive and Efficient Wait-Free Algorithms for Lattice Agreement and Renaming,'' Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, 1998.