Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networ...
Hadhami Dhraief, Alfons Kemper, Wolfgang Nejdl, Ch...
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...