Long-lived renaming made adaptive Y Afek, H Attiya, A Fouren, G Stupp, D Touitou Proceedings of the eighteenth annual ACM symposium on Principles of …, 1999 | 111 | 1999 |

Adaptive and efficient algorithms for lattice agreement and renaming H Attiya, A Fouren SIAM Journal on Computing 31 (2), 642-664, 2001 | 89 | 2001 |

An adaptive collect algorithm with applications H Attiya, A Fouren, E Gafni Distributed Computing 15, 87-96, 2002 | 85 | 2002 |

Algorithms adapting to point contention H Attiya, A Fouren Journal of the ACM (JACM) 50 (4), 444-468, 2003 | 78 | 2003 |

Polynomial and Adaptive Long-lived (2*k*- 1)-Renaming:H Attiya, A Fouren International Symposium on Distributed Computing, 149-163, 2000 | 50 | 2000 |

Adaptive wait-free algorithms for lattice agreement and renaming H Attiya, A Fouren Proceedings of the seventeenth annual ACM symposium on Principles of …, 1998 | 47 | 1998 |

Adaptive long-lived renaming with read and write operations H Attiya, A Fouren Computer Science Department, Technion, 1999 | 20 | 1999 |

Adaptive long-lived renaming using bounded memory Y Afek, H Attiya, A Fouren, G Stupp, D Touitou Proc. of the 40th IEEE Ann. Symp. on Foundations of Computer Science, 262-272, 1999 | 16 | 1999 |

Exponential examples for two renaming algorithms A Fouren Technion Tech Report, 1999 | 7 | 1999 |

Algorithms adapting to contention point H Attiya, A Fouren Journal of the ACM 50 (4), 444-468, 2003 | 5 | 2003 |

Adaptive long-lived renaming using bounded memory. Submitted to DISC99 Y Afek, H Attiya, A Fouren, G Stupp, D Touitou | 5 | 1999 |

Lower bounds on the amortized time complexity of shared objects H Attiya, A Fouren, J Ko Theory of Computing Systems, 1-55, 2024 | 4 | 2024 |

Adaptive Wait-Free Algorithms for Asynchronous Shared-Memory Systems A Fouren Technion-Israel Institute of Technology, Faculty of Computer Science, 2001 | 3 | 2001 |

A polynomial adaptive algorithm for long-lived (2k− 1)-renaming H Attiya, A Fouren, E Gafni Technical report, 2003. Unpublished manuscript, private communication, 0 | 2 | |

Poly-logarithmic adaptive algorithms require revealing primitives H Attiya, A Fouren Journal of Parallel and Distributed Computing 109, 102-116, 2017 | 1 | 2017 |

21st International Conference on Principles of Distributed Systems (OPODIS 2017) L Rodrigues, C Burchert, R Wattenhofer, F Kuhn, P Schneider, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |

Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives H Attiya, A Fouren 19th International Conference on Principles of Distributed Systems (OPODIS 2015), 2016 | | 2016 |

A Polynomial Adaptive Algorithm for Long-Lived (2 H Attiya, A Fouren, E Gafni | | 2003 |

Fast Wait-free Algorithms for Lattice Agreement and Renaming H Attiya, A Fouren | | 1999 |

Polynomial and Adaptive Long-lived (2 H Attiya, A Fouren | | |