Arie Fouren - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2024

Lower Bounds on the Amortized Time Complexity of Shared ObjectsHagit Attiya, Arie Fouren, Jeremy Ko. mst, 68(5):1372-1426, October 2024. [doi]

2017

Lower Bounds on the Amortized Time Complexity of Shared ObjectsHagit Attiya, Arie Fouren. opodis 2018: [doi]

Poly-logarithmic adaptive algorithms require revealing primitivesHagit Attiya, Arie Fouren. jpdc, 109:102-116, 2017. [doi]

2015

Poly-Logarithmic Adaptive Algorithms Require Unconditional PrimitivesHagit Attiya, Arie Fouren. opodis 2016: [doi]

2003

Algorithms adapting to point contentionHagit Attiya, Arie Fouren. JACM, 50(4):444-468, 2003. [doi]

2002

An adaptive collect algorithm with applicationsHagit Attiya, Arie Fouren, Eli Gafni. dc, 15(2):87-96, 2002. [doi]

2001

Adaptive and Efficient Algorithms for Lattice Agreement and RenamingHagit Attiya, Arie Fouren. SICOMP, 31(2):642-664, 2001. [doi]

Adaptive wait-free algorithms for asynchronous shared-memory systemsArie Fouren. PhD thesis, Technion - Israel Institute of Technology, Israel, 2001. [doi]

2000

Polynominal and Adaptive Long-Lived (2::::k::::-1)-RenamingHagit Attiya, Arie Fouren. wdag 2000: 149-163 [doi]

1999

Long-Lived Renaming Made AdaptiveYehuda Afek, Hagit Attiya, Arie Fouren, Gideon Stupp, Dan Touitou. podc 1999: 91-103 [doi]

1998

Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract)Hagit Attiya, Arie Fouren. podc 1998: 277-286 [doi]

Sign in or sign up to see more results.

runs on WebDSL