![]() | ![]() |
| 2012 | ||
|---|---|---|
| 33 | S. Rajyalakshmi, Amitabha Bagchi, Soham Das, Rudra M. Tripathy: Topic Diffusion and Emergence of Virality in Social Networks CoRR abs/1202.2215: (2012) | |
| 32 | Pravesh Biyani, Shankar Prakriya, Amitabha Bagchi, Surendra Prasad: Dynamic Programming Based Multi-User Resource Allocation for Partial Crosstalk Cancellation in VDSL. IEEE Communications Letters 16(3): 420-423 (2012) | |
| 2011 | ||
| 31 | Amitabha Bagchi, Adit Madan, Achal Premi: A computationally inexpensive and power efficient fully distributed topology for data collection in heterogeneous wireless sensor networks. DCOSS 2011: 1-8 | |
| 30 | Amitabha Bagchi, Olivier Beaumont, Pascal Felber, Alberto Montresor: Introduction. Euro-Par (1) 2011: 514-515 | |
| 29 | Sebastien Ardon, Amitabha Bagchi, Anirban Mahanti, Amit Ruhela, Aaditeshwar Seth, Rudra M. Tripathy, Sipat Triukose: Spatio-Temporal Analysis of Topic Popularity in Twitter CoRR abs/1111.2904: (2011) | |
| 2010 | ||
| 28 | Amitabha Bagchi, Adit Madan, Achal Premi: Brief Announcement: Hierarchical Neighbor Graphs: A Sparse Connected Structure for Euclidean Point Sets. ALGOSENSORS 2010: 31-33 | |
| 27 | Rudra M. Tripathy, Amitabha Bagchi, Sameep Mehta: A study of rumor control strategies on social networks. CIKM 2010: 1817-1820 | |
| 26 | Amitabha Bagchi: Sparse power-efficient topologies for wireless ad hoc sensor networks. IPDPS 2010: 1-10 | |
| 2009 | ||
| 25 | Amitabha Bagchi, Garima Lahoti: Relating web pages to enable information-gathering tasks. Hypertext 2009: 109-118 | |
| 24 | Amitabha Bagchi, Sariel Har-Peled, Achal Premi, Adit Madan: Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space CoRR abs/0903.0742: (2009) | |
| 2008 | ||
| 23 | Rohan Choudhary, Sameep Mehta, Amitabha Bagchi: On quantifying changes in temporally evolving dataset. CIKM 2008: 1459-1460 | |
| 22 | Rohan Choudhary, Sameep Mehta, Amitabha Bagchi, Rahul Balakrishnan: Towards Characterization of Actor Evolution and Interactions in News Corpora. ECIR 2008: 422-429 | |
| 21 | Amitabha Bagchi, Sohit Bansal: Nearest-neighbor graphs on random point sets and their applications to sensor networks. PODC 2008: 434 | |
| 20 | Amitabha Bagchi, Sohit Bansal: On the metric distortion of nearest-neighbour graphs on random point sets CoRR abs/0804.3784: (2008) | |
| 19 | Amitabha Bagchi: Sparse power-efficient topologies for wireless ad hoc sensor networks CoRR abs/0805.4060: (2008) | |
| 18 | Amitabha Bagchi, Garima Lahoti: Relating Web pages to enable information-gathering tasks CoRR abs/0810.5428: (2008) | |
| 2007 | ||
| 17 | Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. ACM Transactions on Algorithms 3(2): (2007) | |
| 16 | Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman: Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discrete Math. 21(1): 141-157 (2007) | |
| 2006 | ||
| 15 | Rakesh Kumar, David D. Yao, Amitabha Bagchi, Keith W. Ross, Dan Rubenstein: Fluid modeling of pollution proliferation in P2P networks. SIGMETRICS/Performance 2006: 335-346 | |
| 14 | Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Chen Li, Michal Shmueli-Scheuer: Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information. IEEE Trans. Knowl. Data Eng. 18(10): 1352-1367 (2006) | |
| 13 | Amitabha Bagchi, Ankur Bhargava, Torsten Suel: Approximate maximum weight branchings. Inf. Process. Lett. 99(2): 54-58 (2006) | |
| 12 | Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The Effect of Faults on Network Expansion. Theory Comput. Syst. 39(6): 903-928 (2006) | |
| 2005 | ||
| 11 | Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich: Biased Skip Lists. Algorithmica 42(1): 31-48 (2005) | |
| 10 | Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman: Short length Menger's theorem and reliable optical routing. Theor. Comput. Sci. 339(2-3): 315-332 (2005) | |
| 2004 | ||
| 9 | Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The effect of faults on network expansion. SPAA 2004: 286-293 | |
| 8 | Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic sampling and range counting in geometric data streams. Symposium on Computational Geometry 2004: 144-151 | |
| 7 | Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler: The Effect of Faults on Network Expansion CoRR cs.DC/0404029: (2004) | |
| 2003 | ||
| 6 | Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu: Constructing Disjoint Paths for Secure Communication. DISC 2003: 181-195 | |
| 5 | Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman: Short length menger's theorem and reliable optical routing. SPAA 2003: 246-247 | |
| 4 | Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich: Deterministic Sampling and Range Counting in Geometric Data Streams CoRR cs.CG/0307027: (2003) | |
| 2002 | ||
| 3 | Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich: Biased Skip Lists. ISAAC 2002: 1-13 | |
| 2 | Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman: Algorithms for fault-tolerant routing in circuit switched networks. SPAA 2002: 265-274 | |
| 2001 | ||
| 1 | Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar: Seller-Focused Algorithms for Online Auctioning. WADS 2001: 135-147 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page