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

메뉴 건너뛰기

Journal of Algorithms

Volumn 3, Issue 3, 1982, Pages 245-260

An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

(3) Dolev, Danny a Klawe, Maria a Rodeh, Michael a

a IBM ALMADEN RESEARCH CENTER (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000138318 PISSN: 01966774 EISSN: None Source Type: Journal
DOI: 10.1016/0196-6774(82)90023-2 Document Type: Article

Times cited : (147)

References (7)

1
- 0009990581
- TR-91, Indiana University
- (1980) A Formal Model for Message Passing Systems
- Burns¹

2
- 0018465825
- An improved algorithm for decentralized extrema-finding in circular configurations of processes
- (1979) Comm. ACM , vol.22 , pp. 281-283
- Chang¹ Roberts²

3
- 84915081428
- A Distributed Algorithm for Minimum Spanning Tree
- (1979) MIT, LIDS-P-906-A
- Gallager¹ Humblet² Spira³

4
- 84976712802
- Decentralized extrema-finding in circular configurations of processes
- (1980) Communications of the ACM , vol.23
- Hirschberg¹ Sinclair²

5
- 0013135224
- RJ-3110, IBM Research Report
- (1981) The Lord of the Ring or Probabilistic Methods for Breaking Symmetry in Distributive Networks
- Itai¹ Rodeh²

6
- 0017722619
- Distributed Systems—Toward a Formal Approach
- North-Holland, Amsterdam
- (1977) Information Processing 77 , pp. 155-160
- LeLann¹

7
- 84915081427
- G. L. Peterson, An O(n log n) unidirectional algorithm for the circular extrema problem, to appear in Transactions on Programming Languages and Systems.

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