@techreport{Bachem&Kannan:1984,
	key = "Bachem and Kannan 1984",
	author = "A. Bachem and R. Kannan",
	title = "Lattices and the Basis Reduction Algorithm",
	institution = "Carnegie-Mellon University",
	number = "CMU-CS-84-112",
	year = 1984}

@inproceedings{Kannan&Lenstra&Lovasz:1984,
	key = "Kannan, Lenstra, and Lovasz 1984",
	author = "R. Kannan and A. K. Lenstra and L. {Lov\'asz}",
	title = "Polynomial Factorization and Non-randomness of Bits of
	Algebraic and Transcendental Numbers",
	booktitle = STOC84,
	pages = "191-200",
	year = 1984}

@article{Kannan&Lenstra&Lovasz:1988,
	key = "Kannan, Lenstra, and Lovasz 1988",
	author = "R. Kannan and A. K. Lenstra and L. {Lov\'asz}",
	title = "Polynomial factorization and nonrandomness of bits of
algebraic and some transcendental numbers",
	journal = MC,
	volume = 50,
	year = 1988,
	pages = "235-250"}

@inproceedings{Vallee&Girault&Toffin:1988,
	key = "Vall\'ee, Girault, and Toffin 1988",
	author = "B. Vall\'ee and M. Girault and P. Toffin",
	title = "How to guess $l$-th roots modulo $n$ by reducing lattice
bases",
	booktitle = "AAECC-6",
	editor = "T. Mora",
	series = LNICS,
	volume = 357,
	year = 1988,
	pages = "427-442"}

@inproceedings{Kannan&McGeoch:1986,
	key = "Kannan and McGeoch 1986",
	author = "R. Kannan and L. A. McGeoch",
	title = "Basis reduction and evidence for transcendence of
certain numbers",
	booktitle = "Foundations of Software Technology and Theoretical
Computer Science",
	year = 1986,
	series = LNICS,
	volume = 241,
	editor = "K. V. Nori",
	pages = "263-269"}

@article{Verhezen:1982,
	key = "Verhezen 1982",
	author = "S. Verhezen",
	title = "Approximating transcendental numbers",
	journal = JRM,
	volume = 15,
	year = "1982-3",
	pages = "188-193"}

@techreport{Vallee&Flajolet:1990,
	key = "{Vall\'ee} and Flajolet 1990",
	author = "B. {Vall\'ee} and P. Flajolet",
	title = "Gauss' reduction algorithm:  an average case analysis",
	number = "1990-5",
	institution = "{Universit\'e} de Caen:  Laboratoire $A_3 L$",
	month = "March",
	year = 1990}

@article{Vallee:1991b,
	key = "{Vall\'ee} 1991b",
	author = "B. {Vall\'ee}",
	title = "Gauss' Algorithm Revisited",
	journal = JA,
	volume = 12,
	year = "{\noopsort{1991b}}1991",
	pages = "556-572"}

@incollection{Villard:1992,
	key = "Villard 1992",
	author = "G. Villard",
	title = "Parallel lattice basis reduction",
	booktitle = ISSAC92,
	editor = "P. S. Wang",
	year = 1992,
	publisher = ACM,
	pages = "269-277"}

@incollection{Kaib:1991,
	key = "Kaib 1991",
	author = "M. Kaib",
	title = "The Gauss lattice basis reduction algorithm succeeds
with any norm",
	booktitle = FCT91,
	series = LNICS,
	volume = 529,
	publisher = SV,
	address = NYC,
	year = 1991,
	editor = "L. Budach",
	pages = "275-286"}

@incollection{Schnorr&Euchner:1991,
	key = "Schnorr and Euchner 1991",
	author = "C. P. Schnorr and M. Euchner",
	title = "Lattice basis reduction:  improved practical algorithms
and solving subset sum problems",
	booktitle = FCT91,
	series = LNICS,
	volume = 529,
	publisher = SV,
	address = NYC,
	year = 1991,
	editor = "L. Budach",
	pages = "68-85"}

@article{Lempel&Paz:1994,
	key = "Lempel and Paz 1994",
	author = "M. Lempel and A. Paz",
	title = "An algorithm for finding a shortest vector in a
two-dimensional modular lattice",
	journal = TCS,
	volume = 125,
	year = 1994,
	pages = "229-241"}

@article{Daude&Vallee:1994,
	key = "{Daud\'e} and {Vall\'ee} 1994",
	author = "H. {Daud\'e} and B. {Vall\'ee}",
	title = "An upper bound on the average number of iterations of the
{LLL} algorithm",
	journal = TCS,
	volume = 123,
	year = 1994,
	pages = "95-115"}

@incollection{Daude&Flajolet&Vallee:1994,
	key = "{Daud\'e}, Flajolet, and {Vall\'ee} 1994",
	author = "H. {Daud\'e} and P. Flajolet and B. {Vall\'ee}",
	title = "An analysis of the {Gaussian} algorithm for lattice reduction",
	booktitle = ANTS1,
	editor = "L. M. Adleman and M.-D. Huang",
	series = LNICS,
	volume = 877,
	publisher = SV,
	year = 1994,
	pages = "144-158"}