Skip to Main content Skip to Navigation
New interface

hal-01184044v1  Conference papers
Benoît DaireauxVéronique Maume-DeschampsBrigitte Vallée. The Lyapunov tortoise and the dyadic hare
2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.71-94, ⟨10.46298/dmtcs.3372⟩
hal-00003469v1  Conference papers
Jean-Christophe DubacqVéronique Terrier. Signals for Cellular Automata in dimension 2 or higher
Latin 2002: Theoretical Informatics, 2002, Cancun, Mexico. pp.451-464
hal-01184700v1  Conference papers
Margaret ArchibaldJulien Clément. Average depth in a binary search tree with repeated keys
Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.309-320, ⟨10.46298/dmtcs.3496⟩
hal-02632657v1  Conference papers
Julien ClémentAntoine Genitrini. Binary Decision Diagrams: from Tree Compaction to Sampling
14th Latin American Theoretical Informatics Symposium, May 2020, Sao Polo, Brazil. ⟨10.1007/978-3-030-61792-9_45⟩
tel-01136777v1  Theses
Kanal Hun. Analysis of depth of digital trees built on general sources
Computer Science [cs]. Université de Caen Basse-Normandie, 2014. English
hal-01653711v1  Journal articles
Julien CourtielKaren Yeats. Terminal chords in connected chord diagrams
Annales de l’Institut Henri Poincaré (D) Combinatorics, Physics and their Interactions, European Mathematical Society, 2017, 4 (4), pp.417-452. ⟨10.4171/AIHPD/44⟩
hal-02153783v2  Journal articles
Julien CourtielKaren Yeats. Next-to$^k$ leading log expansions by chord diagrams
Communications in Mathematical Physics, Springer Verlag, 2020, 377, pp.469-501. ⟨10.1007/s00220-020-03691-7⟩
hal-01708981v3  Books
Brigitte ChauvinJulien ClémentDanièle Gardy. Arbres pour l'algorithmique
83, 2018, Mathématiques et Applications, 978-3-319-93724-3. ⟨10.1007/978-3-319-93725-0⟩
hal-01083405v2  Conference papers
Philippe FlajoletMathieu RouxBrigitte Vallée. Digital Trees and Memoryless Sources: from Arithmetics to Analysis
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.233-260, ⟨10.46298/dmtcs.2799⟩
hal-00452702v2  Conference papers
Frédérique BassinoJulien ClémentJ. FayolleP. Nicodème. Counting occurrences for a finite set of words: an inclusion-exclusion approach
2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.31-46, ⟨10.46298/dmtcs.3543⟩
hal-00003234v1  Conference papers
Cyril BanderierJean-Marie Le BarsVlady Ravelomanana. Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)
Formal Power Series and Algebraic Combinatorics (FPSAC'04), 2004, Vancouver, Canada. pp.91-105
hal-01900814v1  Conference papers
Olivier BodiniJulien CourtielSergey DovgalHsien-Kuei Hwang. Asymptotic distribution of parameters in random maps
29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Jun 2018, Uppsala, Sweden. pp.13:1-13:12, ⟨10.4230/LIPIcs.AofA.2018.13⟩
hal-00452701v2  Conference papers
Frédérique BassinoJulien ClémentJulien FayollePierre Nicodème. Constructions for Clumps Statistics.
5th International Colloquium on Mathematics and Computer Science (MathInfo'08), Sep 2008, Blaubeuren, Germany. pp.183-198., ⟨10.46298/dmtcs.3563⟩
hal-03073783v1  Book sections
Paul Dorbec. Power domination in graphs
Topics in Domination in Graphs, 2020, 978-3-030-51117-3. ⟨10.1007/978-3-030-51117-3_16⟩
tel-01134104v1  Theses
Thu Hien Nguyen Thi. Towards a realistic analysis of sorting and searching algorithms
Computer Science [cs]. Université de Caen Basse-Normandie, 2014. English
hal-01650141v2  Journal articles
Julien CourtielKaren YeatsNoam Zeilberger. Connected chord diagrams and bridgeless maps
The Electronic Journal of Combinatorics, Open Journal Systems, 2019, 26 (4), pp.1-56. ⟨10.37236/7400⟩
hal-01184797v1  Conference papers
Brigitte ValléeAntonio Vera. Lattice reduction in two dimensions: analyses under realistic probabilistic models
2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.197-234, ⟨10.46298/dmtcs.3549⟩
hal-01708989v1  Journal articles
Julien ClémentLaura Giambruno. Representing prefix and border tables: results on enumeration
Mathematical Structures in Computer Science, 2017, 27 (02), pp.257 - 276. ⟨10.1017/S0960129515000146⟩
hal-02152162v1  Conference papers
Ali AkhaviJulien ClémentDimitri DarthenayLoïck LhoteBrigitte Vallée. Dichotomic Selection on Words: A Probabilistic Analysis
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), Jun 2019, Pisa, Italy. pp.19:1-19:19, ⟨10.4230/LIPIcs.CPM.2019.19⟩
hal-03795072v1  Conference papers
Paul Dorbec. Searching Posets: from dichotomy to the golden ratio
Maribor Graph Theory Conference, Faculty of Natural Sciences and Mathematics, University of Maribor, Sep 2022, Maribor, Slovenia
hal-01184715v1  Conference papers
Eda CesarattoAlain PlagneBrigitte Vallée. On the non-randomness of modular arithmetic progressions: a solution to a problem by V. I. Arnold
Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.271-288, ⟨10.46298/dmtcs.3510⟩