default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmitabh Chaudhary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Naga Nithin Manne, Shilvi Satpati, Tanu Malik, Amitabha Bagchi, Ashish Gehani, Amitabh Chaudhary:
CHEX: Multiversion Replay with Ordered Checkpoints. Proc. VLDB Endow. 15(6): 1297-1310 (2022)- [i5]Naga Nithin Manne, Shilvi Satpati, Tanu Malik, Amitabha Bagchi, Ashish Gehani, Amitabh Chaudhary:
CHEX: Multiversion Replay with Ordered Checkpoints. CoRR abs/2202.08429 (2022)
2010 – 2019
- 2013
- [j11]Shawn T. O'Neil
, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang:
The topology aware file distribution problem. J. Comb. Optim. 26(4): 621-635 (2013) - 2011
- [j10]Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
New algorithms for online rectangle filling with k-lookahead. J. Comb. Optim. 21(1): 67-82 (2011) - [j9]Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
Online rectangle filling. Theor. Comput. Sci. 412(39): 5247-5275 (2011) - [c24]Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang:
The Topology Aware File Distribution Problem. COCOON 2011: 366-378 - 2010
- [j8]Ioan Raicu, Ian T. Foster, Mike Wilde, Zhao Zhang, Kamil Iskra, Peter H. Beckman, Yong Zhao, Alexander S. Szalay, Alok N. Choudhary, Philip Little, Christopher Moretti, Amitabh Chaudhary, Douglas Thain:
Middleware support for many-task computing. Clust. Comput. 13(3): 291-314 (2010) - [c23]Tanu Malik, Raghvendra Prasad, Sanket Patil, Amitabh Chaudhary, Venkat Venkatasubramanian:
Providing Scalable Data Services in Ubiquitous Networks. DASFAA Workshops 2010: 445-457 - [c22]Peter Sempolinski, Amitabh Chaudhary:
Online Algorithms for the Newsvendor Problem with and without Censored Demands. FAW 2010: 234-249 - [c21]Tanu Malik, Xiaodan Wang, Philip Little, Amitabh Chaudhary, Ani Thakar:
A Dynamic Data Middleware Cache for Rapidly-Growing Scientific Repositories. Middleware 2010: 64-84 - [i4]Tanu Malik, Raghvendra Prasad, Sanket Patil, Amitabh Chaudhary, Venkat Venkatasubramanian:
Providing Scalable Data Services in Ubiquitous Networks. CoRR abs/1005.4695 (2010) - [i3]Tanu Malik, Xiaodan Wang, Philip Little, Amitabh Chaudhary, Ani Thakar:
A Dynamic Data Middleware Cache for Rapidly-growing Scientific Repositories. CoRR abs/1009.3665 (2010)
2000 – 2009
- 2009
- [c20]Ioan Raicu, Ian T. Foster, Yong Zhao, Philip Little, Christopher Moretti, Amitabh Chaudhary, Douglas Thain:
The quest for scalable support of data-intensive workloads in distributed systems. HPDC 2009: 207-216 - [c19]Tanu Malik, Xiaodan Wang, Debabrata Dash, Amitabh Chaudhary, Anastasia Ailamaki, Randal C. Burns:
Adaptive Physical Design for Curated Archives. SSDBM 2009: 148-166 - [c18]Philip Little, Amitabh Chaudhary:
Object Caching for Queries and Updates. WALCOM 2009: 394-405 - 2008
- [c17]Shawn T. O'Neil, Amitabh Chaudhary:
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem. ALENEX 2008: 49-63 - [c16]Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
New Algorithms for Online Rectangle Filling with k-Lookahead. COCOON 2008: 385-394 - 2007
- [j7]Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discret. Math. 21(1): 141-157 (2007) - [j6]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams. ACM Trans. Algorithms 3(2): 16 (2007) - [j5]Amitabh Chaudhary, Danny Z. Chen, Xiaobo Sharon Hu, Michael T. Niemier, Ramprasad Ravichandran, Kevin Whitton:
Fabricatable Interconnect and Molecular QCA Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(11): 1978-1991 (2007) - [c15]Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu:
Approximating the Maximum Sharing Problem. WADS 2007: 52-63 - [c14]Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
Online Rectangle Filling. WAOA 2007: 274-287 - [c13]Michal Shmueli-Scheuer, Amitabh Chaudhary, Avigdor Gal, Chen Li:
Communication-Efficient Query Answering with Quality Guarantees in Client-Server Applications. WebDB 2007 - 2006
- [j4]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) - [j3]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) - [c12]Alec Pawling, Nitesh V. Chawla, Amitabh Chaudhary:
Evaluation of Summarization Schemes for Learning in Streams. PKDD 2006: 347-358 - 2005
- [j2]Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman:
Short length Menger's theorem and reliable optical routing. Theor. Comput. Sci. 339(2-3): 315-332 (2005) - [c11]Amitabh Chaudhary, Danny Z. Chen, Kevin Whitton, Michael T. Niemier, Ramprasad Ravichandran:
Eliminating wire crossings for molecular quantum-dot cellular automata implementation. ICCAD 2005: 565-571 - [c10]Tanu Malik, Randal C. Burns, Amitabh Chaudhary:
Bypass Caching: Making Scientific Databases Good Network Citizens. ICDE 2005: 94-105 - [c9]Amitabh Chaudhary, Michael T. Goodrich:
Balanced Aspect Ratio Trees Revisited. WADS 2005: 73-85 - 2004
- [c8]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams. SCG 2004: 144-151 - [c7]Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The effect of faults on network expansion. SPAA 2004: 286-293 - [i2]Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The Effect of Faults on Network Expansion. CoRR cs.DC/0404029 (2004) - 2003
- [c6]Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman:
Short length menger's theorem and reliable optical routing. SPAA 2003: 246-247 - [c5]Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu:
Constructing Disjoint Paths for Secure Communication. DISC 2003: 181-195 - [i1]Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic Sampling and Range Counting in Geometric Data Streams. CoRR cs.CG/0307027 (2003) - 2002
- [c4]Amitabh Chaudhary, Alexander S. Szalay, Andrew W. Moore:
Very Fast Outlier Detection in Large Multidimensional Data Sets. DMKD 2002 - [c3]Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
Algorithms for fault-tolerant routing in circuit switched networks. SPAA 2002: 265-274 - 2001
- [j1]Amitabh Chaudhary, Sundar Vishwanathan:
Approximation Algorithms for the Achromatic Number. J. Algorithms 41(2): 404-416 (2001) - [c2]Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar:
Seller-Focused Algorithms for Online Auctioning. WADS 2001: 135-147
1990 – 1999
- 1997
- [c1]Amitabh Chaudhary, Sundar Vishwanathan:
Approximation Algorithms for the Achromatic Number. SODA 1997: 558-563
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
