Topology Matters in Communication
暂无分享,去创建一个
Atri Rudra | Jaikumar Radhakrishnan | Arkadev Chattopadhyay | J. Radhakrishnan | A. Rudra | A. Chattopadhyay
[1] Zongpeng Li,et al. A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks , 2009, IEEE Transactions on Information Theory.
[2] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.
[3] Toniann Pitassi,et al. The story of set disjointness , 2010, SIGA.
[4] Panganamala Ramana Kumar,et al. Optimal Function Computation in Directed and Undirected Graphs , 2011, IEEE Transactions on Information Theory.
[5] Eyal Kushilevitz,et al. Communication Complexity , 1997, Adv. Comput..
[6] Rafail Ostrovsky,et al. The Linear-Array Conjecture in Communication Complexity Is False , 1996, STOC '96.
[7] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.
[8] Prasoon Tiwari,et al. Lower bounds on communication complexity in distributed computer networks , 1984, JACM.
[9] Sergei Vassilvitskii,et al. A model of computation for MapReduce , 2010, SODA '10.
[10] Danny Dolev,et al. Multiparty communication complexity , 1989, 30th Annual Symposium on Foundations of Computer Science.
[11] Mark Braverman,et al. Tight Bounds for Set Disjointness in the Message Passing Model , 2013, ArXiv.
[12] Ziv Bar-Yossef,et al. An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[13] David P. Woodruff,et al. When distributed computation is communication expensive , 2013, Distributed Computing.
[14] David P. Woodruff,et al. Tight bounds for distributed functional monitoring , 2011, STOC '12.
[15] José D. P. Rolim,et al. Lower Bounds on the Multiparty Communication Complexity , 1998, J. Comput. Syst. Sci..
[16] Ortrud R. Oellermann,et al. Distance in Graphs , 2011, Structural Analysis of Complex Networks.
[17] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.
[18] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[19] Baochun Li,et al. Network Coding : The Case of Multiple Unicast Sessions , 2004 .
[20] Dan Suciu,et al. Parallel evaluation of conjunctive queries , 2011, PODS.
[21] Maria-Florina Balcan,et al. Distributed Learning, Communication Complexity and Privacy , 2012, COLT.
[22] Qin Zhang,et al. Sorting, Searching, and Simulation in the MapReduce Framework , 2011, ISAAC.
[23] Thomas M. Cover,et al. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .
[24] Fabian Kuhn,et al. The communication complexity of distributed task allocation , 2012, PODC '12.
[25] Zongpeng Li,et al. Network Coding in Undirected Networks , 2004 .
[26] Avishek Saha,et al. Protocols for Learning Classifiers on Distributed Data , 2012, AISTATS.
[27] Ravi Kumar,et al. Two applications of information complexity , 2003, STOC '03.
[28] Shyamkishor Kumar. NETWORK CODING THE CASE OF MULTIPLE UNICAST SESSIONS , 2015 .
[29] Graham Cormode,et al. The continuous distributed monitoring model , 2013, SGMD.
[30] David P. Woodruff,et al. An Optimal Lower Bound for Distinct Elements in the Message Passing Model , 2014, SODA.
[31] Alexander A. Razborov,et al. On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..
[32] Robert D. Kleinberg,et al. Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem , 2004 .
[33] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[34] Martin Dietzfelbinger,et al. The linear-array problem in communication complexity resolved , 1997, STOC '97.
[35] Xi Chen,et al. How to compress interactive communication , 2010, STOC '10.
[36] Noga Alon,et al. The Space Complexity of Approximating the Frequency Moments , 1999 .
[37] Fabian Kuhn,et al. Dynamic networks: models and algorithms , 2011, SIGA.
[38] Qin Zhang,et al. Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy , 2011, SIAM J. Comput..