| 2020 | PODC | Brief Announcement: Hazard Pointer Protection of Structures with Immutable Links. | Maged M. Michael |
| 2019 | ICPP | A Practical, Scalable, Relaxed Priority Queue. | Tingzhe Zhou, Maged M. Michael, Michael F. Spear |
| 2015 | ISCA | Quantitative comparison of hardware transactional memory for Blue Gene/Q, zEnterprise EC12, Intel Core, and POWER8. | Takuya Nakaike, Rei Odaira, Matthew Gaudet, Maged M. Michael, Hisanobu Tomari |
| 2013 | ISCA | Robust architectural support for transactional memory in the power architecture. | Harold W. Cain, Maged M. Michael, Brad Frey, Cathy May, Derek Williams, Hung Q. Le |
| 2011 | POPL | Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. | Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael, Martin T. Vechev |
| 2010 | CAV | Memory Management in Concurrent Algorithms. | Maged M. Michael |
| 2010 | PLDI | Lock elision for read-only critical sections in Java. | Takuya Nakaike, Maged M. Michael |
| 2009 | CGO | Reducing Memory Ordering Overheads in Software Transactional Memory. | Michael F. Spear, Maged M. Michael, Michael L. Scott, Peng Wu |
| 2009 | PPoPP | Idempotent work stealing. | Maged M. Michael, Martin T. Vechev, Vijay A. Saraswat |
| 2008 | ICPP | Implementing and Exploiting Inevitability in Software Transactional Memory. | Michael F. Spear, Michael Silverman, Luke Dalessandro, Maged M. Michael, Michael L. Scott |
| 2008 | SPAA | RingSTM: scalable transactions with a single atomic instruction. | Michael F. Spear, Maged M. Michael, Christoph von Praun |
| 2007 | EuroPar | Experiences Understanding Performance in a Commercial Scale-Out Environment. | Robert W. Wisniewski, Reza Azimi, Mathieu Desnoyers, Maged M. Michael, Jos E. Moreira, Doron Shiloach, Livio Soares |
| 2007 | ICS | Scalability of the Nutch search engine. | Jos E. Moreira, Maged M. Michael, Dilma Da Silva, Doron Shiloach, Parijat Dube, Li Zhang |
| 2007 | PPoPP | A theory of memory models. | Vijay A. Saraswat, Radha Jagadeesan, Maged M. Michael, Christoph von Praun |
| 2007 | SOSP | Why the grass may not be greener on the other side: a comparison of locking vs. transactional memory. | Paul E. McKenney, Maged M. Michael, Jonathan Walpole |
| 2004 | PLDI | Scalable lock-free dynamic memory allocation. | Maged M. Michael |
| 2004 | PODC | Brief announcement: completing the lock-free dynamic cycle. | Maged M. Michael |
| 2003 | EuroPar | CAS-Based Lock-Free Algorithm for Shared Deques. | Maged M. Michael |
| 2002 | PODC | Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. | Maged M. Michael |
| 2002 | SPAA | High performance dynamic lock-free hash tables and list-based sets. | Maged M. Michael |
| 2000 | HPCA | High-Throughput Coherence Controllers. | Ashwini K. Nanda, Anthony-Trung Nguyen, Maged M. Michael, Douglas J. Joseph |
| 1999 | HPCA | Design and Performance of Directory Caches for Scalable Shared Memory Multiprocessors. | Maged M. Michael, Ashwini K. Nanda |
| 1997 | ISCA | Coherence Controller Architectures for SMP-Based CC-NUMA Multiprocessors. | Maged M. Michael, Ashwini K. Nanda, Beng-Hong Lim, Michael L. Scott |
| 1996 | ICCD | The Augmint multiprocessor simulation toolkit for Intel x86 architectures. | Anthony-Trung Nguyen, Maged M. Michael, Arun Sharma, Josep Torrellas |
| 1996 | PODC | Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. | Maged M. Michael, Michael L. Scott |
| 1995 | HPCA | Implementation of Atomic Primitives on Distributed Shared Memory Multiprocessors. | Maged M. Michael, Michael L. Scott |