A Note on Synthesis and Classification of Sorting Algorithms

A Note on Synthesis and Classification of Sorting Algorithms (1989)

Cached

Download Links

[ftp.cs.man.ac.uk]

Other Repositories/Bibliography

DBLP

by K. K. Lau

Venue:	Acta Informatica
Citations:	7 - 4 self

BibTeX

@ARTICLE{Lau89anote,
    author = {K. K. Lau},
    title = {A Note on Synthesis and Classification of Sorting Algorithms},
    journal = {Acta Informatica},
    year = {1989},
    volume = {27},
    pages = {73--80}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

this paper, and the referees for their very helpful comments and constructive suggestions which greatly improved an earlier version of this paper. References

Citations

1310	A disciplne of programming - Dijkstra - 1976
533	A transformation system for developing recursive programs - Burstall, Darlington - 1977
321	The Art of Computer Programming, vol. 3: Sorting and Searching - Knuth - 1973
137	Data Structures and Algorithms 1: Sorting and Searching - Mehlhorn - 1984
51	Top-down synthesis of divide-and-conquer algorithms - Smith - 1985
40	A synthesis of several sorting algorithms - Darlington - 1978
35	Synthesis: Dreams =⇒ programs - Manna, Waldinger - 1979
33	A taxonomy of parallel sorting - Bitton, DeWitt, et al. - 1984
22	On Program Synthesis Knowledge - Green, Barstow
16	Algorithm classification through synthesis - Clark, Darlington - 1980
12	The design of divide and conquer algorithms - Smith - 1985
8	Program transformation by data structure mapping - Hansson, Tarnlund - 1982
6	A class of sorting algorithms based on quicksort - Wainwright - 1985
4	Remarks on "A synthesis of several sorting algorithms - Barstow - 1980
4	Derivation of sorting algorithms from a specification - Dromey - 1987
4	Synthesis of logic programs for recursive sorting algorithm - Lau, Prestwich - 1988