Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-5
|
Results: 5
Sorting using heap structure
Authors:
Chowdhury, RA Kaykobad, M
Citation:
Ra. Chowdhury et M. Kaykobad, Sorting using heap structure, INT J COM M, 77(3), 2001, pp. 347-354
The heap-mergesort
Authors:
Chowdhury, RA Nath, SK Kaykobad, M
Citation:
Ra. Chowdhury et al., The heap-mergesort, COMPUT MATH, 39(7-8), 2000, pp. 193-197
Calculating the square root with arbitrary order of convergence
Authors:
Chowdhury, RA Kaykobad, M
Citation:
Ra. Chowdhury et M. Kaykobad, Calculating the square root with arbitrary order of convergence, INT J COM M, 75(3), 2000, pp. 297-302
A simplified complexity analysis of McDiarmid and Reed's variant of BOTTOM-UP-HEAPSORT
Authors:
Chowdhury, RA Kaykobad, M Nath, SK
Citation:
Ra. Chowdhury et al., A simplified complexity analysis of McDiarmid and Reed's variant of BOTTOM-UP-HEAPSORT, INT J COM M, 73(3), 2000, pp. 293-297
On average edge length of minimum spanning trees
Authors:
Nath, SK Chowdhury, RA Kaykobad, M
Citation:
Sk. Nath et al., On average edge length of minimum spanning trees, INF PROCESS, 70(5), 1999, pp. 241-243
Risultati:
1-5
|