BibSLEIGH — Amit

Travelled to:

1 × Greece
1 × Italy
1 × Latvia
1 × Portugal
1 × Spain
11 × USA
2 × France

Collaborated with:

A.Gupta N.Garg M.N.Garofalakis J.M.Kleinberg R.Rastogi A.Gu R.Huggahalli S.Makineni Y.Sabharwal S.Sen T.Roughgarden D.Kempe S.M.Reddy I.Pomeranz B.Becker J.S.Chadha V.N.Muralidhara L.Shang L.Peh N.K.Jha S.Ganguly C.Chekuri A.Goel S.Khanna S.Anand K.Bringmann T.Friedrich B.Yener T.Mukherjee D.Chander K.Dasgupta A.Chugh A.Mondal A.Bia M.Holmes S.Schreibman R.Siemens J.Walsh

Talks about:

time (6) flow (6) algorithm (5) minim (5) network (4) steiner (3) problem (3) machin (3) design (3) relat (3)

Person: Amit Kumar

DBLP: Kumar:Amit

Contributed to:

2015

2013

2011

2009

2006

2005

2004

2003

2001

2000

Wrote 20 papers:

SAC-2015-MukherjeeKCDCM #as a service #design #framework #performance #platform #scalability: Performance characterization and scalable design of sensing-as-a-service platform (TM, AK, DC, KD, AC, AM), pp. 592–595.
STOC-2015-Gupta0 #algorithm: Greedy Algorithms for Steiner Forest (AG, AK), pp. 871–878.
ICALP-v1-2013-0002BFGK: Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines (SA, KB, TF, NG, AK), pp. 13–24.
STOC-2013-GuGK #maintenance #online #power of: The power of deferral: maintaining a constant-competitive steiner tree online (AG, AG, AK), pp. 525–534.
DATE-2011-KumarRPB #3d #clustering #testing: Hyper-graph based partitioning to reduce DFT cost for pre-bond 3D-IC testing (AK, SMR, IP, BB), pp. 1424–1429.
HPCA-2009-KumarHM #manycore: Characterization of Direct Cache Access on multi-core systems and 10GbE (AK, RH, SM), pp. 341–352.
STOC-2009-ChadhaGKM #algorithm: A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation (JSC, NG, AK, VNM), pp. 679–684.
STOC-2009-GuptaK #approximate #probability: A constant-factor approximation for stochastic Steiner forest (AG, AK), pp. 659–668.
DAC-2006-KumarSPJ #approach #coordination #named: HybDTM: a coordinated hardware-software approach for dynamic thermal management (AK, LS, LSP, NKJ), pp. 548–553.
ICALP-v1-2006-GargK #algorithm: Better Algorithms for Minimizing Average Flow-Time on Related Machines (NG, AK), pp. 181–190.
STOC-2006-GargK: Minimizing average flow time on related machines (NG, AK), pp. 730–738.
ICALP-2005-KumarSS #algorithm #clustering #linear #problem: Linear Time Algorithms for Clustering Problems in Any Dimensions (AK, YS, SS), pp. 1374–1385.
PODS-2005-GangulyGKR #estimation: Join-distinct aggregate estimation over update streams (SG, MNG, AK, RR), pp. 259–270.
ECDL-2004-KumarBHSSW #documentation #functional #library #set: : Bridging the Gap Between a Simple Set of Structured Documents and a Functional Digital Library (AK, AB, MH, SS, RS, JW), pp. 432–441.
PODS-2004-GarofalakisK #metric: Deterministic Wavelet Thresholding for Maximum-Error Metrics (MNG, AK), pp. 166–176.
STOC-2004-ChekuriGKK #multi #scheduling: Multi-processor scheduling to minimize flow time with epsilon resource augmentation (CC, AG, SK, AK), pp. 363–372.
PODS-2003-GarofalakisK #correlation #data type #distance #edit distance #using #xml: Correlating XML data streams using tree-edit distance embeddings (MNG, AK), pp. 143–154.
STOC-2003-GuptaKR #algorithm #approximate #design #network: Simpler and better approximation algorithms for network design (AG, AK, TR), pp. 365–372.
STOC-2001-GuptaKKRY #design #multi #network #problem: Provisioning a virtual private network: a network design problem for multicommodity flow (AG, JMK, AK, RR, BY), pp. 389–398.
STOC-2000-KempeKK #network #problem: Connectivity and inference problems for temporal networks (DK, JMK, AK), pp. 504–513.