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

메뉴 건너뛰기

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 152-164

Two simplified algorithms for maintaining order in a list

(5) Bender, Michael A a Cole, Richard b Demaine, Erik D c Farach Colton, Martin d,e Zito, Jack a

a Stony Brook University (United States)

b NEW YORK UNIVERSITY (United States)

c MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

d GOOGLE INC (United States)

e RUTGERS UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EXPERIMENTAL EVIDENCE; OPTIMAL SOLUTIONS; ORDER MAINTENANCE; SIMPLIFIED ALGORITHMS; TOTAL ORDER;

ARTIFICIAL INTELLIGENCE;

EID: 84938093834 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-45749-6_17 Document Type: Conference Paper

Times cited : (129)

References (14)

1
- 0000963030
- Approximate indexed lists
- A. Andersson and O. Petersson. Approximate indexed lists. Journal of Algorithms, 29(2):256–276, 1998. 153
- (1998) Journal of Algorithms , vol.29 , Issue.2 , pp. 256-276
- Andersson, A.¹ Petersson, O.²

2
- 85088357020
- Optimal dynamic interval management in external memory
- L. Arge and J. Vitter. Optimal dynamic interval management in external memory. In FOCS, 1996. 155
- (1996) In FOCS
- Arge, L.¹ Vitter, J.²

3
- 84938121481
- Two algorithms for maintaining order in a list
- P. Dietz and D. Sleator. Two algorithms for maintaining order in a list. In STOC, 1987. 153, 154
- (1987) In STOC
- Dietz, P.¹ Sleator, D.²

4
- 0038168837
- Maintaining order in a linked list
- P. F. Dietz. Maintaining order in a linked list. In STOC, 1982. 153
- (1982) In STOC
- Dietz, P.F.¹

5
- 84938121483
- A tight lower bound for on-line monotonic list labeling
- P. F. Dietz, J. I. Seiferas, and J. Zhang. A tight lower bound for on-line monotonic list labeling. In SWAT, 1994. 153
- (1994) In SWAT
- Dietz, P.F.¹ Seiferas, J.I.² Zhang, J.³

6
- 84938121484
- Lower bounds for monotonic list labeling
- P. F. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In SWAT, 1990. 153
- (1990) In SWAT
- Dietz, P.F.¹ Zhang, J.²

7
- 0038438346
- A sparse table implementation of priorityqueues
- A. Itai, A. Konheim, and M. Rodeh. A sparse table implementation of priorityqueues. In ICALP, 1981. 153
- (1981) In ICALP
- Itai, A.¹ Konheim, A.² Rodeh, M.³

8
- 0007082977
- Binary search trees of bounded balance
- J. Nievergelt and E.M. Reingold. Binary search trees of bounded balance. SIComp, 2:33–43, 1973. 155
- (1973) Sicomp , vol.2 , pp. 33-43
- Nievergelt, J.¹ Reingold, E.M.²

9
- 1142282403
- Skip lists: A probabilistic alternative to balanced trees
- W. Pugh. Skip lists: a probabilistic alternative to balanced trees. In WADS, 1989. 155
- (1989) In WADS
- Pugh, W.¹

10
- 0021625166
- Maintaining order in a generalized linked list
- May
- A.K. Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica, 21(1):101–112, May 1984. 153
- (1984) Acta Informatica , vol.21 , Issue.1 , pp. 101-112
- Tsakalidis, A.K.¹

11
- 85088352784
- Inserting and deleting records in blocked sequential files. TechnicalReport TM81-45193-5
- D. Willard. Inserting and deleting records in blocked sequential files. TechnicalReport TM81-45193-5, Bell Laboratories, 1981. 153, 154
- (1981) Bell Laboratories
- Willard, D.¹

12
- 84938121488
- Maintaining dense sequential files in a dynamic environment
- D. Willard. Maintaining dense sequential files in a dynamic environment. In STOC, 1982. 153, 154
- (1982) In STOC
- Willard, D.¹

13
- 84976780495
- Good worst-case algorithms for inserting and deleting records in dense sequential files
- D. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In SIGMOD, 1986. 153, 154
- (1986) In SIGMOD
- Willard, D.¹

14
- 0038099300
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time
- D. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2):150–204, 1992. 153, 154
- (1992) Information and Computation , vol.97 , Issue.2 , pp. 150-204
- Willard, D.¹

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