Secure message transmission and Byzantine agreement have been studied extensively in incomplete networks. However, information theoretically secure multiparty computation (MPC) in incomplete networks is less well understood.
An atomic splittable routing game (ASRG) is a network congestion problem where each player has some finite amount of flow he wants to send in the network, while minimizing his cost due to congestion.
In formal languguage theory, regularity is a robust notion having many equivalent representations: regular expressions, ï¬nite state automata, MSO etc. These have made important impact on programming and veriï¬cation tools.
