Sciweavers

2110 search results - page 21 / 422
» What is the complexity of a distributed computing system
Sort
View
137
Voted
PDCAT
2007
Springer
15 years 10 months ago
Incorporating Security Requirements into Communication Protocols in Multi-agent Software Systems
A communication protocol is a fundamental component of a multi-agent system. The security requirements for a communication protocol should be articulated during the early stages o...
Yuxiu Luo, Giannakis Antoniou, Leon Sterling
PODC
2006
ACM
15 years 10 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
PODC
2012
ACM
13 years 6 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
213
Voted
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 4 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
153
Voted
OPODIS
2007
15 years 5 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...