The Communication Complexity of Pointer Chasing
Copyright policy )The Communication Complexity of Pointer Chasing
The bounded round two-party communication complexity of a particular problem -- the pointer chasing problem -- is studied. First, a nonlinear lower bound is proved that matches the known upper bound for this problem. Then, the bit version of the problem is considered, and upper and lower bounds are shown. Also, a certain generalization of the pointer chasing problem, the so-called \(s\)-pointer game, is considered and its upper bound obtained.
Computer Networks and Communications, Communication theory, Analysis of algorithms and problem complexity, pointer chasing problem, Applied Mathematics, upper bound, Theoretical Computer Science, Computational Theory and Mathematics, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), communication complexity, lower bound
Computer Networks and Communications, Communication theory, Analysis of algorithms and problem complexity, pointer chasing problem, Applied Mathematics, upper bound, Theoretical Computer Science, Computational Theory and Mathematics, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), communication complexity, lower bound
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).15 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!