default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaron Singer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i25]Anay Mehrotra, Manolis Zampetakis
, Paul Kassianik, Blaine Nelson, Hyrum S. Anderson, Yaron Singer, Amin Karbasi:
Tree of Attacks: Jailbreaking Black-Box LLMs Automatically. CoRR abs/2312.02119 (2023)- 2022
- [j6]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model. Oper. Res. 70(5): 2967-2981 (2022) - [j5]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
The Limitations of Optimization from Samples. J. ACM 69(3): 21:1-21:33 (2022) - 2021
- [c53]Eric Balkanski, Sharon Qian, Yaron Singer:
Instance Specific Approximations for Submodular Maximization. ICML 2021: 609-618 - [i24]Eric Balkanski, Sharon Qian, Yaron Singer:
Instance Specific Approximations for Submodular Maximization. CoRR abs/2102.11911 (2021) - 2020
- [c52]Adam Breuer, Eric Balkanski, Yaron Singer:
The FAST Algorithm for Submodular Maximization. ICML 2020: 1134-1143 - [c51]Nir Rosenfeld, Kojin Oshiba, Yaron Singer:
Predicting Choice with Set-Dependent Aggregation. ICML 2020: 8220-8229 - [c50]Avinatan Hassidim, Ron Kupfer, Yaron Singer:
An Optimal Elimination Algorithm for Learning a Best Arm. NeurIPS 2020 - [c49]Ron Kupfer, Sharon Qian, Eric Balkanski, Yaron Singer:
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation. NeurIPS 2020 - [c48]Jesse Vig, Sebastian Gehrmann, Yonatan Belinkov, Sharon Qian, Daniel Nevo, Yaron Singer, Stuart M. Shieber:
Investigating Gender Bias in Language Models Using Causal Mediation Analysis. NeurIPS 2020 - [c47]Eric Balkanski, Yaron Singer:
A lower bound for parallel submodular minimization. STOC 2020: 130-139 - [i23]Sharon Qian, Dimitris Kalimeris, Gal Kaplun, Yaron Singer:
Robustness from Simple Classifiers. CoRR abs/2002.09422 (2020) - [i22]Jesse Vig, Sebastian Gehrmann, Yonatan Belinkov, Sharon Qian, Daniel Nevo, Yaron Singer, Stuart M. Shieber:
Causal Mediation Analysis for Interpreting Neural NLP: The Case of Gender Bias. CoRR abs/2004.12265 (2020) - [i21]Avinatan Hassidim, Ron Kupfer, Yaron Singer:
An Optimal Elimination Algorithm for Learning a Best Arm. CoRR abs/2006.11647 (2020) - [i20]Eric Balkanski, Harrison Chase, Kojin Oshiba, Alexander Rilee, Yaron Singer, Richard Wang:
Adversarial Attacks on Binary Image Recognition Systems. CoRR abs/2010.11782 (2020)
2010 – 2019
- 2019
- [c46]Dimitris Kalimeris, Gal Kaplun, Yaron Singer:
Robust Influence Maximization for Hyperparametric Models. ICML 2019: 3192-3200 - [c45]Sharon Qian, Yaron Singer:
Fast Parallel Algorithms for Statistical Subset Selection Problems. NeurIPS 2019: 5073-5082 - [c44]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation. SODA 2019: 283-302 - [c43]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model. STOC 2019: 66-77 - [i19]Sharon Qian, Yaron Singer:
Fast Parallel Algorithms for Feature Selection. CoRR abs/1903.02656 (2019) - [i18]Dimitris Kalimeris, Gal Kaplun, Yaron Singer:
Robust Influence Maximization for Hyperparametric Models. CoRR abs/1903.03746 (2019) - [i17]Juan C. Perdomo, Yaron Singer:
Robust Attacks against Multiple Classifiers. CoRR abs/1906.02816 (2019) - [i16]Nir Rosenfeld, Kojin Oshiba, Yaron Singer:
Predicting Choice with Set-Dependent Aggregation. CoRR abs/1906.06365 (2019) - [i15]Adam Breuer, Eric Balkanski, Yaron Singer:
The FAST Algorithm for Submodular Maximization. CoRR abs/1907.06173 (2019) - 2018
- [c42]Eric Balkanski, Yaron Singer:
Approximation Guarantees for Adaptive Sampling. ICML 2018: 393-402 - [c41]Dimitris Kalimeris, Yaron Singer, Karthik Subbian, Udi Weinsberg:
Learning Diffusion using Hyperparameters. ICML 2018: 2425-2433 - [c40]Nir Rosenfeld, Eric Balkanski, Amir Globerson, Yaron Singer:
Learning to Optimize Combinatorial Functions. ICML 2018: 4371-4380 - [c39]Yaron Singer, Avinatan Hassidim:
Optimization for Approximate Submodularity. NeurIPS 2018: 394-405 - [c38]Eric Balkanski, Adam Breuer, Yaron Singer:
Non-monotone Submodular Maximization in Exponentially Fewer Iterations. NeurIPS 2018: 2359-2370 - [c37]Eric Balkanski, Yaron Singer:
The adaptive complexity of maximizing a submodular function. STOC 2018: 1138-1151 - [i14]Eric Balkanski, Nicole Immorlica, Yaron Singer:
The Importance of Communities for Learning to Influence. CoRR abs/1801.07355 (2018) - [i13]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation. CoRR abs/1804.06355 (2018) - [i12]Eric Balkanski, Adam Breuer, Yaron Singer:
Non-monotone Submodular Maximization in Exponentially Fewer Iterations. CoRR abs/1807.11462 (2018) - [i11]Eric Balkanski, Yaron Singer:
Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization. CoRR abs/1808.03880 (2018) - [i10]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model. CoRR abs/1811.03093 (2018) - [i9]Suproteem K. Sarkar, Kojin Oshiba, Daniel Giebisch, Yaron Singer:
Robust Classification of Financial Risk. CoRR abs/1811.11079 (2018) - 2017
- [j4]Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer:
Posting Prices with Unknown Distributions. ACM Trans. Economics and Comput. 5(2): 13:1-13:20 (2017) - [c36]Eric Balkanski, Yaron Singer:
The Sample Complexity of Optimizing a Convex Function. COLT 2017: 275-301 - [c35]Avinatan Hassidim, Yaron Singer:
Submodular Optimization under Noise. COLT 2017: 1069-1122 - [c34]Avinatan Hassidim, Yaron Singer:
Robust Guarantees of Stochastic Greedy Algorithms. ICML 2017: 1424-1432 - [c33]Eric Balkanski, Yaron Singer:
Minimizing a Submodular Function from Samples. NIPS 2017: 814-822 - [c32]Robert S. Chen, Brendan Lucier, Yaron Singer, Vasilis Syrgkanis:
Robust Optimization for Non-Convex Objectives. NIPS 2017: 4705-4714 - [c31]Eric Balkanski, Nicole Immorlica, Yaron Singer:
The Importance of Communities for Learning to Influence. NIPS 2017: 5862-5871 - [c30]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
The limitations of optimization from samples. STOC 2017: 1016-1027 - [i8]Robert S. Chen, Brendan Lucier, Yaron Singer, Vasilis Syrgkanis:
Robust Optimization for Non-Convex Objectives. CoRR abs/1707.01047 (2017) - 2016
- [j3]Yaron Singer:
Influence maximization through adaptive seeding. SIGecom Exch. 15(1): 32-59 (2016) - [c29]Eric Balkanski, Baharan Mirzasoleiman, Andreas Krause, Yaron Singer:
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization. ICML 2016: 2207-2216 - [c28]Thibaut Horel, Yaron Singer:
Maximization of Approximately Submodular Functions. NIPS 2016: 3045-3053 - [c27]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
The Power of Optimization from Samples. NIPS 2016: 4017-4025 - [c26]Ashwinkumar Badanidiyuru, Christos H. Papadimitriou, Aviad Rubinstein, Lior Seeman, Yaron Singer:
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions. SODA 2016: 414-429 - [i7]Avinatan Hassidim, Yaron Singer:
Submodular Optimization under Noise. CoRR abs/1601.03095 (2016) - 2015
- [j2]Brighten Godfrey, Matthew Caesar, Ian Haken, Yaron Singer, Scott Shenker, Ion Stoica:
Stabilizing Route Selection in BGP. IEEE/ACM Trans. Netw. 23(1): 282-299 (2015) - [c25]Brendan Lucier, Joel Oren, Yaron Singer:
Influence at Scale: Distributed Computation of Complex Contagion in Networks. KDD 2015: 735-744 - [c24]Harikrishna Narasimhan, David C. Parkes, Yaron Singer:
Learnability of Influence in Networks. NIPS 2015: 3186-3194 - [c23]Yaron Singer, Jan Vondrák:
Information-theoretic lower bounds for convex optimization with erroneous oracles. NIPS 2015: 3204-3212 - [c22]Eric Balkanski, Yaron Singer:
Mechanisms for Fair Attribution. EC 2015: 529-546 - [c21]Aviad Rubinstein, Lior Seeman, Yaron Singer:
Approximability of Adaptive Seeding under Knapsack Constraints. EC 2015: 797-814 - [c20]Silvio Lattanzi, Yaron Singer:
The Power of Random Neighbors in Social Networks. WSDM 2015: 77-86 - [c19]Thibaut Horel, Yaron Singer:
Scalable Methods for Adaptively Seeding a Social Network. WWW 2015: 441-451 - [c18]Thibaut Horel, Yaron Singer:
Scalable Methods for Adaptively Seeding a Social Network. WWW (Companion Volume) 2015: 623-624 - [i6]Thibaut Horel, Yaron Singer:
Scalable Methods for Adaptively Seeding a Social Network. CoRR abs/1503.01438 (2015) - [i5]Ashwinkumar Badanidiyuru, Christos H. Papadimitriou, Aviad Rubinstein, Lior Seeman, Yaron Singer:
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions. CoRR abs/1507.02351 (2015) - [i4]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
The Limitations of Optimization from Samples. CoRR abs/1512.06238 (2015) - 2013
- [j1]Yaron Singer:
Budget feasible mechanism design. SIGecom Exch. 12(2): 24-31 (2013) - [c17]Lior Seeman, Yaron Singer:
Adaptive Seeding in Social Networks. FOCS 2013: 459-468 - [c16]Brendan Lucier, Yaron Singer, Vasilis Syrgkanis, Éva Tardos:
Equilibrium in Combinatorial Public Projects. WINE 2013: 347-360 - [c15]Yaron Singer, Manas Mittal:
Pricing mechanisms for crowdsourcing markets. WWW 2013: 1157-1166 - 2012
- [c14]Ilias Diakonikolas, Christos H. Papadimitriou, George Pierrakos, Yaron Singer:
Efficiency-Revenue Trade-Offs in Auctions. ICALP (2) 2012: 488-499 - [c13]Ashwinkumar Badanidiyuru, Robert Kleinberg, Yaron Singer:
Learning on a budget: posted price mechanisms for online procurement. EC 2012: 128-145 - [c12]Yaron Singer:
How to win friends and influence people, truthfully: influence maximization mechanisms for social networks. WSDM 2012: 733-742 - [i3]Ilias Diakonikolas, Christos H. Papadimitriou, George Pierrakos, Yaron Singer:
Efficiency-Revenue Trade-offs in Auctions. CoRR abs/1205.3077 (2012) - 2011
- [b1]Yaron Singer:
Incentives, Computation, and Networks: Limitations and Possibilities of Algorithmic Mechanism Design. University of California, Berkeley, USA, 2011 - [c11]Yaron Singer, Manas Mittal:
Pricing Tasks in Online Labor Markets. Human Computation 2011 - [c10]Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer:
Posting Prices with Unknown Distributions. ICS 2011: 166-178 - [c9]Shahar Dobzinski, Christos H. Papadimitriou, Yaron Singer:
Mechanisms for complement-free procurement. EC 2011: 273-282 - 2010
- [c8]Yaron Singer:
Budget Feasible Mechanisms. FOCS 2010: 765-774 - [c7]Yuval Shavitt, Yaron Singer:
Limitations and Possibilities of Path Trading between Autonomous Systems. INFOCOM 2010: 1226-1234 - [c6]David Buchfuhrer, Michael Schapira, Yaron Singer:
Computation and incentives in combinatorial public projects. EC 2010: 33-42 - [c5]David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans:
Inapproximability for VCG-Based Combinatorial Auctions. SODA 2010: 518-536 - [i2]Christos H. Papadimitriou, Yaron Singer:
Budget Feasible Mechanisms. CoRR abs/1002.2334 (2010)
2000 – 2009
- 2009
- [i1]Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer:
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension. CoRR abs/0905.1995 (2009) - 2008
- [c4]Christos H. Papadimitriou, Michael Schapira, Yaron Singer:
On the Hardness of Being Truthful. FOCS 2008: 250-259 - [c3]Yuval Shavitt, Yaron Singer:
Trading potatoes in distributed multi-tier routing systems. NetEcon 2008: 67-72 - [c2]Michael Schapira, Yaron Singer:
Inapproximability of Combinatorial Public Projects. WINE 2008: 351-361 - 2007
- [c1]Yuval Shavitt, Yaron Singer:
Beyond Centrality - Classifying Topological Significance Using Backup Efficiency and Alternative Paths. Networking 2007: 774-785
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
