![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Kee** Secrets in \(\mathcal {EL}^{+}\) Knowledge Bases
In this paper we study Secrecy-Preserving Query Answering problem under Open World Assumption (OWA) for \(\mathcal {EL}^+\) ...
-
Chapter and Conference Paper
Secrecy-Preserving Query Answering for Instance Checking in \(\mathcal{EL}\)
We consider the problem of answering queries against an \(\mathcal{EL}\) knowledge base (KB) using secrets, whenever it is possib...
-
Chapter and Conference Paper
Parametric Multiple Sequence Alignment and Phylogeny Construction
Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual for...
-
Chapter and Conference Paper
Complexity of Some Problems in Universal Algebra
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite universal algebras A and B, these problems ask: (1) Do A and B satisfy precisely the same identitie...
-
Chapter and Conference Paper
Using sparsification for parametric minimum spanning tree problems
Two applications of sparsification to parametric computing are given. The first is a fast algorithm for enumerating all distinct minimum spanning trees in a graph whose edge weights vary linearly with a parame...
-
Chapter and Conference Paper
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
We give a linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric mi...
-
Chapter and Conference Paper
Optimal parametric search on graphs of bounded tree-width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on planar gra...
-
Chapter and Conference Paper
A hierarchy of deterministic top-down tree transformations
The class DTT DR (respectively, DTT) is the family of all deterministic top-down tree transductions with deterministic top-down look-ahead (respectively, no look-ahead). In this pa...
-
Chapter and Conference Paper
Parametric problems on graphs of bounded tree-width
We consider optimization problems on weighted graphs where vertex and edge weights are polynomial functions of a parameter λ. We show that, if a problem satisfies certain regularity properties and the underlying ...
-
Chapter and Conference Paper
Solving parametric problems on trees
-
Chapter and Conference Paper
The complexity of a counting finite-state automaton
A counting finite-state automaton is a nondeterministic finite-state automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We exa...
-
Chapter and Conference Paper
Alternating tree automata
-
Chapter and Conference Paper
Descriptional complexity of concurrent processes (preliminary version)
This paper compares several algebraic software description techniques which were proposed recently. Using language theoretic tools we show that some of the most handy concurrent behavior descriptors (inverse s...
-
Chapter and Conference Paper
Parallel and two-way recognizers of directed acyclic graphs
-
Chapter and Conference Paper
Dags and Chomsky hierarchy