357 search results - page 3 / 72 » Is Computational Complexity a Barrier to Manipulation |
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
PPOPP
2005
ACM
13 years 11 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
PDC
2004
ACM
13 years 10 months ago
2004
ACM
Design is a ubiquitous activity. The complexity of design problems requires communities rather than individuals to address, frame, and solve them. These design communities have to...
ICPPW
2005
IEEE
13 years 11 months ago
2005
IEEE
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
HPCC
2010
Springer
13 years 6 months ago
2010
Springer
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...