This story is based upon a research article, On the Cause of the 1930s Dust Bowl, recently published by Siegfried D. Schubert, Max J. Suarez, Philip J. Pegion , Randal D. Koster, and Julio T. Bacmeister in the March 19, 2004 edition of SCIENCE Magazine.
short stack(Noun) A relatively small amount of chips relative to the stakes. short stack(Noun) An amount of chips which is far less than the average in the tournament. short stack(Noun) A player who is in possession of a short stack. short stack(Noun) Two pancakes one on top of the other, as opposed to a stack of three.
In computer science, a stack or LIFO (last in, first out) is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the last element that was added.n example is top of stack, or  peek , which observes the top-most element without removing it from the stack. Since this can be done with a pop and a push with the same data, it is not essential. An underflow condition can occur in the stack top operation if the stack is empty, the same as pop.