Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("SEDGEWICK, R")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 19 of 19

  • Page / 1

Export

Selection :

  • and

THE ANALYSIS OF QUICKSORT PROGRAMS.SEDGEWICK R.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 7; NO 4; PP. 327-355; BIBL. 1 P.Article

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

PERMUTATION GENERATION METHODS.SEDGEWICK R.1977; COMPUTG SURV.; U.S.A.; DA. 1977; VOL. 9; NO 2; PP. 137-164; BIBL. 1 P. 1/2Article

QUICKSORT WITH EQUAL KEYS.SEDGEWICK R.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 2; PP. 240-267; BIBL. 15 REF.Article

COMPUTER GRAPHICS FOR DRAFTING.SEDGEWICK R.1974; COMPUTER GRAPH. IMAGE PROCESSG; U.S.A.; DA. 1974; VOL. 3; NO 2; PP. 91-124; BIBL. 7 P.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

PROGRAMMING ASPECTS OF VLSI (PRELIMINARY VERSION)LIPTON RJ; SEDGEWICK R; VALDES J et al.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 57-65; BIBL. 12 REF.Conference Paper

The analysis of heapsortSCHAFFER, R; SEDGEWICK, R.Journal of algorithms (Print). 1993, Vol 15, Num 1, pp 76-100, issn 0196-6774Article

Queue-mergesortGOLIN, M. J; SEDGEWICK, R.Information processing letters. 1993, Vol 48, Num 5, pp 253-259, issn 0020-0190Article

More on shellsort increment sequencesWEISS, M. A; SEDGEWICK, R.Information processing letters. 1990, Vol 34, Num 5, pp 267-270, issn 0020-0190Article

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

VLSI layout as programmingLIPTON, R. J; VALDES, J; VIJAYAN, G et al.ACM transactions on programming languages and systems. 1983, Vol 5, Num 3, pp 405-421, issn 0164-0925Article

  • Page / 1