Aravind Srinivasan
Aravind Srinivasan
Professor of Computer Science, University of Maryland
Vahvistettu sähköpostiosoite verkkotunnuksessa - Kotisivu
Modelling disease outbreaks in realistic urban social networks
S Eubank, H Guclu, VSA Kumar, MV Marathe, A Srinivasan, Z Toroczkai, ...
Nature 429 (6988), 180-184, 2004
Mobile data offloading through opportunistic communications and social participation
B Han, P Hui, VSA Kumar, MV Marathe, J Shao, A Srinivasan
IEEE Transactions on mobile computing 11 (5), 821-834, 2011
data. table: Extension of ‘data. frame’
M Dowle, A Srinivasan, T Short, S Lianoglou
R package version 1 (4), 2017
Chernoff–Hoeffding bounds for applications with limited independence
JP Schmidt, A Siegel, A Srinivasan
SIAM Journal on Discrete Mathematics 8 (2), 223-250, 1995
P5: A protocol for scalable anonymous communication
R Sherwood, B Bhattacharjee, A Srinivasan
Journal of Computer Security 13 (6), 839-876, 2005
Cellular traffic offloading through opportunistic communications: a case study
B Han, P Hui, VSA Kumar, MV Marathe, G Pei, A Srinivasan
Proceedings of the 5th ACM workshop on Challenged networks, 31-38, 2010
Innovization: Innovating design principles through optimization
K Deb, A Srinivasan
Proceedings of the 8th annual conference on Genetic and evolutionary …, 2006
Splitters and near-optimal derandomization
M Naor, LJ Schulman, A Srinivasan
Proceedings of IEEE 36th Annual Foundations of Computer Science, 182-191, 1995
Client-driven channel management for wireless LANs
A Mishra, V Brik, S Banerjee, A Srinivasan, W Arbaugh
ACM SIGMOBILE Mobile Computing and Communications Review 10 (4), 8-10, 2006
Resilient multicast using overlays
S Banerjee, S Lee, B Bhattacharjee, A Srinivasan
ACM SIGMETRICS Performance Evaluation Review 31 (1), 102-113, 2003
Randomized distributed edge coloring via an extension of the Chernoff--Hoeffding bounds
A Panconesi, A Srinivasan
SIAM Journal on Computing 26 (2), 350-368, 1997
Algorithmic aspects of capacity in wireless networks
VSA Kumar, MV Marathe, S Parthasarathy, A Srinivasan
Proceedings of the 2005 ACM SIGMETRICS international conference on …, 2005
System and method for locating a closest server in response to a client domain name request
M Andrews, M Hofmann, B Shepherd, A Srinivasan, P Winkler, F Zane
US Patent 7,020,698, 2006
Approximation algorithms for partial covering problems
R Gandhi, S Khuller, A Srinivasan
Journal of Algorithms 53 (1), 55-84, 2004
Approximating thedomatic number
U Feige, MM Halldórsson, G Kortsarz, A Srinivasan
SIAM Journal on computing 32 (1), 172-195, 2002
Dependent rounding and its applications to approximation algorithms
R Gandhi, S Khuller, S Parthasarathy, A Srinivasan
Journal of the ACM (JACM) 53 (3), 324-360, 2006
'Beating the news' with EMBERS: Forecasting civil unrest using open source indicators
N Ramakrishnan, P Butler, S Muthiah, N Self, R Khandpur, P Saraf, ...
Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014
Improved bounds and algorithms for hypergraph 2‐coloring
J Radhakrishnan, A Srinivasan
Random Structures & Algorithms 16 (1), 4-32, 2000
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
D Dubhashi, A Mei, A Panconesi, J Radhakrishnan, A Srinivasan
Journal of Computer and System Sciences 71 (4), 467-479, 2005
Predicting trust and distrust in social networks
T DuBois, J Golbeck, A Srinivasan
2011 IEEE third international conference on privacy, security, risk and …, 2011
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20