Dimitri Surinx

According to our database, Dimitri Surinx authored at least 11 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Inputs, Outputs, and Composition in the Logic of Information Flows.

Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche

ACM Trans. Comput. Log., October, 2023

On the Use of AutoML for Combating Alert Fatigue in Security Operations Centers.

Davy Preuveneers, Javier Martínez Llamas, Irfan Bulut, Enrique Argones-Rúa, Pieter Verfaillie, Vince Demortier, Dimitri Surinx, Wouter Joosen

Proceedings of the Computer Security. ESORICS 2023 International Workshops, 2023

2020

Executable First-Order Queries in the Logic of Information Flows.

Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche

Proceedings of the 23rd International Conference on Database Theory, 2020

2019

A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries.

Dimitri Surinx, Jan Van den Bussche

Inf. Process. Lett., 2019

A framework for comparing query languages in their ability to express boolean queries.

Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht

Ann. Math. Artif. Intell., 2019

Fully Generic Queries: Open Problems and Some Partial Answers.

Dimitri Surinx, Jan Van den Bussche, Jonni Virtema

Proceedings of the Model and Data Engineering - 9th International Conference, 2019

Additive First-Order Queries.

Gerald Berger, Martin Otto, Andreas Pieris, Dimitri Surinx, Jan Van den Bussche

Proceedings of the 22nd International Conference on Database Theory, 2019

2017

A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries

Dimitri Surinx

PhD thesis, 2017

The primitivity of operators in the algebra of binary relations under conjunctions of containments.

Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2015

Relative expressive power of navigational querying on graphs.

George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu

Inf. Sci., 2015

Relative expressive power of navigational querying on graphs using transitive closure.

Dimitri Surinx, George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu

Log. J. IGPL, 2015