Julien David

Available identifiers

Publication	Date of Publication	Type
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	2020-02-21	Paper
Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications	2016-03-23	Paper
An average study of hypergraphs and their minimal transversals	2015-07-24	Paper
Asymptotic enumeration of minimal automata	2012-08-23	Paper
Average case analysis of Moore's state minimization algorithm	2012-04-26	Paper
https://portal.mardi4nfdi.de/entity/Q5389971	2012-04-24	Paper
Average complexity of Moore's and Hopcroft's algorithms	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)\)	2010-09-03	Paper
REGAL: A Library to Randomly and Exhaustively Generate Automata	2008-06-10	Paper

This page was built for person: Julien David