2008 |
28 | EE | Bruno Gaujal,
Jean Mairesse:
Minimization of circuit registers: Retiming revisited.
Discrete Applied Mathematics 156(18): 3498-3505 (2008) |
27 | EE | Eitan Altman,
Bruno Gaujal,
Jean Mairesse:
Guest Editorial.
Discrete Event Dynamic Systems 18(4): 445-446 (2008) |
26 | EE | Thu-Ha Dao-Thi,
Jean Mairesse:
Zero-Automatic Networks.
Discrete Event Dynamic Systems 18(4): 499-536 (2008) |
2007 |
25 | EE | Thu-Ha Dao-Thi,
Jean Mairesse:
Zero-automatic queues and product form
CoRR abs/0707.3449: (2007) |
24 | EE | Jean Mairesse:
Products of irreducible random matrices in the (Max,+) Algebra
CoRR abs/0707.3672: (2007) |
23 | EE | Moez Draief,
Jean Mairesse,
Neil O'Connell:
Queues, stores, and tableaux
CoRR abs/0707.4104: (2007) |
22 | EE | Moez Draief,
Jean Mairesse:
Services within a busy period of an M/M/1 queue and Dyck paths
CoRR abs/0707.4124: (2007) |
21 | EE | Bruno Gaujal,
Stefan Haar,
Jean Mairesse:
Blocking a transition in a Free Choice net and what it tells about its throughput
CoRR abs/0707.4372: (2007) |
20 | EE | Sylvain Lombardy,
Jean Mairesse:
Series which are both max-plus and min-plus rational are unambiguous
CoRR abs/0709.3257: (2007) |
19 | EE | Ines Klimann,
Sylvain Lombardy,
Jean Mairesse,
Christophe Prieur:
Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton
CoRR abs/0709.4117: (2007) |
2006 |
18 | EE | Thu-Ha Dao-Thi,
Jean Mairesse:
Zero-automatic networks.
VALUETOOLS 2006: 3 |
17 | EE | Anne Bouillard,
Bruno Gaujal,
Jean Mairesse:
Extremal Throughputs in Free-Choice Nets.
Discrete Event Dynamic Systems 16(3): 327-352 (2006) |
16 | EE | Jean Mairesse,
Frédéric Mathéus:
Growth Series for Artin Groups of Dihedral Type.
IJAC 16(6): 1087-1108 (2006) |
2005 |
15 | EE | Thu-Ha Dao-Thi,
Jean Mairesse:
Zero-Automatic Queues.
EPEW/WS-FM 2005: 64-78 |
14 | EE | Anne Bouillard,
Bruno Gaujal,
Jean Mairesse:
Extremal Throughputs in Free-Choice Nets.
ICATPN 2005: 108-127 |
13 | EE | Moez Draief,
Jean Mairesse:
Services within a Busy Period of an M/M/1 Queue and Dyck Paths.
Queueing Syst. 49(1): 73-84 (2005) |
2004 |
12 | EE | Ines 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 |
11 | EE | Moez Draief,
Jean Mairesse,
Neil O'Connell:
Joint Burke's Theorem and RSK Representation for a Queue and a Store.
DRW 2003: 69-82 |
10 | EE | Anne Bouillard,
Jean Mairesse:
Generating Series of the Trace Group.
Developments in Language Theory 2003: 159-170 |
9 | EE | Ines Klimann,
Sylvain Lombardy,
Jean Mairesse,
Christophe Prieur:
Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton.
Developments in Language Theory 2003: 373-385 |
8 | EE | Daniel Krob,
Jean Mairesse,
Ioannis Michos:
Computing the average parallelism in trace monoids.
Discrete Mathematics 273(1-3): 131-162 (2003) |
7 | EE | Bruno Gaujal,
Stefan Haar,
Jean Mairesse:
Blocking a transition in a free choice net and what it tells about its throughput.
J. Comput. Syst. Sci. 66(3): 515-548 (2003) |
2002 |
6 | EE | Daniel Krob,
Jean Mairesse,
Ioannis Michos:
On the Average Parallelism in Trace Monoids.
STACS 2002: 477-488 |
5 | EE | Jean Mairesse,
Laurent Vuillon:
Asymptotic behavior in a heap model with two pieces.
Theor. Comput. Sci. 270(1-2): 525-560 (2002) |
2001 |
4 | EE | Daniel Krob,
Jean Mairesse,
Ioannis Michos:
Computing the average parallelism in trace monoids
CoRR cs.DM/0112012: (2001) |
3 | EE | Daniel Krob,
Jean Mairesse,
Ioannis Michos:
On the average Cartier-Foata height of traces.
Electronic Notes in Discrete Mathematics 10: 164-171 (2001) |
2000 |
2 | EE | Sabrina Mantaci,
Vincent D. Blondel,
Jean Mairesse:
Bilinear Functions and Trees over the (max, +) Semiring.
MFCS 2000: 549-558 |
1 | EE | Bruno Gaujal,
Alain Jean-Marie,
Jean Mairesse:
Computations of Uniform Recurrence Equations Using Minimal Memory Size.
SIAM J. Comput. 30(5): 1701-1738 (2000) |