Michel Petitot

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with François Boulier

> Home > Persons > Michel Petitot

Publications

2011
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/casc/BoulierLPS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/casc/BoulierLPS11
François Boulier, François Lemaire, Michel Petitot, Alexandre Sedoglavic:
Chemical Reaction Systems, Computer Algebra and Systems Biology - (Invited Talk). CASC 2011: 73-87
2010
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/anb/VidalPBLK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/anb/VidalPBLK10
Samuel Vidal, Michel Petitot, François Boulier, François Lemaire, Céline Kuttler:
Models of Stochastic Gene Expression and Weyl Algebra. ANB 2010: 76-97
2009
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/aaecc/BoulierLOP09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aaecc/BoulierLOP09
François Boulier, Daniel Lazard, François Ollivier, Michel Petitot:
Computing representations for radicals of finitely generated differential ideals. Appl. Algebra Eng. Commun. Comput. 20(1): 73-121 (2009)
1995
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/issac/BoulierLOP95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/issac/BoulierLOP95
François Boulier, Daniel Lazard, François Ollivier, Michel Petitot:
Representation for the Radical of a Finitely Generated Differential Ideal. ISSAC 1995: 158-166

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.