Stacks have the capability to permute data by a series of push
and pop operations. It has been known for many years which permutations
can be generated and which can be sorted, and how to characterize them. We
shall review early work in the field, summarize some more recent work on
generalizations of a simple stack, and finally give some new results.
This information is available at
http://cgm.cs.mcgill.ca/~therese/seminar.
Direct questions, comments, additions to and removals from the mailing list, and
suggestions for speakers to Therese Biedl at
therese@cgm.cs.mcgill.ca.