## Found 13 Documents (Results 1–13)

100
MathJax

Full Text:

### Enumerating permutations sortable by $$k$$ passes through a pop-stack. (English)Zbl 1414.05007

MSC:  05A05 05A15
Full Text:

### Permutations sortable by two stacks in parallel and quarter plane walks. (English)Zbl 1301.05005

MSC:  05A05 05A15 68P10
Full Text:

### On the combinatorial identities of Abel-Hurwitz type and their use in constructive theory of functions. (English)Zbl 1240.41058

MSC:  41A35 41A20

### Classification of bijections between 321- and 132-avoiding permutations. (English)Zbl 1393.05010

Proceedings of the 20th annual international conference on formal power series and algebraic combinatorics, FPSAC 2008, Viña del Mar, Chile, June 23–27, 2008. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 495-506 (2008).
MSC:  05A05
Full Text:

### Classification of bijections between 321- and 132-avoiding permutations. (English)Zbl 1179.05006

MSC:  05A05 05A19
Full Text:

Full Text:

### Polynomial identities from weighted lattice path counting. (English)Zbl 0852.05013

MSC:  05A19 05A15
Full Text:

### Efficient algorithms for remainder computation and exponentiation of long numbers. (English. Russian original)Zbl 0902.11054

Cybern. Syst. Anal. 32, No. 3, 437-441 (1996); translation from Kibern. Sist. Anal. 1996, No. 3, 145-150 (1996).
MSC:  11Y16 68Q25
Full Text:

### The art of computer programming. Vol. 3: Sorting and searching. (English)Zbl 0302.68010

Addison-Wesley Series in Computer Science and Information Processing. Reading, Mass. etc.: Addison-Wesley Publishing Company. XI, 722 p. (1973).
Reviewer: Gerhard Maeß

### The art of computer programming. Vol. 2: Seminumerical algorithms. (English)Zbl 0191.18001

Addison-Wesley Series in Computer Science and Information Processing. Reading, Mass.: Addison-Wesley Publishing Company. XII, 624 p. (1969).
Reviewer: Gerhard Maeß
MSC:  68-02 68Nxx

all top 5

all top 3

all top 3