FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
We extend Howe’s method to prove that input-early strong and -delay contextual bisimulations are congruences for the Higher-order mobile embedded resources (Homer) calculus, a ty...
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
We present novel algorithms for estimating the size of the natural join of two data streams that have efficient update processing times and provide excellent quality of estimates....
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
We construct a formal framework for investigating epistemic and temporal notions in the context of distributed quantum systems. While we rely on structures developed in [DDKP05], w...
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We consider exchange economies where the traders’ preferences are expressed in terms of the extensively used constant elasticity of substitution (CES) utility functions...
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
Let P be a set of n points in d-dimensional Euclidean space, where each of the points has integer coordinates from the range [−∆, ∆],