2924 search results - page 136 / 585 » Lower Bounds in Distributed Computing |
84
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
106
Voted
RECOMB
2006
Springer
16 years 1 months ago
2006
Springer
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
101
click to vote
PODC
2004
ACM
15 years 6 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
CONCUR
1997
Springer
15 years 4 months ago
1997
Springer
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...