# Yaron Singer

According to our database

Collaborative distances:

^{1}, Yaron Singer authored at least 49 papers between 2007 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model.

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Robust Influence Maximization for Hyperparametric Models.

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

The adaptive complexity of maximizing a submodular function.

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Optimization for Approximate Submodularity.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Non-monotone Submodular Maximization in Exponentially Fewer Iterations.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Learning to Optimize Combinatorial Functions.

Proceedings of the 35th International Conference on Machine Learning, 2018

Learning Diffusion using Hyperparameters.

Proceedings of the 35th International Conference on Machine Learning, 2018

Approximation Guarantees for Adaptive Sampling.

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

The limitations of optimization from samples.

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Robust Optimization for Non-Convex Objectives.

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Minimizing a Submodular Function from Samples.

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

The Importance of Communities for Learning to Influence.

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Robust Guarantees of Stochastic Greedy Algorithms.

Proceedings of the 34th International Conference on Machine Learning, 2017

Submodular Optimization under Noise.

Proceedings of the 30th Conference on Learning Theory, 2017

The Sample Complexity of Optimizing a Convex Function.

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Influence maximization through adaptive seeding.

SIGecom Exchanges, 2016

Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Maximization of Approximately Submodular Functions.

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

The Power of Optimization from Samples.

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization.

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

Stabilizing Route Selection in BGP.

IEEE/ACM Trans. Netw., 2015

Scalable Methods for Adaptively Seeding a Social Network.

Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Scalable Methods for Adaptively Seeding a Social Network.

Proceedings of the 24th International Conference on World Wide Web, 2015

The Power of Random Neighbors in Social Networks.

Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Approximability of Adaptive Seeding under Knapsack Constraints.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Mechanisms for Fair Attribution.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Information-theoretic lower bounds for convex optimization with erroneous oracles.

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Learnability of Influence in Networks.

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Influence at Scale: Distributed Computation of Complex Contagion in Networks.

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

2013

Budget feasible mechanism design.

SIGecom Exchanges, 2013

Pricing mechanisms for crowdsourcing markets.

Proceedings of the 22nd International World Wide Web Conference, 2013

Equilibrium in Combinatorial Public Projects.

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Adaptive Seeding in Social Networks.

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

How to win friends and influence people, truthfully: influence maximization mechanisms for social networks.

Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Learning on a budget: posted price mechanisms for online procurement.

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Efficiency-Revenue Trade-Offs in Auctions.

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Incentives, Computation, and Networks: Limitations and Possibilities of Algorithmic Mechanism Design.

PhD thesis, 2011

Mechanisms for complement-free procurement.

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Posting Prices with Unknown Distributions.

Proceedings of the Innovations in Computer Science, 2011

Pricing Tasks in Online Labor Markets.

Proceedings of the Human Computation, 2011

2010

Inapproximability for VCG-Based Combinatorial Auctions.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Computation and incentives in combinatorial public projects.

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Limitations and Possibilities of Path Trading between Autonomous Systems.

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Budget Feasible Mechanisms.

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2008

Inapproximability of Combinatorial Public Projects.

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Trading potatoes in distributed multi-tier routing systems.

Proceedings of the ACM SIGCOMM 2008 Workshop on Economics of Networked Systems, 2008

On the Hardness of Being Truthful.

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Beyond Centrality - Classifying Topological Significance Using Backup Efficiency and Alternative Paths.

Proceedings of the NETWORKING 2007. Ad Hoc and Sensor Networks, 2007