Maged M. Michael
Computer Networks and Communications · 2002–2008
A researcher in the Science corpus: 3 papers; trusts 1 researcher and is trusted by 7 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 10 citations into it; #2,737 of 9,886 by trust here, #5,733 by citations
Whom Maged M. Michael trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Maged M. Michael overall
- Keir Fraser
- T. Harris
- Peter W. O'Hearn
- Maurice Herlihy
- Guillaume Marçais
- Josh Berdine
- Ming Liu
- Lifeng Nai
Papers from Maged M. Michael's perspective
Ordered by how strongly the researchers Maged M. Michael trusts endorse each paper. Same corpus, a different order for every researcher.
- High performance dynamic lock-free hash tables and list-based sets (ACM Symposium on Parallelism in Algorithms and Architectures)
- READ-COPY UPDATE: USING EXECUTION HISTORY TO SOLVE CONCURRENCY PROBLEMS
- Introduction to algorithms
- A Pragmatic Implementation of Non-blocking Linked-Lists (International Symposium on Distributed Computing)
- The Art of Computer Programming: Volume 3: Sorting and Searching
- Transactional memory coherence and consistency (Proceedings. 31st Annual International Symposium on Computer Architecture, 2004.)
- Language support for lightweight transactions (Conference on Object-Oriented Programming Systems, Languages, and Applications)
- LogTM: log-based transactional memory (The Twelfth International Symposium on High-Performance Computer Architecture, 2006.)
- Transactional Locking II (International Symposium on Distributed Computing)
- Software transactional memory for dynamic-sized data structures (ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing)
Their papers
- Software Transactional Memory: Why Is It Only a Research Toy? (2008) — 297 citations
- Hazard pointers: safe memory reclamation for lock-free objects (2004) — 539 citations
- High performance dynamic lock-free hash tables and list-based sets (2002) — 469 citations