906 search results - page 128 / 182 » Linking Theories of Concurrency |
164
click to vote
ALGORITHMICA
2010
15 years 6 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 ...
190
click to vote
ICONFERENCE
2011
15 years 1 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...
179
click to vote
TON
2010
15 years 25 days 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...
219
click to vote
PODC
2012
ACM
13 years 8 months 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...
173
click to vote
PLDI
2009
ACM
16 years 28 days 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 ...