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

메뉴 건너뛰기

Discrete Mathematics

Volumn 259, Issue 1-3, 2002, Pages 19-36

Restricted permutations and the wreath product

(2) Atkinson, M D a Stitt, T b

a UNIVERSITY OF OTAGO (New Zealand)

b UNIVERSITY OF ST ANDREWS (United Kingdom)

Author keywords

Basis; Enumeration; Forbidden; Permutation; Restricted; Sequence; Subsequence

Indexed keywords

EID: 31244436203 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/S0012-365X(02)00443-0 Document Type: Article

Times cited : (63)

References (18)

1
- 0032283257
- Generalised stack permutations
- M.D. Atkinson, Generalised stack permutations, Combin. Probab. Comput. 7 (1998) 239-246.
- (1998) Combin. Probab. Comput. , vol.7 , pp. 239-246
- Atkinson, M.D.¹

2
- 0141438295
- Permutations which are the union of an increasing and a decreasing sequence
- Paper R6
- M.D. Atkinson, Permutations which are the union of an increasing and a decreasing sequence, Electron. J. Combin. 5 (1998) Paper R6 (13pp.).
- (1998) Electron. J. Combin. , vol.5
- Atkinson, M.D.¹

3
- 0003373725
- Restricted permutations
- M.D. Atkinson, Restricted permutations, Discrete Math. 195 (1999) 27-38.
- (1999) Discrete Math. , vol.195 , pp. 27-38
- Atkinson, M.D.¹

4
- 33845801475
- Permuting mechanisms and closed classes of permutations
- Combinatorics, Computation & Logic, in: C.S. Calude, M.J. Dineen (Eds.), Proceedings of DMTCS '99, and CATS '99, Auckland, 18-21 January, Springer, Singapore
- M.D. Atkinson, R. Beals, Permuting mechanisms and closed classes of permutations, Australian Computer Science Communications, Vol. 21 (3), Combinatorics, Computation & Logic, in: C.S. Calude, M.J. Dineen (Eds.), Proceedings of DMTCS '99, and CATS '99, Auckland, 18-21 January, Springer, Singapore, 1999, pp. 117-127.
- (1999) Australian Computer Science Communications , vol.21 , Issue.3 , pp. 117-127
- Atkinson, M.D.¹ Beals, R.²

5
- 0009351065
- On pop-stacks in series
- D. Avis, M. Newborn, On pop-stacks in series, Utilitas Math. 19 (1981) 129-140.
- (1981) Utilitas Math. , vol.19 , pp. 129-140
- Avis, D.¹ Newborn, M.²

6
- 0002921232
- Permutations avoiding certain patterns; the case of length 4 and generalizations
- M. Bóna, Permutations avoiding certain patterns; the case of length 4 and generalizations, Discrete Math. 175 (1997) 55-67.
- (1997) Discrete Math. , vol.175 , pp. 55-67
- Bóna, M.¹

7
- 0000150371
- Exact enumeration of 1342-avoiding permutations; A close link with labeled trees and planar maps
- M. Bóna, Exact enumeration of 1342-avoiding permutations; A close link with labeled trees and planar maps, J. Combin. Theory Ser. A 80 (1997) 257-272.
- (1997) J. Combin. Theory Ser. A , vol.80 , pp. 257-272
- Bóna, M.¹

8
- 0001753738
- Pattern matching for permutations
- P. Bose, J.F. Buss, A. Lubiw, Pattern matching for permutations, Inform. Process. Lett. 65 (1998) 277-283.
- (1998) Inform. Process. Lett. , vol.65 , pp. 277-283
- Bose, P.¹ Buss, J.F.² Lubiw, A.³

9
- 0001135606
- Fundamental Algorithms
- Addison-Wesley, Reading, MA
- D.E. Knuth, Fundamental Algorithms, The Art of Computer Programming, Vol. 1, 2nd Edition, Addison-Wesley, Reading, MA, 1973.
- (1973) The Art of Computer Programming, Vol. 1, 2nd Edition , vol.1
- Knuth, D.E.¹

10
- 0030527058
- The enumeration of permutations with a prescribed number of forbidden patterns
- J. Noonan, D. Zeilberger, The enumeration of permutations with a prescribed number of forbidden patterns, Adv. in Appl. Math. 17 (1996) 381-407.
- (1996) Adv. in Appl. Math. , vol.17 , pp. 381-407
- Noonan, J.¹ Zeilberger, D.²

11
- 0015770335
- Computing permutations with double-ended queues, parallel stacks and parallel queues
- V.R. Pratt, Computing permutations with double-ended queues, parallel stacks and parallel queues, Proc. ACM Symp. Theory Comput. 5 (1973) 268-277.
- (1973) Proc. ACM Symp. Theory Comput. , vol.5 , pp. 268-277
- Pratt, V.R.¹

12
- 0000526470
- Bootstrap percolation, the Schröder number, and the N-kings problem
- L. Shapiro, A.B. Stephens, Bootstrap percolation, the Schröder number, and the N-kings problem, SIAM J. Discrete Math. 2 (1991) 275-280.
- (1991) SIAM J. Discrete Math. , vol.2 , pp. 275-280
- Shapiro, L.¹ Stephens, A.B.²

13
- 84861133916
- Restricted permutations
- R. Simion, F.W. Schmidt, Restricted permutations, European J. Combin. 6 (1985) 383-406.
- (1985) European J. Combin. , vol.6 , pp. 383-406
- Simion, R.¹ Schmidt, F.W.²

14
- 0000123938
- Forbidden subsequences
- Z.E. Stankova, Forbidden subsequences, Discrete Math. 132 (1994) 291-316.
- (1994) Discrete Math. , vol.132 , pp. 291-316
- Stankova, Z.E.¹

15
- 21344442884
- Classification of forbidden subsequences of length 4
- Z.E. Stankova, Classification of forbidden subsequences of length 4, European J. Combin. 17(5) (1996) 501-517.
- (1996) European J. Combin. , vol.17 , Issue.5 , pp. 501-517
- Stankova, Z.E.¹

16
- 84976820924
- Sorting using networks of queues and stacks
- R.E. Tarjan, Sorting using networks of queues and stacks, J. ACM 19 (1972) 341-346.
- (1972) J. ACM , vol.19 , pp. 341-346
- Tarjan, R.E.¹

17
- 0000464149
- Generating trees and the Catalan and Schröder numbers
- J. West, Generating trees and the Catalan and Schröder numbers, Discrete Math. 146 (1995) 247-262.
- (1995) Discrete Math. , vol.146 , pp. 247-262
- West, J.¹

18
- 0000164922
- Generating trees and forbidden sequences
- J. West, Generating trees and forbidden sequences, Discrete Math. 157 (1996) 363-374.
- (1996) Discrete Math. , vol.157 , pp. 363-374
- West, J.¹

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