Haase, Christoph
604  results:
Search for persons X
?
1

Reachability in Fixed VASS: Expressiveness and Lower Bounds:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,
 
?
2

Quantifier elimination for counting extensions of Presburge..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,
 
?
3

Geometric decision procedures and the VC dimension of linea..:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,
 
?
4

Preface:

Bojańczyk, Mikołaj ; Brihaye, Thomas ; Haase, Christoph...
Information and Computation.  277 (2021)  - p. 104579 , 2021
 
?
5

On the Expressiveness of Büchi Arithmetic:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,
Haase, Christoph ; Różycki, Jakub - p. 310-323 , 2021
 
?
 
?
9

Directed Reachability for Infinite-State Systems:

, In: Tools and Algorithms for the Construction and Analysis of Systems; Lecture Notes in Computer Science,
 
?
11

Approaching Arithmetic Theories with Finite-State Automata:

, In: Language and Automata Theory and Applications; Lecture Notes in Computer Science,
Haase, Christoph - p. 33-43 , 2020
 
?
12

On the existential theories of Büchi arithmetic and linear ..:

, In: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
 
?
14

Presburger arithmetic with stars, rational subsets of graph..:

, In: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
Haase, Christoph ; Zetzsche, Georg - p. 1-14 , 2019
 
1-15