Flush Message Passing in Communicating Sequential Processes. - Mohan Ahuja; Kannan Varadhan; Amitabh Sinha (PARBASE / Architectures, 1990)

Supporting Machine Independent Programming on Diverse Parallel Architectures. - Wayne Fenton; Balkrishna Ramkumar; Vikram A. Saletore; Amitabh Sinha; Laxmikant V. Kalé (ICPP (2), 1991)

Prioritization in Parallel Symbolic Computing. - Laxmikant V. Kalé; Balkrishna Ramkumar; Vikram A. Saletore; Amitabh Sinha (Parallel Symbolic Computing, 1992)

A Load Balancing Strategy for Prioritized Execution of Tasks. - Amitabh Sinha; Laxmikant V. Kalé (IPPS, 1993)

Information Sharing Mechanisms in Parallel Programs. - Laxmikant V. Kalé; Amitabh Sinha (IPPS, 1994)

Towards Automatic Performance Analysis. - Amitabh Sinha; Laxmikant V. Kalé (ICPP, Vol. 3, 1996)

Approximation Algorithms for Edge-Dilation k-Center Problems. - Jochen Könemann; Yanjun Li; Ojas Parekh; Amitabh Sinha (SWAT, 2002)

Covering Graphs Using Trees and Stars. - Guy Even; Naveen Garg 001; Jochen Könemann; R. Ravi 001; Amitabh Sinha (RANDOM-APPROX, 2003)

Profit guaranteeing mechanisms for multicast networks. - Shuchi Chawla 001; D. Kitchin; Uday Rajan; R. Ravi 001; Amitabh Sinha (EC, 2003)

An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. - Anupam Gupta 001; R. Ravi 001; Amitabh Sinha (FOCS, 2004)

Worst-case payoffs of a location game. - Shuchi Chawla 001; Uday Rajan; R. Ravi 001; Amitabh Sinha (EC, 2004)

Multicommodity facility location. - R. Ravi 001; Amitabh Sinha (SODA, 2004)

Boosted sampling: approximation algorithms for stochastic optimization. - Anupam Gupta 001; Martin Pál; R. Ravi 001; Amitabh Sinha (STOC, 2004)

Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. - Nikhil Bansal 001; Kedar Dhamdhere; Jochen Könemann; Amitabh Sinha (Algorithmica, 2004)

Improved Approximations for Tour and Tree Covers. - Jochen Könemann; Goran Konjevod; Ojas Parekh; Amitabh Sinha (Algorithmica, 2004)

Min-max tree covers of graphs. - Guy Even; Naveen Garg 001; Jochen Könemann; R. Ravi 001; Amitabh Sinha (Oper. Res. Lett., 2004)

An approximation algorithm for the edge-dilation k-center problem, . - Jochen Könemann; Yanjun Li; Ojas Parekh; Amitabh Sinha (Oper. Res. Lett., 2004)

What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. - Anupam Gupta 001; Martin Pál; R. Ravi 001; Amitabh Sinha (APPROX-RANDOM, 2005)

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. - Jochen Könemann; Asaf Levin; Amitabh Sinha (Algorithmica, 2005)

Approximation Algorithms for Problems Combining Facility Location and Network Design. - R. Ravi 001; Amitabh Sinha (Oper. Res., 2006)

Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. - R. Ravi 001; Amitabh Sinha (Math. Program., 2006)

Min-Max payoffs in a two-player location game. - Shuchi Chawla 001; Uday Rajan; R. Ravi 001; Amitabh Sinha (Oper. Res. Lett., 2006)

LP Rounding Approximation Algorithms for Stochastic Network Design. - Anupam Gupta 001; R. Ravi 001; Amitabh Sinha (Math. Oper. Res., 2007)

Approximating k. - R. Ravi 001; Amitabh Sinha (Eur. J. Oper. Res., 2008)

On the approximability of some network design problems. - Julia Chuzhoy; Anupam Gupta 001; Joseph Naor; Amitabh Sinha (ACM Trans. Algorithms, 2008)

Solving Truckload Procurement Auctions Over an Exponential Number of Bundles. - Richard Li-Yang Chen; Shervin AhmadBeygi; Amy Cohn; Damian R. Beil; Amitabh Sinha (Transp. Sci., 2009)

Efficient Structures for Innovative Social Networks. - William S. Lovejoy; Amitabh Sinha (Manag. Sci., 2010)

Approximation Algorithms for Multicommodity Facility Location Problems. - R. Ravi 001; Amitabh Sinha (SIAM J. Discret. Math., 2010)

Integrated Optimization of Procurement, Processing, and Trade of Commodities. - Sripad K. Devalkar; Ravi Anupindi; Amitabh Sinha (Oper. Res., 2011)

Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems. - Anupam Gupta 001; Martin Pál; R. Ravi 001; Amitabh Sinha (SIAM J. Comput., 2011)

The Learning Continuum: formal and informal learning experiences - enabling learning and creation of new knowledge in an organization. - Amitabh Sinha (Int. J. Adv. Corp. Learn., 2012)

An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment. - Stefanus Jasin; Amitabh Sinha (Oper. Res., 2015)

Capacity Investment with Demand Learning. - Anyan Qi; Hyun-Soo Ahn; Amitabh Sinha (Oper. Res., 2017)

Dynamic Risk Management of Commodity Operations: Model and Analysis. - Sripad K. Devalkar; Ravi Anupindi; Amitabh Sinha (Manuf. Serv. Oper. Manag., 2018)

Joint Dynamic Pricing and Order Fulfillment for E-commerce Retailers. - Yanzhe (Murray) Lei; Stefanus Jasin; Amitabh Sinha (Manuf. Serv. Oper. Manag., 2018)

UIUC-PPL/charm: v6.10.0-beta1. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2019)

UIUC-PPL/charm: v6.10.0-rc. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2019)

UIUC-PPL/charm: v6.10.0-rc2. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2019)

Data-Driven Promotion Planning for Paid Mobile Applications. - Manqi (Maggie) Li; Yan Huang 009; Amitabh Sinha (Inf. Syst. Res., 2020)

UIUC-PPL/charm: v6.10.0. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2020)

UIUC-PPL/charm: v6.10.1. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2020)

UIUC-PPL/charm: Charm++ version 6.10.2. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2020)

UIUC-PPL/charm: v6.11.0-beta1. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2020)

Using Image Transformations to Learn Network Structure. - Brayan Ortiz; Amitabh Sinha (CoRR, 2021)

Distribution-Free Inventory Risk Pooling in a Multilocation Newsvendor. - Aravind Govindarajan; Amitabh Sinha; Joline Uichanco (Manag. Sci., 2021)

UIUC-PPL/charm: v7.0.0-rc1. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2021)

UIUC-PPL/charm: v7.0.0-rc2. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2021)

UIUC-PPL/charm: Charm++ version 7.0.0. - Laxmikant V. Kalé; Bilge Acun; Seonmyeong Bak; Aaron T. Becker; Milind A. Bhandarkar; Nitin Bhat; Abhinav Bhatele; Eric J. Bohm; Cyril Bordage; Robert Brunner; Ronak Buch; Sayantan Chakravorty; et al. (Zenodo, 2021)