%
%	Arbitrary precision integer arithmetic--greatest common divisor.
%
%	Ken Weber 	kweber@mcs.kent.edu	12/14/94
%
@string{cacm = "Communications of the {ACM}"}
@string{jsc = "Journal of Symbolic Computation"}
@string{ja  = "Journal of Algorithms"}
@string{ssb = "{SIGSAM} Bulletin"}
@string{TOMS = "{ACM} Transactions on Mathematical Software"}

@article
{   chor,
    author = "Benny Chor and Oded Goldreich",
    title = "An Improved Parallel Algorithm for Integer GCD",
    journal = "Algorithmica",
    year = 1990,
    volume  = 5,
    pages = "1--10"
}

@inproceedings
{   jebelean2,
    author = "Tudor Jebelean",
    title = "A Generalization of the Binary {GCD} Algorithm",
    booktitle = "{ISSAC} '93: International Symposium on Symbolic and Algebraic
	Computation",
    address = "Kiev, Ukraine",
    month = "July", 
    year = 1993, 
    pages = "111--116"
}

@inproceedings
{   jebelean1,
    author = "Tudor Jebelean",
    title = "Comparing Several {GCD} Algorithms",
    booktitle = "{ARITH}-11: {IEEE} Symposium on Computer Arithmetic",
    address = "Windsor, Canada",
    month = "June", 
    year = 1993, 
    pages = "180--185"
}

@inproceedings
{   norton,
    author = "Graham Norton",
    title = "A Shift-remainder {GCD} Algorithm",
    booktitle = "Proceedings of the 5th International Conference on
	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes",
    year = 1987,
    publisher = "Springer-Verlag",
    editor = "L. Huguet and A. Poli",
    pages = "350--356",
    notes = "Springer-Verlag Lecture Notes In Computer Science, Number 356"
}

@article
{   sorenson-2,
    author = "Jonathan Sorenson",
    title = "Two Fast {GCD} Algorithms",
    pages = "110--144",
    journal = ja,
    year = 1994,
    volume = 16,
    number = 1,
    month = jan
}

@article
{   weber,
    author = "Kenneth Weber",
    title = "The Accelerated Integer GCD Algorithm",
    journal = TOMS,
    year = 1994,
    note = "To appear"
}

@phdthesis
{   kweber-thesis,
    author = "Kenneth Weber",
    title = 
      "Parallel Integer GCD Algorithms and Their Application to Polynomial GCD",
    school = "Kent State University",
    year = 1994
}