Index Terms
- The complexity of flat origami
Recommendations
Fragile complexity of adaptive algorithms
AbstractThe fragile complexity of a comparison-based algorithm is f ( n ) if each input element participates in O ( f ( n ) ) comparisons. In this paper, we explore the fragile complexity of algorithms adaptive to various restrictions on the ...
Highlights- Fragile complexity parameterized by other quantity than the input size.
- ...
On the bit communication complexity of randomized rumor spreading
SPAA '10: Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architecturesWe study the communication complexity of rumor spreading in the random phone-call model. Suppose nplayers communicate in parallel rounds, where in each round every player calls a randomly selected communication partner. A player u is allowed to exchange ...
On dynamic bit-probe complexity
ICALP'05: Proceedings of the 32nd international conference on Automata, Languages and ProgrammingThis paper presents several advances in the understanding of dynamic data structures in the bit-probe model:
We improve the lower bound record for dynamic language membership problems to $\Omega((\frac{{\rm lg}\ n}{\rm lg \ lg \ {\it n}})^{2})$. ...
Comments