22 search results - page 4 / 5 » An O(M(n) log n) algorithm for the Jacobi symbol |
WIA
2005
Springer
14 years 1 months ago
2005
Springer
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
CPM
1997
Springer
13 years 12 months ago
1997
Springer
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
SIAMCOMP
2002
13 years 7 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
SPIRE
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...
CIKM
2009
Springer
14 years 13 days ago
2009
Springer
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...