The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |