Sciweavers

5 search results - page 1 / 1
» Equivalence between Closed Connected n - G -Maps without Mul...
Sort
View
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 11 months ago
A connection between palindromic and factor complexity using return words
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
Michelangelo Bucci, Alessandro De Luca, Amy Glen, ...
PODC
2004
ACM
14 years 4 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 5 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
SIAMCOMP
2010
100views more  SIAMCOMP 2010»
13 years 9 months ago
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
Markus Kirschmer, John Voight
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 5 months ago
On the Simulation of Tikhonov Random Processes
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
Giuseppe Thadeu Freitas de Abreu