Not All Fair Probabilistic Schedulers Are Equivalent
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Brief announcement: decidable graph languages by mediated population protocols
DISC'09 Proceedings of the 23rd international conference on Distributed computing
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Algorithmic verification of population protocols
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Theoretical Computer Science
Passively mobile communicating machines that use restricted space
Theoretical Computer Science
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
Hi-index | 0.00 |
Let V = {x1,...,xn} be a set of variables that range over a set of values D = {d1,...,dq}. A constraint is an expression of the type $R(x_{i_1},\ldots,x_{i_r})$, ...