Search for persons
X
?
Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures ,
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:
?
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science ,
3
Geometric decision procedures and the VC dimension of linea..:
, In:
?
Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures ,
5
On the Expressiveness of Büchi Arithmetic:
, In:
?
Tools and Algorithms for the Construction and Analysis of Systems; Lecture Notes in Computer Science ,
9
Directed Reachability for Infinite-State Systems:
, In:
?
Language and Automata Theory and Applications; Lecture Notes in Computer Science ,
11
Approaching Arithmetic Theories with Finite-State Automata:
, In:
?
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science ,
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