|
Search the dblp DataBase
Franck Guingne:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Franck Guingne, André Kempe, Florent Nicart
Running Time Complexity of Printing an Acyclic Automaton. [Citation Graph (0, 0)][DBLP] CIAA, 2003, pp:131-140 [Conf]
- Franck Guingne, Florent Nicart
Finite State Lazy Operations in NLP. [Citation Graph (0, 0)][DBLP] CIAA, 2002, pp:138-147 [Conf]
- André Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne, Florent Nicart
WFSC - A New Weighted Finite State Compiler. [Citation Graph (0, 0)][DBLP] CIAA, 2003, pp:108-119 [Conf]
- André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart
A Class of Rational n-WFSM Auto-intersections. [Citation Graph (0, 0)][DBLP] CIAA, 2005, pp:188-198 [Conf]
- André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart
WFSM Auto-intersection and Join Algorithms. [Citation Graph (0, 0)][DBLP] FSMNLP, 2005, pp:120-131 [Conf]
- André Kempe, Franck Guingne, Florent Nicart
Algorithms for weighted multi-tape automata [Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal]
- Jean-Marc Champarnaud, Franck Guingne, Georges Hansel
Cover transducers for functions with finite domain. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:851-865 [Journal]
- Franck Guingne, Florent Nicart, Jean-Marc Champarnaud, Lauri Karttunen, Tamás Gaál, André Kempe
Virtual Operations On Virtual Networks: The Priority Union . [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1055-1071 [Journal]
- Franck Guingne, Florent Nicart, André Kempe
Acyclic networks maximizing the printing complexity. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:328, n:1-2, pp:39-51 [Journal]
- Jean-Marc Champarnaud, Franck Guingne, Jacques Farré
Reducing Acyclic Cover Transducers. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:38-50 [Conf]
Search in 0.027secs, Finished in 0.028secs
|