|
Search the dblp DataBase
Amitabh Chaudhary:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- Amitabh Chaudhary, Alexander S. Szalay, Andrew W. Moore
Very Fast Outlier Detection in Large Multidimensional Data Sets. [Citation Graph (0, 0)][DBLP] DMKD, 2002, pp:- [Conf]
- Amitabh Chaudhary, Danny Z. Chen, Kevin Whitton, Michael T. Niemier, Ramprasad Ravichandran
Eliminating wire crossings for molecular quantum-dot cellular automata implementation. [Citation Graph (0, 0)][DBLP] ICCAD, 2005, pp:565-571 [Conf]
- Tanu Malik, Randal C. Burns, Amitabh Chaudhary
Bypass Caching: Making Scientific Databases Good Network Citizens. [Citation Graph (0, 0)][DBLP] ICDE, 2005, pp:94-105 [Conf]
- Alec Pawling, Nitesh V. Chawla, Amitabh Chaudhary
Evaluation of Summarization Schemes for Learning in Streams. [Citation Graph (0, 0)][DBLP] PKDD, 2006, pp:347-358 [Conf]
- Amitabh Chaudhary, Sundar Vishwanathan
Approximation Algorithms for the Achromatic Number. [Citation Graph (0, 0)][DBLP] SODA, 1997, pp:558-563 [Conf]
- 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]
- 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]
- 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]
- 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]
- Amitabh Chaudhary, Michael T. Goodrich
Balanced Aspect Ratio Trees Revisited. [Citation Graph (0, 0)][DBLP] WADS, 2005, pp:73-85 [Conf]
- 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]
- 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]
- 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]
- Amitabh Chaudhary, Sundar Vishwanathan
Approximation Algorithms for the Achromatic Number. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:404-416 [Journal]
- 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]
- 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]
- Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu
Approximating the Maximum Sharing Problem. [Citation Graph (0, 0)][DBLP] WADS, 2007, pp:52-63 [Conf]
- Michal Shmueli-Scheuer, Amitabh Chaudhary, Avigdor Gal, Chen Li
Communication-Efficient Query Answering with Quality Guarantees in Client-Server Applications. [Citation Graph (0, 0)][DBLP] WebDB, 2007, pp:- [Conf]
- 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]
- 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]
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem. [Citation Graph (, )][DBLP]
New Algorithms for Online Rectangle Filling with k-Lookahead. [Citation Graph (, )][DBLP]
Providing Scalable Data Services in Ubiquitous Networks. [Citation Graph (, )][DBLP]
The quest for scalable support of data-intensive workloads in distributed systems. [Citation Graph (, )][DBLP]
Adaptive Physical Design for Curated Archives. [Citation Graph (, )][DBLP]
Online Rectangle Filling. [Citation Graph (, )][DBLP]
Object Caching for Queries and Updates. [Citation Graph (, )][DBLP]
Online Algorithms for the Newsvendor Problem with and without Censored Demands. [Citation Graph (, )][DBLP]
Providing Scalable Data Services in Ubiquitous Networks [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.304secs
|