Travelled to:1 × Canada
1 × France
1 × Italy
1 × United Kingdom
2 × USA
Collaborated with:L.C.Lau R.Ravi N.K.Vishnoi J.Naor B.Laekhanukit S.O.Gharan M.Sakare S.Gupta N.Buchbinder M.R.Salavatipour V.R.Narasayya I.Menache F.Li M.Syamala S.Chaudhuri
Talks about:approxim (4) degre (4) minimum (3) constraint (2) algorithm (2) network (2) surviv (2) design (2) optim (2) bound (2)
Person: Mohit Singh
DBLP: Singh:Mohit
Contributed to:
2015
2014
2012
2011200820072006Wrote 9 papers:
- VLDB-2015-NarasayyaMSLSC #as a service #memory management #multitenancy #relational
- Sharing Buffer Pool Memory in Multi-Tenant Relational Database-as-a-Service (VRN, IM, MS, FL, MS, SC), pp. 726–737.
- STOC-2014-SinghV #optimisation
- Entropy, optimization and counting (MS, NKV), pp. 50–59.
- ICALP-v1-2012-BuchbinderNRS #algorithm #approximate #constraints #online #rank
- Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (NB, JN, RR, MS), pp. 145–156.
- ICALP-v1-2012-LaekhanukitGS #approach #problem
- A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (BL, SOG, MS), pp. 606–616.
- DATE-2011-SinghSG #generative #performance #testing #using
- Testing of high-speed DACs using PRBS generation with “Alternate-Bit-Tapping” (MS, MS, SG), pp. 377–382.
- STOC-2008-LauS #approximate #bound #design #network
- Additive approximation for bounded degree survivable network design (LCL, MS), pp. 759–768.
- STOC-2007-LauNSS #constraints #design #network #order
- Survivable network design with degree or order constraints (LCL, JN, MRS, MS), pp. 651–660.
- STOC-2007-SinghL #approximate #bound
- Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.
- ICALP-v1-2006-RaviS #algorithm #approximate
- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (RR, MS), pp. 169–180.