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

메뉴 건너뛰기

SIAM Journal on Computing

Volumn 30, Issue 1, 2000, Pages 86-109

On RAM priority queues

(1) Thorup, M a

a AT AND T LABS RESEARCH (United States)

Author keywords

Greedy algorithms; Priority queues; RAM model; Shortest paths; Sorting

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; RANDOM ACCESS STORAGE; SET THEORY; SORTING;

GREEDY ALGORITHMS; PRIORITY QUEUES; SHORTEST PATHS;

QUEUEING THEORY;

EID: 0034456287 PISSN: 00975397 EISSN: None Source Type: Journal
DOI: 10.1137/S0097539795288246 Document Type: Article

Times cited : (72)

References (36)

1
- 0025417561
- Faster algorithms for the shortest path problem
- (1990) J. ACM , vol.37 , pp. 213-223
- Ahuja, R.K.¹ Mehlhorn, K.² Orlin, J.B.³ Tarjan, R.E.⁴

2
- 0001286367
- Improved parallel integer sorting without concurrent writing
- (1997) Inform. and Comput. , vol.136 , pp. 25-51
- Albers, S.¹ Hagerup, T.²

3
- 0032142026
- Sorting in linear time?
- (1998) J. Comput. System Sci. , vol.57 , pp. 74-93
- Andersson, A.¹ Hagerup, T.² Nilsson, S.³ Raman, R.⁴

4
- 0030393772
- 0 RAMs-Query time Θ(√log n/log log n) is necessary and sufficient
- (1996) Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, Burlington, VT , pp. 441-450
- Andersson, A.¹ Miltersen, P.B.² Riis, S.³ Thorup, M.⁴

5
- 0000645187
- 0 operations only
- (1999) Theoret. Comput. Sci. , vol.215 , pp. 337-344
- Andersson, A.¹ Miltersen, P.B.² Thorup, M.³

6
- 84987162001
- A new efficient radix sort
- (1994) Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, Santa Fe, NM , pp. 714-721
- Andersson, A.¹ Nilsson, S.²

7
- 0033691875
- Tight(er) worst-case bounds on dynamic searching and priority queues
- to appear
- (2000) Proceedings of the 32nd ACM Symposium on the Theory of Computing, Portland, OR
- Andersson, A.¹ Thorup, M.²

8
- 0032633728
- Optimal bounds for the predecessor problem
- (1999) Proceedings of the 31st ACM Symposium on the Theory of Computing, Atlanta, GA , pp. 295-304
- Beame, P.¹ Fich, F.²

9
- 0024701192
- Optimal bounds on the decision problems on the CRCW PRAM
- (1989) J. ACM , vol.36 , pp. 643-670
- Beame, P.¹ Håstad, J.²

10
- 0004273274
- Addison-Wesley, Reading, MA
- (1986) Programming Pearls
- Bentley, J.¹

11
- 0018456171
- Universal classes of hash functions
- (1979) J. Comput. System Sci. , vol.18 , pp. 143-154
- Carter, J.L.¹ Wegman, M.N.²

12
- 0030823087
- Buckets, heaps, lists, and monotone priority queues
- (1997) Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA , pp. 83-92
- Cherkassky, B.V.¹ Goldberg, A.V.² Silverstein, C.³

13
- 34147120474
- A note on two problems in connection with graphs
- (1959) Numer. Math. , vol.1 , pp. 269-271
- Dijkstra, E.W.¹

14
- 0001549012
- Shortest-route methods 1: Reaching, pruning, and buckets
- (1979) Oper. Res. , vol.27 , pp. 161-186
- Denardo, D.V.¹ Fox, B.L.²

15
- 0028344438
- Fishspear: A priority queue algorithm
- (1994) J. ACM , vol.41 , pp. 3-30
- Fischer, M.J.¹ Paterson, M.S.²

16
- 84945709825
- Trie memory
- (1960) Comm. ACM , vol.3 , pp. 490-499
- Fredkin, E.¹

17
- 0000743608
- Surpassing the information theoretic bound with fusion trees
- See also the Proceedings of the 22nd ACM Symposium on the Theory of Computing, Baltimore, MD, 1990, pp. 1-7
- (1993) J. Comput. System Sci. , vol.47 , pp. 424-436
- Fredman, M.L.¹ Willard, D.E.²

18
- 0028459904
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- See also the Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, St. Louis, MO, 1990, pp. 719-725
- (1994) J. Comput. System Sci. , vol.48 , pp. 533-551
- Fredman, M.L.¹ Willard, D.E.²

19
- 0023384210
- Fibonacci heaps and their uses in improved network optimization algorithms
- (1987) J. ACM , vol.34 , pp. 596-615
- Fredman, M.L.¹ Tarjan, R.E.²

20
- 78649841467
- Sorting and searching on the Word RAM
- (1998) Proceedings of the 15th Symposium on the Theoretical Aspects of Computer Science, Paris, Lecture Notes in Comput. Sci. 1373, Springer, Berlin , pp. 366-398
- Hagerup, T.¹

21
- 0000737752
- Sorting by address calculation
- (1956) J. ACM , vol.3 , pp. 169-174
- Isaac, E.J.¹ Singleton, R.C.²

22
- 34250239747
- A priority queue in which initialization and queue operations take O (log log D) time
- (1982) Math. Systems Theory , vol.15 , pp. 295-309
- Johnson, D.B.¹

23
- 0000978261
- Optimal computer search trees and variable-length alphabetic codes
- (1971) SIAM J. Appl. Math. , vol.21 , pp. 514-532
- Hu, T.C.¹ Tucker, A.C.²

24
- 0021374797
- Upper bounds for sorting integers on random access machines
- (1984) Theoret. Comput. Sci. , vol.28 , pp. 263-276
- Kirkpatrick, D.¹ Reisch, S.²

25
- 0003657590
- Addison-Wesley, Reading, MA
- (1973) The Art of Computer Programming 3: Sorting and Searching
- Knuth, D.E.¹

26
- 0004047313
- Springer, Berlin
- (1984) Data Structures and Algorithms 1: Sorting and Searching
- Mehlhorn, K.¹

27
- 0025702474
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- (1990) Inform. Process. Lett. , vol.35 , pp. 183-189
- Mehlhorn, K.¹ Näher, S.²

28
- 0028016999
- Lower bounds for union-split-find related problems on random access machines
- (1994) Proceedings of the 26th ACM Symposium on the Theory of Computing, Montreal, Canada , pp. 625-634
- Miltersen, P.B.¹

29
- 0003143994
- Decision trees and random access machines
- (1980) Proceedings of the Symposium Über Logik and Algoritmik, Zürich, Switzerland , pp. 331-340
- Paul, W.J.¹ Simon, J.²

30
- 84958047776
- Priority queues: Small, monotone, and trans-dichotomous
- (1996) Proceedings of the European Symposium on Algorithms, Barcelona, Spain, Lecture Notes in Comput. Sci. 1136, Springer, Berlin , pp. 121-137
- Raman, R.¹

31
- 0005395248
- Recent results on the single-source shortest paths problem
- (1997) SICACT News , vol.28 , pp. 81-87
- Raman, R.¹

32
- 0005483705
- On RAM priority queues
- (1996) Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA , pp. 59-67
- Thorup, M.¹

33
- 0030816966
- Randomized sorting in O(n log log n) time and linear space using addition, shifts, and bit-wise Boolean operations
- (1997) Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA , pp. 352-359
- Thorup, M.¹

34
- 0032272931
- Faster deterministic sorting and priority queues in linear space
- (1998) Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD , pp. 550-555
- Thorup, M.¹

35
- 0002484064
- Preserving order in a forest in less than logarithmic time and linear space
- (1977) Inform. Process. Lett. , vol.6 , pp. 80-82
- Van Emde Boas, P.¹

36
- 34250391491
- Design and implementation of an efficient priority queue
- (1977) Math. Systems Theory , vol.10 , pp. 99-127
- Van Emde Boas, P.¹ Kaas, R.² Zijlstra, E.³

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