Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Anupam
    Last name: Gupta
    DBLP: 27/2931
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 221  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Anupam Gupta, Amit Kumar 0001, Viswanath Nagarajan, Xiangkun Shen.
    Stochastic Load Balancing on Unrelated Machines.
    Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 2018 (0) 2018
    Conference paper
    Anupam Gupta, Euiwoong Lee, Jason Li.
    An FPT Algorithm Beating 2-Approximation for
    Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 2018 (0) 2018
    Conference paper
    Martin Groß 0001, Anupam Gupta, Amit Kumar 0001, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt 0001, José Verschae.
    A Local-Search Algorithm for Steiner Forest.
    9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA 2018 (0) 2018
    Conference paper
    Anupam Gupta, R. Ravi 0001, Kunal Talwar, Seeun William Umboh.
    LAST but not Least: Online Spanners for Buy-at-Bulk.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Anupam Gupta, Viswanath Nagarajan, Sahil Singla.
    Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar 0001, Debmalya Panigrahi.
    Online and dynamic algorithms for set cover.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Lijie Chen, Anupam Gupta, Jian Li 0015, Mingda Qiao, Ruosong Wang.
    Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Lijie Chen, Anupam Gupta, Jian Li 0015, Mingda Qiao, Ruosong Wang.
    Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration.
    Proceedings of the 30th Conference on Learning Theory, COLT 2017, Amsterdam, The Netherlands, 7-10 July 2017 2017 (0) 2017
    Conference paper
    Martin Groß 0001, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt 0001, José Verschae.
    A Local-Search Algorithm for Steiner Forest.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Anupam Gupta, Archit Karandikar.
    Stochastic Unsplittable Flows.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA 2017 (0) 2017
    Conference paper
    Anupam Gupta, Viswanath Nagarajan, R. Ravi 0001.
    Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems.
    Math. Oper. Res. 2017, Volume 42 (0) 2017
    Conference paper
    Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman.
    Metric Embedding via Shortest Path Decompositions.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Anupam Gupta, Euiwoong Lee, Jason Li.
    An FPT Algorithm Beating 2-Approximation for k-Cut.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Anupam Gupta, Guru Guruganesh, Amit Kumar, David Wajc.
    Fully-Dynamic Bin Packing with Limited Repacking.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Nikhil Bansal, Anupam Gupta.
    Potential-Function Proofs for First-Order Methods.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Anupam Gupta, Viswanath Nagarajan, Sahil Singla.
    Algorithms and Adaptivity Gaps for Stochastic Probing.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Anupam Gupta, Viswanath Nagarajan, R. Ravi 0001.
    Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets.
    ACM Transactions on Algorithms 2016, Volume 12 (0) 2016
    Journal article
    Lijie Chen, Anupam Gupta, Jian Li.
    Pure Exploration of Multi-armed Bandit Under Matroid Constraints.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Albert Gu, Anupam Gupta, Amit Kumar 0001.
    The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online.
    SIAM J. Comput. 2016, Volume 45 (0) 2016
    Conference paper
    Lijie Chen, Anupam Gupta, Jian Li.
    Pure Exploration of Multi-armed Bandit Under Matroid Constraints.
    Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016 2016 (0) 2016
    Conference paper
    Zachary Friggstad, Anupam Gupta, Mohit Singh.
    An Improved Integrality Gap for Asymmetric TSP Paths.
    Math. Oper. Res. 2016, Volume 41 (0) 2016
    Conference paper
    Anupam Gupta, Guru Guruganesh, Melanie Schmidt 0001.
    Approximation Algorithms for Aversion k-Clustering via Local k-Median.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Anupam Gupta, Viswanath Nagarajan, Sahil Singla.
    Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    T.-H. Hubert Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou.
    On Hierarchical Routing in Doubling Metrics.
    ACM Transactions on Algorithms 2016, Volume 12 (0) 2016
    Conference paper
    Anupam Gupta, Marco Molinaro.
    How the Experts Algorithm Can Help Solve LPs Online.
    Math. Oper. Res. 2016, Volume 41 (0) 2016
    Conference paper
    Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar 0001, Debmalya Panigrahi.
    Online and Dynamic Algorithms for Set Cover.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Anupam Gupta, R. Ravi 0001, Kunal Talwar, Seeun William Umboh.
    LAST but not Least: Online Spanners for Buy-at-Bulk.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang 0002, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi.
    Online Algorithms for Covering and Packing Problems with Convex Objectives.
    IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA 2016 (0) 2016
    Journal article
    Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan.
    Algorithms for Hub Label Optimization.
    ACM Trans. Algorithms 2016, Volume 13 (0) 2016
    Journal article
    Anupam Gupta, Mauro Sbragaglia, Andrea Scagliarini.
    Hybrid Lattice Boltzmann/Finite Difference simulations of viscoelastic multicomponent flows in confined geometries.
    J. Comput. Physics 2015, Volume 291 (0) 2015
    Journal article
    Nikhil Bansal, Anupam Gupta, Guru Guruganesh.
    On the Lovász Theta function for Independent Sets in Sparse Graphs.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Anupam Gupta, Amit Kumar 0001.
    Greedy Algorithms for Steiner Forest.
    Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015 2015 (0) 2015
    Conference paper
    Nikhil Bansal, Anupam Gupta, Guru Guruganesh.
    On the Lovász Theta function for Independent Sets in Sparse Graphs.
    Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015 2015 (0) 2015
    Conference paper
    Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein.
    A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA 2015 (0) 2015
    Conference paper
    Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi 0001.
    Running Errands in Time: Approximation Algorithms for Stochastic Orienteering.
    Math. Oper. Res. 2015, Volume 40 (0) 2015
    Conference paper
    Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor.
    A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching.
    Algorithmica 2014, Volume 68 (0) 2014
    Conference paper
    Anupam Gupta, Amit Kumar 0001, Clifford Stein.
    Maintaining Assignments Online: Matching, Scheduling, and Flows.
    Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 2014 (0) 2014
    Conference paper
    Anupam Gupta, Anastasios Sidiropoulos.
    Minimum
    Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 2014 (0) 2014
    Conference paper
    Anupam Gupta, Amit Kumar 0001.
    Online Steiner Tree with Deletions.
    Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 2014 (0) 2014
    Conference paper
    Alexandr Andoni, Anupam Gupta, Robert Krauthgamer.
    Towards (1 +
    Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 2014 (0) 2014
    Conference paper
    Heena Rathore, Venkataramana Badarla, Sushmita Jha, Anupam Gupta.
    Novel approach for security in Wireless Sensor Network using bio-inspirations.
    Sixth International Conference on Communication Systems and Networks, COMSNETS 2014, Bangalore, India, January 6-10, 2014 2014 (0) 2014
    Journal article
    Anupam Gupta, Kunal Talwar, Udi Wieder.
    Changing Bases: Multistage Optimization for Matroids and Matchings.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Anupam Gupta, Kunal Talwar, Udi Wieder.
    Changing Bases: Multistage Optimization for Matroids and Matchings.
    Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I 2014 (0) 2014
    Conference paper
    Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar.
    Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs.
    Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 2014 (0) 2014
    Conference paper
    Anupam Gupta, Viswanath Nagarajan, R. Ravi 0001.
    Thresholded covering algorithms for robust and max-min optimization.
    Math. Program. 2014, Volume 146 (0) 2014
    Conference paper
    Anupam Gupta, Marco Molinaro.
    How the Experts Algorithm Can Help Solve LPs Online.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan.
    Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.
    Theory Comput. Syst. 2014, Volume 55 (0) 2014
    Conference paper
    Anupam Gupta, Marco Molinaro.
    How Experts Can Solve LPs Online.
    Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar.
    Vertex Sparsifiers: New Results from Old Techniques.
    SIAM J. Comput. 2014, Volume 43 (0) 2014
    Conference paper
    Anupam Gupta, Viswanath Nagarajan.
    Approximating Sparse Covering Integer Programs Online.
    Math. Oper. Res. 2014, Volume 39 (0) 2014
    Journal article
    Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor.
    Online Packing and Covering Framework with Convex Objectives.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Anupam Gupta, Amit Kumar 0001.
    Greedy Algorithms for Steiner Forest.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Anupam Gupta, Viswanath Nagarajan.
    A Stochastic Probing Problem with Applications
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Zachary Friggstad, Anupam Gupta, Mohit Singh.
    An Improved Integrality Gap for Asymmetric TSP Paths
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani.
    Thrifty Algorithms for Multistage Robust Optimization
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani.
    Thrifty Algorithms for Multistage Robust Optimization.
    Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Anupam Gupta, Viswanath Nagarajan.
    A Stochastic Probing Problem with Applications.
    Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Zachary Friggstad, Anupam Gupta, Mohit Singh.
    An Improved Integrality Gap for Asymmetric TSP Paths.
    Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Michael Dinitz, Anupam Gupta.
    Packing Interdiction and Partial Covering Problems.
    Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski.
    Catch them if you can: how to serve impatient users.
    Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013 2013 (0) 2013
    Conference paper
    Maria-Florina Balcan, Avrim Blum, Anupam Gupta.
    Clustering under approximation stability.
    J. ACM 2013, Volume 60 (0) 2013
    Conference paper
    Anupam Gupta, Kunal Talwar, David Witmer.
    Sparsest cut on bounded treewidth graphs: algorithms and hardness results.
    Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013 2013 (0) 2013
    Conference paper
    Albert Gu, Anupam Gupta, Amit Kumar 0001.
    The power of deferral: maintaining a constant-competitive steiner tree online.
    Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013 2013 (0) 2013
    Journal article
    Anupam Gupta, Kunal Talwar, David Witmer.
    Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Avrim Blum, Anupam Gupta, Ariel D. Procaccia, Ankit Sharma.
    Harnessing the power of two crossmatches.
    ACM Conference on Electronic Commerce, EC '13, Philadelphia, PA, USA, June 16-20, 2013 2013 (0) 2013
    Conference paper
    Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan.
    Algorithms for Hub Label Optimization.
    Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I 2013 (0) 2013
    Conference paper
    Fabrizio Grandoni 0001, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh.
    Set Covering with Our Eyes Closed.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Journal article
    Anupam Gupta, Anastasios Sidiropoulos.
    Minimum d-dimensional arrangement with fixed points.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Albert Gu, Anupam Gupta, Amit Kumar 0001.
    The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Anupam Gupta, Kunal Talwar.
    Random Rates for 0-Extension and Low-Diameter Decompositions.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber.
    The Approximability of the Binary Paintshop Problem.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman.
    Privately Releasing Conjunctions and the Statistical Query Barrier.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Journal article
    Ashish Kumar, Anupam Gupta.
    Some Efficient Solutions to Yao's Millionaire Problem.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Alexandr Andoni, Anupam Gupta, Robert Krauthgamer.
    Towards (1+ε)-Approximate Flow Sparsifiers.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar.
    Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Anupam Gupta, Amit Kumar 0001.
    Online Steiner Tree with Deletions.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Anupam Gupta, Aaron Roth, Jonathan Ullman.
    Iterative Constructions and Private Data Release.
    Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra.
    When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings.
    Algorithmica 2012, Volume 63 (0) 2012
    Conference paper
    Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan.
    Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design.
    24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012 2012 (0) 2012
    Conference paper
    Anupam Gupta, Kevin Lewi.
    The Online Metric Matching Problem for Doubling Metrics.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012 (0) 2012
    Conference paper
    Anupam Gupta, Viswanath Nagarajan.
    Approximating Sparse Covering Integer Programs Online.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012 (0) 2012
    Journal article
    Anupam Gupta, Viswanath Nagarajan, R. Ravi.
    Technical Note - Approximation Algorithms for VRP with Stochastic Demands.
    Operations Research 2012, Volume 60 (0) 2012
    Conference paper
    Anupam Gupta, Viswanath Nagarajan.
    Approximating Sparse Covering Integer Programs Online
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Sanjiban Sekhar Roy, Anupam Gupta, Anvesha Sinha, Rohit Ramesh.
    Cancer data investigation using variable precision Rough set with flexible classification.
    The Second International Conference on Computational Science, Engineering and Information Technology, CCSEIT '12, Coimbatore, India, October 26-28, 2012 2012 (0) 2012
    Conference paper
    Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein.
    Multicast Routing for Energy Minimization Using Speed Scaling.
    Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings 2012 (0) 2012
    Conference paper
    T.-H. Hubert Chan, Anupam Gupta.
    Approximating TSP on Metrics with Bounded Global Growth.
    SIAM J. Comput. 2012, Volume 41 (0) 2012
    Conference paper
    Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi 0001.
    Approximation algorithms for stochastic orienteering.
    Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 2012 (0) 2012
    Conference paper
    Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs.
    Scheduling heterogeneous processors isn't as easy as you think.
    Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 2012 (0) 2012
    Conference paper
    Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi 0001.
    Online and Stochastic Survivable Network Design.
    SIAM J. Comput. 2012, Volume 41 (0) 2012
    Conference paper
    Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs.
    Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling.
    Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers 2013 (0) 2012
    Journal article
    Anupam Gupta, Kunal Talwar.
    Making Doubling Metrics Geodesic.
    Algorithmica 2011, Volume 59 (0) 2011
    Journal article
    Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi.
    Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg.
    Robust sensor placements at informative and communication-efficient locations.
    TOSN 2010, Volume 7 (0) 2011
    Conference paper
    Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev.
    Set connectivity problems in undirected graphs and the directed steiner network problem.
    ACM Transactions on Algorithms 2010, Volume 7 (0) 2011
    Journal article
    Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs.
    Scalably Scheduling Power-Heterogeneous Processors
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman.
    Privately releasing conjunctions and the statistical query barrier.
    Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011 2011 (0) 2011
    Conference paper
    Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan.
    Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs.
    SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) 2011 (0) 2011
    Journal article
    Anupam Gupta, Aaron Roth, Jonathan Ullman.
    Iterative Constructions and Private Data Release
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs.
    Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma.
    Welfare and Profit Maximization with Production Costs
    CoRR 2011, Volume 0 (0) 2011
    Show item 1 to 100 of 221  

    Your query returned 221 matches in the database.