The SCEAS System
| |||||||

## Search the dblp DataBase
Gopal Pandurangan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Suresh Jagannathan, Gopal Pandurangan, Siriam Srinivasan
**Query Protocols for Highly Resilient Peer-to-Peer Networks.**[Citation Graph (0, 0)][DBLP] ISCA PDCS, 2006, pp:247-252 [Conf] - Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
**Using PageRank to Characterize Web Structure.**[Citation Graph (0, 0)][DBLP] COCOON, 2002, pp:330-339 [Conf] - Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
**Building Low-Diameter P2P Networks.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:492-499 [Conf] - Milos Hauskrecht, Gopal Pandurangan, Eli Upfal
**Computing Near Optimal Strategies for Stochastic Investment Planning Problems.**[Citation Graph (0, 0)][DBLP] IJCAI, 1999, pp:1310-1315 [Conf] - Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
**Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis.**[Citation Graph (0, 0)][DBLP] IPSN, 2005, pp:348-355 [Conf] - Gopal Pandurangan, GaHyun Park
**Brief announcement: analysis of a randomized contention-resolution protocol for distributed access.**[Citation Graph (0, 0)][DBLP] PODC, 2005, pp:274- [Conf] - Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pandurangan
**A random graph approach to NMR sequential assignment.**[Citation Graph (0, 0)][DBLP] RECOMB, 2004, pp:58-67 [Conf] - S. Muthukrishnan, Gopal Pandurangan
**The bin-covering technique for thresholding random geometric graph properties.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:989-998 [Conf] - Gopal Pandurangan, Eli Upfal
**Can entropy characterize performance of online algorithms?.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:727-734 [Conf] - Gopal Pandurangan, Eli Upfal
**Static and Dynamic Evaluation of QoS Properties.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:566-573 [Conf] - Maleq Khan, Gopal Pandurangan
**A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.**[Citation Graph (0, 0)][DBLP] DISC, 2006, pp:355-369 [Conf] - Hetunandan Kamisetty, Chris Bailey-Kellogg, Gopal Pandurangan
**An efficient randomized algorithm for contact-based NMR backbone resonance assignment.**[Citation Graph (0, 0)][DBLP] Bioinformatics, 2006, v:22, n:2, pp:172-180 [Journal] - Gopal Pandurangan
**On a simple randomized algorithm for finding a 2-factor in sparse graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:95, n:1, pp:321-327 [Journal] - Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pandurangan
**A Random Graph Approach to NMR Sequential Assignment.**[Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 2005, v:12, n:6, pp:569-583 [Journal] - Gopal Pandurangan, Ramesh Hariharan
**The restriction mapping problem revisited.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:3, pp:526-544 [Journal] - Gopal Pandurangan, Eli Upfal
**Static and Dynamic Evaluation of QoS Properties.**[Citation Graph (0, 0)][DBLP] Journal of Interconnection Networks, 2000, v:1, n:2, pp:135-150 [Journal] - Gopal Pandurangan, Eli Upfal
**Entropy-based bounds for online algorithms.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal] - Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
**Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:9, pp:987-1000 [Journal] - Alessandro Ferrante, Gopal Pandurangan, Kihong Park
**On the Hardness of Optimization in Power Law Graphs.**[Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:417-427 [Conf] - Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar
**A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:385, n:1-3, pp:101-114 [Journal] **Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks.**[Citation Graph (, )][DBLP]**Contact replacement for NMR resonance assignment.**[Citation Graph (, )][DBLP]**Latency-sensitive power control for wireless ad-hoc networks.**[Citation Graph (, )][DBLP]**Efficient distributed approximation algorithms via probabilistic tree embeddings.**[Citation Graph (, )][DBLP]**Fast distributed random walks.**[Citation Graph (, )][DBLP]**Brief announcement: locality-based aggregate computation in wireless sensor networks.**[Citation Graph (, )][DBLP]**Efficient distributed random walks with applications.**[Citation Graph (, )][DBLP]**Energy-optimal distributed algorithms for minimum spanning trees.**[Citation Graph (, )][DBLP]**Optimal gossip-based aggregate computation.**[Citation Graph (, )][DBLP]**Analysis of Randomized Protocols for Conflict-Free Distributed Access.**[Citation Graph (, )][DBLP]**A Universal Online Caching Algorithm Based on Pattern Matching.**[Citation Graph (, )][DBLP]**Near-Optimal Sublinear Time Bounds for Distributed Random Walks**[Citation Graph (, )][DBLP]**Optimal Gossip-Based Aggregate Computation**[Citation Graph (, )][DBLP]**A fast distributed approximation algorithm for minimum spanning trees.**[Citation Graph (, )][DBLP]
Search in 0.037secs, Finished in 0.040secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |