Online Algorithms

• A. Bagchi, A. Chaudhary, R. Garg, M. T. Goodrich, and V. Kumar.
  Seller-focused algorithms for online auctioning.
  In Proc. 7th International Workshop on Algorithms and Data Structures (WADS), pages 135 — 147, 2001.


• A. Bagchi, A. Chaudhary, P. Kolman, and C. Scheideler.
  Algorithms for fault-tolerant routing in circuit switched networks.
  In Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 265 — 274, 2002; and submitted to SIAM J. on Discrete Mathematics.


• A. Bagchi, A. Chaudhary, and P. Kolman.
  Short length Menger's theorem and reliable optical routing.
  In Proc. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 246 — 247, 2003; and Theor. Comput. Sci, 339(2-3), pages 315 — 332, 2005.


• A. Bagchi, A. Chaudhary, M. T. Goodrich, and S. Xu.
  Constructing disjoint paths for secure communication.
  In Proc. 17th International Symposium on Distributed Computing (DISC), pages 181 — 195, 2003.


• T. Malik, R. Burns, and A. Chaudhary.
  Bypass Caching: Making scientific databases good network citizens.
  In it Proc. 21st International Conference on Data Engineering (ICDE), pages 94--105, 2005.


• S. O'Neil and A. Chaudhary.
  Comparing online learning algorithms to stochastic approaches for the multi-period newsvendor problem.
  In Proc. Workshop on Algorithm Engineering and Experiments (ALENEX), 2008.


• H. Wang, A. Chaudhary, and D.Z. Chen.
  New algorithms for online rectangle filling with k-lookahead.
  In Proc. 14th Computing and Combinatorics Conference (COCOON), pages 385 — 394, 2008.


• S. O'Neil, X. Zhao, D. Sun, A. Chaudhary and J.C. Wei.
  Coping with demand shocks: a distribution-free algorithm for solving newsvendor problems with limited demand information. Under review.


• I. Raicu, I.T. Foster, Y. Zhao, P. Little, C.M. Moretti, A. Chaudhary, and D. Thain.
  The quest for scalable support of data-intensive workloads in distributed systems.
  In Proc. 18th ACM Symposium on High Performance Distributed Computing (HPDC), pages 207 — 216, Garching, Germany, 2009.


• R. Prasad, S. Patil, T. Malik, A. Chaudhary, and V.Venkatasubramanian.
  Providing scalable data services in ubiquitous networks.
  In Proc. Database Systems for Advanced Applications (DASFAA) Workshop on Ubiquitous Data Management (UMD), pages 445 — 457, Tokyo, Japan, 2010.


• P. Sempolinski and A. Chaudhary.
  Online algorithms for the newsvendor problems with and without censored demands.
  In Proc. 4th International Frontiers of Algorithmics Workshop (FAW), pages 234 — 249, Wuhan, China, 2010.


• T. Malik, A. Chaudhary, P. Little, X. Wang, and A. Thakar.
  A dynamic data middleware system for rapidly-growing scientific repositories.
  In Proc. ACM/IFIP/USENIX 11th International Middleware Conference (MIDDLEWARE), Bangalore, India, 2010, to appear.

Graph Theory

• A. Chaudhary and S. Vishwanathan.
  Approximation algorithms for the achromatic number.
  In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 558 — 563, 1997; and J. Algorithms, 41(2), pages 404 — 416, 2001.


• A. Bagchi, A. Chaudhary, P. Kolman, and C. Scheideler.
  Algorithms for fault-tolerant routing in circuit switched networks.
  In Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 265 — 274, 2002; and submitted to SIAM J. on Discrete Mathematics.


• A. Bagchi, A. Chaudhary, and P. Kolman.
  Short length Menger's theorem and reliable optical routing.
  In Proc. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 246 — 247, 2003; and Theor. Comput. Sci, 339(2-3), pages 315 — 332, 2005.


• A. Bagchi, A. Chaudhary, M. T. Goodrich, and S. Xu.
  Constructing disjoint paths for secure communication.
  In Proc. 17th International Symposium on Distributed Computing (DISC), pages 181 — 195, 2003.


• A. Bagchi, A. Bhargava, D. Eppstein, A. Chaudhary, and C. Scheideler.
  On the effects of faults on network expansion.
  In 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 286 — 293, 2004; and accepted by Theory of Computing Systems, special issue devoted to the best theoretical papers from SPAA '04, 2006.


• A. Bagchi, A. Chaudhary, P. Kolman, and J. Sgall.
  A simple combinatorial proof of duality of multiroute flows and cuts.
  Technical Report.


• A. Chaudhary, D.Z. Chen, X.S. Hu, M.T. Niemier, R. Ravichandran, and K. Whitton.
  Eliminating Wire Crossings for Molecular Quantum-dot Cellular Automata Implementation.
  In Proc. International Conference of Computer Aided Design (ICCAD), pages 565--571, 2005, and IEEE Trans. Computer-aided Design of Integrated Circuits and Systems, 26(11), pages 1978--1991, 2007.


• J.Li, A. Chaudhary, D.Z.Chen, R.Fleischer, X.S.Hu, M.T.Niemier, Z.Xie, and H.Zhu.
  Approximating the maximum sharing problem.
  In Proc. 10th Workshop on Algorithms and Data Structures (WADS), 2007.

Scientific Databases

• A. Chaudhary, B. F. de Medeiros, C. A. Duncan, M. T. Goodrich, and A. S. Szalay.
  Parameterized balanced aspect ratio trees.
  In Proc. 4th CGC Workshop on Computational Geometry, 1999.


• A. Chaudhary, A. S. Szalay, and A. W. Moore.
  Very fast outlier detection in large multidimensional data sets.
  In Proc. ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), 2002.


• T. Malik, R. Burns, and A. Chaudhary.
  Bypass Caching: Making scientific databases good network citizens.
  In it Proc. 21st International Conference on Data Engineering (ICDE), pages 94--105, 2005.


• A. Chaudhary and M. T. Goodrich.
  Balanced aspect ratio trees revisted.
  In Proc. 9th International Workshop on Algorithms and Data Structures (WADS), pages 73-85, 2005.


• A. Bagchi, A. Chaudhary, M. T. Goodrich, C. Li, and M. Shmueli-Scheuer.
  Achieving communication efficiency through push-pull partitioning of semantic spaces to disseminate dynamic information.
  IEEE Trans. on Knowledge and Data Engineering (TKDE), 18(10), pages 1352--1367, 2006.


• I. Raicu, I.T. Foster, Y. Zhao, P. Little, C.M. Moretti, A. Chaudhary, and D. Thain.
  The quest for scalable support of data-intensive workloads in distributed systems.
  In Proc. 18th ACM Symposium on High Performance Distributed Computing (HPDC), pages 207 — 216, Garching, Germany, 2009.


• P. Little and A. Chaudhary.
  Object caching for queries and updates.
  In Proc. 3rd International Workshop on Algorithms and Computation (WALCOM), pages 394 — 405, Kolkata, India, 2009.


• T. Malik, X. Wang, D. Dash, A. Chaudhary, R. Burns, and A. Ailamaki.
  Adaptive physical design for curated archives.
  In Proc. 21st Scientific and Statistical Database Management Systems (SSDBM), pages 148 — 166, New Orleans, Louisiana, 2009.


• T. Malik, A. Chaudhary, P. Little, X. Wang, and A. Thakar.
  A dynamic data middleware system for rapidly-growing scientific repositories.
  In Proc. ACM/IFIP/USENIX 11th International Middleware Conference (MIDDLEWARE), Bangalore, India, 2010, to appear.

Caching

• T. Malik, R. Burns, and A. Chaudhary.
  Bypass Caching: Making scientific databases good network citizens.
  In it Proc. 21st International Conference on Data Engineering (ICDE), pages 94--105, 2005.


• A. Bagchi, A. Chaudhary, M. T. Goodrich, C. Li, and M. Shmueli-Scheuer.
  Achieving communication efficiency through push-pull partitioning of semantic spaces to disseminate dynamic information.
  IEEE Trans. on Knowledge and Data Engineering (TKDE), 18(10), pages 1352--1367, 2006.


• I. Raicu, I.T. Foster, Y. Zhao, P. Little, C.M. Moretti, A. Chaudhary, and D. Thain.
  The quest for scalable support of data-intensive workloads in distributed systems.
  In Proc. 18th ACM Symposium on High Performance Distributed Computing (HPDC), pages 207 — 216, Garching, Germany, 2009.


• P. Little and A. Chaudhary.
  Object caching for queries and updates.
  In Proc. 3rd International Workshop on Algorithms and Computation (WALCOM), pages 394 — 405, Kolkata, India, 2009.


• T. Malik, A. Chaudhary, P. Little, X. Wang, and A. Thakar.
  A dynamic data middleware system for rapidly-growing scientific repositories.
  In Proc. ACM/IFIP/USENIX 11th International Middleware Conference (MIDDLEWARE), Bangalore, India, 2010, to appear.

Computational Geometry and Spatial Data Structures

• A. Chaudhary, B. F. de Medeiros, C. A. Duncan, M. T. Goodrich, and A. S. Szalay.
  Parameterized balanced aspect ratio trees.
  In Proc. 4th CGC Workshop on Computational Geometry, 1999.


• A. Chaudhary, A. S. Szalay, and A. W. Moore.
  Very fast outlier detection in large multidimensional data sets.
  In Proc. ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), 2002.


• A. Bagchi, A. Chaudhary, D. Eppstein, and M. T. Goodrich.
  Deterministic sampling and range counting in geometric data streams.
  In 12th ACM Annual Symposium on Computational Geometry (SoCG), pages 144 — 151, 2004; and ACM Trans. Algorithms (TALG), 3(2), 2007.


• A. Chaudhary and M. T. Goodrich.
  Balanced aspect ratio trees revisted.
  In Proc. 9th International Workshop on Algorithms and Data Structures (WADS), pages 73-85, 2005.

Circuit Design

• A. Chaudhary, D.Z. Chen, X.S. Hu, M.T. Niemier, R. Ravichandran, and K. Whitton.
  Eliminating Wire Crossings for Molecular Quantum-dot Cellular Automata Implementation.
  In Proc. International Conference of Computer Aided Design (ICCAD), pages 565--571, 2005, and IEEE Trans. Computer-aided Design of Integrated Circuits and Systems, 26(11), pages 1978--1991, 2007.


• J.Li, A. Chaudhary, D.Z.Chen, R.Fleischer, X.S.Hu, M.T.Niemier, Z.Xie, and H.Zhu.
  Approximating the maximum sharing problem.
  In Proc. 10th Workshop on Algorithms and Data Structures (WADS), 2007.

Data Streams

• A. Bagchi, A. Chaudhary, D. Eppstein, and M. T. Goodrich.
  Deterministic sampling and range counting in geometric data streams.
  In 12th ACM Annual Symposium on Computational Geometry (SoCG), pages 144 — 151, 2004; and ACM Trans. Algorithms (TALG), 3(2), 2007.


• A. Pawling, N. Chawla, and A. Chaudhary.
  Computing Information Gain in Data Streams.
  ICDM 2005 Workshop on Temporal Data Mining: Algorithms, Theory, and Applications, 2005.


• A. Pawling, N. Chawla, and A. Chaudhary.
  Evaluation of Summarization Schemes for Learning in Streams.
  In Proc. 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, 347--358, 2006.

Inventory Management

• S. O'Neil and A. Chaudhary.
  Comparing online learning algorithms to stochastic approaches for the multi-period newsvendor problem.
  In Proc. Workshop on Algorithm Engineering and Experiments (ALENEX), 2008.


• S. O'Neil, X. Zhao, D. Sun, A. Chaudhary and J.C. Wei.
  Coping with demand shocks: a distribution-free algorithm for solving newsvendor problems with limited demand information. Under review.


• P. Sempolinski and A. Chaudhary.
  Online algorithms for the newsvendor problems with and without censored demands.
  In Proc. 4th International Frontiers of Algorithmics Workshop (FAW), pages 234 — 249, Wuhan, China, 2010.

Networks and Communication

• A. Bagchi, A. Chaudhary, P. Kolman, and C. Scheideler.
  Algorithms for fault-tolerant routing in circuit switched networks.
  In Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 265 — 274, 2002; and submitted to SIAM J. on Discrete Mathematics.


• A. Bagchi, A. Chaudhary, and P. Kolman.
  Short length Menger's theorem and reliable optical routing.
  In Proc. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 246 — 247, 2003; and Theor. Comput. Sci, 339(2-3), pages 315 — 332, 2005.


• A. Bagchi, A. Chaudhary, M. T. Goodrich, and S. Xu.
  Constructing disjoint paths for secure communication.
  In Proc. 17th International Symposium on Distributed Computing (DISC), pages 181 — 195, 2003.


• A. Bagchi, A. Bhargava, D. Eppstein, A. Chaudhary, and C. Scheideler.
  On the effects of faults on network expansion.
  In 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 286 — 293, 2004; and accepted by Theory of Computing Systems, special issue devoted to the best theoretical papers from SPAA '04, 2006.


• A. Bagchi, A. Chaudhary, P. Kolman, and J. Sgall.
  A simple combinatorial proof of duality of multiroute flows and cuts.
  Technical Report.


• H. Wang, A. Chaudhary, and D.Z. Chen.
  New algorithms for online rectangle filling with k-lookahead.
  In Proc. 14th Computing and Combinatorics Conference (COCOON), pages 385 — 394, 2008.