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

메뉴 건너뛰기

Mathematical Systems Theory

Volumn 10, Issue 1, 1976, Pages 99-127

Design and implementation of an efficient priority queue

(3) van Emde Boas, P a Kaas, R a Zijlstra, E b

a CWI (Netherlands)

b UNIVERSITY OF AMSTERDAM (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34250391491 PISSN: 00255661 EISSN: 14330490 Source Type: Journal
DOI: 10.1007/BF01683268 Document Type: Article

Times cited : (417)

References (11)

1
- 0003415652
- Addison Wesley, Reading, Mass.
- (1974) The design and analysis of computer Algorithms
- Aho, A.V.¹ Hopcroft, J.E.² Ullman, J.D.³

2
- 84931795331
- Aho, A. V., J. E. Hopcroft and J. D. Ullman, On finding lowest common ancestors in tress, Proc. 5-th ACM symp. Theory of Computing (1973), 253–265.

3
- 0347404244
- Dept. of Comp. Sci., Cornell Univ., Ithaca 14853, N.Y.
- (1974) An O (n log log n) On-Line Algorithm for the Insert-Extract Min Problem, Rep. TR 74-221
- Van Emde Boas, P.¹

4
- 84931795329
- Even, S. and O. Kariv, Oral Commun., Berkeley, October 1975.

5
- 2942553813
- Efficiency of equivalence algorithms
- R. E., Miller, J. W., Thatcher, Plenum Press, New York
- (1972) Complexity of Computer Computations , pp. 158-168
- Fischer, M.J.¹

6
- 84931795318
- Hopcroft, J. and J. D. Ullman, Set-merging Algorithms, SIAM J. Comput.2 (Dec. 1973), 294–303.

7
- 84931766638
- Dept. Electr. Eng. Princeton Univ., Princeton, N.J. 08540
- (1975) A fast algorithm for computing longest common subsequences
- Hunt, J.W.¹ Szymanski, T.G.²

8
- 84931795317
- Tarjan, R. E., Applications of path compression on balanced trees. Manuscript. Stanford Oct. 75. (Submitted to JACM).

9
- 0016495233
- Efficiency of a good but non linear set union algorithm
- (1975) J. Assoc. Comput. Mach. , vol.22 , pp. 215-224
- Tarjan, R.E.¹

10
- 84931795316
- Tarjan, R. E., Edge disjoint spanning trees, dominators and depth first search, Rep. CS-74-455 (Sept. 1974), Stanford.

11
- 84941496928
- The Programming Language PASCAL (revised report)
- K., Jensen, N., Wirth, Lecture Notes in Computer Science, 18, Springer, Berlin
- (1974) PASCAL User Manual and Report
- Wirth, N.¹

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