DATA MOVEMENT IN ODD-EVEN MERGING.SEDGEWICK R.1978; S.I.A.M.J. COMPUTG; USA; DA. 1978; VOL. 7; NO 3; PP. 239-272; BIBL. 15 REF.Article

IMPLEMENTING QUICKSORT PROGRAMSSEDGEWICK R.1978; COMMUNIC. A.C.M.; USA; DA. 1978; VOL. 21; NO 10; PP. 847-857; BIBL. 21 REF.Article

A new upper bound for shellsortSEDGEWICK, R.Journal of algorithms (Print). 1986, Vol 7, Num 2, pp 159-173, issn 0196-6774Article

THE COMPLEXITY OF FINDING CYCLES IN PERIODIC FUNCTIONSSEDGEWICK R; SZYMANSKI TG; YAO AC et al.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 376-390; BIBL. 5 REF.Article

Tight lower bounds for shellsortWEISS, M. A; SEDGEWICK, R.Journal of algorithms (Print). 1990, Vol 11, Num 2, pp 242-251, issn 0196-6774, 10 p.Article

Digital search trees revisitedFLAJOLET, P; SEDGEWICK, R.SIAM journal on computing (Print). 1986, Vol 15, Num 3, pp 748-767, issn 0097-5397Article

Bad cases of shaker-sortWEISS, M. A; SEDGEWICK, R.Information processing letters. 1988, Vol 28, Num 3, pp 133-136, issn 0020-0190Article

Practical variations of shellsortINCERPI, J; SEDGEWICK, R.Information processing letters. 1987, Vol 26, Num 1, pp 37-43, issn 0020-0190Article

Resizable arrays in optimal time and spaceBRODNIK, A; CARLSSON, S; DEMAINE, E. D et al.Lecture notes in computer science. 1999, pp 37-48, issn 0302-9743, isbn 3-540-66279-0Conference Paper

Mellin transforms and asymptoptics : finite differences and Rice's integralsFLAJOLET, P; SEDGEWICK, R.Theoretical computer science. 1995, Vol 144, Num 1-2, pp 101-124, issn 0304-3975Article