SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Mathematics

Volumn 240, Issue 1-3, 2001, Pages 97-122

Loopless generation of up-down permutations

(1) Korsh, James F a

a Temple University (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035964593 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/S0012-365X(00)00387-3 Document Type: Article

Times cited : (7)

References (18)

1
- 0001185301
- Sur les permutations alternees
- D. Andre, Sur les permutations alternees, J. Math. Pures Appl. 7 (1881) 167-184.
- (1881) J. Math. Pures Appl. , vol.7 , pp. 167-184
- Andre, D.¹

2
- 0022420725
- On zigzag permutations and comparisons of adjacent elements
- M.D. Atkinson, On zigzag permutations and comparisons of adjacent elements, Inform. Process. Lett. 21 (1985) 187-189.
- (1985) Inform. Process. Lett. , vol.21 , pp. 187-189
- Atkinson, M.D.¹

3
- 0012247039
- Generating alternating permutations lexicographically
- B. Bauslaugh, F. Ruskey, Generating alternating permutations lexicographically, BIT 30 (1990) 17-26.
- (1990) BIT , vol.30 , pp. 17-26
- Bauslaugh, B.¹ Ruskey, F.²

4
- 0016994626
- Efficient generation of the binary reflected Gray code and its applications
- J.R. Bitner, G. Ehrlich, E.M. Reingold, Efficient generation of the binary reflected Gray code and its applications, Commun. ACM 19 (1976) 517-521.
- (1976) Commun. ACM , vol.19 , pp. 517-521
- Bitner, J.R.¹ Ehrlich, G.² Reingold, E.M.³

5
- 0002379536
- A loop-free algorithm for generating the linear extensions of a poset
- E.R. Canfield, S.G. Williamson, A loop-free algorithm for generating the linear extensions of a poset, Order 12 (1995) 57-75.
- (1995) Order , vol.12 , pp. 57-75
- Canfield, E.R.¹ Williamson, S.G.²

6
- 0016452003
- A simplified loop-free algorithm for generating permutations
- N. Dershowitz, A simplified loop-free algorithm for generating permutations, BIT 15 (1975) 158-164.
- (1975) BIT , vol.15 , pp. 158-164
- Dershowitz, N.¹

7
- 84976704458
- Algorithm 466: Four combinatorial algorithms
- G. Ehrlich, Algorithm 466: four combinatorial algorithms, Commun. ACM 16 (1973) 690-691.
- (1973) Commun. ACM , vol.16 , pp. 690-691
- Ehrlich, G.¹

8
- 84976666253
- Loopless algorithms for generating permutations, combinations, and other combinatorial objects
- G. Ehrlich, Loopless algorithms for generating permutations, combinations, and other combinatorial objects, J. ACM 20 (1973) 500-513.
- (1973) J. ACM , vol.20 , pp. 500-513
- Ehrlich, G.¹

9
- 0007826035
- On the generation of all topological sortings
- D. Kalvin, Y.L. Varol, On the generation of all topological sortings, J. Algorithms 4 (1983) 150-162.
- (1983) J. Algorithms , vol.4 , pp. 150-162
- Kalvin, D.¹ Varol, Y.L.²

10
- 0021424930
- On two problems reducible to topological sorting
- D. Kalvin, Y.L. Varol, On two problems reducible to topological sorting, Comput. J. 27 (1984) 176-177.
- (1984) Comput. J. , vol.27 , pp. 176-177
- Kalvin, D.¹ Varol, Y.L.²

11
- 0000379410
- Generating multiset permutations in constant time
- J.F. Korsh, S. Lipschutz, Generating multiset permutations in constant time, J. Algorithms 25 (1997) 321-335.
- (1997) J. Algorithms , vol.25 , pp. 321-335
- Korsh, J.F.¹ Lipschutz, S.²

12
- 0347957422
- Generating the linear extensions of certain posets by transpositions
- G. Pruesse, F. Ruskey, Generating the linear extensions of certain posets by transpositions, SIAM J. Discrete Math. 4 (1991) 413-422.
- (1991) SIAM J. Discrete Math. , vol.4 , pp. 413-422
- Pruesse, G.¹ Ruskey, F.²

13
- 0026202470
- A loopless algorithm for generating binary tree sequences
- D. Roelants van Baronaigien, A loopless algorithm for generating binary tree sequences, Inform. Process. Lett. 39 (1991) 189-194.
- (1991) Inform. Process. Lett. , vol.39 , pp. 189-194
- Roelants Van Baronaigien, D.¹

14
- 0039839315
- Generating permutations with given ups and downs
- D. Roelants van Baronaigien, F. Ruskey, Generating permutations with given ups and downs, Discrete Appl. Math. 36 (1992) 57-65.
- (1992) Discrete Appl. Math. , vol.36 , pp. 57-65
- Roelants Van Baronaigien, D.¹ Ruskey, F.²

15
- 0033075120
- A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
- D. Roelants van Baronaigien, A multi-stack method for the fast generation of permutations with minimal length increasing subsequences, Infom. Process. Lett. 69 (1999) 123-126.
- (1999) Infom. Process. Lett. , vol.69 , pp. 123-126
- Roelants Van Baronaigien, D.¹

16
- 0009371733
- Fast recursive algorithms for generating combinatorial objects
- F. Ruskey, D. Roelants van Baronaigien, Fast recursive algorithms for generating combinatorial objects, Congr. Numer. 41 (1984) 53-62.
- (1984) Congr. Numer. , vol.41 , pp. 53-62
- Ruskey, F.¹ Roelants Van Baronaigien, D.²

17
- 0347327174
- Transposition generation of alternating permutations
- F. Ruskey, Transposition generation of alternating permutations, Order 6 (1989) 227-233.
- (1989) Order , vol.6 , pp. 227-233
- Ruskey, F.¹

18
- 0347327175
- The number of permutations with a given signature, and the expectations of their elements
- G.G. Szpiro, The number of permutations with a given signature, and the expectations of their elements, Discrete Math. 226 (2001) 423-430.
- (2001) Discrete Math. , vol.226 , pp. 423-430
- Szpiro, G.G.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.