SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 28, Issue 2, 1984, Pages 260-269

Communication complexity

(2) Papadimitriou, Christos H a Sipser, Michael b

a NATIONAL TECHNICAL UNIVERSITY OF ATHENS (Greece)

b MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS;

EID: 0021409918 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/0022-0000(84)90069-2 Document Type: Article

Times cited : (109)

References (8)

1
- 84976664827
- Lower bounds on information transfer in distributed computations
- (1978) Proceedings of the 19th Annual Symposium on Foundations of Computer Science
- Abelson¹

2
- 85034843873
- Lower bounds for VLSI
- (1981) Proceedings of the 13th Symposium on Theory of Computing , pp. 300-307
- Lipton¹ Sedgewick²

3
- 84939715814
- Las Vegas is better than determinism in VLSI and distributed computing (extended abstract)
- (1982) Proceedings of the 14th Symposium on Theory of Computing , pp. 330-337
- Melhorn¹ Schmidt²

4
- 0018616228
- Area-time tradeoffs for matrix multiplication and related problems in VLSI models
- (1979) Proceedings of the Allerton Conference
- Savage¹

5
- 85034258456
- Area-time complexity for VLSI
- (1979) Proceedings of the 11th Annual Symposium on Theory of Computing , pp. 81-88
- Thompson¹

6
- 0019248365
- A combinatorial limit on the computational power of VLSI circuits
- (1980) Proceedings of the 21st Annual Conference on Foundations of Computer Science , pp. 294-300
- Vuillemin¹

7
- 0013450821
- The entropic limitations on VLSI computations
- (1981) Proceedings of the 13th Annual Symposium on Theory of Computing , pp. 308-311
- Yao¹

8
- 85039623622
- Some complexity questions related to distributive computing
- (1979) Proceedings of the 11th Annual Symposium on Theory of Computing , pp. 209-213
- Yao¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.