Julien David

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the average-case complexity of Berge algorithm Theoretical Computer Science	2026-01-14	Paper
A Markov chain for lattice polytopes	2024-10-31	Paper
Approximate Cartesian tree matching: an approach using swaps	2024-05-29	Paper
Elementary moves on lattice polytopes Journal of Combinatorial Theory. Series A	2020-02-21	Paper
Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications Algorithms and Discrete Applied Mathematics	2016-03-23	Paper
An average study of hypergraphs and their minimal transversals Theoretical Computer Science	2015-07-24	Paper
Asymptotic enumeration of minimal automata (available as arXiv preprint)	2012-08-23	Paper
Average case analysis of Moore's state minimization algorithm Algorithmica	2012-04-26	Paper
On the average complexity of Moore's state minimization algorithm	2012-04-24	Paper
Average complexity of Moore's and Hopcroft's algorithms Theoretical Computer Science	2012-03-13	Paper
Enumeration and random generation of possibly incomplete deterministic automata	2011-02-22	Paper
The average complexity of Moore's state minimization algorithm is \(\mathcal O( n \log\log n)\) Mathematical Foundations of Computer Science 2010	2010-09-03	Paper
REGAL: A Library to Randomly and Exhaustively Generate Automata Implementation and Application of Automata	2008-06-10	Paper

Research outcomes over time

This page was built for person: Julien David