Individual communication complexity

We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correct protocols, one-way versus two-way, with (not in this version) and without help bits.

[1]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[2]  Harry Buhrman,et al.  New applications of the incompressibility method: Part II , 1998, Theor. Comput. Sci..

[3]  Péter Gács,et al.  Algorithmic statistics , 2000, IEEE Trans. Inf. Theory.

[4]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[5]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[6]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[7]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[8]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[9]  Alexander Shen,et al.  Relations between varieties of kolmogorov complexities , 1996, Mathematical systems theory.

[10]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[11]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[12]  Andrej Muchnik,et al.  Conditional complexity and codes , 2002, Theor. Comput. Sci..

[13]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[14]  Nikolai K. Vereshchagin,et al.  Randomised Individual Communication Complexity , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[15]  Nikolai K. Vereshchagin,et al.  Kolmogorov's structure functions with an application to the foundations of model selection , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[16]  Nikolai K. Vereshchagin,et al.  Kolmogorov's structure functions and model selection , 2002, IEEE Transactions on Information Theory.

[17]  Uzi Vishkin,et al.  Communication complexity of document exchange , 1999, SODA '00.