5 search results - page 1 / 1 » Brief announcement: efficient graph algorithms without synch... |
PODC
2010
ACM
13 years 6 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
PODC
2010
ACM
13 years 8 months ago
2010
ACM
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...