Yingbin Liang

Computer Networks and Communications · IEEE Transactions on Information Theory · 2007–2016

A researcher in the Science corpus: 5 papers; trusts 12 researchers and is trusted by 14 researchers here, as inferred from the citation graph.

Subfields

• Computer Networks and Communications — 42 citations into it; #2,160 of 9,886 by trust here, #2,044 by citations
• Electrical and Electronic Engineering — 40 citations into it; #2,954 of 16,539 by trust here, #6,474 by citations
• Artificial Intelligence — 13 citations into it; #17,049 of 35,345 by trust here, #25,809 by citations
• Computational Theory and Mathematics — 13 citations into it
• Computational Mechanics — 12 citations into it
• Numerical Analysis — 6 citations into it
• Mathematical Physics — 5 citations into it

Whom Yingbin Liang trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Ning Cai
2. H. Vincent Poor
3. Lifeng Lai
4. Patricio Parada
5. Jérôme Bolte
6. Raymond W. Yeung
7. Praveen Kumar Gopala
8. Hesham El Gamal
9. Shlomo Shamai
10. Hédy Attouch

Who trusts Yingbin Liang overall

1. Jiangyuan Li
2. Praveen Kumar Gopala
3. Lifeng Lai
4. H. Vincent Poor
5. Lalitha Sankar
6. A. Mukherjee
7. Ashish J. Khisti
8. Yiliang Liu
9. Athina P. Petropulu
10. Shlomo Shamai

Papers from Yingbin Liang's perspective

Ordered by how strongly the researchers Yingbin Liang trusts endorse each paper. Same corpus, a different order for every researcher.

1. Secrecy Capacity of Wireless Channels (2006 IEEE International Symposium on Information Theory)
2. Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
3. Multiple-Access Channels With Confidential Messages (IEEE Transactions on Information Theory)
4. A Mathematical Theory of Communication
5. On the Secrecy Capacity of Fading Channels (2007 IEEE International Symposium on Information Theory)
6. Distributed delayed stochastic optimization
7. MapReduce: simplified data processing on large clusters
8. Parallel and distributed computation
9. Scaling Distributed Machine Learning with the Parameter Server
10. Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality

Their papers

• Secure Communication Over Fading Channels (2007) — 966 citations
• Compound Wiretap Channels (2009) — 319 citations
• Multiple-Access Channels With Confidential Messages (2008) — 331 citations
• On Convergence of Model Parallel Proximal Gradient Algorithm for Stale Synchronous Parallel System (2016) — 30 citations
• Information Theoretic Security (2009) — 441 citations