New results in minimum-comparison sorting

Algorithmica (New York)

Volumn 40, Issue 2, 2004, Pages 133-145

  Peczarski, Marcin ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Counting linear extensions; Optimal sorting; The Ford Johnson algorithm

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; LINEAR EQUATIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

COMPUTER SEARCH; COUNTING LINEAR EXTENSIONS; OPTIMAL SORTING; THE FORD-JOHNSON ALGORITHM;

COMPUTER SYSTEMS PROGRAMMING;

EID: 21044433170     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1100-7     Document Type: Article

References (12)

1. G. Brightwell and P. Winkler, Counting Linear Extensions, Order, 8 (1991), 225-242.
2. L. Ford and S. Johnson, A Tournament Problem, American Mathematical Monthly, 66 (1959), 387-389.
3. J. Kahn and M. Saks, Balancing Poset Extensions, Order, 1 (1984), 113-126.
4. D. E. Knuth, The Art of Computer Programming, Volume 3, 2nd edn., Addison-Wesley, Reading, MA, 1998.
5. D. E. Knuth, Generating All Permutations, in The Art of Computer Programming, Addison-Wesley, Reading, MA, 2002, Pre-Fascicle 2B.
6. D. E. Knuth and E. B. Kaehler, An Experiment in Optimal Sorting, Information Processing Letters, 1 (1972), 173-176.
7. M. Peczarski, Sorting 13 Elements Requires 34 Comparisons, in Proceedings of the 10th Annual European Symposium on Algorithms (R. Möhring and R. Raman, eds.), Lecture Notes in Computer Science, vol 2461, Springer-Verlag, Berlin, 2002, pp. 785-794.
8. M. Peczarski, Home Page, http://www.mimuw.edu.pl/~marpe.
9. G. Pruesse and F. Ruskey, Generating Linear Extensions Fast, SIAM Journal on Computing, 23 (1994), 373-386.
10. J. R. Ullman, An Algorithm for Subgraph Isomorphism, Journal of the ACM, 23 (1976), 31-42.
11. M. Wells, Elements of Combinatorial Computing, Pergamon Press, Oxford, 1971.
12. The Combinatorial Object Server, http://www.theory.csc.uvic.ca/~cos.