Michael Frumkin

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ An Introduction to the Geometry of Numbers 1959 J. W. S. Cassels
2
+ A periodicity lemma in linear diophantine analysis 1976 Hans G�nther Weidner
2
+ An Introduction to Diophantine Approximation. 1958 John C. Brixey
J. W. S. Cassels
2
+ Schnelle Berechnung von Kettenbruchentwicklungen 1971 Arnold Schönhage
1
+ Rational Quadratic Forms 1982 J. W. S. Cassels
1
+ Efficient cache use for stencil operations on structured discretization grids 2000 Michael Frumkin
Rob F. Van der Wijngaart
1
+ PDF Chat Algorithm and bound for the greatest common divisor of <i>n</i> integers 1970 Gordon H. Bradley
1
+ Approximation properties of Jacobi's algorithm 1976 Fritz Schweiger
1
+ Explicit representations of dirichlet approximations 1977 W. B. Jurkat
W. Kratz
Alexander Peyerimhoff
1
+ On best two-dimensional Dirichlet-approximations and their algorithmic calculation 1979 W. B. Jurkat
W. Kratz
Alexander Peyerimhoff
1
+ Introduction to Diophantine Approximations 1995 Serge Lang
1
+ PDF Chat Minkowski reduction of integral matrices 1979 John L. Donaldson
1
+ PDF Chat Polynomial Expansions of Analytic Functions 1961 J. D. Todd
R. P. Boas
R. Creighton Buck
1
+ Euclid's Algorithm for Large Numbers 1938 D. H. Lehmer
1
+ PDF Chat Machine-independent description of certain machine complexity classes 1982 Serguei Pakhomov
1
+ Fundamental units of cubic fields of positive discriminant 1981 �. T. Avanesov
K. K. Billevich
1
+ The Least Quadratic Non Residue 1952 N. C. Ankeny
1
+ A generalization of the algorithm for continued fractions related to the algorithm of Viggo Brunn 1981 E. V. Podsypanin
1
+ The Umbral Calculus 1984 Steven Roman
1
+ The Symmetric Eigenvalue Problem 1998 Beresford Ν. Parlett
1
+ Discrete Isoperimetric Problems 1977 Da‐Lun Wang
Ping Wang
1
+ PDF Chat On the computational complexity of determining the solvability or unsolvability of the equation 𝑋²-𝐷𝑌²=-1 1980 Jeffrey C. Lagarias
1
+ PDF Chat Computational Problems, Methods, and Results in Algebraic Number Theory 1974 Morris Newman
Horst G. Zimmer
1
+ GROUPS OF FORMAL DIFFEOMORPHISMS OF THE SUPERLINE, GENERATING FUNCTIONS FOR SEQUENCES OF POLYNOMIALS, AND FUNCTIONAL EQUATIONS 1990 Виктор Матвеевич Бухштабер
A N Kholodov
1
+ A New Version of the Euclidean Algorith 1963 W. A. Blankinship
1
+ Special Functions and the Theory of Group Representations 1968 N. I︠a︡. Vilenkin
1
+ Bounds for the least solutions of homogeneous quadratic equations 1955 J. W. S. Cassels
1
+ Number Theory 1980 Helmut Hasse
1
+ Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux. 1967 1
+ Elementary Number Theory 2005 1
+ Sur un problème de géométrie diophantienne linéaire. II. 1967 Emil Ehrhardt
1
+ Number Theory 1980 Helmut Hasse
1
+ On integral formulas of the (unit) sphere and their application to numerical computation of integrals 1980 Willi Freeden
1
+ Polynomial expansions of analytic functions 1964 R. P. Boas
R. Creighton Buck
1
+ The geometry of positive quadratic forms 1983 Сергей Сергеевич Рышков
1
+ The Metrical Theory of Jacobi-Perron Algorithm 1973 Fritz Schweiger
1
+ PDF Chat The Jacobi-Perron Algorithm Its Theory and Application 1971 Leon Bernstein
1
+ Fundamentals of number theory 1977 W. J. LeVeque
1
+ Polynomial time algorithms in the theory of linear diophantine equations 1977 M. A. Frumkin
1