2814 search results - page 507 / 563 » Competitive Analysis of Distributed Algorithms |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
SASN
2006
ACM
14 years 2 months ago
2006
ACM
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communic...