A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
We present a space efficient approximate algorithm to compute k-core decomposition using O(n log d) space approximate algorithm to estimate k-cores in graphs, where n is the number of nodes, and d is the ... We present algorithms to compute h-index in various streaming settings and get a (1 ± ϵ) estimate of the h-index with sublinear, ie, polylog or even O(1) space. ... Muthu, a huge thank you! Acknowledgement of Previous Publications Portions of this dissertation are based on work previously published or submitted for publication by the author. ...fatcat:rufnw3lanbenplnlzsnv547r4e