Kamesh Munagala
According to our database^{1},
Kamesh Munagala
authored at least 114 papers
between 1999 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at cs.duke.edu
On csauthors.net:
Bibliography
2020
Dynamic Weighted Fairness with Minimal Disruptions.
POMACS, 2020
Predict and Match: Prophet Inequalities with Uncertain Supply.
POMACS, 2020
Advertising for Demographically Fair Outcomes.
CoRR, 2020
Concentration of Distortion: The Value of Extra Voters in Randomized Social Choice.
CoRR, 2020
Approximately stable committee selection.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
2019
The SegmentationThickness Tradeoff in Online Marketplaces.
POMACS, 2019
Iterative Local Voting for Collective Decisionmaking in Continuous Spaces.
J. Artif. Intell. Res., 2019
Proportionally Fair Clustering.
CoRR, 2019
Proportionally Fair Clustering.
Proceedings of the 36th International Conference on Machine Learning, 2019
Improved Metric Distortion for Deterministic Social Choice Rules.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
Group Fairness in Committee Selection.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
Random Dictators with a Random Referee: Constant Sample Complexity Mechanisms for Social Choice.
Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence, 2019
2018
Data Aggregation in Sensor Networks.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018
Competitive Algorithms from Competitive Equilibria: NonClairvoyant Scheduling under Polyhedral Constraints.
J. ACM, 2018
A Simple Mechanism for a BudgetConstrained Buyer.
Proceedings of the Web and Internet Economics  14th International Conference, 2018
Fair Allocation of Indivisible Public Goods.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Subtrajectory Clustering: Models and Algorithms.
Proceedings of the 37th ACM SIGMODSIGACTSIGAI Symposium on Principles of Database Systems, 2018
2017
Segmenting twosided markets.
SIGecom Exch., 2017
Twosided Facility Location.
CoRR, 2017
Collaborative Optimization for Collective Decisionmaking in Continuous Spaces.
Proceedings of the 26th International Conference on World Wide Web, 2017
Sequential Deliberation for Social Choice.
Proceedings of the Web and Internet Economics  13th International Conference, 2017
ROBUS: Fair Cache Allocation for Dataparallel Workloads.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017
Metric Distortion of Social Choice Rules: Lower Bounds and Fairness Properties.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
2016
Local Search for Kmedians and Facility Location.
Encyclopedia of Algorithms, 2016
The Core of the Participatory Budgeting Problem.
Proceedings of the Web and Internet Economics  12th International Conference, 2016
Parallel Algorithms for Constructing Range and NearestNeighbor Searching Data Structures.
Proceedings of the 35th ACM SIGMODSIGACTSIGAI Symposium on Principles of Database Systems, 2016
Competitive Analysis of Constrained Queueing Systems.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains.
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016
A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints.
Proceedings of the Approximation, 2016
2015
ROBUS: Fair Cache Allocation for Multitenant Dataparallel Workloads.
CoRR, 2015
A Note on Modeling Retweet Cascades on Twitter.
Proceedings of the Algorithms and Models for the Web Graph  12th International Workshop, 2015
Combating Friend Spam Using Social Rejections.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015
Competitive Flow Time Algorithms for Polyhedral Scheduling.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
Modeling opinion dynamics in social networks.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014
ValueBased Network Externalities and Optimal Auction Design.
Proceedings of the Web and Internet Economics  10th International Conference, 2014
Efficient PrimalDual Graph Algorithms for MapReduce.
Proceedings of the Algorithms and Models for the Web Graph  11th International Workshop, 2014
Coordination mechanisms from (almost) all scheduling policies.
Proceedings of the Innovations in Theoretical Computer Science, 2014
SelfishMigrate: A Scalable Algorithm for Nonclairvoyantly Scheduling Heterogeneous Processors.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
Stochastic Regret Minimization via Thompson Sampling.
Proceedings of The 27th Conference on Learning Theory, 2014
2013
Optimal Auctions with Positive Network Externalities.
ACM Trans. Economics and Comput., 2013
Approximation Algorithms for Bayesian MultiArmed Bandit Problems.
CoRR, 2013
Coevolutionary opinion formation games.
Proceedings of the Symposium on Theory of Computing Conference, 2013
Optimal auctions via the multiplicative weight method.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
On the precision of social and information networks.
Proceedings of the Conference on Online Social Networks, 2013
Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013
2012
Order Matters: Transmission Reordering in Wireless Networks.
IEEE/ACM Trans. Netw., 2012
BudgetConstrained Auctions with Heterogeneous Items.
Theory Comput., 2012
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems.
ACM Trans. Algorithms, 2012
How to approximate optimal auctions.
SIGecom Exch., 2012
Complexity Measures for MapReduce, and Comparison to Parallel Computing
CoRR, 2012
Algorithms for CostAware Scheduling.
Proceedings of the Approximation and Online Algorithms  10th International Workshop, 2012
Mechanisms and allocations with positive network externalities.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012
2011
Interactionaware scheduling of reportgeneration workloads.
VLDB J., 2011
Storing Matrices on Disk: Theory and Practice Revisited.
Proc. VLDB Endow., 2011
Consideration set generation in commerce search.
Proceedings of the 20th International Conference on World Wide Web, 2011
On Allocations with Negative Externalities.
Proceedings of the Internet and Network Economics  7th International Workshop, 2011
Approximation Algorithm for Security Games with Costly Resources.
Proceedings of the Internet and Network Economics  7th International Workshop, 2011
2010
How to probe for an extreme value.
ACM Trans. Algorithms, 2010
Approximation algorithms for restless bandit problems.
J. ACM, 2010
Iterated Allocations with Delayed Feedback
CoRR, 2010
FalseNameProofness in Social Networks.
Proceedings of the Internet and Network Economics  6th International Workshop, 2010
Incentive Compatible Budget Elicitation in Multiunit Auctions.
Proceedings of the TwentyFirst Annual ACMSIAM Symposium on Discrete Algorithms, 2010
2009
Data Aggregation in Sensor Networks.
Proceedings of the Encyclopedia of Database Systems, 2009
A Constant Factor Approximation for the Single Sink Edge Installation Problem.
SIAM J. Comput., 2009
Budget Constrained Auctions with Heterogeneous Items
CoRR, 2009
Hybrid keyword search auctions.
Proceedings of the 18th International Conference on World Wide Web, 2009
Largescale uncertainty management systems: learning and exploiting your data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009
Learning and Approximating the Optimal Strategy to Commit To.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009
Exceeding expectations and clustering uncertain data.
Proceedings of the TwentyEigth ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2009
Fa: A System for Automating Failure Diagnosis.
Proceedings of the 25th International Conference on Data Engineering, 2009
Multiarmed Bandits with Metric Switching Costs.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009
2008
Local Search for Kmedians and Facility Location.
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
CostDistance: Two Metric Network Design.
SIAM J. Comput., 2008
Sequential Design of Experiments via Linear Programming
CoRR, 2008
Information Acquisition and Exploitation in Multichannel Wireless Networks
CoRR, 2008
The Stochastic Machine Replenishment Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
Processing Diagnosis Queries: A Principled and Scalable Approach.
Proceedings of the 24th International Conference on Data Engineering, 2008
QShuffler: Getting the Query Mix Right.
Proceedings of the 24th International Conference on Data Engineering, 2008
Message in Message (MIM): A Case for Shuffling Transmissions in Wireless Networks.
Proceedings of the 7th ACM Workshop on Hot Topics in Networks, 2008
Modeling and exploiting query interactions in database systems.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008
2007
Making Sense of Suppressions and Failures in Sensor Data: A Bayesian Approach.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007
Approximation algorithms for budgeted learning problems.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Modeldriven optimization using adaptive probes.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Optimization of continuous queries with shared expensive filters.
Proceedings of the TwentySixth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2007
From Data Reverence to Data Relevance: ModelMediated Wireless Sensing of the Physical Environment.
Proceedings of the Computational Science, 2007
Approximation Algorithms for PartialInformation Based Stochastic Control with Markovian Rewards.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
DataDriven Processing in Sensor Networks.
Proceedings of the CIDR 2007, 2007
2006
Query Optimization over Web Services.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006
Energyefficient monitoring of extreme values in sensor networks.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006
Optimizing transmission rate in wireless channels using adaptive probes.
Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006
Asking the right questions: modeldriven optimization using probes.
Proceedings of the TwentyFifth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2006
A SamplingBased Approach to Optimizing Topk Queries in Sensor Networks.
Proceedings of the 22nd International Conference on Data Engineering, 2006
ModelDriven Dynamic Control of Embedded Wireless Sensor Networks.
Proceedings of the Computational Science, 2006
2005
Operator placement for innetwork stream query processing.
Proceedings of the Twentyfourth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 2005
The Pipelined Set Cover Problem.
Proceedings of the Database Theory, 2005
Adaptive Caching for Continuous Queries.
Proceedings of the 21st International Conference on Data Engineering, 2005
Online View Maintenance Under a ResponseTime Constraint.
Proceedings of the Algorithms, 2005
2004
Local Search Heuristics for kMedian and Facility Location Problems.
SIAM J. Comput., 2004
Cancer characterization and feature set extraction by discriminative margin clustering.
BMC Bioinform., 2004
Adaptive Ordering of Pipelined Stream Filters.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004
2003
A constant factor approximation algorithm for the faulttolerant facility location problem.
J. Algorithms, 2003
Application of the twosided depth test to CSG rendering.
Proceedings of the 2003 Symposium on Interactive 3D Graphics, 2003
2002
Extending Greedy Multicast Routing to Delay Sensitive Applications.
Algorithmica, 2002
Generalized clustering.
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
Improved algorithms for the data placement problem.
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
2001
A constant factor approximation for the single sink edge installation problems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Local search heuristic for kmedian and facility location problems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Web caching using access statistics.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Improved algorithms for fault tolerant facility location.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Designing Networks Incrementally.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
2000
Balancing Steiner trees and shortest path trees online.
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
Hierarchical Placement and Network Design Problems.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
Online Algorithms for Caching Multimedia Streams.
Proceedings of the Algorithms, 2000
1999
I/OComplexity of Graph Algorithms.
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999