By Topic

The communication complexity of pointer chasing. Applications of entropy and sampling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ponzio, S.J. ; Integrated Objects, Boston, MA, USA ; Radhakrishnan, J. ; Venkatesh, S.

The following pointer chasing problem plays a central role in the study of bounded round communication complexity. There are two players A and B. There are two sets of vertices VA and VB of size n each. Player A is given a function fA: VA→VB and player B is given a function fB: VB→VA. In the problem g k the players have to determine the vertex reached by applying fA and fB alternately, k times starting with a fixed vertex v0∈VA. That is, in g1, they must determine fA(v0), in g 2 they must determine fB(fA(v0 )), in g3 they must determine fA(fB (fA(v0))), and so on

Published in:

Computational Complexity, 1999. Proceedings. Fourteenth Annual IEEE Conference on

Date of Conference:

1999