A
Aravind Srinivasan
Researcher at University of Maryland, College Park
Publications - 278
Citations - 14614
Aravind Srinivasan is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Approximation algorithm & Wireless network. The author has an hindex of 60, co-authored 266 publications receiving 13711 citations. Previous affiliations of Aravind Srinivasan include Graz University of Technology & Bell Labs.
Papers
More filters
Journal ArticleDOI
Low discrepancy sets yield approximate min-wise independent permutation families
TL;DR: This work shows connections of ϵ-approximate min-wise independent permutation families with low discrepancy sets for geometric rectangles, and gives explicit constructions of such families F of size nO(logn) for ϵ=1/nΘ(1), improving upon the previously best-known bound of Indyk.
The discrepancy of permutation families
TL;DR: In this article, it was shown that the discrepancy of any permutation of [n] = f1; 2;:::;ng is O( p n log(2 n) log(n) n).
Journal ArticleDOI
Efficient lookup on unstructured topologies
TL;DR: This work presents LMS, a protocol for efficient lookup on unstructured networks that uses a virtual namespace without imposing specific topologies, and demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size.
Proceedings ArticleDOI
New Constructive Aspects of the Lovasz Local Lemma
TL;DR: It is shown that the output distribution of the Moser-Tardos algorithm well-approximates the conditional LLL-distribution – the distribution obtained by conditioning on all bad events being avoided, and how a known bound on the probabilities of events in this distribution can be used for further probabilistic analysis and give new constructive and non-constructive results.
Journal ArticleDOI
Finding Large Independent Sets in Graphs and Hypergraphs
TL;DR: Here, it is shown that an RNC algorithm due to Beame and Luby finds an independent set of expected size $\alpha_k(H)$ and also derandomizes it for certain special cases.