# Amitabh Chaudhary

According to our database

Collaborative distances:

^{1}, Amitabh Chaudhary authored at least 39 papers between 1997 and 2013.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2013

The topology aware file distribution problem.

J. Comb. Optim., 2013

2011

Online rectangle filling.

Theor. Comput. Sci., 2011

New algorithms for online rectangle filling with

*k*-lookahead.
J. Comb. Optim., 2011

The Topology Aware File Distribution Problem.

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

A Dynamic Data Middleware Cache for Rapidly-growing Scientific Repositories

CoRR, 2010

Providing Scalable Data Services in Ubiquitous Networks

CoRR, 2010

Middleware support for many-task computing.

Cluster Computing, 2010

A Dynamic Data Middleware Cache for Rapidly-Growing Scientific Repositories.

Proceedings of the Middleware 2010 - ACM/IFIP/USENIX 11th International Middleware Conference, Bangalore, India, November 29, 2010

Online Algorithms for the Newsvendor Problem with and without Censored Demands.

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Providing Scalable Data Services in Ubiquitous Networks.

Proceedings of the Database Systems for Advanced Applications, 2010

2009

Object Caching for Queries and Updates.

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Adaptive Physical Design for Curated Archives.

Proceedings of the Scientific and Statistical Database Management, 2009

The quest for scalable support of data-intensive workloads in distributed systems.

Proceedings of the 18th ACM International Symposium on High Performance Distributed Computing, 2009

2008

New Algorithms for Online Rectangle Filling with k-Lookahead.

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem.

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007

Fabricatable Interconnect and Molecular QCA Circuits.

IEEE Trans. on CAD of Integrated Circuits and Systems, 2007

Deterministic sampling and range counting in geometric data streams.

ACM Trans. Algorithms, 2007

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.

SIAM J. Discrete Math., 2007

Communication-Efficient Query Answering with Quality Guarantees in Client-Server Applications.

Proceedings of the Tenth International Workshop on the Web and Databases, 2007

Online Rectangle Filling.

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Approximating the Maximum Sharing Problem.

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2006

Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information.

IEEE Trans. Knowl. Data Eng., 2006

The Effect of Faults on Network Expansion.

Theory Comput. Syst., 2006

Evaluation of Summarization Schemes for Learning in Streams.

Proceedings of the Knowledge Discovery in Databases: PKDD 2006, 2006

2005

Short length Menger's theorem and reliable optical routing.

Theor. Comput. Sci., 2005

Balanced Aspect Ratio Trees Revisited.

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Bypass Caching: Making Scientific Databases Good Network Citizens.

Proceedings of the 21st International Conference on Data Engineering, 2005

Eliminating wire crossings for molecular quantum-dot cellular automata implementation.

Proceedings of the 2005 International Conference on Computer-Aided Design, 2005

2004

The Effect of Faults on Network Expansion

CoRR, 2004

The effect of faults on network expansion.

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Deterministic sampling and range counting in geometric data streams.

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

Deterministic Sampling and Range Counting in Geometric Data Streams

CoRR, 2003

Constructing Disjoint Paths for Secure Communication.

Proceedings of the Distributed Computing, 17th International Conference, 2003

Short length menger's theorem and reliable optical routing.

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

Algorithms for fault-tolerant routing in circuit switched networks.

SPAA, 2002

Very Fast Outlier Detection in Large Multidimensional Data Sets.

Proceedings of the 2002 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2002

2001

Approximation Algorithms for the Achromatic Number.

J. Algorithms, 2001

Seller-Focused Algorithms for Online Auctioning.

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

1997

Approximation Algorithms for the Achromatic Number.

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997