Cache-oblivious comparison-based algorithms on multisets

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 305-316

  Farzan, Arash ^a   Ferragina, Paolo ^b   Franceschini, Gianni ^b   Munro, J Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

ADDITIVE ERRORS; CACHE COMPLEXITY; CACHE SIZE; OPTIMAL ALGORITHMS;

ALGORITHMS;

EID: 27144447089     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_29     Document Type: Conference Paper

References (9)

1. Aggarwal, A., Vitter, J.S.: The I/O complexity of sorting and related problems. In: ICALP Proceedings. Volume 267 of LNCS., Springer-Verlag (1987) 467-478
2. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: FOGS Proceedings, IEEE Computer Society Press (1999) 285-297
3. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2) (1985) 202-208
4. Munro, I., Spira, P.: Sorting and searching in multisets. SIAM Journal on Computing 5 (1976) 1-8
5. Arge, L., Knudsen, M., Larsen, K.: A general lower bound on the I/O-complexity of comparison-based algorithms. In: In Proceedings of WADS, Springer-Verlag (1993)
6. Brodai, Fagerberg: Cache oblivious distribution sweeping. In: ICALP. (2002)
7. Demairie, E.D.: Cache-oblivious algorithms and data structures. In: Lecture Notes from the EEF Summer School on Massive Data Sets. Lecture Notes in Computer Science, BRIGS, University of Aarhus, Denmark (2002)
8. Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious β-trees. In IEEE, ed.: Annual Symposium on Foundations of Computer Science 2000, IEEE Computer Society Press (2000) 399-409
9. Misra, J., Cries, D.: Finding repeated elements. Science of Computer Programming 2 (1982) 143-152