| Publication | Date of Publication | Type |
|---|
| An iterative approach for counting reduced ordered binary decision diagrams | 2024-12-03 | Paper |
| An iterative approach for counting reduced ordered binary decision diagrams | 2022-11-09 | Paper |
Binary decision diagrams: from tree compaction to sampling
(available as arXiv preprint) | 2022-10-13 | Paper |
| Dichotomic Selection on Words: A Probabilistic Analysis | 2022-07-18 | Paper |
Analysis of fast versions of the Euclid algorithm
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Binary Decision Diagrams: from Tree Compaction to Sampling
(available as arXiv preprint) | 2019-07-15 | Paper |
Trees for algorithmics
Mathématiques & Applications (Berlin) | 2018-07-24 | Paper |
Towards a realistic analysis of some popular sorting algorithms
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Representing prefix and border tables: results on enumeration
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
| A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms | 2017-01-30 | Paper |
Towards a realistic analysis of the QuickSelect algorithm
Theory of Computing Systems | 2016-06-03 | Paper |
| scientific article; zbMATH DE number 6469204 (Why is no real title available?) | 2015-08-03 | Paper |
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Counting occurrences for a finite set of words
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On the number of prefix and border tables
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Self-stabilizing counting in mobile sensor networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| Reverse engineering prefix tables | 2012-04-24 | Paper |
The cost of probabilistic agreement in oblivious robot networks
Information Processing Letters | 2012-01-18 | Paper |
| Average depth in a binary search tree with repeated keys | 2010-07-05 | Paper |
The Number of Symbol Comparisons in QuickSort and QuickSelect
Automata, Languages and Programming | 2009-07-14 | Paper |
Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
Journal of Symbolic Computation | 2009-06-18 | Paper |
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Parsing with a finite dictionary
Theoretical Computer Science | 2005-08-01 | Paper |
The standard factorization of Lyndon words: an average point of view
Discrete Mathematics | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 1948508 (Why is no real title available?) | 2003-07-13 | Paper |
Dynamical sources in information theory: A general analysis of trie structures
Algorithmica | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1303595 (Why is no real title available?) | 1999-06-17 | Paper |
