Communication complexity

Known as: Quantum communication complexity

The notion of communication complexity was introduced by Yao in 1979,who investigated the following problem involving two separated parties (Alice…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

This paper presents our preliminary results from a single case study on face-to-face, email and instant messaging (IM…

2010

─ This paper describes an efficient parallelization of the multi-level fast multipole algorithm (MLFMA) for fast solution of very…

2009

We present a distributed data structure, which we call the rainbow skip graph. To our knowledge, this is the first peer-to-peer…

2008

Most of the state-of-the-art localization algorithms in wireless sensor networks (WSNs) are vulnerable to various kinds of…

2007

Foreword. Preface. Acknowledgements. Introduction. PART ONE. Chapter One Building Blocks of Communication. Chapter Two The…

2006

The emergence of communication is studied in a scenario where agents endowed with distinct object-meaning mappings learn from…

2001

In a trading scenario agents interact with each other, selling and buying resources. In order to control the behavior of the…

1999

This work is settled in the area of complexity theory for rest icted variants of branching programs. Today, branching programs…

1996

We present a verification of a distributed sorting algorithm in ALF, an implementation of Martin L¨of's type theory. The…

1991

The communication patterns of physicists and all scientists are undergoing change due to introduction of new technology…