Results 31 to 40 of about 2,178 (219)
Multicollision attacks and generalized iterated hash functions
Journal of Mathematical Cryptology, 2010 We apply combinatorics on words to develop an approach to multicollisions in generalized iterated hash functions. Our work is based on the discoveries of A. Joux and on generalizations provided by M. Nandi and D. Stinson as well as J. Hoch and A. Shamir.
Kortelainen Juha +2 more
doaj +1 more source
Analysis of the multiplicity matching parameter in suffix trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In a suffix tree, the multiplicity matching parameter (MMP) $M_n$ is the number of leaves in the subtree rooted at the branching point of the $(n+1)$st insertion.
Mark Daniel Ward, Wojciech Szpankowski
doaj +1 more source
Powers in a class of A-strict standard episturmian words [PDF]
, 2007 This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent ...
Glen, Amy, Glen, A.
core +2 more sources
Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Jernej Azarija +3 more
doaj +1 more source
, 2008 In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense.
Zamboni, L +12 more
core +2 more sources
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source
Counting words with Laguerre polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of formal sums of Laguerre polynomials.
Jair Taylor
doaj +1 more source
On Correlation Polynomials and Subword Complexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We consider words with letters from a $q-ary$ alphabet $\mathcal{A}$. The kth subword complexity of a word $w ∈\mathcal{A}^*$ is the number of distinct subwords of length $k$ that appear as contiguous subwords of $w$.
Irina Gheorghiciuc, Mark Daniel Ward
doaj +1 more source
Mini-Workshop: Combinatorics on Words [PDF]
, 2010 The area of combinatorics on words is concerned with properties of sequences of symbols. It is characteristic to the field that questions arise from various mathematical problems, and hence, many fundamental results on words have been established in ...
core +4 more sources
Protected node profile of Tries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some practical motivations, e.g., in organizational schemes, security models and social-network models.
Mehri Javanian
doaj +1 more source