906 search results - page 128 / 182 » Linking Theories of Concurrency |
ALGORITHMICA
2010
14 years 10 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
ICONFERENCE
2011
14 years 4 months ago
2011
The aim of this study is to understand the role of bloggers in driving viral information. More specifically, we develop a new methodology that creates a map of the „life cycle...
TON
2010
14 years 4 months ago
2010
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
123
click to vote
PODC
2012
ACM
13 years 5 days ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...