Oliveira, Mateus de Oliveira
113  Ergebnisse:
Personensuche X
?
1

Mortality and Edge-to-Edge Reachability are Decidable on Su..:

, In: 25th ACM International Conference on Hybrid Systems: Computation and Control,
 
?
2

Synthesis and Analysis of Petri Nets from Causal Specificat..:

, In: Computer Aided Verification; Lecture Notes in Computer Science,
de Oliveira Oliveira, Mateus - p. 447-467 , 2022
 
?
3

Learning from Positive and Negative Examples: Dichotomies a..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
 
?
4

On the Fine Grained Complexity of Finite Automata Non-empti..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,
 
?
6

Second-Order Finite Automata:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,
 
?
7

Social Perceptions About Adopting Smartphone Applications i..:

, In: 16th International Conference on Information Technology-New Generations (ITNG 2019); Advances in Intelligent Systems and Computing,
 
?
8

Social dimensions in the acceptance of and access to techno..:

, In: Proceedings of the 18th Brazilian Symposium on Human Factors in Computing Systems,
 
?
9

On the Width of Regular Classes of Finite Structures:

, In: Lecture Notes in Computer Science; Automated Deduction – CADE 27,
 
?
10

A near-quadratic lower bound for the size of quantum circui..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
de Oliveira Oliveira, Mateus - p. 136-145 , 2018
 
?
11

On Weak Isomorphism of Rooted Vertex-Colored Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
 
?
12

Social Perceptions about Adopting Smartphone Applications i..:

, In: Proceedings of the XIV Brazilian Symposium on Information Systems,
 
?
13

Graph Amalgamation Under Logical Constraints:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
de Oliveira Oliveira, Mateus - p. 152-163 , 2018
 
?
14

Intersection Non-emptiness and Hardness Within Polynomial T..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,
 
?
15

A Near-Quadratic Lower Bound for the Size of Quantum Circui..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
de Oliveira Oliveira, Mateus - p. 136-145 , 2018
 
1-15