1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.CR2023
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited
Ran Cohen, Pouyan Forghani, Juan Garay +2
It is well known that without randomization, Byzantine agreement (BA) requires a linear number of rounds in the synchronous setting, while it is flat out impossible in the asynchro…
math.CO2018
Power domination throttling
Boris Brimkov, Joshua Carlson, Illya V. Hicks +2
A power dominating set of a graph is a set that colors every vertex of according to the following rules: in the first timestep, every vertex in be…
math.CO2018★ 1 cited
Power domination polynomials of graphs
Boris Brimkov, Rutvik Patel, Varun Suriyanarayana +1
A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from…