Lattices, mobius functions and communication complexity

Laszlo Lovasz, Michael Saks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

66 Citations (Scopus)

Abstract

A general framework for the study of a broad class of communication problems is developed. It is based on a recent analysis of the communication complexity of graph connectivity. The approach makes use of combinatorial lattice theory.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Pages81-90
Number of pages10
ISBN (Print)0818608773
Publication statusPublished - Dec 1 1988

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Lattices, mobius functions and communication complexity'. Together they form a unique fingerprint.

  • Cite this

    Lovasz, L., & Saks, M. (1988). Lattices, mobius functions and communication complexity. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 81-90). (Annual Symposium on Foundations of Computer Science (Proceedings)). Publ by IEEE.