Author:
Cosnard Michel,Ferreira Afonso G.
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest and R.E. Tarjan, "Time bounds for selection", JCSS, 7 (1973), pp 448–461
2. M. Cosnard, J. Duprat and A.G. Ferreira, "The complexity of searching in X + Y and other multisets", Information Processing Letters, 34 (1990) 103–109
3. M.L.Fredman, "Two applications of a probabilistic search technique: sorting X + Y and building balanced search trees", in Proc. 7-th Annual ACM Symp. on Theory of Computing, (May 1975), ACM, 1975, pp 240–244
4. G.N. Frederickson and D.B. Johnson, "The complexity of selection and ranking in X + Y and matrices with sorted columns", JCSS 24 (1982), pp 197–208
5. G.N. Frederickson and D.B. Johnson, "Generalized selection and ranking: sorted matrices", SIAM J. Comput. 13 (1), Feb 1984, pp 197–208