Michel Morvan

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 Philippe Baldy

> Home > Persons > Michel Morvan

Publications

2001
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/order/BaldyM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/order/BaldyM01
Philippe Baldy, Michel Morvan:
Height Preserving Minimal Interval Extensions. Order 18(1): 69-77 (2001)
1999
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/order/BaldyMT99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/order/BaldyMT99
Philippe Baldy, Michel Morvan, Eric Thierry:
Extending a Partially Ordered Set: Links with its Lattice of Ideals. Order 16(4): 305-312 (1999)
1994
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/cfcp/BaldyDMMV94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cfcp/BaldyDMMV94
Philippe Baldy, Hervé Dicky, Raoul Medina, Michel Morvan, Jean-François Vilarem:
Efficient Reconstruction of the Causal Relationship in Distributed Systems. Canada-France Conference on Parallel and Distributed Computing 1994: 101-113
1993
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/BaldyM93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BaldyM93
Philippe Baldy, Michel Morvan:
A Linear Time and Space Algorithm to Regonize Interval Orders. Discret. Appl. Math. 46(2): 173-178 (1993)

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.