- 1 THACHER, H. C., JR. Certification of algorithm 60. Comm. ACM 5 (Mar. 1962), 168. Google ScholarDigital Library
- 2 BUCHNER, K. H. Certification of algorithm 60. Comm. ACM 5 (May, 1962), 281. Google ScholarDigital Library
- 3 FETTIS, H. E. Algorithm 163, modified Hankel function. Comm. ACM 6 (Apr. 1963), 161-2; 6 (Sep. 1963), 522. Google ScholarDigital Library
- 4 RUTISHAUSER, H. Ausdehnung des Rombergschen Prinzips. Numer. Math. 5 (1963), 48-54.Google ScholarDigital Library
- 5 McKEEMAN, W. M. Personal communication, Sept. 1963.Google Scholar
- 6 ENGELI, M. Personal communication, Jan. 1964.Google Scholar
- 7 BAUER, F. L., RUTISHAUSER, H., AND STIEFELE, E. New aspects in numerical quadrature. Proc. Symp. Appl. Math 15, 1963, 199-218.Google ScholarCross Ref
Index Terms
- Algorithm 235: Random permutation
Recommendations
Permutation tableaux and permutation patterns
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the -diagrams of Alex Postnikov [A. Postnikov, Webs in ...
On the sign-imbalance of permutation tableaux
Permutation tableaux were introduced by Steingrmsson and Williams. Corteel and Kim defined the sign of a permutation tableau in terms of the number of unrestricted columns. The sign-imbalance of permutation tableaux of length n is the sum of signs over ...
The sorting index and permutation codes
In the combinatorial study of the coefficients of a bivariate polynomial that generalizes both the length and the reflection length generating functions for finite Coxeter groups, Petersen introduced a new Mahonian statistic sor, called the sorting ...
Comments