Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm

Volume 13
Issue 4-5 - Jul 2004
Add to Basket £30.00 / $45.00
Request Permissions
Cited by Articles (CrossRef)
Cited by Articles (Google Scholar)
Citation Alert
Go to Next Abstract in TOC
Go to Previous Abstract in TOC
Blog this Article close

Copy and paste this code to insert a reference to this article in your blog or online community profile:

Highlight All
<div style="background: #FFFFFF; margin: 10px 10px 10px 10px; padding: 10px 10px 10px 20px; text-align: left; border-top: 1px dashed #a5bbd1; border-left: 10px solid #a5bbd1; font-family: Verdana, Geneva, sans-serif;"><br> <div style="font-size: 12px; padding: 0px 0px 10px 0px; font-weight:bold; color: #003366;">Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm</div><br><div style="font-size: 10px;"><b>BENOÎT DAIREAUX and BRIGITTE VALLÉE (2004).</b><br /> <a href="http://journals.cambridge.org/action/displayJournal?jid=CPC">Combinatorics, Probability and Computing</a>, <a href="http://journals.cambridge.org/action/displayJournal?jid=CPC&volumeId=13&bVolume=y#loc13 ">Volume 13</a>, <a href="http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=13&issueId=4-5&iid=248091"> Issue 4-5</a>, July 2004 pp 499-536 <br/> <a href="http://journals.cambridge.org/action/displayAbstract?aid=248091">http://journals.cambridge.org/action/displayAbstract?aid=248091</a></div></div>
The code will display like this:

Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm

BENOÎT DAIREAUX and BRIGITTE VALLÉE (2004).
Combinatorics, Probability and Computing, Volume 13, Issue 4-5, July 2004 pp 499-536 http://journals.cambridge.org/action/displayAbstract?aid=248091

Blog this Article

Combinatorics, Probability and Computing (2004), 13 : 499-536 Cambridge University Press

Copyright © 2004 Cambridge University Press

doi:10.1017/S0963548304006261 (About doi)

Published online by Cambridge University Press 24 Sep 2004

Social Bookmarking

Username or Email Address	Password

Cambridge Journals Online

Combinatorics, Probability and Computing (2004), 13 : 499-536 Cambridge University Press

Copyright © 2004 Cambridge University Press

doi:10.1017/S0963548304006261 (About doi)

Published online by Cambridge University Press 24 Sep 2004