On the Complexity of Designing Distributed Protocols

[1]  Mark Stefik H. A. Simon, The Sciences of the Artificial , 1984, Artif. Intell..

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

[3]  Michael Randolph Garey,et al.  The complexity of the generalized Lloyd - Max problem , 1982, IEEE Trans. Inf. Theory.

[4]  Christos H. Papadimitriou,et al.  The complexity of distributed concurrency control , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

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

[7]  Richard E. Ladner,et al.  The Complexity of Problems in Systems of Communicating Sequential Processes , 1980, J. Comput. Syst. Sci..

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

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

[10]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  R. Radner,et al.  Economic theory of teams , 1972 .

[13]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[14]  Herbert A. Simon,et al.  The Sciences of the Artificial , 1970 .