21 citations · 82 across the 21 of their papers we have counts for
1 paper · 2 filters
Danny Dolev, Keijo Heljanko, Matti Järvisalo +5
Consider a complete communication network on n nodes, each of which is a state machine. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree o…