Analysis of a randomized rendezvous algorithm
Information and Computation
Leader election in plane cellular automata, only with left-right global convention
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Bilateral Ranking Negotiations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Multilateral Ranking Negotiations
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Universal Semi-local Election Protocol Using Forward Links
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Compositional Systems over Reducible Networks
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Semi-local Model of Computations on Graphs to Break the Local Symmetry
Electronic Notes in Theoretical Computer Science (ENTCS)
Uniform election in trees and polyominoids
Discrete Applied Mathematics
Compositional Systems over Reducible Networks
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Universal Semi-local Election Protocol Using Forward Links
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Bilateral Ranking Negotiations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Multilateral Ranking Negotiations
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Hi-index | 0.89 |