We study the problem of SPARQL query optimization on top of distributed hash tables. Existing works on SPARQL query processing in such environments have never been implemented in a...
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...