The ubiquity of mobile devices has led to the deployment of many mobile applications for providing different types of services, like internet access, route recommendation, cab finder, nearby friends, etc. Some of these ...

Range Tree is a geometrical data structure used to store data in d-dimensions. In order to store larger amount of data in external memory, we need an I/O efficient algorithm. There are many I/O efficient algorithms ...

Enumerating maximal bicliques is essential to analyze several biological networks. For example bicliques in gene expression data helps us to maps a set of genes to their biological function. Statistical methods have been ...

Distinguishing between unitary operators is one of the fundamental problems in the field of quantum computing. In the operator identification problem, we are given access to unknown operator U as a black-box that implements ...

In this thesis we address the problem of computing closeness centrality, Harmonic centrality and a few related centrality measures that operate on the shortest paths in a graph. We consider sparse graphs, especially ...