2924 search results - page 126 / 585 » Lower Bounds in Distributed Computing |
CLUSTER
2000
IEEE
15 years 5 months ago
2000
IEEE
We propose a programming model for distributed concurrent systems with mobile objects in the context of a process calculus. Code mobility is induced by lexical scoping on names. O...
85
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
78
Voted
MM
2003
ACM
15 years 6 months ago
2003
ACM
In this paper, we present a novel approach to automatically determine the positions of sensors and actuators in an ad-hoc distributed network of heterogeneous general purpose comp...
108
click to vote
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
116
Voted
JCO
2008
15 years 19 days ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...