Author:
Viola Emanuele,Wigderson Avi
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference40 articles.
1. Noga Alon, Yossi Matias and Mario Szegedy: The space complexity of approximating the frequency moments, J. Comput. System Sci. 58(1, part 2) (1999), 137–147.
2. Alfred V. Aho, Jeffrey D. Ullman and Mihalis Yannakakis: On notions of information transfer in VLSI circuits, in: 15th ACM symposium on Theory of computing (STOC), pages 133–139, ACM Press, 1983.
3. Avraham Ben-Aroya, Oded Regev and Ronald de Wolf: A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs, in: 49th IEEE Symposium on Foundations of Computer Science (FOCS), pages 477–486, IEEE Computer Society, 2008.
4. Joshua Brody and Amit Chakrabarti: Sublinear communication protocols for multi-party pointer jumping and a related lower bound, in: 25th Symposium on Theoretical Aspects of Computer Science (STACS), pages 145–156, 2008.
5. Paul Beame, Matei David, Toniann Pitassi and Philipp Woelfel: Separating deterministic from nondeterministic nof multiparty communication complexity, in: 34th International Colloquium on Automata, Languages and Programming (ICALP), pages 134–145, Springer, 2007.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Triangle and Four Cycle Counting in the Data Stream Model;Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2020-05-29
2. The Complexity of Counting Cycles in the Adjacency List Streaming Model;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019
3. The Function-Inversion Problem: Barriers and Opportunities;Theory of Cryptography;2019
4. The Multiparty Communication Complexity of Set Disjointness;SIAM Journal on Computing;2016-01
5. Communication Lower Bounds Using Directional Derivatives;Journal of the ACM;2014-12-17