- Online First™
Window-based greedy contention management for transactional memory: theory and practice
Gokarna Sharma and Costas Busch
Online First™, 1 February 2012
- Online First™
Efficient distributed approximation algorithms via probabilistic tree embeddings
Maleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan and Kunal Talwar
Online First™, 27 January 2012
- Online First™
Fault-containing self-stabilization in asynchronous systems with constant fault-gap
Sven Köhler and Volker Turau
Online First™, 26 December 2011
- Online First™
Concurrency theory: timed automata, testing, program synthesis
Davide Sangiorgi
Online First™, 20 December 2011
- Online First™
Fast message dissemination in random geometric networks
Artur Czumaj, Robert Elsässer, Leszek Gąsieniec, Thomas Sauerwald and Xin Wang
Online First™, 20 December 2011
- Online First™
RMR-efficient implementations of comparison primitives using read and write operations
Wojciech Golab, Vassos Hadzilacos, Danny Hendler and Philipp Woelfel
Online First™, 15 December 2011
- Online First™
Overcoming controllability problems in distributed testing from an input output transition system
Robert M. Hierons
Online First™, 10 December 2011
- Online First™
Implementation relations and test generation for systems with distributed interfaces
Robert M. Hierons, Mercedes G. Merayo and Manuel Núñez
Online First™, 23 November 2011
- Online First™
A study on shuffle, stopwatches and independently evolving clocks
Cătălin Dima and Ruggero Lanotte
Online First™, 19 November 2011
- Online First™
How to meet when you forget: log-space rendezvous in arbitrary graphs
Jurek Czyzowicz, Adrian Kosowski and Andrzej Pelc
Online First™, 31 October 2011