Communication complexity in a 3-computer model-Reference-Cited by-同舟云学术

Communication complexity in a 3-computer model

Published:1996-09 Issue:3 Volume:16 Page:298-301
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Ambainis A.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01955678.pdf

Reference3 articles.

1. L. Lovasz. Communication complexity: a survey. InPaths, Flows and VLSI Layout (Korte, Lovasz, Promel, Schrijver, eds.). Springer-Verlag, New York, 1990, pp. 235–266.

2. F. J. MacWilliams and N. J. A. Sloane.The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.

3. Andrew C. Yao. Some complexity questions related to distributed computing.Proceedings of the 11th ACM Symposium on the Theory of Computing, 1979, pp. 209–213.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Overcoming Congestion in Distributed Coloring;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20

2. Optimal quantum-programmable projective measurements with coherent states;Physical Review Research;2021-10-14

3. Efficient experimental quantum fingerprinting with channel multiplexing and simultaneous detection;Nature Communications;2021-07-22

4. Optical quantum communication complexity in the simultaneous-message-passing model;Physical Review A;2020-12-11

5. Multi-party quantum fingerprinting with weak coherent pulses: circuit design and protocol analysis;New Journal of Physics;2020-11-01