Gopal Pandurangan
Gopal Pandurangan
Professor of Computer Science, University of Houston
Vahvistettu sähköpostiosoite verkkotunnuksessa cs.uh.edu - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Algorithms and theory of computation handbook
MJ Atallah
CRC press, 1998
614*1998
Building Low-Diameter P2P Networks
G Pandurangan, P Raghavan, E Upfal
IEEE Symposium on the Foundations of Computer Science (FOCS), 492-499, 2001
455*2001
Distributed verification and hardness of distributed approximation
AD Sarma, S Holzer, L Kor, A Korman, D Nanongkai, G Pandurangan, ...
SIAM Journal on Computing 41 (5), 1235-1265, 2012
2752012
Using pagerank to characterize web structure
G Pandurangan, P Raghavan, E Upfal
International computing and combinatorics conference, 330-339, 2002
2452002
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
JY Chen, G Pandurangan, D Xu
IEEE Transactions on Parallel and Distributed Systems 17 (9), 987-1000, 2006
2422006
Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks
M Khan, G Pandurangan, VSA Kumar
IEEE Transactions on Parallel and Distributed Systems 20 (1), 124-139, 2008
1482008
Fast distributed pagerank computation
AD Sarma, AR Molla, G Pandurangan, E Upfal
Theoretical Computer Science 561, 113-121, 2015
1402015
The bin-covering technique for thresholding random geometric graph properties
S Muthukrishnan, G Pandurangan
SODA 2005, 989-998, 2005
116*2005
Distance matrix reconstruction from incomplete distance information for sensor network localization
P Drineas, A Javed, M Magdon-Ismail, G Pandurangan, R Virrankoski, ...
2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc …, 2006
912006
On the complexity of information spreading in dynamic networks
C Dutta, G Pandurangan, R Rajaraman, Z Sun, E Viola
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
82*2013
Distributed random walks
A Das Sarma, D Nanongkai, G Pandurangan, P Tetali
Journal of the ACM (JACM) 60 (1), 1-31, 2013
81*2013
Toward optimal bounds in the congested clique: Graph connectivity and MST
JW Hegeman, G Pandurangan, SV Pemmaraju, VB Sardeshmukh, ...
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015
802015
Distributed computation of large-scale graph problems
H Klauck, D Nanongkai, G Pandurangan, P Robinson
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
79*2014
Towards robust and efficient computation in dynamic peer-to-peer networks
J Augustine, G Pandurangan, P Robinson, E Upfal
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012
79*2012
Efficient distributed approximation algorithms via probabilistic tree embeddings
M Khan, F Kuhn, D Malkhi, G Pandurangan, K Talwar
Distributed Computing 25 (3), 189-205, 2012
752012
A fast distributed approximation algorithm for minimum spanning trees
M Khan, G Pandurangan
Distributed Computing 20 (6), 391-402, 2008
752008
Fast byzantine agreement in dynamic networks
J Augustine, G Pandurangan, P Robinson
Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013
612013
On the complexity of universal leader election
S Kutten, G Pandurangan, D Peleg, P Robinson, A Trehan
Journal of the ACM (JACM) 62 (1), 1-27, 2015
602015
Improved random graph isomorphism
T Czajka, G Pandurangan
Journal of Discrete Algorithms 6 (1), 85-92, 2008
552008
Xheal: a localized self-healing algorithm using expanders
G Pandurangan, A Trehan
Distributed computing 27 (1), 39-54, 2014
54*2014
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20