default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnamitra R. Choudhury
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c24]Venkatesan T. Chakaravarthy, Padmanabha Venkatagiri Seshadri, Pooja Aggarwal, Anamitra R. Choudhury, Ashok Pon Kumar, Yogish Sabharwal, Amith Singhee:
Rightsizing Clusters for Time-Limited Tasks. CLOUD 2021: 619-624- [c23]Aswin Kannan, Anamitra Roy Choudhury, Vaibhav Saxena, Saurabh Raje, Parikshit Ram, Ashish Verma, Yogish Sabharwal:
HyperASPO: Fusion of Model and Hyper Parameter Optimization for Multi-objective Machine Learning. IEEE BigData 2021: 790-800 - [i6]Venkatesan T. Chakaravarthy, Padmanabha Venkatagiri Seshadri, Pooja Aggarwal, Anamitra R. Choudhury, Ashok Pon Kumar, Yogish Sabharwal, Amith Singhee:
Rightsizing Clusters for Time-Limited Tasks. CoRR abs/2112.11597 (2021) - 2020
- [j5]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Scheduling split intervals with non-uniform demands. Discret. Optim. 38: 100611 (2020) - [c22]Anamitra Roy Choudhury, Saurabh Goyal, Yogish Sabharwal, Ashish Verma:
Variable batch size across layers for efficient prediction on CNNs. CLOUD 2020: 435-444 - [c21]Saurabh Goyal, Anamitra Roy Choudhury, Saurabh Raje, Venkatesan T. Chakaravarthy, Yogish Sabharwal, Ashish Verma:
PoWER-BERT: Accelerating BERT Inference via Progressive Word-vector Elimination. ICML 2020: 3690-3699 - [i5]Saurabh Goyal, Anamitra Roy Choudhury, Venkatesan T. Chakaravarthy, Saurabh ManishRaje, Yogish Sabharwal, Ashish Verma:
PoWER-BERT: Accelerating BERT inference for Classification Tasks. CoRR abs/2001.08950 (2020)
2010 – 2019
- 2019
- [c20]Saurabh Goyal, Anamitra Roy Choudhury, Vivek Sharma:
Compression of Deep Neural Networks by Combining Pruning and Low Rank Decomposition. IPDPS Workshops 2019: 952-958 - 2018
- [j4]Anamitra Roy Choudhury, Syamantak Das, Naveen Garg
, Amit Kumar:
Rejecting jobs to minimize load and maximum flow-time. J. Comput. Syst. Sci. 91: 42-68 (2018) - [j3]Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambudha Roy, Yogish Sabharwal:
Set Cover Problems with Small Neighborhood Covers. Theory Comput. Syst. 62(8): 1763-1797 (2018) - [j2]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal:
Improved algorithms for resource allocation under varying capacity. J. Sched. 21(3): 313-325 (2018) - 2017
- [c19]Anamitra Roy Choudhury:
Demand Forecasting in DHC-network using machine learning models. e-Energy 2017: 367-372 - [c18]Kumar Saurav, Anamitra Roy Choudhury, Vikas Chandan, Peter Lingman, Nicklas Linder:
Building modelling methodologies for virtual district heating and cooling networks. SmartGridComm 2017: 387-392 - [i4]Dharma Teja Vooturi, Saurabh Goyal, Anamitra R. Choudhury, Yogish Sabharwal, Ashish Verma:
Efficient Inferencing of Compressed Deep Neural Networks. CoRR abs/1711.00244 (2017) - 2016
- [c17]Anamitra Roy Choudhury, Ramachandra Kota, Sampath Dechu, Sambaran Bandyopadhyay:
Supply scheduling and usage-based pricing for shared storage in adaptive dynamic islanding. e-Energy 2016: 12:1-12:11 - 2015
- [c16]Anamitra Roy Choudhury, Syamantak Das, Amit Kumar:
Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model. FSTTCS 2015: 25-37 - [c15]Subendhu Rongali, Anamitra R. Choudhury, Vikas Chandan, Vijay Arya:
A context vector regression based approach for demand forecasting in district heating networks. ISGT Asia 2015: 1-6 - [c14]Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar:
Rejecting jobs to Minimize Load and Maximum Flow-time. SODA 2015: 1114-1133 - 2014
- [c13]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal:
Improved Algorithms for Resource Allocation under Varying Capacity. ESA 2014: 222-234 - [i3]Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar:
Rejecting Jobs to Minimize Load and Maximum Flow-time. CoRR abs/1410.1839 (2014) - 2013
- [c12]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Scheduling Jobs with Multiple Non-uniform Tasks. Euro-Par 2013: 90-101 - [c11]Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. FSTTCS 2013: 249-261 - [c10]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sivaramakrishnan R. Natarajan, Sambuddha Roy:
Knapsack Cover Subject to a Matroid Constraint. FSTTCS 2013: 275-286 - [c9]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths. IPDPS 2013: 973-984 - [i2]Suman Kalyan Bera, Anamitra R. Choudhury, Syamantak Das, Sambuddha Roy, Jayram S. Thatchachar:
Fenchel Duals for Drifting Adversaries. CoRR abs/1309.5904 (2013) - [i1]Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. CoRR abs/1312.7217 (2013) - 2012
- [j1]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal:
Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem. Theory Comput. Syst. 51(4): 447-473 (2012) - [c8]Fabio Checconi, Fabrizio Petrini, Jeremiah Willcock, Andrew Lumsdaine, Anamitra R. Choudhury, Yogish Sabharwal:
Breaking the speed and scalability barriers for graph exploration on distributed-memory machines. SC 2012: 13 - [c7]Dong Chen, Noel Eisley, Philip Heidelberger, Sameer Kumar, Amith R. Mamidala, Fabrizio Petrini, Robert M. Senger, Yutaka Sugawara, Robert Walkup, Burkhard D. Steinmacher-Burow, Anamitra R. Choudhury, Yogish Sabharwal, Swati Singhal, Jeffrey J. Parker:
Looking under the hood of the IBM blue gene/Q network. SC 2012: 69 - 2011
- [c6]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal:
An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem. ICDCN 2011: 53-64 - [c5]Thomas George, Vaibhav Saxena, Anshul Gupta, Amik Singh, Anamitra R. Choudhury:
Multifrontal Factorization of Sparse SPD Matrices on GPUs. IPDPS 2011: 372-383 - [c4]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal:
Improved Algorithms for the Distributed Trigger Counting Problem. IPDPS 2011: 515-523 - 2010
- [c3]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal:
A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints. FSTTCS 2010: 181-191 - [c2]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Vijay K. Garg, Yogish Sabharwal:
Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting. DISC 2010: 398-400
2000 – 2009
- 2008
- [c1]Anamitra R. Choudhury, Alan King, Sunil Kumar, Yogish Sabharwal:
Optimizations in financial engineering: The Least-Squares Monte Carlo method of Longstaff and Schwartz. IPDPS 2008: 1-11
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-24 22:58 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:
