A simple solution to Lamport's concurrent programming problem with linear wait
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Virtual rings: an introduction to concurrency
ACM SIGCSE Bulletin
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Self-assessment procedure XXI: a self-assessment procedure on concurrency
Communications of the ACM
Proof of a mutual exclusion algorithm—a classic example
ACM SIGOPS Operating Systems Review
Paradigms for process interaction in distributed programs
ACM Computing Surveys (CSUR)
Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
A correctness condition for high-performance multiprocessors (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Elements for a course on the design of distributed algorithms
ACM SIGCSE Bulletin
Implementation of classical mutual exclusion algorithms in Ada
ACM SIGAda Ada Letters
TRI-Ada '92 Proceedings of the conference on TRI-Ada '92
A multitasking executive for operating systems courses
ACM SIGOPS Operating Systems Review
On mutual exclusion in faulty distributed systems
ACM SIGOPS Operating Systems Review
Programming DEC-Alpha based multiprocessors the easy way (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Performance Characterization of the Tree Quorum Algorithm
IEEE Transactions on Parallel and Distributed Systems
The communication requirements of mutual exclusion
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Process synchronization and IPC
ACM Computing Surveys (CSUR)
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Strong Interaction Fairness Via Randomization
IEEE Transactions on Parallel and Distributed Systems
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Thin locks: featherweight synchronization for Java
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
The mutual exclusion problem has been solved
Communications of the ACM
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Verification of Safety Properties Using IntegerProgramming: Beyond the State Equation
Formal Methods in System Design
The Journal of Supercomputing
A distributed solution to the reader - writer problem
ACM SIGOPS Operating Systems Review
Theoretical Computer Science
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science
Y-Invalidate: A New Protocol for Implementing Weak Consistency in DSM Systems
International Journal of Parallel Programming
IEEE Transactions on Computers
A Resilient Mutual Exclusion Algorithm for Computer Networks
IEEE Transactions on Parallel and Distributed Systems
Message Complexity of the Tree Quorum Algorithm
IEEE Transactions on Parallel and Distributed Systems
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
Memory Consistency and Process Coordination for SPARC Multiprocessors
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution
Proceedings of the 13th International Symposium on Distributed Computing
Fair and Efficient Mutual Exclusion Algorithms (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
The Congenial Talking Philosophers Problem in Computer Networks (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Bounds for Mutual Exclusion with only Processor Consistency
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Fault-Tolerant Sequencer for Timed Asynchronous Systems
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Bounding Lamport's Bakery Algorithm
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Efficiency of Token-Passing MUTEX-Solutions - Some Experiments
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
The congenial talking philosophers problem in computer networks
Distributed Computing
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Debugging in a Distributed World: Observation and Control
ASSET '98 Proceedings of the 1998 IEEE Workshop on Application - Specific Software Engineering and Technology
Evaluating quorum systems over the Internet
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Adaptive and efficient abortable mutual exclusion
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Developing and Refining an Adaptive Token-Passing Strategy
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Some myths about famous mutual exclusion algorithms
ACM SIGACT News
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Predicate control: synchronization in distributed computations with look-ahead
Journal of Parallel and Distributed Computing
Thin locks: featherweight Synchronization for Java
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Asynchronous group mutual exclusion
Distributed Computing
Model-checking processes with data
Science of Computer Programming
A mutual exclusion algorithm with optimally bounded bypasses
Information Processing Letters
An Ω (n log n) lower bound on the cost of mutual exclusion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Tight Bounds for Critical Sections in Processor Consistent Platforms
IEEE Transactions on Parallel and Distributed Systems
Unfolding Based Algorithms for the Reachability Problem
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
The notion of a timed register and its application to indulgent synchronization
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Memory model sensitive bytecode verification
Formal Methods in System Design
Implementing sequentially consistent programs on processor consistent platforms
Journal of Parallel and Distributed Computing
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
The semantics of progress in lock-based transactional memory
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Teaching Modelling and Validation of Concurrent Systems Using Coloured Petri Nets
Transactions on Petri Nets and Other Models of Concurrency I
Time and Fairness in a Process Algebra with Non-blocking Reading
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Transactional Memory: Glimmer of a Theory
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A mutual exclusion algorithm with optimally bounded bypasses
Information Processing Letters
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Contention-sensitive data structures and algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On the existence of weakest failure detectors for mutual exclusion and k-exclusion
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Constant RMR solutions to reader writer synchronization
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
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
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
Multiwriter Consistency Conditions for Shared Memory Registers
SIAM Journal on Computing
Distributed priority inheritance for real-time and embedded systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Byzantine and multi-writer k-quorums
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Proving liveness with fairness using rewriting
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
A memory model sensitive checker for c#
FM'06 Proceedings of the 14th international conference on Formal Methods
On the cost of concurrency in transactional memory
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
On the implementation of concurrent objects
Dependable and Historic Computing
Tight time-space tradeoff for mutual exclusion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Inter-entry selection: Non-determinism and explicit control mechanisms
Computer Languages
Unfolding Based Algorithms for the Reachability Problem
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Verification of petri nets with read arcs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Oblivious assignment with m slots
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.05 |