302 articles – 345 references  [version française]
.:. Browse > List by year > 2004 .:.
37 documents ordered by :
1 - 2 - 3 Next Last
fulltext access Jeux abstraits et composition catégorique
hirschowitz M.
Université Paris-Diderot - Paris VII (17/12/2004), Danos Vincent (Dir.) [tel-00008275 - version 1]
fulltext access On timed automata with input-determined guards
D'Souza D., Tabareau N.
Dans Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems - Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, France (2004) [hal-00017462 - version 1]
fulltext access Representation of the Signal Transduction with Aberrance Using Ipi Calculus
Zhang M., Li G., Fu F., Zhang Z., He L.
Dans Computational and Information Science - First International Symposium, CIS 2004, Chine (2004) [hal-00155354 - version 1]
fulltext access Un cadre quantitatif pour la Ludique
Maurel F.
Université Paris-Diderot - Paris VII (26/11/2004), Pierre-Louis Curien (Dir.) [tel-00152476 - version 1]
Components of the fundamental category
Goubault E.
Applied Categorical Structures 12, 1 (2004) 81-108 [hal-00150859 - version 1]
Formal Molecular Biology
Danos V., Laneve C.
Theoretical Computer Science 325, 1 (2004) 69-110 [hal-00164591 - version 1]
Modeling and Querying biological networks
Chabrier N., Chiaverini M., Danos V., Fages F., Schachter V.
Theoretical Computer Science 325, 1 (2004) 25-44 [hal-00164592 - version 1]
Labeled Markov processes: stronger and faster approximations
Danos V., Desharnais J., Panangaden P.
Electronic Notes in Theoretical Computer Science 87 (2004) 157-203 [hal-00164589 - version 1]
fulltext access Asynchronous games 2: the true concurrency of innocence
Melliès P.-A.
Dans CONCUR 2004 -- Concurrency Theory - CONCUR 2004 -- Concurrency Theory, Royaume-Uni (2004) [hal-00154286 - version 1]
Ensuring termination by typability
Deng Y.
Dans Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science - (2004) [hal-00159679 - version 1]
fulltext accessible on an other server State monads and their algebras
Métayer F.
[hal-00148695 - version 1] (2007-05-23)
Towards an algebraic theory of typed mobile processes
Deng Y.
Dans Proceedings of the 31st International Colloquium on Automata, Languages and Programming - (2004) [hal-00159674 - version 1]
fulltext access Subsitutions explicites, logique et normalisation
Polonovski E.
Université Paris-Diderot - Paris VII (30/06/2004), Pierre-Louis Curien (Dir.) [tel-00007962 - version 1]
Massively multi-player games: matching game design with technical design
Bosser A.-G.
Dans Proceedings of the 2004 ACM SIGCHI International Conference on Advances in computer entertainment technology - Advances in Computer Entertainment technology, Singapour (2004) [hal-00150841 - version 1]
Deriving strong normalisation
Lengrand S.
Dans Proceedings of the 2nd International Workshop on Higher-Order Rewriting (HOR'04) - Higher-Order Rewriting (HOR'04), Allemagne (2004) [hal-00150289 - version 1]