Sorting with a forklift

Electronic Journal of Combinatorics

Volumn 9, Issue 2 R, 2003, Pages

  Albert, M H ^a   Atkinson, M D ^a  

^a UNIVERSITY OF OTAGO   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042632052     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. M. D. Atkinson: Restricted permutations, Discrete Math. 195 (1999), 27-38.
2. M. D. Atkinson: Generalised stack permutations, Combinatorics, Probability and Computing 7 (1998), 239-246.
3. N. Chomsky and M. P. Schützenberger: The Algebraic Theory of Context-Free Languages, in: Computer programming and formal systems ed. P. Braffort, D. Hirschberg, North Holland, Amsterdam, 1963, 118-161.
4. P. Flajolet and A. M. Odlyzko: Singularity analysis of generating functions. SIAM Jour. Disc. Math. 2 (1990), 216-240.
5. P. Flajolet and R. Sedgwick: The Average Case Analysis of Algorithms, Complex Asymptotics and Generating Functions. INRIA Research Report 2026, 1993.
6. I. P. Goulden, D. M. Jackson: Combinatorial Enumeration, John Wiley and Sons, New York, 1983.
7. J. E. Hopcroft, J. D Ullman: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass. (1979).
8. D. E. Knuth: Fundamental Algorithms, The Art of Computer Programming Vol. 1 (First Edition), Addison-Wesley, Reading, Mass. (1967).
9. V. R. Pratt: Computing permutations with double-ended queues, parallel stacks and parallel queues, Proc. ACM Symp. Theory of Computing 5 (1973), 268-277.
10. N. J. A. Sloane: The Online Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences/, 2002.
11. R. E. Tarjan: Sorting using networks of queues and stacks, Journal of the ACM 19 (1972), 341-346.
12. H. S. Wilf: generatingfunctionology, Academic Press, New York, 1993.