C. Damm, S. Jukna and J. Sgall, Some bounds on multiparty communication complexity of pointer jumping. In Proc. 13th Ann. Symp. on Theor. Aspects of Comput. Sci., Springer Lecture Notes in Comput. Sci., 1046 (1996), 643--654.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....They have obtained results for a function called the generalized addressing function . Remark 4: The communication game for the pointer jumping function and a prescribed order of the players has been considered without success by many researchers (personal communication with Noam Nisan) Damm, Jukna, and Sgall (1996) have presented surprising upper bounds and a strong lower bound but only for a restricted case. The above conjecture is still open. We sketch our ideas how we obtain an improved hierarchy for kIBDDs of polynomial size, if the conjecture holds. We describe a new pointer jumping function ....

Damm, C., Jukna, S., and Sgall, J. (1996). Some bounds on multiparty communication complexity of pointer jumping. In STACS'96, Lecture Notes in Computer Science 1046, 643--654.

No context found.

C. Damm, S. Jukna and J. Sgall, Some bounds on multiparty communication complexity of pointer jumping. In Proc. 13th Ann. Symp. on Theor. Aspects of Comput. Sci., Springer Lecture Notes in Comput. Sci., 1046 (1996), 643--654.

....4 and lower bounds in Section 5. In Section 6 we demonstrate the gap between conservative and non conservative protocols. Open problems are discussed in Section 7. The lower and upper bounds for small k were also reported in Damm Jukna (1995) The preliminary version of this paper appeared in Damm, Jukna Sgall (1996) . 2. Related work Our main motivation is the result of Hastad Goldmann (1991) based on Yao (1990) and following also easily from an improvement of Yao (1990) by Beigel Tarui (1994) They show that any function in ACC (i.e. computed by polynomial size, bounded depth and unbounded fan in ....

C. Damm, S. Jukna and J. Sgall, Some bounds on multiparty communication complexity of pointer jumping. In Proc. 13th Ann. Symp. on Theor. Aspects of Comput. Sci., Springer Lecture Notes in Comput. Sci., 1046 (1996), 643--654.

....of a game corresponding to computing certain set of n permutations (instead of n shifts) Very recently (during the refereeing process of this paper) Ambainis [4] improved some of our results on communication complexity (Theorems 4.2 and 4. 9) In another recent paper, Damm, Jukna, and Sgall [11] prove bounds on the k party communication complexity of the pointer jumping function in a restricted model not directly corresponding to the models considered here. Hereisanoverview of the paper. In section 2, we give the basic definitions and facts. Section 3 summarizes the relations between ....

C. Damm, S. Jukna, and J. Sgall, Some bounds for multiparty communication complexity of pointer jumping, Comput. Complexity, to appear.

....complexity of a game corresponding to computing certain set of n permutations (instead of n shifts) Very recently (during the refereeing process) Ambainis [4] improved some of our results on communication complexity (Theorems 4.2 and 4. 9) In another recent paper Damm, Jukna, and Sgall [11] prove bounds on the k party communication complexity of the pointer jumping function in a restricted model not directly corresponding to the models considered here. Here is an overview of the paper. In x2 we give the basic definitions and facts. Section 3 summarizes the relations between ranks of ....

C. Damm, S. Jukna, and J. Sgall, Some bounds for multiparty communication complexity of pointer jumping, in Proc. of the 13th Ann. Symp. on Theoretical Aspects of Computer Sci., Lecture Notes in Computer Sci. 1046, Springer-Verlag, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC