Dimitri Surinx

Orcid: 0000-0003-0718-8854

According to our database1, Dimitri Surinx authored at least 11 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Executable First-Order Queries in the Logic of Information Flows.
Log. Methods Comput. Sci., 2024

2023
Inputs, Outputs, and Composition in the Logic of Information Flows.
ACM Trans. Comput. Log., October, 2023

On the Use of AutoML for Combating Alert Fatigue in Security Operations Centers.
Proceedings of the Computer Security. ESORICS 2023 International Workshops, 2023

2019
A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries.
Inf. Process. Lett., 2019

A framework for comparing query languages in their ability to express boolean queries.
Ann. Math. Artif. Intell., 2019

Fully Generic Queries: Open Problems and Some Partial Answers.
Proceedings of the Model and Data Engineering - 9th International Conference, 2019

Additive First-Order Queries.
Proceedings of the 22nd International Conference on Database Theory, 2019

2017
A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries
PhD thesis, 2017

The primitivity of operators in the algebra of binary relations under conjunctions of containments.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2015
Relative expressive power of navigational querying on graphs.
Inf. Sci., 2015

Relative expressive power of navigational querying on graphs using transitive closure.
Log. J. IGPL, 2015


  Loading...