2008 |
28 | EE | Julia Chuzhoy,
Anupam Gupta,
Joseph Naor,
Amitabh Sinha:
On the approximability of some network design problems.
ACM Transactions on Algorithms 4(2): (2008) |
27 | EE | R. Ravi,
Amitabh Sinha:
Approximating k.
European Journal of Operational Research 186(1): 77-90 (2008) |
2006 |
26 | EE | R. Ravi,
Amitabh Sinha:
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.
Math. Program. 108(1): 97-114 (2006) |
25 | EE | Shuchi Chawla,
Uday Rajan,
R. Ravi,
Amitabh Sinha:
Min-Max payoffs in a two-player location game.
Oper. Res. Lett. 34(5): 499-507 (2006) |
2005 |
24 | EE | Anupam Gupta,
Martin Pál,
R. Ravi,
Amitabh Sinha:
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.
APPROX-RANDOM 2005: 86-98 |
23 | EE | Julia Chuzhoy,
Anupam Gupta,
Joseph Naor,
Amitabh Sinha:
On the approximability of some network design problems.
SODA 2005: 943-951 |
2004 |
22 | EE | Shuchi Chawla,
Uday Rajan,
R. Ravi,
Amitabh Sinha:
Worst-case payoffs of a location game.
ACM Conference on Electronic Commerce 2004: 244-245 |
21 | EE | Anupam Gupta,
R. Ravi,
Amitabh Sinha:
An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design.
FOCS 2004: 218-227 |
20 | EE | R. Ravi,
Amitabh Sinha:
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.
IPCO 2004: 101-115 |
19 | EE | R. Ravi,
Amitabh Sinha:
Multicommodity facility location.
SODA 2004: 342-349 |
18 | EE | Anupam Gupta,
Martin Pál,
R. Ravi,
Amitabh Sinha:
Boosted sampling: approximation algorithms for stochastic optimization.
STOC 2004: 417-426 |
17 | EE | Nikhil Bansal,
Kedar Dhamdhere,
Jochen Könemann,
Amitabh Sinha:
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown.
Algorithmica 40(4): 305-318 (2004) |
16 | EE | Jochen Könemann,
Asaf Levin,
Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
Algorithmica 41(2): 117-129 (2004) |
15 | EE | Guy Even,
Naveen Garg,
Jochen Könemann,
R. Ravi,
Amitabh Sinha:
Min-max tree covers of graphs.
Oper. Res. Lett. 32(4): 309-315 (2004) |
14 | EE | Jochen Könemann,
Yanjun Li,
Ojas Parekh,
Amitabh Sinha:
An approximation algorithm for the edge-dilation k-center problem, .
Oper. Res. Lett. 32(5): 491-495 (2004) |
2003 |
13 | EE | Shuchi Chawla,
D. Kitchin,
Uday Rajan,
R. Ravi,
Amitabh Sinha:
Profit guaranteeing mechanisms for multicast networks.
ACM Conference on Electronic Commerce 2003: 190-191 |
12 | EE | Jochen Könemann,
Asaf Levin,
Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
RANDOM-APPROX 2003: 109-121 |
11 | EE | Guy Even,
Naveen Garg,
Jochen Könemann,
R. Ravi,
Amitabh Sinha:
Covering Graphs Using Trees and Stars.
RANDOM-APPROX 2003: 24-35 |
10 | EE | Nikhil Bansal,
Kedar Dhamdhere,
Jochen Könemann,
Amitabh Sinha:
Non-clairvoyant Scheduling for Minimizing Mean Slowdown.
STACS 2003: 260-270 |
9 | EE | Jochen Könemann,
Goran Konjevod,
Ojas Parekh,
Amitabh Sinha:
Improved Approximations for Tour and Tree Covers.
Algorithmica 38(3): 441-449 (2003) |
2002 |
8 | EE | Jochen Könemann,
Yanjun Li,
Ojas Parekh,
Amitabh Sinha:
Approximation Algorithms for Edge-Dilation k-Center Problems.
SWAT 2002: 210-219 |
2000 |
7 | EE | Jochen Könemann,
Goran Konjevod,
Ojas Parekh,
Amitabh Sinha:
Improved approximations for tour and tree covers.
APPROX 2000: 184-193 |
1996 |
6 | | Amitabh Sinha,
Laxmikant V. Kalé:
Towards Automatic Performance Analysis.
ICPP, Vol. 3 1996: 53-60 |
1994 |
5 | | Laxmikant V. Kalé,
Amitabh Sinha:
Information Sharing Mechanisms in Parallel Programs.
IPPS 1994: 461-468 |
1993 |
4 | | Amitabh Sinha,
Laxmikant V. Kalé:
A Load Balancing Strategy for Prioritized Execution of Tasks.
IPPS 1993: 230-237 |
1992 |
3 | | Laxmikant V. Kalé,
Balkrishna Ramkumar,
Vikram A. Saletore,
Amitabh Sinha:
Prioritization in Parallel Symbolic Computing.
Parallel Symbolic Computing 1992: 12-41 |
1991 |
2 | | Wayne Fenton,
Balkrishna Ramkumar,
Vikram A. Saletore,
Amitabh Sinha,
Laxmikant V. Kalé:
Supporting Machine Independent Programming on Diverse Parallel Architectures.
ICPP (2) 1991: 193-201 |
1990 |
1 | | Mohan Ahuja,
Kannan Varadhan,
Amitabh Sinha:
Flush Message Passing in Communicating Sequential Processes.
PARBASE / Architectures 1990: 31-47 |