| Towards an API for the real numbers | 0 | 0.34 | 2020 |
| New Challenges in Parallelism (Dagstuhl Seminar 17451). | 0 | 0.34 | 2017 |
| Outlawing ghosts: avoiding out-of-thin-air results | 35 | 1.00 | 2014 |
| Can seqlocks get along with programming language memory models? | 14 | 0.66 | 2012 |
| Position paper: nondeterminism is unavoidable, but data races are pure evil | 19 | 0.58 | 2012 |
| You don't know jack about shared variables or memory models | 17 | 0.70 | 2012 |
| IFRit: interference-free regions for dynamic data-race detection | 45 | 0.92 | 2012 |
| On a Technique for Transparently Empowering Classical Compiler Optimizations on Multithreaded Code | 1 | 0.34 | 2012 |
| Performance implications of fence-based memory models | 1 | 0.39 | 2011 |
| Extended sequential reasoning for data-race-free programs | 12 | 0.55 | 2011 |
| How to miscompile programs with "benign" data races | 10 | 0.76 | 2011 |
| The runtime abort graph and its application to software transactional memory optimization | 6 | 0.46 | 2011 |
| Conflict exceptions: simplifying concurrent language semantics with precise hardware exceptions for data-races | 55 | 1.96 | 2010 |
| A solid foundation for x86 shared memory: technical perspective | 1 | 0.36 | 2010 |
| Garbage collection in the next C++ standard | 3 | 0.46 | 2009 |
| Foundations of the C++ concurrency memory model | 210 | 7.06 | 2008 |
| Reordering constraints for pthread-style locks | 6 | 1.01 | 2007 |
| Threads cannot be implemented as a library | 61 | 6.19 | 2005 |
| The constructive reals as a Java library | 3 | 0.42 | 2005 |
| The space cost of lazy reference counting | 9 | 0.54 | 2004 |
| An almost non-blocking stack | 5 | 0.82 | 2004 |
| Destructors, finalizers, and synchronization | 13 | 0.82 | 2003 |
| Bounding space usage of conservative garbage collectors | 20 | 1.09 | 2002 |
| Reducing garbage collector cache misses | 23 | 1.71 | 2000 |
| Understanding memory allocation of scheme programs | 8 | 1.26 | 2000 |
| Ropes: an alternative to strings | 24 | 1.97 | 1995 |
| Implementing multiple locks using Lamport's mutual exclusion algorithm | 0 | 0.34 | 1993 |
| Optimizing programs over the constructive reals | 5 | 0.74 | 1990 |
| Partial polymorphic type inference is undecidable | 23 | 3.98 | 1985 |
| A logic for expressions with side-effects | 3 | 1.09 | 1982 |
