Brigitte Vallée

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

Analysis of generalized continued fraction algorithms over polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2021

2020

Preface of the Special Issue on Theoretical Aspects of Computer Science (2018).

[BibT_eX]

[DOI]

Rolf Niedermeier

Theory Comput. Syst., 2020

Two Arithmetical Sources and Their Associated Tries.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Probabilistic, 2020

2019

Guest Editorial: Special Issue on Theoretical Aspects of Computer Science.

[BibT_eX]

[DOI]

Heribert Vollmer

Theory Comput. Syst., 2019

Dichotomic Selection on Words: A Probabilistic Analysis.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

The Brun gcd algorithm in high dimensions is almost always subtractive.

[BibT_eX]

[DOI]

Valérie Berthé

J. Symb. Comput., 2018

Analysis of the Continued Logarithm Algorithm.

[BibT_eX]

[DOI]

Pablo Rotondo

Alfredo Viola

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

The Depoissonisation Quintet: Rice-Poisson-Mellin-Newton-Laplace.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

The recurrence function of a random Sturmian word.

[BibT_eX]

[DOI]

Pablo Rotondo

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

Towards a Realistic Analysis of the QuickSelect Algorithm.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Probabilistic analyses of the plain multiple gcd algorithm.

[BibT_eX]

[DOI]

Valérie Berthé

J. Symb. Comput., 2016

Analysis of the Brun Gcd Algorithm.

[BibT_eX]

[DOI]

Valérie Berthé

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015

Towards a Realistic Analysis of Some Popular Sorting Algorithms.

[BibT_eX]

[DOI]

Thu Hien Nguyen Thi

Comb. Probab. Comput., 2015

Gaussian Distribution of Trie Depth for Strongly Tame Sources.

[BibT_eX]

[DOI]

Eda Cesaratto

Comb. Probab. Comput., 2015

Recurrence Function on Sturmian Words: A Probabilistic Study.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Fine costs for Euclid's algorithm on polynomials and Farey maps.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2014

Typical Depth of a Digital Search Tree built on a general source.

[BibT_eX]

[DOI]

Kanal Hun

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013

A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms.

[BibT_eX]

[DOI]

Thu Hien Nguyen Thi

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Multiple GCDs. probabilistic analysis of the plain algorithm.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Pseudorandomness of a Random Kronecker Sequence.

[BibT_eX]

[DOI]

Eda Cesaratto

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Philippe Flajolet, the Father of Analytic Combinatorics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Obituary. Philippe Flajolet.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

In memoriam: Philippe Flajolet, the father of analytic combinatorics.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

Philippe Flajolet (1948-2011).

[BibT_eX]

[DOI]

Bull. EATCS, 2011

Philippe Flajolet 1 December 1948 - 22 March 2011.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

Information theory: Sources, Dirichlet series, and realistic analyses of data structures

[BibT_eX]

[DOI]

Mathieu Roux

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

2010

Probabilistic Analyses of Lattice Reduction Algorithms.

[BibT_eX]

[DOI]

Antonio Vera

Proceedings of the LLL Algorithm - Survey and Applications, 2010

Modelling the LLL Algorithm by Sandpiles.

[BibT_eX]

[DOI]

Manfred G. Madritsch

Véronique Maume-Deschamps

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Regularity of the Euclid Algorithm; application to the analysis of fast GCD Algorithms.

[BibT_eX]

[DOI]

J. Symb. Comput., 2009

The Number of Symbol Comparisons in QuickSort and QuickSelect.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Gaussian Laws for the Main Parameters of the Euclid Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2008

2007

Analysis of Fast Versions of the Euclid Algorithm.

[BibT_eX]

[DOI]

Eda Cesaratto

Benoit Daireaux

Véronique Maume-Deschamps

Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006

Hidden word statistics.

[BibT_eX]

[DOI]

Wojciech Szpankowski

J. ACM, 2006

Sharp Estimates for the Main Parameters of the Euclid Algorithm.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Pattern Matching Statistics on Correlated Sources.

[BibT_eX]

[DOI]

Jérémie Bourdon

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Statistics for dynamical sources.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

2004

Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm.

[BibT_eX]

[DOI]

Benoit Daireaux

Véronique Maume-Deschamps

Comb. Probab. Comput., 2004

Erratum to 'Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes'.

[BibT_eX]

[DOI]

Frédéric Chazal

Algorithmica, 2004

Distribuional Analyses of Euclidean Algorithms.

[BibT_eX]

Viviane Baladi

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Dynamical analysis of a class of Euclidean algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Euclidean algorithms are Gaussian

[BibT_eX]

[DOI]

Viviane Baladi

CoRR, 2003

2002

Preface.

[BibT_eX]

[DOI]

Helmut Prodinger

J. Algorithms, 2002

Dynamical analysis of alpha-Euclidean algorithms.

[BibT_eX]

[DOI]

Jérémie Bourdon

Benoit Daireaux

J. Algorithms, 2002

2001

On the Stack-Size of General Tries.

[BibT_eX]

[DOI]

Jérémie Bourdon

Markus E. Nebel

RAIRO Theor. Informatics Appl., 2001

Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes.

[BibT_eX]

[DOI]

Algorithmica, 2001

Dynamical Sources in Information Theory: A General Analysis of Trie Structures.

[BibT_eX]

[DOI]

Algorithmica, 2001

Hidden Pattern Statistics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

A Unifying Framework for the Analysis of a Class of Euclidean Algorithms.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Average Bit-Complexity of Euclidean Algorithms.

[BibT_eX]

[DOI]

Ali Akhavi

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1998

Continued Fraction Algorithms, Functional Operators, and Structure Constants.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators.

[BibT_eX]

[DOI]

Algorithmica, 1998

The Analysis of Hybrid Trie Structures.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

The Complete Analysis of the Binary Euclidean Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997

An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction.

[BibT_eX]

[DOI]

Hervé Daudé

Comb. Probab. Comput., 1997

Algorithms for Computing Signs of 2×2 Determinants: Dynamics and Average-Case Analysis.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1994

An Upper Bound on the Average Number of Iterations of the LLL Algorithm.

[BibT_eX]

[DOI]

Hervé Daudé

Theor. Comput. Sci., 1994

An analysis of the Gaussian algorithm for lattice reduction.

[BibT_eX]

[DOI]

Hervé Daudé

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1991

Gauss' Algorithm Revisited.

[BibT_eX]

[DOI]

J. Algorithms, 1991

1990

The Lattice Reduction Algorithm of Gauss: An Average Case Analysis

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

La Réduction Des Réseaux, Autour De L'Algorithme De Lenstra, Lenstra, Lovász.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1989

Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988

How to Break Okamoto's Cryptosystem by Reducing Lattice Bases.

[BibT_eX]

[DOI]

Marc Girault

Philippe Toffin

Proceedings of the Advances in Cryptology, 1988

Computation of Approximate L-th Roots Modulo <i>n</i> and Application to Cryptography.

[BibT_eX]

[DOI]

Marc Girault

Philippe Toffin

Proceedings of the Advances in Cryptology, 1988

How to Guess <i>l</i>-th Roots Modulo n by Reducing Lattice Bases.

[BibT_eX]

[DOI]

Philippe Toffin

Marc Girault

Proceedings of the Applied Algebra, 1988

1987

An affine point of view on minima finding in integer lattices of lower dimensions.

[BibT_eX]

[DOI]