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

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 48, Issue 2, 1994, Pages 214-230

Finding level-ancestors in trees

(2) Berkman, Omer a Vishkin, Uzi b,c

a KING'S COLLEGE LONDON (United Kingdom)

b UNIVERSITY OF MARYLAND (United States)

c TEL AVIV UNIVERSITY (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; OPTIMIZATION; TREES (MATHEMATICS);

EULER TOUR; LEVEL ANCESTOR PROBLEM; PREPROCESSING; QUERIES; VERTEX;

PARALLEL PROCESSING SYSTEMS;

EID: 0028407484 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/S0022-0000(05)80002-9 Document Type: Article

Times cited : (90)

References (18)

1
- 85031923295
- Deterministic parallel list ranking
- Lecture Notes in Computer Science, Springer-Verlag, Cambridge, MA
- (1988) 3rd Aegean Workshop on Computing , vol.319 , pp. 81-90
- Anderson¹ Miller²

2
- 11544358207
- Some Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values
- also IBM research report, Computer Science, RC 14128 (#63291), Univ. of Maryland Inst. for Advanced Computer Studies, New York/Berlin
- (1988) Technical Report UMIACS-TR-88-79
- Berkman¹ Schieber² Vishkin³

3
- 0024766542
- Recursive *-tree parallel data-structure
- SIAM J. Comput., to appear
- (1989) Proceedings, 30th IEEE Annual Symp. on Foundation of Computer Science , pp. 196-202
- Berkman¹ Vishkin²

4
- 84912919154
- Recursive *-tree Parallel Data-Structure
- SIAM J. Comput., to appear, Univ. of Maryland Inst. for Advanced Computer Studies
- (1990) Technical Report UMIACS-TR-90-40
- Berkman¹ Vishkin²

5
- 0347669806
- Almost Fully-Parallel Parentheses Matching
- Univ. of Maryland Inst. for Advanced Computer Studies
- (1991) Technical Report UMIACS-TR-91-103
- Berkman¹ Vishkin²

6
- 52449148136
- Computing on a free tree via complexity-preserving mappings
- (1987) Algorithmica , vol.2 , pp. 337-361
- Chazelle¹

7
- 0022875301
- Approximate and exact parallel scheduling with applications to list, tree and graph problems
- (1986) Proceedings, 27th IEEE Annual Symp. on Foundation of Computer Science , pp. 478-491
- Cole¹ Vishkin²

8
- 0024684158
- Faster optimal parallel prefix sums and list ranking
- (1989) Inform. and Comput. , vol.81 , Issue.3 , pp. 334-352
- Cole¹ Vishkin²

9
- 84912907495
- (1991) Finding level-ancestors in dinamic trees, manuscript
- Dietz¹

10
- 0024020142
- Relations between concurrent-write models of parallel computation
- (1988) SIAM Journal on Computing , vol.1 , pp. 606-627
- Fich¹ Ragde² Wigderson³

11
- 0021426157
- Fast algorithms for finding nearest common ancestors
- (1984) SIAM J. Comput. , vol.13 , Issue.2 , pp. 338-355
- Harel¹ Tarjan²

12
- 84976772007
- Parallel prefix computation
- (1980) Journal of the ACM , vol.27 , pp. 831-838
- Ladner¹ Fischer²

13
- 0025420032
- Recognizing breadth-first search trees in linear time
- (1990) Inform. Process. Lett. , vol.34 , pp. 167-171
- Manber¹

14
- 84976827056
- Parallel tridiagonal equation solvers
- (1975) ACM Transactions on Mathematical Software , vol.1 , Issue.4 , pp. 289-307
- Stone¹

15
- 0002886578
- Finding the maximum, merging, and sorting in a parallel computation model
- (1981) J. Algorithms , vol.2 , pp. 88-102
- Shiloach¹ Vishkin²

16
- 0024144496
- On finding lowest common ancestors: simplification and parallelization
- (1988) SIAM J. Comput. , vol.17 , Issue.6 , pp. 1253-1262
- Schieber¹ Vishkin²

17
- 0022162133
- An efficient parallel, biconnectivity algorithm
- (1985) SIAM J. Comput. , vol.14 , Issue.4 , pp. 862-874
- Tarjan¹ Vishkin²

18
- 0022075739
- On efficient parallel strong orientation
- (1985) Inform. Process. Lett. , vol.20 , pp. 235-240
- Vishkin¹

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