ask others

Michael Blondin

> Home > Persons

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

showing all ?? records

2010 – today

see FAQ

What is the meaning of the colors in the publication lists?

2018
[j4]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/iandc/BlondinFM18
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/iandc/BlondinFM18
Michael Blondin, Alain Finkel, Pierre McKenzie:
Handling infinitely branching well-structured transition systems. Inf. Comput. 258: 28-49 (2018)
[c8]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/stacs/BlondinEJ18
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stacs/BlondinEJ18
Michael Blondin, Javier Esparza, Stefan Jaax:
Large Flocks of Small Birds: on the Minimal Size of Population Protocols. STACS 2018: 16:1-16:14
[i7]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1801-00742
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1801-00742
Michael Blondin, Javier Esparza, Stefan Jaax:
Large Flocks of Small Birds: On the Minimal Size of Population Protocols. CoRR abs/1801.00742 (2018)
2017
[j3]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/lmcs/BlondinFM17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/lmcs/BlondinFM17
Michael Blondin, Alain Finkel, Pierre McKenzie:
Well Behaved Transition Systems. Logical Methods in Computer Science 13(3) (2017)
[j2]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - journals/tocl/BlondinFHH17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tocl/BlondinFHH17
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log. 18(3): 24:1-24:28 (2017)
[c7]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/fsttcs/BlondinFG17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/fsttcs/BlondinFG17
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS 2017: 16:1-16:15
[c6]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/lics/BlondinH17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/lics/BlondinH17
Michael Blondin, Christoph Haase:
Logics for continuous reachability in Petri nets and vector addition systems with states. LICS 2017: 1-12
[c5]
- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/podc/BlondinEJM17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/podc/BlondinEJM17
Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer:
Towards Efficient Verification of Population Protocols. PODC 2017: 423-430
[i6]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/BlondinJEM17
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/BlondinJEM17
Michael Blondin, Stefan Jaax, Javier Esparza, Philipp J. Meyer:
Towards Efficient Verification of Population Protocols. CoRR abs/1703.04367 (2017)
[i5]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/abs-1710-07258
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/abs-1710-07258
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. CoRR abs/1710.07258 (2017)
2016
[b1]
- view
  - electronic edition @ archives-ouvertes.fr
- export record
  dblp key:
  - phd/hal/Blondin16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/phd/hal/Blondin16
Michael Blondin:
Algorithmique et complexité des systèmes à compteurs. (Algorithmics and complexity of counter machines). University of Paris-Saclay, France 2016
[j1]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/cc/BlondinKM16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/cc/BlondinKM16
Michael Blondin, Andreas Krebs, Pierre McKenzie:
The complexity of intersecting finite automata having few final states. Computational Complexity 25(4): 775-814 (2016)
[c4]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/tacas/BlondinFHH16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/tacas/BlondinFHH16
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
Approaching the Coverability Problem Continuously. TACAS 2016: 480-496
[i4]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/BlondinFM16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/BlondinFM16
Michael Blondin, Alain Finkel, Pierre McKenzie:
Well Behaved Transition Systems. CoRR abs/1608.02636 (2016)
2015
[c3]
- view
- export record
  dblp key:
  - conf/lics/BlondinFGHM15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/lics/BlondinFGHM15
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS 2015: 32-43
[i3]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/BlondinFHH15
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/BlondinFHH15
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
Approaching the Coverability Problem Continuously. CoRR abs/1510.05724 (2015)
2014
[c2]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/icalp/BlondinFM14
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/icalp/BlondinFM14
Michael Blondin, Alain Finkel, Pierre McKenzie:
Handling Infinitely Branching WSTS. ICALP (2) 2014: 13-25
[i2]
- view
  - electronic edition @ arxiv.org
- export record
  dblp key:
  - journals/corr/BlondinFGHM14
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/corr/BlondinFGHM14
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR abs/1412.4259 (2014)
2012
[c1]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - conf/csr/BlondinM12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/csr/BlondinM12
Michael Blondin, Pierre McKenzie:
The Complexity of Intersecting Finite Automata Having Few Final States. CSR 2012: 31-42
[i1]
- view
  - electronic edition @ hpi-web.de
- export record
  dblp key:
  - journals/eccc/BlondinKM12
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/eccc/BlondinKM12
Michael Blondin, Andreas Krebs, Pierre McKenzie:
The Complexity of Intersecting Finite Automata Having Few Final States. Electronic Colloquium on Computational Complexity (ECCC) 19: 90 (2012)

Coauthor Index

see FAQ

maintained by

at