BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × Denmark
1 × Germany
1 × Iceland
1 × Latvia
1 × The Netherlands
2 × Canada
2 × Greece
6 × USA
Collaborated with:
D.G.Harris S.Chari P.Rohatgi R.Gandhi S.Khuller S.V.Pemmaraju C.Teo N.Alon A.Panconesi P.Auer P.M.Long M.E.Saks S.Zhou E.Morsy G.Pandurangan P.Robinson Y.Azar A.Madry T.Moscibroda D.Panigrahi E.Halperin G.Kortsarz D.Cook V.Faber M.V.Marathe Y.J.Sussmann T.Schlegel M.Foursa M.Bogen R.Narayanan D.d'Angelo G.Haidegger I.Mezgár J.Canou D.Sallé F.Meo J.A.Ibarbia A.H.Praturlon N.Ramakrishnan P.Butler S.Muthiah N.Self R.P.Khandpur P.Saraf W.Wang J.Cadena A.Vullikanti G.Korkmaz C.J.Kuhlman A.Marathe L.Zhao T.Hua F.Chen C.Lu B.Huang K.Trinh L.Getoor G.Katz A.Doyle C.Ackermann I.Zavorin J.Ford K.M.Summers Y.Fayed J.Arredondo D.Gupta D.Mares
Talks about:
approxim (7) algorithm (5) problem (5) improv (5) distribut (3) network (3) random (3) cover (3) rout (3) program (2)

Person: Aravind Srinivasan

DBLP DBLP: Srinivasan:Aravind

Contributed to:

KDD 20142014
ICALP (2) 20132013
STOC 20132013
ICALP (2) 20092009
ICALP (1) 20082008
HCI p4 20072007
ICALP 20032003
ICALP 20012001
STOC 20002000
ICALP 19981998
STOC 19971997
ICALP 19961996
STOC 19951995
STOC 19941994
STOC 19931993
STOC 19921992

Wrote 18 papers:

KDD-2014-RamakrishnanBMSKSWCVKKMZHCLHSTGKDAZFSFAGM #open source #using
“Beating the news” with EMBERS: forecasting civil unrest using open source indicators (NR, PB, SM, NS, RPK, PS, WW, JC, AV, GK, CJK, AM, LZ, TH, FC, CTL, BH, AS, KT, LG, GK, AD, CA, IZ, JF, KMS, YF, JA, DG, DM), pp. 1799–1808.
ICALP-v2-2013-HarrisMPRS #performance
Efficient Computation of Balanced Structures (DGH, EM, GP, PR, AS), pp. 581–593.
STOC-2013-HarrisS #constraints
Constraint satisfaction, packet routing, and the lovasz local lemma (DGH, AS), pp. 685–694.
ICALP-v2-2009-AzarMMPS #adaptation #network
Maximum Bipartite Flow in Networks with Adaptive Channel Width (YA, AM, TM, DP, AS), pp. 351–362.
ICALP-A-2008-PemmarajuS #random #symmetry
The Randomized Coloring Procedure with Symmetry-Breaking (SVP, AS), pp. 306–319.
HCI-AS-2007-SchlegelSFBNdHMCSMIP #distributed #interactive #named
INT-MANUS: Interactive Production Control in a Distributed Environment (TS, AS, MF, MB, RN, Dd, GH, IM, JC, DS, FM, JAI, AHP), pp. 1150–1159.
ICALP-2003-GandhiHKKS #algorithm #approximate
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities (RG, EH, SK, GK, AS), pp. 164–175.
ICALP-2001-GandhiKS #algorithm #approximate #problem
Approximation Algorithms for Partial Covering Problems (RG, SK, AS), pp. 225–236.
STOC-2000-Srinivasan #clique
The value of strong inapproximability results for clique (AS), pp. 144–152.
ICALP-1998-CookFMSS #network
Low-Bandwidth Routing and Electrical Power Networks (DC, VF, MVM, AS, YJS), pp. 604–615.
STOC-1997-AuerLS #approximate #learning #pseudo #set
Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets (PA, PML, AS), pp. 314–323.
STOC-1997-SrinivasanT #algorithm #approximate
A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria (AS, CPT), pp. 636–643.
ICALP-1996-AlonS #approximate #integer #parallel #problem #programming
Improved Parallel Approximation of a Class of Integer Programming Programming Problems (NA, AS), pp. 562–573.
Explicit dispersers with polylog degree (MES, AS, SZ), pp. 479–488.
STOC-1995-Srinivasan #approximate #problem
Improved approximations of packing and covering problems (AS), pp. 268–276.
STOC-1994-ChariRS #algorithm #approximate #probability
Improved algorithms via approximations of probability distributions (SC, PR, AS), pp. 584–592.
STOC-1993-ChariRS #problem
Randomness-optimal unique element isolation, with applications to perfect matching and related problems (SC, PR, AS), pp. 458–467.
STOC-1992-PanconesiS #algorithm #composition #distributed #network #problem
Improved Distributed Algorithms for Coloring and Network Decomposition Problems (AP, AS), pp. 581–592.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.