Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Schmitz, Sylvain
203  Ergebnisse:
Personensuche X
?
1

Verifying Unboundedness via Amalgamation:

, In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science,
Anand, Ashwani ; Schmitz, Sylvain ; Schütze, Lia. - p. 1-15 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

On the Computation of the Zariski Closure of Finitely Gener..:

, In: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation,
Nosan, Klara ; Pouly, Amaury ; Schmitz, Sylvain.. - p. 129-138 , 2022
Link: https://dl.acm.org/doi/1..
 
?
3

The ideal view on Rackoff's coverability technique:

Lazić, Ranko ; Schmitz, Sylvain
Information and Computation.  277 (2021)  - p. 104582 , 2021
Link: https://doi.org/10.1016/..
 
?
4

Reachability Problems: 14th International Conference, RP 20.. 

Theoretical Computer Science and General Issues, 12448
Schmitz, Sylvain ; Potapov, Igor - 1st ed. 2020 . , 2020
Link: https://doi.org/10.1007/..
 
?
5

On Ordinal Invariants in Well Quasi Orders and Finite Antic..:

, In: Trends in Logic; Well-Quasi Orders in Computation, Logic, Language and Reasoning,
Džamonja, Mirna ; Schmitz, Sylvain ; Schnoebelen, Philippe - p. 29-54 , 2020
Link: https://doi.org/10.1007/..
 
?
6

Decidable XPath Fragments in the Real World:

, In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Baelde, David ; Lick, Anthony ; Schmitz, Sylvain - p. 285-302 , 2019
Link: https://dl.acm.org/doi/1..
 
?
7

Bisimulation equivalence of first-order grammars is ACKERMA..:

, In: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
Jančar, Petr ; Schmitz, Sylvain - p. 1-12 , 2019
Link: https://dl.acm.org/doi/1..
 
?
8

Coverability Is Undecidable in One-Dimensional Pushdown Vec..:

, In: Lecture Notes in Computer Science; Reachability Problems,
Schmitz, Sylvain ; Zetzsche, Georg - p. 193-201 , 2019
Link: https://doi.org/10.1007/..
 
?
9

Reachability in vector addition systems is primitive-recurs..:

, In: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
Leroux, Jérôme ; Schmitz, Sylvain - p. 1-13 , 2019
Link: https://dl.acm.org/doi/1..
 
?
10

Perfect half space games:

, In: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science,
Colcombet, Thomas ; Jurdziński, Marcin ; Lazić, Ranko. - p. 1-11 , 2017
Link: https://dl.acm.org/doi/1..
 
?
11

IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE:

SCHMITZ, SYLVAIN
The Journal of Symbolic Logic.  81 (2016)  2 - p. 641-661 , 2016
Link: https://doi.org/10.1017/..
 
?
12

The Complexity of Coverability in ν-Petri Nets:

, In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science,
Lazić, Ranko ; Schmitz, Sylvain - p. 467-476 , 2016
Link: https://dl.acm.org/doi/1..
 
?
13

The complexity of reachability in vector addition systems:

Schmitz, Sylvain
ACM SIGLOG News.  3 (2016)  1 - p. 4-21 , 2016
Link: https://doi.org/10.1145/..
 
?
14

The complexity of reachability in vector addition systems:

Schmitz, Sylvain
ACM SIGLOG News.  3 (2016)  1 - p. 4-21 , 2016
Link: https://dl.acm.org/doi/1..
 
?
15

Complexity Hierarchies beyond Elementary:

Schmitz, Sylvain
ACM Transactions on Computation Theory.  8 (2016)  1 - p. 1-36 , 2016
Link: https://doi.org/10.1145/..
 
1-15