| Synchronization algorithms and concurrent programming G Taubenfeld Pearson Education, 2006 | 277 | 2006 |
| Computing with infinitely many processes: Under assumptions on concurrency and participation M Merritt, G Taubenfeld International Symposium on Distributed Computing, 164-178, 2000 | 114 | 2000 |
| Script: A communication abstraction mechanism and its verification N Francez, B Hailpern, G Taubenfeld Science of Computer Programming 6, 35-88, 1986 | 108* | 1986 |
| Disentangling multi-object operations Y Afek, M Merritt, G Taubenfeld, D Touitou Proceedings of the sixteenth annual ACM symposium on Principles of …, 1997 | 97 | 1997 |
| The concurrency hierarchy, and algorithms for unbounded concurrency E Gafni, M Merritt, G Taubenfeld Proceedings of the twentieth annual ACM symposium on Principles of …, 2001 | 76 | 2001 |
| The black-white bakery algorithm and related bounded-space, adaptive, local-spinning and FIFO algorithms G Taubenfeld International Symposium on Distributed Computing, 56-70, 2004 | 67 | 2004 |
| Computing with faulty shared memory Y Afek, DS Greenberg, M Merritt, G Taubenfeld Proceedings of the eleventh annual ACM symposium on Principles of …, 1992 | 53 | 1992 |
| Contention-sensitive data structures and algorithms G Taubenfeld International Symposium on Distributed Computing, 157-171, 2009 | 52* | 2009 |
| Computing with faulty shared objects Y Afek, DS Greenberg, M Merritt, G Taubenfeld Journal of the ACM (JACM) 42 (6), 1231-1274, 1995 | 52 | 1995 |
| Automatic Discovery of Mutual Exclusion Algorithms: (Preliminary Version) Y Bar-David, G Taubenfeld International Symposium on Distributed Computing, 136-150, 2003 | 50 | 2003 |
| Speeding Lamport's fast mutual exclusion algorithm M Merritt, G Taubenfeld Information Processing Letters 45 (3), 137-142, 1993 | 49 | 1993 |
| Time-adaptive algorithms for synchronization R Alur, H Attiya, G Taubenfeld Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing …, 1994 | 46 | 1994 |
| Possibility and impossibility results in a shared memory environment G Taubenfeld, S Moran Acta Informatica 33 (1), 1-20, 1996 | 35 | 1996 |
| On asymmetric progress conditions D Imbs, M Raynal, G Taubenfeld Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010 | 34 | 2010 |
| The computability of relaxed data structures: queues and stacks as examples N Shavit, G Taubenfeld Distributed Computing 29 (5), 395-407, 2016 | 32 | 2016 |
| Coordination without prior agreement G Taubenfeld Proceedings of the ACM Symposium on Principles of Distributed Computing, 325-334, 2017 | 31 | 2017 |
| Objects shared by Byzantine processes D Malkhi, M Merritt, MK Reiter, G Taubenfeld Distributed Computing 16 (1), 37-48, 2003 | 31 | 2003 |
| The computational structure of progress conditions G Taubenfeld International Symposium on Distributed Computing, 221-235, 2010 | 29 | 2010 |
| The wakeup problem MJ Fischer, S Moran, S Rudich, G Taubenfeld SIAM Journal on Computing 25 (6), 1332-1357, 1996 | 29 | 1996 |
| Initial failures in distributed computations G Taubenfeld, S Katz, S Moran International Journal of Parallel Programming 18 (4), 255-276, 1989 | 27 | 1989 |
Michael MerrittAT&T Labs - ResearchVerified email at research.att.com
