Filter your results
- 43
- 26
- 1
- 26
- 22
- 10
- 9
- 2
- 1
- 7
- 2
- 67
- 14
- 3
- 3
- 1
- 2
- 2
- 3
- 1
- 5
- 4
- 3
- 4
- 2
- 4
- 5
- 6
- 8
- 1
- 4
- 3
- 1
- 1
- 3
- 1
- 1
- 1
- 2
- 1
- 1
- 65
- 5
- 63
- 12
- 6
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 70
- 13
- 12
- 10
- 7
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
Two Arithmetical Sources and Their Associated Tries31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2020, Klagenfurt, Austria. ⟨10.4230/LIPIcs.AofA.2020.4⟩
Conference papers
hal-02868527v1
|
||
|
Continued Fraction Algorithms, Functional Operators, and Structure Constants[Research Report] RR-2931, INRIA. 1996
Reports
inria-00073768v1
|
||
|
The Euclid Algorithm is totally gaussian23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2012, Jun 2012, Montréal, Canada. ⟨10.46298/dmtcs.3000⟩
Conference papers
hal-01086476v1
|
||
Recurrence Function on Sturmian Words: A Probabilistic StudyMathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Aug 2015, Milan, Italy. pp.116-128, ⟨10.1007/978-3-662-48057-1_9⟩
Conference papers
hal-01199096v1
|
|||
Analysis of Euclidean algorithms : an Arithmetical Instance of Dynamical AnalysisFranco-Thai Seminar in Pure and Applied Mathematics, 2009, paris, France
Conference papers
hal-01082437v1
|
|||
|
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Feb 2013, Kiel, Germany
Conference papers
hal-01086576v1
|
||
On The Stack-Size of General TriesRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2001, 35, pp.163--185
Journal articles
hal-00442422v1
|
|||
|
Guest Editorial: Special Issue on Theoretical Aspects of Computer Science (2017)Theory of Computing Systems, 2019, 63 (5), pp.923-925. ⟨10.1007/s00224-019-09934-y⟩
Journal articles
hal-02735297v1
|
||
|
The recurrence function of a random Sturmian word2017 Proceedings of the Meeting on Analytic Algorithmics and Combinatorics (ANALCO), Jan 2017, Barcelona, Spain. pp.100-114, ⟨10.1137/1.9781611974775.10⟩
Conference papers
hal-01578436v1
|
||
|
Philippe Flajolet, the Father of Analytic Combinatorics23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.1-2, ⟨10.46298/dmtcs.2966⟩
Conference papers
hal-01336772v1
|
||
|
Typical Depth of a Digital Search Tree built on a general sourceProceedings of ANALCO'2014, SIAM Meeting on Analytic Algorithmics and Combinatoric, Jan 2014, Portland, United States. pp.1 - 15, ⟨10.1137/1.9781611973204.1⟩
Conference papers
hal-01087072v1
|
||
|
Small quotients in Euclidean algorithmsRamanujan Journal (The), 2011, 24, pp.183 - 218. ⟨10.1007/s11139-010-9256-z⟩
Journal articles
hal-01087902v1
|
||
|
Fine costs for Euclid's algorithm on polynomials and Farey mapsAdvances in Applied Mathematics, 2014, 54, pp.27-65. ⟨10.1016/j.aam.2013.11.001⟩
Journal articles
hal-01086629v1
|
||
|
Regularity of the Euclid Algorithm, Application to the analysis of fast GCD AlgorithmsJournal of Symbolic Computation, 2009, 44 (7), pp.726. ⟨10.1016/j.jsc.2008.04.018⟩
Journal articles
hal-00504022v1
|
||
|
Multiple GCD's. Probabilistic analysis of the plain algorithm38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, Jun 2013, Boston, United States
Conference papers
hal-01082245v1
|
||
|
Gaussian behaviour of quadratic irrationalsActa Arithmetica, In press, 197 (2), pp.159-205. ⟨10.4064/aa191205-18-5⟩
Journal articles
hal-01709406v1
|
||
|
Gaussian laws for the main parameters of the Euclid Algorithms,Algorithmica, 2007, pp.35
Journal articles
hal-00207680v1
|
||
Dynamical Analysis of alpha-Euclidean AlgorithmsJournal of Algorithms in Cognition, Informatics and Logic, 2002, 1 (44), pp.246--285
Journal articles
hal-00442421v1
|
|||
|
Probabilistic behaviour of lattice reduction algorithms2008
Preprints, Working Papers, ...
hal-00211546v1
|
||
Pattern Matching Statistics on Correlated sourcesLATIN 2006, Mar 2006, Chile. pp.224-237
Conference papers
hal-00461975v1
|
|||
Gaussian Distribution of Trie Depth for Strongly Tame SourcesCombinatorics, Probability and Computing, 2015, 24 (01), pp.54-103. ⟨10.1017/S0963548314000741⟩
Journal articles
hal-01153052v1
|
|||
|
Dynamical Sources in Information Theory : A General Analysis of Trie Structures[Research Report] RR-3645, INRIA. 1999
Reports
inria-00073027v1
|
||
|
The Analysis of Hybrid Trie Structures[Research Report] RR-3295, INRIA. 1997
Reports
inria-00073393v1
|
||
Philippe Flajolet, le fondateur de la combinatoire analytiqueGazette des Mathématiciens, 2011, 129, pp.113-114
Journal articles
hal-00680928v1
|
|||
|
Pseudo-randomness of a random Kronecker sequenceLatin American Symposium on Theoretical Informatics, Apr 2012, Arequipa, Peru. pp.157-171, ⟨10.1007/978-3-642-29344-3_14⟩
Conference papers
hal-01084963v1
|
||
|
On the non-randomness of modular arthmetic progressions : a solution to a problem by V.I. Arnold2008
Preprints, Working Papers, ...
hal-00211041v1
|
||
|
Euclideans DynamicsDiscrete and Continuous Dynamical Systems - Series S, 2006, pp.281-352
Journal articles
hal-00204770v1
|
||
Pseudo-randomness of a random Kronecker sequence. An instance of dynamical analysisEdited by V. Berthé and M. Rigo. Combinatorics, Words and Symbolic Dynamics, 11, Cambridge University Press, pp.401-442, 2016, 9781139924733. ⟨10.1017/CBO9781139924733.012⟩
Book sections
hal-01578308v1
|
|||
Jules Ferry 3.0. Bâtir une école créative et juste dans un monde numériqueConseil national du numérique (CNNum). 2014, pp.119
Reports
hal-01144070v1
|
|||
|
Probalistic analyses of lattice reductions algorithms2008
Preprints, Working Papers, ...
hal-00204499v1
|