![]() |
other persons with the same name:
| 2009 | ||
|---|---|---|
| 63 | EE | Amit Kumar, Ram Huggahalli, Srihari Makineni: Characterization of Direct Cache Access on multi-core systems and 10GbE. HPCA 2009: 341-352 |
| 2008 | ||
| 62 | EE | Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan: All-Norms and All-L_p-Norms Approximation Algorithms. FSTTCS 2008 |
| 61 | EE | Priya Govindarajan, Srihari Makineni, Donald Newell, Ravi R. Iyer, Ram Huggahalli, Amit Kumar: Achieving 10Gbps Network Processing: Are We There Yet?. HiPC 2008: 518-528 |
| 60 | EE | Naveen Garg, Amit Kumar, V. N. Muralidhara: Minimizing Total Flow-Time: The Unrelated Case. ISAAC 2008: 424-435 |
| 59 | Mahantesh Halappanavar, Amit Kumar, Ravi Mukkamala, Mohammad Zubair: Efficient Parallel Implementations of Binomial Tree Option Price Valuation. ISCA PDCCS 2008: 74-81 | |
| 58 | EE | Yigal Bejerano, Seung-Jae Han, Keon-Taek Lee, Amit Kumar: Single-path routing for life time maximization in multi-hop wireless networks. LCN 2008: 160-167 |
| 2007 | ||
| 57 | EE | Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar: Stochastic Steiner Tree with Non-uniform Inflation. APPROX-RANDOM 2007: 134-148 |
| 56 | EE | Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta, Amit Kumar, Rajeev Rastogi: On Configuring BGP Route Reflectors. COMSWARE 2007 |
| 55 | EE | Naveen Garg, Amit Kumar: Minimizing Average Flow-time : Upper and Lower Bounds. FOCS 2007: 603-613 |
| 54 | EE | Amit Kumar, Yogish Sabharwal: The Priority k-Median Problem. FSTTCS 2007: 71-83 |
| 53 | EE | Naveen Garg, Amit Kumar, Vinayaka Pandit: Order Scheduling Models: Hardness and Algorithms. FSTTCS 2007: 96-107 |
| 52 | EE | Dean P. McCullough, Prabhakar R. Gudla, Karen J. Meaburn, Amit Kumar, Michael Kuehn, Stephen J. Lockett: 3d Segmentation of Whole Cells and Cell Nuclei in Tissue Using Dynamic Programming. ISBI 2007: 276-279 |
| 51 | EE | Amit Kumar, Ram Huggahalli: Impact of Cache Coherence Protocols on the Processing of Network Traffic. MICRO 2007: 161-171 |
| 50 | EE | Amit Kumar, Krishnendu Chakrabarty, Chunduri Rama Mohan: An ECO Technique for Removing Crosstalk Violations in Clock Networks. VLSI Design 2007: 283-288 |
| 49 | EE | Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica 47(1): 53-78 (2007) |
| 48 | EE | Yigal Bejerano, Seung-Jae Han, Amit Kumar: Efficient load-balancing routing for wireless mesh networks. Computer Networks 51(10): 2450-2466 (2007) |
| 47 | EE | Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54(3): 11 (2007) |
| 2006 | ||
| 46 | Pankaj Garg, Amit Kumar, Huzur Saran: Enhanced distributed hash tables for complex queries. COMSWARE 2006 | |
| 45 | EE | Naveen Garg, Amit Kumar: Better Algorithms for Minimizing Average Flow-Time on Related Machines. ICALP (1) 2006: 181-190 |
| 44 | EE | Naveen Garg, Amit Kumar: Minimizing average flow time on related machines. STOC 2006: 730-738 |
| 43 | EE | Ashu Jain, Amit Kumar: An evaluation of artificial neural network technique for the determination of infiltration model parameters. Appl. Soft Comput. 6(3): 272-282 (2006) |
| 42 | EE | Amit Kumar, Jon M. Kleinberg: Fairness Measures for Resource Allocation. SIAM J. Comput. 36(3): 657-680 (2006) |
| 2005 | ||
| 41 | EE | Anupam Gupta, Amit Kumar: Where's the Winner? Max-Finding and Sorting with Metric Costs. APPROX-RANDOM 2005: 74-85 |
| 40 | EE | Amit Kumar, Yogish Sabharwal, Sandeep Sen: Linear Time Algorithms for Clustering Problems in Any Dimensions. ICALP 2005: 1374-1385 |
| 39 | Herbert G. Tanner, Amit Kumar: Towards Decentralization of Multi-robot Navigation Functions. ICRA 2005: 4132-4137 | |
| 38 | EE | Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, Rajeev Rastogi: Join-distinct aggregate estimation over update streams. PODS 2005: 259-270 |
| 37 | EE | Herbert G. Tanner, Amit Kumar: Formation Stabilization of Multiple Agents Using Decentralized Navigation Functions. Robotics: Science and Systems 2005: 49-56 |
| 36 | EE | Mani Abrol, Bhavin Doshi, Jim Kanihan, Amit Kumar, Jinhui Liu, Jianchang Mao: Intelligent Taxonomy Management Tools for Enterprise Content. Web Intelligence 2005: 809-811 |
| 35 | EE | Minos N. Garofalakis, Amit Kumar: XML stream processing using tree-edit distance embeddings. ACM Trans. Database Syst. 30(1): 279-332 (2005) |
| 34 | EE | Minos N. Garofalakis, Amit Kumar: Wavelet synopses for general error metrics. ACM Trans. Database Syst. 30(4): 888-928 (2005) |
| 33 | EE | Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. Algorithmica 43(1-2): 17-41 (2005) |
| 32 | EE | Chandra Chekuri, Anupam Gupta, Amit Kumar: On a bidirected relaxation for the MULTIWAY CUT problem. Discrete Applied Mathematics 150(1-3): 67-79 (2005) |
| 2004 | ||
| 31 | EE | Chandra Chekuri, Amit Kumar: Maximum Coverage Problem with Group Budget Constraints and Applications. APPROX-RANDOM 2004: 72-83 |
| 30 | EE | Amit Kumar, Alejandro Bia, Martin Holmes, Susan Schreibman, Ray Siemens, John Walsh: <teiPublisher>: Bridging the Gap Between a Simple Set of Structured Documents and a Functional Digital Library. ECDL 2004: 432-441 |
| 29 | EE | Amit Kumar, Yogish Sabharwal, Sandeep Sen: A Simple Linear Time (1+ ) -Approximation Algorithm for k-Means Clustering in Any Dimensions. FOCS 2004: 454-462 |
| 28 | EE | Minos N. Garofalakis, Amit Kumar: Deterministic Wavelet Thresholding for Maximum-Error Metrics. PODS 2004: 166-176 |
| 27 | EE | Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar: Multi-processor scheduling to minimize flow time with epsilon resource augmentation. STOC 2004: 363-372 |
| 26 | EE | Chaitanya Swamy, Amit Kumar: Primal-Dual Algorithms for Connected Facility Location Problems. Algorithmica 40(4): 245-269 (2004) |
| 25 | EE | Anupam Gupta, Amit Kumar, Rajeev Rastogi: Traveling with a Pez Dispenser (or, Routing Issues in MPLS). SIAM J. Comput. 34(2): 453-474 (2004) |
| 2003 | ||
| 24 | EE | Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS 2003: 606- |
| 23 | Ashu Jain, Amit Kumar: Calibration of Infiltration Parameters Using Artificial Neural Networks. IICAI 2003: 73-82 | |
| 22 | EE | Anupam Gupta, Amit Kumar, Rajeev Rastogi: Exploring the trade-off between label size and stack depth in MPLS Routing. INFOCOM 2003 |
| 21 | EE | Minos N. Garofalakis, Amit Kumar: Correlating XML data streams using tree-edit distance embeddings. PODS 2003: 143-154 |
| 20 | EE | Anupam Gupta, Amit Kumar, Mikkel Thorup: Tree based MPLS routing. SPAA 2003: 193-199 |
| 19 | EE | Anupam Gupta, Amit Kumar, Tim Roughgarden: Simpler and better approximation algorithms for network design. STOC 2003: 365-372 |
| 18 | EE | Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalakis, Amit Kumar: Optimal configuration of OSPF aggregates. IEEE/ACM Trans. Netw. 11(2): 181-194 (2003) |
| 2002 | ||
| 17 | EE | Chaitanya Swamy, Amit Kumar: Primal-Dual Algorithms for Connected Facility Location Problems. APPROX 2002: 256-270 |
| 16 | EE | Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. APPROX 2002: 51-66 |
| 15 | EE | Amit Kumar, Anupam Gupta, Tim Roughgarden: A Constant-Factor Approximation Algorithm for the Multicommodity. FOCS 2002: 333- |
| 14 | Amit Kumar, Arthur C. Sanderson, Robert J. Graves, Raj Subbu: Distributed Relational Decision Framework for Scalable Enterprise Systems. ICRA 2002: 775-780 | |
| 13 | EE | Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalakis, Amit Kumar: Optimal Configuration of OSPF Aggregates. INFOCOM 2002 |
| 12 | EE | Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. IPCO 2002: 439-456 |
| 11 | EE | Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, Bülent Yener: Algorithms for provisioning virtual private networks in the hose model. IEEE/ACM Trans. Netw. 10(4): 565-578 (2002) |
| 10 | EE | David Kempe, Jon M. Kleinberg, Amit Kumar: Connectivity and Inference Problems for Temporal Networks. J. Comput. Syst. Sci. 64(4): 820-842 (2002) |
| 2001 | ||
| 9 | Anupam Gupta, Amit Kumar, Rajeev Rastogi: Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). FOCS 2001: 148-157 | |
| 8 | Anupam Gupta, Amit Kumar: Sorting and Selection with Structured Costs. FOCS 2001: 416-425 | |
| 7 | EE | Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, Bülent Yener: Algorithms for provisioning virtual private networks in the hose model. SIGCOMM 2001: 135-146 |
| 6 | EE | Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener: Provisioning a virtual private network: a network design problem for multicommodity flow. STOC 2001: 389-398 |
| 5 | Jon M. Kleinberg, Amit Kumar: Wavelength Conversion in Optical Networks. J. Algorithms 38(1): 25-50 (2001) | |
| 2000 | ||
| 4 | Amit Kumar, Jon M. Kleinberg: Fairness Measures for Resource Allocation. FOCS 2000: 75-85 | |
| 3 | EE | David Kempe, Jon M. Kleinberg, Amit Kumar: Connectivity and inference problems for temporal networks. STOC 2000: 504-513 |
| 1999 | ||
| 2 | EE | Jon M. Kleinberg, Amit Kumar: Wavelength Conversion in Optical Networks. SODA 1999: 566-575 |
| 1998 | ||
| 1 | EE | Manuel D. Rossetti, Amit Kumar, Robin A. Felder: Mobile Robot Simulation of Clinical Laboratory Deliveries. Winter Simulation Conference 1998: 1415-1422 |