This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
This paper presents a methodology to derive views over a relational database by applying a sequence of appropriately defined operations to the global schema. Such tailoring and com...
In this paper, we study the problem of maintaining metadata for open Web content. In digital libraries such as DLESE, NSDL and G-Portal, metadata records are created for some good ...
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...