Characterizing Transactional Memory Consistency Conditions Using Observational Refinement.
Invited Article Foreword.
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible.
The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication.
Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints.
Embeddability in the 3-Sphere Is Decidable.