Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity

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

[2]  Zhi-Quan Luo.  Communication complexity of some problems in distributed computation , 1989 .

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

[4]  Harold Abelson,et al.  Corrigendum: Towards a Theory of Local and Global in Computation , 1978, Theoretical Computer Science.

[5]  Nils Sandell,et al.  Detection with Distributed Sensors , 1980, IEEE Transactions on Aerospace and Electronic Systems.

[6]  Joseph Ja' Ja',et al.  The VLSI Complexity of Selected Graph Problems , 1984 .

[7]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[8]  Richard J. Lipton,et al.  Lower bounds for VLSI , 1981, STOC '81.

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

[10]  John N. Tsitsiklis,et al.  Communication complexity of convex optimization , 1986, 1986 25th IEEE Conference on Decision and Control.