"Maximum order complexity of the sum of digits function in Zeckendorf base ..."

Damien Jamet, Pierre Popoli, Thomas Stoll (2021)

> Home

Details and statistics

DOI: 10.1007/S12095-021-00507-W

access: open

type: Journal Article

metadata version: 2023-01-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ccds/JametPS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ccds/JametPS21
Damien Jamet, Pierre Popoli, Thomas Stoll:
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences. Cryptogr. Commun. 13(5): 791-814 (2021)

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.