See this document in CiteSeerX!

Digits and Continuants in Euclidean Algorithms. Ergodic versus Tauberian Theorems (2000)  (Make Corrections)  
Brigitte Vallée



  Home/Search   Context   Related

 
View or download:
info.unicaen.fr/~brigit...Valleejtnb.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  info.unicaen.fr/~brigitte/Publ... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We obtain new results regarding the precise average-- case analysis of the main quantities that intervene in algorithms of a broad Euclidean type. We develop a general framework for the analysis of such algorithms, where the average-case complexity of an algorithm is related to the analytic behaviour in the complex plane of the set of elementary transformations determined by the algorithms. The methods rely on properties of transfer operators suitably adapted from dynamical systems theory and... (Update)

Similar documents (at the sentence level):
6.1%:   Average Bit-Complexity of Euclidean Algorithms - Akhavi, Vallée (2000)   (Correct)
5.0%:   Dynamical Analysis of a Class of Euclidean Algorithms - Vallée   (Correct)

Active bibliography (related documents):   More   All
3.3:   Digits and Continuants in Euclidean Algorithms. Ergodic versus.. - Vallée   (Correct)
1.7:   Average-case Analyses of three algorithms for computing .. - Vallée.. (1998)   (Correct)
1.5:   Dynamical Analysis of ff--Euclidean Algorithms - Er'emie Bourdon Benoit   (Correct)

Similar documents based on text:   More   All
1.4:   Rapport D'activités Annuel - Glineur (1998)   (Correct)
1.1:   Automates Finis - Perrin (1999)   (Correct)
1.0:   Lambda-Calcul et Domaines - Curien (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ vall-digits,
  author = "Brigitte Vallée",
  title = "Digits and Continuants in Euclidean Algorithms. Ergodic versus Tauberian
    Theorems",
  url = "citeseer.ist.psu.edu/489610.html" }
Citations (may not include all citations):
2003   The art of Computer programming (context) - Knuth - 1998
584   Perturbation Theory for Linear Operators (context) - Kato - 1980
144   Thermodynamic formalism (context) - Ruelle - 1978
137   Universal codeword sets and representations of the integers (context) - Elias - 1975
78   Ergodic Theory and Information (context) - Billingsley - 1965
57   Exact real computer arithmetic with continued fractions (context) - Vuillemin - 1990  ACM   DBLP
30   Dynamical Zeta Functions for Piecewise Monotone Maps of the .. (context) - Ruelle - 1994
28   Produits tensoriels topologiques et espaces nucl'eaires (context) - Grothendieck - 1955
25   Symbolic Dynamics and Hyperbolic Spaces (context) - Bedford, Keane et al. - 1991
25   An average-case analysis of the Gaussian algorithm for latti.. (context) - Daud'e, Flajolet et al. - 1997  ACM
23   University of Chicago Press (context) - Khinchin, Fractions
21   Composition operators and classical function theory (context) - Shapiro - 1993
20   La th'eorie de Fredholm (context) - Grothendieck
19   Continued fractions and related transformations (context) - Mayer - 1991
17   Analysis of the subtractive algorithm for greatest common di.. (context) - Yao, Knuth - 1975
15   Theoretical Computer Science (context) - Flajolet, Vall'ee et al. - 1998  ACM
15   The number of steps in the Euclidean algorithm (context) - Dixon - 1970
14   i function related to the continued fraction transformation (context) - Mayer - 1976
13   The number of steps in the Euclidean algorithm (context) - Hensley - 1994
13   Dynamics of the Binary Euclidean Algorithm: Functional Analy.. (context) - Vall'ee - 1998  DBLP
12   a la th'eorie analytique des nombres (context) - Tenenbaum - 1990
11   Soviet Mathematical Doklady (context) - Babenko, of - 1978
11   the average length of a class of continued fractions (context) - Heilbronn - 1969
11   Artificial Intelligence Laboratory (context) - Beeler, Gosper et al. - 1972
11   Analytic Combinatorics (context) - Flajolet, Sedgewick
10   Analysis of the Binary Euclidean algorithm (context) - Brent - 1976
9   ange, G'en'eralisation du Th'eor`eme d'Ikehara (context) - Del - 1954
9   Oxford University Press (context) - Lorch, Theory - 1962
9   Distribution of L'evy's constants for quadratic numbers (context) - Faivre - 1992
8   the theorem of Gauss-Kusmin--L'evy and a Frobenius-type theo.. (context) - Wirsing - 1974
8   Analytic analysis of algorithms - Flajolet - 1992  ACM   DBLP
6   a contraintes p (context) - Vall'ee, continues - 1998
6   Average bit--complexity of Euclidean Algorithms - Akhavi, Vall'ee
6   Uber die mittlere Schrittazahl bei Divisionalgorithmen (context) - Rieger - 1978
5   Positive solutions of operator equations (context) - Krasnoselsky - 1964
3   Atti del Congresso Internationale dei Matematici (context) - Kuzmin, probleme - 1928
3   A Unifying Framework for the analysis of a class of Euclidea.. - Vall'ee - 2000  ACM   DBLP
2   A series of Comprehensive Studies in Mathematics (context) - Cornfeld, Fomin et al. - 1982
2   Dynamical Analysis of a Class of Euclidean Algorithms - Vall'ee  ACM   DBLP
1   Further analysis of the binary Euclidean algorithm - Brent - 1999  ACM
1   to appear in Theoretical Computer Science (context) - in, Science - 2001

Documents on the same site (http://www.info.unicaen.fr/~brigitte/Publications/):   More
Dynamical Systems and Average-Case Analysis of General Tries - Vallée (1997)   (Correct)
Average-case Analyses of three algorithms for computing .. - Vallée.. (1998)   (Correct)
Dynamical Sources in Information Theory: Fundamental intervals .. - Vallée (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC