论文信息 - Communication complexity of convex optimization - 字舞流文

Communication complexity of convex optimization

J. Tsitsiklis | Z. Luo

[1] Abbas El Gamal,et al. Communication Complexity of Computing the Hamming Distance , 1986, SIAM J. Comput..

[2] R. Gallager,et al. Communication complexity of distributed shortest path algorithms , 1985 .

[3] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .

[4] Alfred V. Aho,et al. On notions of information transfer in VLSI circuits , 1983, STOC.

[5] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .

[6] John N. Tsitsiklis,et al. On the Complexity of Designing Distributed Protocols , 1982, Inf. Control..

[7] Christos H. Papadimitriou,et al. Communication complexity , 1982, STOC '82.

[8] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[9] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[10] Henryk Wozniakowski,et al. A general theory of optimal algorithms , 1980, ACM monograph series.

[11] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[12] Daniel Uri Friedman,et al. Communication complexity of distributed shortest path algorithms , 1979 .

[13] Harold Abelson,et al. Lower bounds on information transfer in distributed computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).