dblp.uni-trier.dewww.uni-trier.de

Christophe Prieur Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
14EERafal Goebel, Christophe Prieur, Andrew R. Teel: Smooth patchy control Lyapunov functions. Automatica 45(3): 675-683 (2009)
13EEFabien Tarissan, Matthieu Latapy, Christophe Prieur: Efficient Measurement of Complex Networks Using Link Queries CoRR abs/0904.3222: (2009)
2008
12EEThomas Loquen, Sophie Tarbouriech, Christophe Prieur: Stability of reset control systems with nonzero reference. CDC 2008: 3386-3391
11EEVincent Andrieu, Christophe Prieur: Uniting two Control Lyapunov Functions for affine systems. CDC 2008: 622-627
10EEChristophe Prieur, Dominique Cardon, Jean-Samuel Beuscart, Nicolas Pissard, Pascal Pons: The Stength of Weak cooperation: A Case Study on Flickr CoRR abs/0802.2317: (2008)
2007
9 Valérie dos Santos, Christophe Prieur: Boundary control of a channel - last improvements. ICINCO-ICSO 2007: 320-325
8EEInes Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur: Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton CoRR abs/0709.4117: (2007)
2004
7EEInes Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theor. Comput. Sci. 327(3): 349-373 (2004)
2003
6EEInes Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur: Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. Developments in Language Theory 2003: 373-385
5 Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292(1): 45-63 (2003)
2002
4EEChristophe Prieur: How to decide continuity of rational functions on infinite words. Theor. Comput. Sci. 276(1-2): 445-447 (2002)
2001
3EEChristophe Prieur: How to decide continuity of rational functions on infinite words. Theor. Comput. Sci. 250(1-2): 71-82 (2001)
2000
2 Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch: Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN 2000: 397-406
1997
1 Christophe Prieur, Christian Choffrut, Michel Latteux: Constructing Sequential Bijections. Structures in Logic and Computer Science 1997: 308-321

Coauthor Index

1Vincent Andrieu [11]
2Marie-Pierre Béal [2] [5]
3Jean-Samuel Beuscart [10]
4Dominique Cardon [10]
5Olivier Carton [2] [5]
6Christian Choffrut [1]
7Rafal Goebel [14]
8Ines Klimann [6] [7] [8]
9Matthieu Latapy [13]
10Michel Latteux [1]
11Sylvain Lombardy [6] [7] [8]
12Thomas Loquen [12]
13Jean Mairesse [6] [7] [8]
14Nicolas Pissard [10]
15Pascal Pons [10]
16Jacques Sakarovitch [2] [5]
17Valérie dos Santos [9]
18Sophie Tarbouriech [12]
19Fabien Tarissan [13]
20Andrew R. Teel [14]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)