Author:
Becker Florent,Montealegre Pedro,Rapaport Ivan,Todinca Ioan
Publisher
Springer International Publishing
Reference14 articles.
1. Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: Proc. of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 459–467 (2012)
2. Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: Sparsification, spanners, and subgraphs. In: Proc. of the 31st Symposium on Principles of Database Systems, PODS 2012, pp. 5–14 (2012)
3. Babai, L., Kimmel, P.G.: Randomized simultaneous messages: Solution of a problem of Yao in communication complexity. In: Proc. of the 12th Annual IEEE Conference on Computational Complexity, pp. 239–246 (1997)
4. Becker, F., Matamala, M., Nisse, N., Rapaport, I., Suchan, K., Todinca, I.: Adding a referee to an interconnection network: What can(not) be computed in one round. In: Proc. of the 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011, pp. 508–514 (2011)
5. Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.: Informational complexity and the direct sum problem for simultaneous message complexity. In: Proc. of the 42nd IEEE Symposium on Foundations of Computer Science, FOCS 2001, pp. 270–278 (2001)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献