"Stack words and a bound for 3-stack sortable permutations."

Miklós Bóna (2020)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2020.03.028

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/Bona20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Bona20
Miklós Bóna:
Stack words and a bound for 3-stack sortable permutations. Discret. Appl. Math. 284: 602-605 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.