Sciweavers

2 search results - page 1 / 1
» The complexity of deciding reachability properties of distri...
Sort
View
TCS
2008
14 years 10 months ago
The complexity of deciding reachability properties of distributed negotiation schemes
Distributed negotiation schemes offer one approach to agreeing an allocation of resources among a set of individual agents. Such schemes attempt to agree a distribution via a sequ...
Paul E. Dunne, Yann Chevaleyre
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
15 years 10 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl