Zobrazeno 1 - 10
of 1 969
pro vyhledávání: '"A. Popoli"'
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which gives the
Externí odkaz:
http://arxiv.org/abs/2410.02409
Autor:
Popoli, Pierre, Stipulanti, Manon
The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence possesses go
Externí odkaz:
http://arxiv.org/abs/2408.14059
Autor:
Mermoud, Dylan Laplace, Popoli, Pierre
Publikováno v:
EPTCS 403, 2024, pp. 128-133
In cooperative game theory, the social configurations of players are modeled by balanced collections. The Bondareva-Shapley theorem, perhaps the most fundamental theorem in cooperative game theory, characterizes the existence of solutions to the game
Externí odkaz:
http://arxiv.org/abs/2406.16409
Autor:
Popoli, Pierre
The correlation measure of order $k$ is a measure of pseudorandomness that quantifies the similarity between a sequence and its shifts. It is known that the correlation of order 4 is large for the Rudin-Shapiro sequence despite having nice pseudorand
Externí odkaz:
http://arxiv.org/abs/2306.10629
Let $s(n)$ denote the sum of digits in the binary expansion of the integer $n$. Hare, Laishram and Stoll (2011) studied the number of odd integers such that $s(n)=s(n^2)=k$, for a given integer $k\geq 1$. The remaining cases that could not be treated
Externí odkaz:
http://arxiv.org/abs/2203.05451
Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation measure of order 2 is large. These sequences are highly predictable desp
Externí odkaz:
http://arxiv.org/abs/2106.09959
Autor:
Popoli, Pierre
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 large. These facts imply that these sequences are highly predictable des
Externí odkaz:
http://arxiv.org/abs/2011.03457
Autor:
Panetta, Valentina, Gaeta, Giovanni Battista, Filomia, Roberto, Coco, Barbara, Monti, Monica, Amoruso, Daniela Caterina, Madonia, Salvatore, Ieluzzi, Donatella, Taliani, Gloria, Badia, Lorenzo, Migliorino, Guglielmo Marco, Giorgini, Alessia, Masarone, Mario, Blanc, Pierluigi, Cossiga, Valentina, De Siena, Martina, Tata, Xhimi, Rumi, Maria Grazia, Chessa, Luchino, Lampertico, Pietro, Ferrari, Carlo, Gentile, Ivan, Parruti, Giustino, Baiocchi, Leonardo, Ciancio, Alessia, Invernizzi, Pietro, Federico, Alessandro, Torti, Carlo, Morsica, Giulia, Andreone, Pietro, Aghemo, Alessio, Popoli, Patrizia, Vella, Stefano, Kondili, Loreta A., Quaranta, Maria Giovanna, Cavalletto, Luisa, Calvaruso, Vincenza, Ferrigno, Luigina, D'Ambrosio, Roberta, Simonelli, Ilaria, Brancaccio, Giuseppina, Raimondo, Giovanni, Brunetto, Maurizia R., Zignego, Anna Linda, Coppola, Carmine, Iannone, Andrea, Biliotti, Elisa, Verucchi, Gabriella, Massari, Marco, Licata, Anna, Barbaro, Francesco, Persico, Marcello, Russo, Francesco Paolo, Morisco, Filomena, Pompili, Maurizio, Viganò, Mauro, Puoti, Massimo, Santantonio, Teresa, Villa, Erica, Craxì, Antonio, Chemello, Liliana
Publikováno v:
In Digestive and Liver Disease July 2023 55(7):907-917
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Theoretical Computer Science 4 January 2023 939:119-139