The complexity of sorting with networks of stacks and queues

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5193 LNCS, Issue , 2008, Pages 417-429

  Felsner, Stefan ^a   Pergel, Martin ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ADJACENT NODES; INPUT NODE; LOWER BOUNDS; STORAGE ELEMENTS; TWO-STACK;

COMPLEX NETWORKS;

EID: 57749196695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_35     Document Type: Conference Paper

References (8)

1. Amato, N., Blum, M., Irani, S., Rubinfeld, R.: Reversing trains: a turn of the century sorting problem. J. Alg. 10, 413-428 (1989)
2. Atkinson, M.D., Livesy, M.J., Tulley, D.: Permutations generated by token passing in graphs. Theor. Comput. Sci. 178, 103-118 (1997)
3. Bona, M.: A survey of stack-sorting disciplines. Electr. J. Combin. 9(2), 16 pages (2003)
4. Bóna, M.: Combinatorics of Permutations. Chapman & Hall, Boca Raton (2004)
5. Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol. 1. Addison-Wesley, Reading (updated and revised) (1997)
6. König, F.G., Lübbecke, M.E.: Sorting with Complete Networks of Stacks, TU Berlin, Mathematik (preprint, 036-2007)
7. König, F.G., Lübbecke, M.E., Möhring, R.H., Schäfer, G., Spenke, I.: Solutions to real-world instances of Pspace-complete stacking. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 729-740. Springer, Heidelberg (2007)
8. Tarjan, R.: Sorting using networks of queues and stacks. J. Assoc. Comput. Mach. 19, 341-346 (1972)