Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
Partha S. Roop, Sidharta Andalam, Reinhard von Han...
We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at ...
Jure Leskovec, Lars Backstrom, Ravi Kumar, Andrew ...
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...