On computations with integer division
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, STACS 88, Tome 23 (1989) no. 1, pp. 101-111. 
@article{ITA_1989__23_1_101_0,
     author = {Just, Bettina and Meyer auf der Heide, Friedhelm and Wigderson, Avi},
     title = {On computations with integer division},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {101--111},
     publisher = {EDP-Sciences},
     volume = {23},
     number = {1},
     year = {1989},
     mrnumber = {990070},
     zbl = {0665.68027},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1989__23_1_101_0/}
}
TY  - JOUR
AU  - Just, Bettina
AU  - Meyer auf der Heide, Friedhelm
AU  - Wigderson, Avi
TI  - On computations with integer division
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1989
SP  - 101
EP  - 111
VL  - 23
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1989__23_1_101_0/
LA  - en
ID  - ITA_1989__23_1_101_0
ER  - 
%0 Journal Article
%A Just, Bettina
%A Meyer auf der Heide, Friedhelm
%A Wigderson, Avi
%T On computations with integer division
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1989
%P 101-111
%V 23
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1989__23_1_101_0/
%G en
%F ITA_1989__23_1_101_0
Just, Bettina; Meyer auf der Heide, Friedhelm; Wigderson, Avi. On computations with integer division. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, STACS 88, Tome 23 (1989) no. 1, pp. 101-111. http://www.numdam.org/item/ITA_1989__23_1_101_0/

1. M. Ben Or, Lower bounds for Algebraic Computation Trees, Proc. 15th ACM STOC, 1983, pp. 80-86.

2. L. Babai, B. Just and F. Meyer Auf Der Heide, On the Limits of Computations with the Floor Functions, Information and Computation, 78 (2), 1988, pp. 99-107. | MR | Zbl

3. J. W. S. Cassels, An Introduction to the Geometry of Numbers, Springer, Berlin, 1959; second printing, 1971. | MR | Zbl

4. D. Dobkin and R. Lipton, A Lower Bound of 1/2n2 on Linear Search Programs for the Knapsack Problem, J..C.S.S., Vol. 16, 1975, pp. 417-421. | Zbl

5. J. Hastad, B. Just,J. Lagarias and C. P. Schnorr, Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers, Proc. STACS, 1986, pp. 105-118. | MR | Zbl

6. P. Klein and F. Meyer Auf Der Heide, A Lower Bound for the Knapsack Problem on Random Access Machines, Act. Inf., Vol. 19, 1983, pp. 385-395. | MR | Zbl

7. H. W. Jr Lenstra, Integer Programming with a Fixed Number of Variables, Report 81-03, Mathematisch Instituut, Amsterdam, 1983. | MR

8. J. C. Lagarias, H. W. Jr. Lenstra and C. P. Schnorr, Karkine-Zolotareff Bases and Successive Minima of a Latice and its Reciprocla Lattice, preprint 1986.

9. F. Meyer Auf Der Heide, Lower Bounds for Solving Linear Diophantine equations on Random Acces Machines, J.ACM., Vol. 32 (4), 1985, pp. 929-937. | MR | Zbl