{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:25:32Z","timestamp":1761647132822},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7137,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0304-3975(94)90071-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"95-115","source":"Crossref","is-referenced-by-count":42,"title":["An upper bound on the average number of iterations of the LLL algorithm"],"prefix":"10.1016","volume":"123","author":[{"given":"Herv\u00e9","family":"Daud\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brigitte","family":"Vall\u00e9e","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90071-X_BIB1","article-title":"Sphere Packings, Lattices and Groups","volume":"Vol. 290","author":"Conway","year":"1988"},{"key":"10.1016\/0304-3975(94)90071-X_BIB2","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0022-314X(70)90044-2","article-title":"The number of steps in the Euclidean algorithm","volume":"2","author":"Dixon","year":"1970","journal-title":"J. Number Theory"},{"key":"10.1016\/0304-3975(94)90071-X_BIB3","first-page":"41","article-title":"Sur le nombre de divisions \u00e0 effectuer pour obtenir le plus grand commun diviseur entre deux nombres entiers","volume":"11","author":"Dupr\u00e9","year":"1846","journal-title":"J. de Math\u00e9matiques"},{"key":"10.1016\/0304-3975(94)90071-X_BIB4","series-title":"Number Theory and Analysis","first-page":"87","article-title":"On the average length of a class of continued fractions","author":"Heilbronn","year":"1969"},{"key":"10.1016\/0304-3975(94)90071-X_BIB5","article-title":"Algorithmic geometry of numbers","author":"Kannan","year":"1988","journal-title":"Ann. Rev. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90071-X_BIB6","series-title":"Tech. Report GRAL","article-title":"Distribution de la constante d'Hermite et du plus court vecteur des r\u00e9seaux de dimension 2","author":"Laville","year":"1993"},{"key":"10.1016\/0304-3975(94)90071-X_BIB7","series-title":"Geometry of Numbers","author":"Lekkerkerker","year":"1987"},{"key":"10.1016\/0304-3975(94)90071-X_BIB8","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomial with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann."},{"key":"10.1016\/0304-3975(94)90071-X_BIB9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01571276","article-title":"Lattice points in high-dimensional spheres","volume":"110","author":"Mazo","year":"1990","journal-title":"Monatsh. Math."},{"key":"10.1016\/0304-3975(94)90071-X_BIB10","series-title":"Calcul des Probabilit\u00e9s","author":"Renyi","year":"1966"},{"key":"10.1016\/0304-3975(94)90071-X_BIB11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/mana.19780820115","article-title":"\u00dcber die mittlere Schrittanzahl bei Divisionalgorithmen","volume":"82","author":"Rieger","year":"1978","journal-title":"Math. Nachr."},{"key":"10.1016\/0304-3975(94)90071-X_BIB12","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/0196-6774(91)90033-U","article-title":"Gauss algorithm revisited","volume":"12","author":"Vall\u00e9e","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)90071-X_BIB13_1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1051\/ita\/1989230303451","article-title":"Un probl\u00e8me central en g\u00e9om\u00e9trie algorithmique des nombres: la r\u00e9duction des r\u00e9seaux; autour de l'algorithme LLL","author":"Vall\u00e9e","year":"1989","journal-title":"Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(94)90071-X_BIB13_2","first-page":"95","volume":"3","author":"Kranakis","year":"1990","journal-title":"CWI Quart."},{"key":"10.1016\/0304-3975(94)90071-X_BIB14","first-page":"830","article-title":"The lattice reduction algorithm of gauss: an average case analysis","volume":"Vol. 2","author":"Vall\u00e9e","year":"1990"},{"key":"10.1016\/0304-3975(94)90071-X_BIB15","article-title":"Another NP complete partition problem and the complexity of computing short vectors in a lattice","author":"Van Emde Boas","year":"1981","journal-title":"Report, MI, UVA 81-04"},{"key":"10.1016\/0304-3975(94)90071-X_BIB16","doi-asserted-by":"crossref","unstructured":"G. Villard, Parallel lattice basis reduction, Proc. ISSAC 1992, Lecture Notes in Computer Science, to appear.","DOI":"10.1145\/143242.143327"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490071X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490071X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:47Z","timestamp":1555129547000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759490071X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["030439759490071X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90071-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}