Aviezri Fraenkel's Work in Number Theory
暂无分享,去创建一个
[1] Aviezri S. Fraenkel,et al. New results for covering systems of residue sets , 1986 .
[2] Aviezri S. Fraenkel. The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier , 1961, JACM.
[3] A S Fraenkel,et al. Proof that sequences of A,C,G, and T can be assembled to produce chains of ultimate length avoiding repetitions everywhere. , 1966, Progress in nucleic acid research and molecular biology.
[4] Aviezri S. Fraenkel,et al. The Bracket Function and Complementary Sets of Integers , 1969, Canadian Journal of Mathematics.
[5] R. J. Simpson. Disjoint covering systems of rational Beatty sequences , 1991, Discret. Math..
[6] Mihalis Yannakakis,et al. On the Complexity of Protein Folding , 1998, J. Comput. Biol..
[7] Aviezri S. Fraenkel. On a theorem of D. Ridout in the theory of Diophantine approximations. , 1962 .
[8] Robert Tijdeman. Fraenkel's conjecture for six sequences , 2000, Discret. Math..
[9] Ronald L. Graham,et al. Spectra of Numbers , 1978 .
[10] Aviezri S. Fraenkel,et al. How Many Squares Can a String Contain? , 1998, J. Comb. Theory, Ser. A.
[11] A. S. Fraenkel,et al. Gap Problems for Integer Part and Fractional Part Sequences , 1995 .
[12] Jamie Simpson,et al. The Exact Number of Squares in Fibonacci Words , 1999, Theor. Comput. Sci..
[13] Aviezri S. Fraenkel,et al. Complementing and Exactly Covering Sequences , 1973, J. Comb. Theory, Ser. A.
[14] A. S. Fraenkel,et al. Determination of [nθ] by its Sequence of*Differences , 1978, Canadian Mathematical Bulletin.
[15] G. Estrin,et al. A very high-speed digital number sieve , 1962 .
[16] Aviezri S. Fraenkel,et al. New proof of the generalized Chinese Remainder Theorem , 1963 .
[17] Aviezri S. Fraenkel,et al. How Many Squares Must a Binary Sequence Contain? , 1997, Electron. J. Comb..
[18] Aviezri S. Fraenkel. Protein folding, spin glass and computational complexity , 1997, DNA Based Computers.