| Distributed computing: fundamentals, simulations, and advanced topics H Attiya, J Welch John Wiley & Sons, 2004 | 2245 | 2004 |
| Atomic snapshots of shared memory Y Afek, H Attiya, D Dolev, E Gafni, M Merritt, N Shavit Journal of the ACM (JACM) 40 (4), 873-890, 1993 | 787 | 1993 |
| Sharing memory robustly in message-passing systems H Attiya, A Bar-Noy, D Dolev Journal of the ACM 42 (1), 124-142, 1995 | 774 | 1995 |
| Renaming in an asynchronous environment H Attiya, A Bar-Noy, D Dolev, D Peleg, R Reischuk Journal of the ACM (JACM) 37 (3), 524-548, 1990 | 497* | 1990 |
| Sequential consistency versus linearizability H Attiya, JL Welch ACM Transactions on Computer Systems (TOCS) 12 (2), 91-122, 1994 | 422 | 1994 |
| Computing on an anonymous ring H Attiya, M Snir, MK Warmuth Journal of the ACM (JACM) 35 (4), 845-875, 1988 | 333 | 1988 |
| Atomic snapshots in O (n log n) operations H Attiya, O Rachman SIAM Journal on Computing 27 (2), 319-340, 1998 | 211* | 1998 |
| Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated H Attiya, R Guerraoui, D Hendler, P Kuznetsov, MM Michael, M Vechev ACM SIGPLAN Notices 46 (1), 487-498, 2011 | 188 | 2011 |
| Are wait-free algorithms fast? H Attiya, N Lynch, N Shavit Journal of the ACM (JACM) 41 (4), 725-763, 1994 | 174 | 1994 |
| Bounds on the time to reach agreement in the presence of timing uncertainty H Attiya, C Dwork, N Lynch, L Stockmeyer Journal of the ACM (JACM) 41 (1), 122-152, 1994 | 166 | 1994 |
| Atomic snapshots using lattice agreement H Attiya, M Herlihy, O Rachman Distributed Computing 8 (3), 121-132, 1995 | 151* | 1995 |
| A correctness condition for high-performance multiprocessors H Attiya, R Friedman SIAM Journal on Computing 27 (6), 1637-1670, 1998 | 145* | 1998 |
| Adaptive and efficient algorithms for lattice agreement and renaming H Attiya, A Fouren SIAM Journal on Computing 31 (2), 642-664, 2001 | 135* | 2001 |
| Using mappings to prove timing properties N Lynch, H Attiya Proceedings of the ninth annual ACM symposium on Principles of distributed …, 1990 | 135 | 1990 |
| Reliable communication over unreliable channels Y Afek, H Attiya, A Fekete, M Fischer, N Lynch, Y Mansour, DW Wang, ... Journal of the ACM (JACM) 41 (6), 1267-1297, 1994 | 129 | 1994 |
| The combinatorial structure of wait-free solvable tasks H Attiya, S Rajsbaum SIAM Journal on Computing 31 (4), 1286-1313, 2002 | 123* | 2002 |
| The complexity of obstruction-free implementations H Attiya, R Guerraoui, D Hendler, P Kuznetsov Journal of the ACM (JACM) 56 (4), 1-33, 2009 | 122* | 2009 |
| Limitations of highly-available eventually-consistent data stores H Attiya, F Ellen, A Morrison IEEE transactions on parallel and distributed systems 28 (1), 141-155, 2017 | 120 | 2017 |
| Concurrent updates with rcu: Search tree as an example M Arbel, H Attiya Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 113 | 2014 |
| 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 | 112 | 1999 |
Jennifer Lundelius WelchProfessor, Department of Computer Science and Engineering, Texas A&M UniversityVerified email at cse.tamu.edu
