3 papers
cs.DS2024
A faster algorithm for the construction of optimal factoring automata
Thomas Erlebach, Kleitos Papadopoulos
The problem of constructing optimal factoring automata arises in the context of unification factoring for the efficient execution of logic programs. Given an ordered set of str…
cs.DS2023
Sorting and Hypergraph Orientation under Uncertainty with Predictions
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow +1
Learning-augmented algorithms have been attracting increasing interest, but have only recently been considered in the setting of explorable uncertainty where precise values of unce…
cs.NI2012
Computational Complexity of Traffic Hijacking under BGP and S-BGP
Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach +1
Harmful Internet hijacking incidents put in evidence how fragile the Border Gateway Protocol (BGP) is, which is used to exchange routing information between Autonomous Systems (ASe…