Skip to main content
SpringerLink
Log in

Individual Communication Complexity

Extended Abstract

  • Conference paper
STACS 2004 (STACS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2996))

Included in the following conference series:

Abstract

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.

The authors are partially supported by EU project QAIP, IST–1999–11234, EU project RESQ, IST-2001-37559, the NoE QUIPROCONE IST–1999–29064, the ESF QiT Programmme, the EU NeuroCOLT II Working Group EP 27150, the EU NoE PASCAL, and by the Netherlands Organization for Scientific Research (NWO).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bennett, C.H., Gács, P., Li, M., Vitányi, P.M.B., Zurek, W.: Information Distance. IEEE Trans. Information Theory IT-44(4), 1407–1423 (1998)

    Article  Google Scholar 

  2. Buhrman, H., Jiang, T., Li, M., Vitanyi, P.: New applications of the incompressibility method: Part II. Theoretical Computer Science 235(1), 59–70 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  4. Levin, L.A.: Average Case Complete Problems. SIAM J. Comput. 15(1), 285–286 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  5. Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, New York (1997)

    MATH  Google Scholar 

  6. Muchnik, A.A.: Conditional complexity and codes. Theoret. Comput. Sci. 271(1/2), 97–111 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Vereshchagin, N.K., Vitányi, P.M.B.: Kolmogorov’s structure functions and an application to the foundations of model selection. In: Proc. 47th IEEE Symp. Found. Comput. Sci., pp. 751–760 (2002)

    Google Scholar 

  8. Yao, A.C.: Some complexity questions related to distributive computing. In: Proc. 11th ACM Symposium on Theory of Computing, pp. 209–213 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands

    Harry Buhrman & Paul Vitányi

  2. IAS, Einstein Drive, Princeton, NJ, 08540-0631, USA

    Hartmut Klauck

  3. Dept. Math. Logic and Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Leninskie gory, Moscow, 119992, Russia

    Nikolai Vereshchagin

Authors
  1. Harry Buhrman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hartmut Klauck
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nikolai Vereshchagin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paul Vitányi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Stuttgart, FMI, Germany

    Volker Diekert

  2. LIAFA and the University of Paris 7, Denis Diderot,  

    Michel Habib

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buhrman, H., Klauck, H., Vereshchagin, N., Vitányi, P. (2004). Individual Communication Complexity. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24749-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21236-2

  • Online ISBN: 978-3-540-24749-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation