Julien David

	2012
8		Frédérique Bassino, Julien David, Andrea Sportiello: Asymptotic enumeration of Minimal Automata. STACS 2012: 88-99
7		Frédérique Bassino, Julien David, Cyril Nicaud: Average Case Analysis of Moore's State Minimization Algorithm. Algorithmica 63(1-2): 509-531 (2012)
6		Julien David: Average complexity of Moore's and Hopcroft's algorithms. Theor. Comput. Sci. 417: 50-65 (2012)
	2011
5		Frédérique Bassino, Julien David, Andrea Sportiello: Asymptotic enumeration of Minimal Automata CoRR abs/1109.5683: (2011)
	2010
4		Julien David: The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n). MFCS 2010: 318-329
	2009
3		Frédérique Bassino, Julien David, Cyril Nicaud: On the Average Complexity of Moore's State Minimization Algorithm. STACS 2009: 123-134
2		Frédérique Bassino, Julien David, Cyril Nicaud: On the Average Complexity of Moore's State Minimization Algorithm CoRR abs/0902.1048: (2009)
	2007
1		Frédérique Bassino, Julien David, Cyril Nicaud: : A Library to Randomly and Exhaustively Generate Automata. CIAA 2007: 303-305

Coauthor Index

1	Frédérique Bassino	[1] [2] [3] [5] [7] [8]
2	Cyril Nicaud	[1] [2] [3] [7]
3	Andrea Sportiello	[5] [8]

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page