The notion of a timed register and its application to indulgent synchronization
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Centralized asynchronous broadcast in radio networks
Theoretical Computer Science
Tight RMR lower bounds for mutual exclusion and other problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Hierarchical Classifiers for Complex Spatio-temporal Concepts
Transactions on Rough Sets IX
Randomized mutual exclusion in O(log N / log log N) RMRs
Proceedings of the 28th ACM symposium on Principles of distributed computing
On the Computational Power of Shared Objects
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Multi-sided shared coins and randomized set-agreement
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Help when needed, but no more: efficient read/write partial snapshot
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Contention-sensitive data structures and algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On asymmetric progress conditions
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The x-wait-freedom progress condition
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
The computational structure of progress conditions
DISC'10 Proceedings of the 24th international conference on Distributed computing
A study of shared-memory mutual exclusion protocols using CADP
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
On the performance of distributed lock-based synchronization
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Queue based mutual exclusion with linearly bounded overtaking
Science of Computer Programming
A highly-efficient wait-free universal construction
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
If a picture is worth a thousand words, what would an animation be worth?
Proceedings of the 16th Western Canadian Conference on Computing Education
On the performance of distributed lock-based synchronization?
ACM SIGOPS Operating Systems Review
Looking for efficient implementations of concurrent objects
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Help when needed, but no more: Efficient read/write partial snapshot
Journal of Parallel and Distributed Computing
Tight space bounds for l-exclusion
DISC'11 Proceedings of the 25th international conference on Distributed computing
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
On the implementation of concurrent objects
Dependable and Historic Computing
Efficient transformations of obstruction-free algorithms into non-blocking algorithms
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Intensional and extensional characterisation of global progress in the π-calculus
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Computability in distributed computing: a Tutorial
ACM SIGACT News
Taming confusion for modeling and implementing probabilistic concurrent systems
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Science of Computer Programming
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Journal of Parallel and Distributed Computing
Theoretical Computer Science
Computing with infinitely many processes
Information and Computation
Hi-index | 0.00 |