Result 1 to 20 of 74 total
Algebraic shift register sequences. (English)
Cambridge: Cambridge University Press (ISBN 978-1-107-01499-2/hbk). xv, 498~p. \sterling~50.00; \$~85.00/hbk (2012).
1
Vladimir Sergeevich Anashin. (English)
$p$-Adic Numbers Ultrametric Anal. Appl. 3, No. 4, 359-362 (2011).
2
Decoupling the linear and nonlinear parts in Hammerstein model identification. (English)
Giri, Fouad (ed.) et al., Block-oriented nonlinear system identification. Berlin: Springer (ISBN 978-1-84996-512-5/pbk; 978-1-84996-513-2/ebook). Lecture Notes in Control and Information Sciences 404, 335-345 (2010).
3
Theoretical and empirical convergence results for additive congruential random number generators. (English)
J. Comput. Appl. Math. 233, No. 9, 2302-2311 (2010).
4
On the Ehrenfeucht-Mycielski sequence. (English)
J. Discrete Algorithms 7, No. 4, 500-508 (2009).
5
On pseudo-random subsets of ${\mathbb{Z}}_n$. (English)
Monatsh. Math. 157, No. 1, 13-35 (2009).
6
A universal algorithm for transforming chaotic sequences into uniform pseudo-random sequences. (Chinese)
Acta Phys. Sin. 57, No. 7, 4007-4013 (2008).
7
Pseudo-randomness of discrete-log sequences from elliptic curves. (English)
Pei, Dingyi (ed.) et al., Information security and cryptology. Third SKLOIS conference, Inscrypt 2007, Xining, China, August 31‒September 5, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-79498-1/pbk). Lecture Notes in Computer Science 4990, 231-245 (2008).
8
Finite binary sequences constructed by explicit inversive methods. (English)
Finite Fields Appl. 14, No. 3, 579-592 (2008).
9
Generating good pseudo-random numbers. (English)
Comput. Stat. Data Anal. 51, No. 3, 1614-1622 (2006).
10
Binary sequences from a pair of elliptic curves. (English)
Wuhan Univ. J. Nat. Sci. 11, No. 6, 1511-1515 (2006).
11
A generator of pseudo-random numbers sequences with a very long period. (English)
Math. Comput. Modelling 42, No. 7-8, 809-816 (2005).
12
Classification of quasigroups by random walk on torus. (English)
J. Appl. Math. Comput. 19, No. 1-2, 57-75 (2005).
13
Design of long period pseudo-random sequences from the addition of $m$-sequences over ${\Bbb F}_p$. (English)
EURASIP J. Wirel. Commun. Netw. 2004, No. 1, 12-18 (2004).
14
Linear recurrences with polynomial coefficients. (English)
J. Complexity 20, No. 2-3, 171-181 (2004).
15
Pseudo-randomness of round-off errors in discretized linear maps on the plane. (English)
Int. J. Bifurcation Chaos Appl. Sci. Eng. 13, No. 11, 3373-3393 (2003).
16
Defects in parallel Monte Carlo and quasi-Monte Carlo integration using the leap-frog technique. (English)
Parallel Algorithms Appl. 18, No. 1-2, 13-26 (2003).
17
Evolutionary computer simulations. (English)
Physica A 306, 351-358 (2002).
18
Applications of the theory of Gröbner bases to the study of linear recurring arrays. (English)
Chin. Sci. Bull. 46, No. 14, 1149-1152 (2001).
19
Quasi-random simulation of linear kinetic equations. (English)
J. Complexity 17, No.4, 795-814 (2001).
20
Result 1 to 20 of 74 total
Start
Contact
Print
General Help
