◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Popoli

3 papers hereh-index 210 citations6 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • middle author1

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • math.NT3
same name
  • P. Popoli — 7 papers, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20202023
most citedMaximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences

5 citations · 5 across the 3 of their papers we have counts for

collaborators
Showing 2020 · math.NTShow all

1 paper · 2 filters

math.NT2020

On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values

Pierre Popoli

Both the Thue-Morse and Rudin-Shapiro sequences are not suitable sequences for cryptography since their expansion complexity is small and their correlation measure of order 2 is la…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.