Sylvain Schmitz

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 Ranko Lazic 0001

> Home > Persons > Sylvain Schmitz

Publications

2021
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/iandc/LazicS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/LazicS21
Ranko Lazic, Sylvain Schmitz:
The ideal view on Rackoff's coverability technique. Inf. Comput. 277: 104582 (2021)
2017
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/lics/ColcombetJLS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lics/ColcombetJLS17
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Perfect half space games. LICS 2017: 1-11
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ColcombetJLS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ColcombetJLS17
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Perfect Half Space Games. CoRR abs/1704.05626 (2017)
2016
[c31]
- view
  authority control:
- export record
  dblp key:
  - conf/fossacs/HofmanLLLST16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fossacs/HofmanLLLST16
Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke:
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS 2016: 445-461
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/lics/LazicS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lics/LazicS16
Ranko Lazic, Sylvain Schmitz:
The Complexity of Coverability in ν-Petri Nets. LICS 2016: 467-476
2015
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tocl/LazicS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/LazicS15
Ranko Lazic, Sylvain Schmitz:
Nonelementary Complexities for Branching VASS, MELL, and Extensions. ACM Trans. Comput. Log. 16(3): 20:1-20:30 (2015)
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/JurdzinskiLS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/JurdzinskiLS15
Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. ICALP (2) 2015: 260-272
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/rp/LazicS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rp/LazicS15
Ranko Lazic, Sylvain Schmitz:
The Ideal View on Rackoff's Coverability Technique. RP 2015: 76-88
[i13]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/JurdzinskiLS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/JurdzinskiLS15
Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. CoRR abs/1502.06875 (2015)
2014
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/csl/LazicS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csl/LazicS14
Ranko Lazic, Sylvain Schmitz:
Non-elementary complexities for branching VASS, MELL, and extensions. CSL-LICS 2014: 61:1-61:10
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/LazicS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/LazicS14
Ranko Lazic, Sylvain Schmitz:
Non-Elementary Complexities for Branching VASS, MELL, and Extensions. CoRR abs/1401.6785 (2014)

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.