SCOPUS 정보 검색 플랫폼

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

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 164-175

Mergeable dictionaries

(2) Iacono, John a Özkan, Özgür a

a POLYTECHNIC UNIVERSITY (United States)

Author keywords

amortized analysis; data structures

Indexed keywords

ABSTRACT DATA TYPES; ADDITIONAL COSTS; AMORTIZED ANALYSIS; AMORTIZED TIME; DISJOINT SETS; MERGE OPERATIONS; ORDERED DATA; SPLIT OPERATIONS; SPLIT-AND-MERGE;

DATA STRUCTURES; LINGUISTICS; TRANSLATION (LANGUAGES);

DATA HANDLING;

EID: 77955322888 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-642-14165-2_15 Document Type: Conference Paper

Times cited : (10)

References (10)

1
- 17444407403
- Biased skip lists
- Bagchi, A., Buchsbaum, A. L., Goodrich, M. T.: Biased skip lists. Algorithmica 42 (1), 31-48 (2005)
- (2005) Algorithmica , vol.42 , Issue.1 , pp. 31-48
- Bagchi, A.¹ Buchsbaum, A.L.² Goodrich, M.T.³

2
- 0018456411
- A fast merging algorithm
- Brown, M. R., Tarjan, R. E.: A fast merging algorithm. J. ACM 26 (2), 211-226 (1979)
- (1979) J. ACM , vol.26 , Issue.2 , pp. 211-226
- Brown, M.R.¹ Tarjan, R.E.²

3
- 0033899322
- Adaptive set intersections, unions, and differences
- In
- Demaine, E. D., López-Ortiz, A., Munro, J. I.: Adaptive set intersections, unions, and differences. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743-752 (2000)
- (2000) Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp. 743-752
- Demaine, E.D.¹ López-Ortiz, A.² Munro, J.I.³

4
- 0000573761
- String matching in lempel-ziv compressed strings
- Farach, M., Thorup, M.: String matching in lempel-ziv compressed strings. Algorithmica 20 (4), 388-404 (1998)
- (1998) Algorithmica , vol.20 , Issue.4 , pp. 388-404
- Farach, M.¹ Thorup, M.²

5
- 77955329575
- Data structures for mergeable trees
- abs/0711.1682
- Georgiadis, L., Kaplan, H., Shafrir, N., Tarjan, R. E., Werneck, R. F. F.: Data structures for mergeable trees. In: CoRR, abs/0711.1682 (2007)
- (2007) CoRR
- Georgiadis, L.¹ Kaplan, H.² Shafrir, N.³ Tarjan, R.E.⁴ Werneck, R.F.F.⁵

6
- 33244493278
- Design of data structures for mergeable trees
- ACM Press, New York
- Georgiadis, L., Tarjan, R. E., Werneck, R. F. F.: Design of data structures for mergeable trees. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 394-403. ACM Press, New York (2006)
- (2006) Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp. 394-403
- Georgiadis, L.¹ Tarjan, R.E.² Werneck, R.F.F.³

7
- 77955339950
- Mergeable dictionaries
- abs/1002.4248
- Iacono, J., Ozkan, O.: Mergeable Dictionaries. In: CoRR, abs/1002.4248 (2010)
- (2010) CoRR
- Iacono, J.¹ Ozkan, O.²

8
- 77955322461
- Master's thesis, Massachusetts Institute of Technology, Erik Demaine, Adviser
- Lai, K. J.: Complexity of union-split-find problems. Master's thesis, Massachusetts Institute of Technology, Erik Demaine, Adviser (2008)
- (2008) Complexity of Union-split-find Problems
- Lai, K.J.¹

9
- 0025436383
- Skip lists: A probabilistic alternative to balanced trees
- Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM 33 (6), 668-676 (1990)
- (1990) Communications of the ACM , vol.33 , Issue.6 , pp. 668-676
- Pugh, W.¹

10
- 0000402933
- Amortized computational complexity
- Tarjan, R. E.: Amortized computational complexity. SIAM Journal on Algebraic Discrete Methods 6 (2), 306-318 (1985)
- (1985) SIAM Journal on Algebraic Discrete Methods , vol.6 , Issue.2 , pp. 306-318
- Tarjan, R.E.¹

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