Output Guards and Nondeterminism in “Communicating Sequential Processes”
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unbounded speed variability in distributed communication systems
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A difference in efficiency between synchronous and asynchronous systems
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Distributed algorithms for synchronizing interprocess communication within real time
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Fast allocation of nearby resources in a distributed system
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Real time resource allocation in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Adding time to synchronous process communications
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Simple, efficient, asynchronous parallel algorithms for maximization
ACM Transactions on Programming Languages and Systems (TOPLAS)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Strong Interaction Fairness Via Randomization
IEEE Transactions on Parallel and Distributed Systems
Simple, efficient asynchronous parallel algorithms for maximization
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
IEEE Transactions on Parallel and Distributed Systems
Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity
IEEE Transactions on Parallel and Distributed Systems
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
| Hi-index | 0.01 |