Sciweavers

2924 search results - page 451 / 585
» Lower Bounds in Distributed Computing
Sort
View
145
Voted
PODC
2010
ACM
15 years 4 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
Robert Danek
GRID
2006
Springer
15 years 4 months ago
Cacheable Decentralized Groups for Grid Resource Access Control
Abstract-- Sharing data among collaborators in widely distributed systems remains a challenge due to limitations with existing methods for defining groups across administrative dom...
Jeffrey Hemmes, Douglas Thain
TIT
2008
127views more  TIT 2008»
15 years 4 months ago
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
Mohsen Bayati, Devavrat Shah, Mayank Sharma
PODC
2011
ACM
14 years 7 months ago
Scalability versus semantics of concurrent FIFO queues
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
Hannes Payer, Harald Röck, Christoph M. Kirsc...
106
Voted
STACS
2010
Springer
15 years 11 months ago
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
Edward A. Hirsch, Dmitry Itsykson