Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Pandurangan, Gopal"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Distributed computation in dynamic networks via random walks
Atish Das Sarma
,
Anisur Rahaman Molla
,
Gopal Pandurangan
Theoretical Computer Science
581
, 2015, pp. 45-66
Fast distributed PageRank computation
Atish Das Sarma
,
Anisur Rahaman Molla
,
Gopal Pandurangan
,
Eli Upfal
Theoretical Computer Science
561, Part B
, 2014, pp. 113-121
Sublinear bounds for randomized leader election
Shay Kutten
,
Gopal Pandurangan
,
David Peleg
,
Peter Robinson
,
Amitabh Trehan
Theoretical Computer Science
561, Part B
, 2014, pp. 134-143
Storage and search in dynamic peer-to-peer networks
John Augustine
,
Anisur Rahaman Molla
,
Ehab Morsy
,
Gopal Pandurangan
,
Peter Robinson
,
Eli Upfal
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013)
, 2013, pp. 53-62
Coalescing-branching random walks on graphs
Chinmoy Dutta
,
Gopal Pandurangan
,
Rajmohan Rajaraman
,
Scott Roche
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013)
, 2013, pp. 176-185
Efficient computation of balanced structures
David G. Harris
,
Ehab Morsy
,
Gopal Pandurangan
,
Peter Robinson
,
Aravind Srinivasan
Lecture Notes in Computer Science
7966
, 2013, pp. 581-593
Distributed random walks
Atish Das Sarma
,
Danupon Nanongkai
,
Gopal Pandurangan
,
Prasad Tetali
Journal of the ACM
60
(1), 2013, pp. 2: 1-31
Almost-optimal gossip-based aggregate computation
Jen-yeu Chen
,
Gopal Pandurangan
SIAM Journal on Computing
41
(3), 2012, pp. 455-483
Discovery through gossip
Bernhard Haeupler
,
Gopal Pandurangan
,
David Peleg
,
Rajmohan Rajaraman
,
Zhifeng Sun
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2012 (Pittsburgh, Pennsylvania, USA, June 25-27, 2012)
, 2012, pp. 140-149
Ballast
: A ball-based algorithm for structural motifs
Lu He
,
Fabio Vandin
,
Gopal Pandurangan
,
Chris Bailey-Kellogg
Lecture Notes in Computer Science
7262
, 2012, pp. 79-93
Efficient computation of distance sketches in distributed networks
Atish Das Sarma
,
Michael Dinitz
,
Gopal Pandurangan
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2012 (Pittsburgh, Pennsylvania, USA, June 25-27, 2012)
, 2012, pp. 318-326
Distributed verification and hardness of distributed approximation
Atish Das Sarma
,
Stephan Holzer
,
Liah Kor
,
Amos Korman
,
Danupon Nanongkai
,
Gopal Pandurangan
,
David Peleg
,
Roger Wattenhofer
SIAM Journal on Computing
41
(5), 2012, pp. 1235-1265
Distributed verification and hardness of distributed approximation
Atish Das Sarma
,
Stephan Holzer
,
Liah Kor
,
Amos Korman
,
Danupon Nanongkai
,
Gopal Pandurangan
,
David Peleg
,
Roger Wattenhofer
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 363-372
Optimal gossip-based aggregate computation
Jen-Yeu Chen
,
Gopal Pandurangan
Proceedings of the 22nd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2010 (Thira, Santorini, Greece, June 13-15, 2010)
, 2010, pp. 124-133
Thresholding random geometric graph properties motivated by ad hoc sensor networks
S. Muthukrishnan
,
Gopal Pandurangan
Journal of Computer and System Sciences
76
(7), 2010, pp. 686-696
A universal online caching algorithm based on pattern matching
Gopal Pandurangan
,
Wojciech Szpankowski
Algorithmica
57
(1), 2010, pp. 62-73
Energy-optimal distributed algorithms for minimum spanning trees
Yongwook Choi
,
Maleq Khan
,
V.S. Anil Kumar
,
Gopal Pandurangan
Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2008 (Munich, Germany, June 14-16, 2008)
, 2008, pp. 188-190
On the hardness of optimization in power-law graphs
Alessandro Ferrante
,
Gopal Pandurangan
,
Kihong Park
Theoretical Computer Science
393
(1-3), 2008, pp. 220-230
Contact replacement for NMR resonance assignment
Fei Xiong
,
Gopal Pandurangan
,
Chris Bailey-Kellogg
Bioinformatics
24
(13), 2008, pp. 205-213
On the hardness of optimization in power law graphs
Alessandro Ferrante
,
Gopal Pandurangan
,
Kihong Park
Lecture Notes in Computer Science
4598
, 2007, pp. 417-427
A simple randomized scheme for constructing low-weight
k
-connected spanning subgraphs with applications to distributed algorithms
Maleq Khan
,
Gopal Pandurangan
,
V.S. Anil Kumar
Theoretical Computer Science
385
(1-3), 2007, pp. 101-114
Analysis of randomized protocols for conflict-free distributed access
Gopal Pandurangan
,
Gahyun Park
Algorithmica
49
(2), 2007, pp. 109-126
An efficient randomized algorithm for contact-based NMR backbone resonance assignment
Hetunandan Kamisetty
,
Chris Bailey-Kellogg
,
Gopal Pandurangan
Bioinformatics
22
(2), 2006, pp. 172-180
On a simple randomized algorithm for finding a 2-factor in sparse graphs
Gopal Pandurangan
Information Processing Letters
95
(1), 2005, pp. 321-327
A random graph approach to NMR sequential assignment
Chris Bailey-Kellogg
,
Sheetal Chainraj
,
Gopal Pandurangan
Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology, RECOMB'2004 (San Diego, CA, USA, March 27-31, 2004)
, 2004, pp. 58-67
Seiten 1
2
>