-
1
-
-
85029487505
-
The I/O Complexity of Sorting and Related Problems. Proceedings of 14th ICALP (1987)
-
Springer Verlag
-
Aggarwal, A., Vitter, J.S.: The I/O Complexity of Sorting and Related Problems. Proceedings of 14th ICALP (1987), Lecture Notes in Computer Science 267, Springer Verlag, 467–478
-
Lecture Notes in Computer Science
, vol.267
, pp. 467-478
-
-
Aggarwal, A.1
Vitter, J.S.2
-
2
-
-
0024082546
-
The Input/Output Complexity of Sorting and Related Problems
-
The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM, Vol 31 (9) (1988) 1116–1127.
-
(1988)
Communications of the ACM
, vol.31
, Issue.9
, pp. 1116-1127
-
-
-
3
-
-
0020879158
-
Lower bounds for algebraic computation trees
-
Ben-Or, M.: Lower bounds for algebraic computation trees. Proceedings of 15th STOC (1983), 80–86.
-
(1983)
Proceedings of 15Th STOC
, pp. 80-86
-
-
Ben-Or, M.1
-
4
-
-
0015865168
-
Time bounds for selection
-
Blum, M., Floyd, R.W, Pratt, V.R, Rivest, R.L, Tarjan, R.E.: Time bounds for selection. Journal of Computer and System Sciences, 7(4) (1972), 448–461.
-
(1972)
Journal of Computer and System Sciences
, vol.7
, Issue.4
, pp. 448-461
-
-
Blum, M.1
Floyd, R.W.2
Pratt, V.R.3
Rivest, R.L.4
Tarjan, R.E.5
-
5
-
-
84906660734
-
-
M.Sc. Thesis, Aarhus University, November
-
Knudsen, M., Larsen, K.,: I/O-complexity of comparison and permutation problems. M.Sc. Thesis, Aarhus University, November 1992.
-
(1992)
I/O-Complexity of Comparison and Permutation Problems
-
-
Knudsen, M.1
Larsen, K.2
-
6
-
-
85029479089
-
-
Sorting and Searching, Addison-Wesley
-
Knuth, D.E.: The Art of Computer Programming, Vol 3: Sorting and Searching, Addison-Wesley (1973) (p. 205–206).
-
(1973)
The Art of Computer Programming
, vol.3
, pp. 205-206
-
-
Knuth, D.E.1
-
7
-
-
0020202558
-
Finding Repeated Elements
-
North-Holland Publishing
-
Misra, J., Gries, D.: Finding Repeated Elements. Science of Computer Programming 2 (1982), 143–152, North-Holland Publishing.
-
(1982)
Science of Computer Programming
, vol.2
, pp. 143-152
-
-
Misra, J.1
Gries, D.2
-
8
-
-
1542710191
-
Sorting Multisets and Vectors In-Place. Proceedings of 2nd WADS
-
Springer Verlag
-
Munro, J.I., Raman, V.: Sorting Multisets and Vectors In-Place. Proceedings of 2nd WADS, Lecture Notes in Computer Science 519, Springer Verlag (1991), 473–479.
-
(1991)
Lecture Notes in Computer Science
, vol.519
, pp. 473-479
-
-
Munro, J.I.1
Raman, V.2
-
9
-
-
27144461951
-
Sorting and Searching in Multisets
-
Munro, I., Spira, P.M.: Sorting and Searching in Multisets. SIAM Journal of Computing, 5 (1) (1976) 1–8.
-
(1976)
SIAM Journal of Computing
, vol.5
, Issue.1
, pp. 1-8
-
-
Munro, I.1
Spira, P.M.2
-
11
-
-
84958084953
-
Efficient Memory Access in Large-Scale Computation (Invited paper)
-
Vitter, J.S: Efficient Memory Access in Large-Scale Computation (invited paper). Proceedings of 8th STACS (1991), 26–41.
-
(1991)
Proceedings of 8Th STACS
, pp. 26-41
-
-
Vitter, J.S.1
|