Sciweavers

11 search results - page 1 / 3
» Crucial Words for Abelian Powers
Sort
View
DAM
2010
80views more  DAM 2010»
13 years 5 months ago
On shortest crucial words avoiding abelian powers
Let k 2 be an integer. An abelian k-th power is a word of the form X1X2
Sergey V. Avgustinovich, Amy Glen, Bjarni V. Halld...
DLT
2009
13 years 3 months ago
Crucial Words for Abelian Powers
A word is crucial with respect to a given set of prohibited words (or simply prohibitions) if it avoids the prohibitions but it cannot be extended to the right by any letter of its...
Amy Glen, Bjarni V. Halldórsson, Sergey Kit...
PE
2000
Springer
101views Optimization» more  PE 2000»
13 years 5 months ago
On the convergence of the power series algorithm
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...
Gerard Hooghiemstra, Ger Koole
AAECC
2009
Springer
136views Algorithms» more  AAECC 2009»
14 years 2 hour ago
There Are Not Non-obvious Cyclic Affine-invariant Codes
We show that an affine-invariant code C of length pm is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or it...
José Joaquín Bernal, Ángel de...
CN
2006
69views more  CN 2006»
13 years 5 months ago
A framework for realistic and systematic multicast performance evaluation
Previous multicast research often makes commonly accepted but unverified assumptions on network topologies and group member distribution in simulation studies. In this paper, we p...
Li Lao, Jun-Hong Cui, Mario Gerla