"On a Greedy Algorithm to Construct Universal Cycles for Permutations."

Alice L. L. Gao et al. (2019)

> Home

Details and statistics

DOI: 10.1142/S0129054119400033

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/GaoKSZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/GaoKSZ19
Alice L. L. Gao, Sergey Kitaev, Wolfgang Steiner, Philip B. Zhang:
On a Greedy Algorithm to Construct Universal Cycles for Permutations. Int. J. Found. Comput. Sci. 30(1): 61-72 (2019)

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.