The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Amitabha Bagchi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
    Deterministic sampling and range counting in geometric data streams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:144-151 [Conf]
  2. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
    Biased Skip Lists. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:1-13 [Conf]
  3. Rakesh Kumar, David D. Yao, Amitabha Bagchi, Keith W. Ross, Dan Rubenstein
    Fluid modeling of pollution proliferation in P2P networks. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2006, pp:335-346 [Conf]
  4. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The effect of faults on network expansion. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:286-293 [Conf]
  5. Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
    Short length menger's theorem and reliable optical routing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:246-247 [Conf]
  6. Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman
    Algorithms for fault-tolerant routing in circuit switched networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:265-274 [Conf]
  7. Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar
    Seller-Focused Algorithms for Online Auctioning. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:135-147 [Conf]
  8. Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu
    Constructing Disjoint Paths for Secure Communication. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:181-195 [Conf]
  9. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
    Biased Skip Lists. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:1, pp:31-48 [Journal]
  10. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
    Deterministic Sampling and Range Counting in Geometric Data Streams [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  11. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The Effect of Faults on Network Expansion [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  12. Amitabha Bagchi, Ankur Bhargava, Torsten Suel
    Approximate maximum weight branchings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:2, pp:54-58 [Journal]
  13. Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
    Short length Menger's theorem and reliable optical routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:2-3, pp:315-332 [Journal]
  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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2006, v:18, n:10, pp:1352-1367 [Journal]
  15. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The Effect of Faults on Network Expansion. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:6, pp:903-928 [Journal]
  16. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
    Deterministic sampling and range counting in geometric data streams. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  17. On quantifying changes in temporally evolving dataset. [Citation Graph (, )][DBLP]


  18. Towards Characterization of Actor Evolution and Interactions in News Corpora. [Citation Graph (, )][DBLP]


  19. Relating web pages to enable information-gathering tasks. [Citation Graph (, )][DBLP]


  20. Nearest-neighbor graphs on random point sets and their applications to sensor networks. [Citation Graph (, )][DBLP]


  21. On the metric distortion of nearest-neighbour graphs on random point sets [Citation Graph (, )][DBLP]


  22. Sparse power-efficient topologies for wireless ad hoc sensor networks [Citation Graph (, )][DBLP]


  23. Relating Web pages to enable information-gathering tasks [Citation Graph (, )][DBLP]


  24. Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002