| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pranjal Awasthi, Avrim Blum, Or Sheffet |
Center-based clustering under perturbation stability.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Shai Fine, Yishay Mansour |
Distributed Learning, Communication Complexity and Privacy |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet |
The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Katrina Ligett, Aaron Roth |
A Learning Theory Approach to Non-Interactive Database Privacy |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma |
Welfare and Profit Maximization with Production Costs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Eric Blais, Avrim Blum, Liu Yang |
Active Testing |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Aaron Roth |
Fast Private Data Release Algorithms for Sparse Queries |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma |
Welfare and Profit Maximization with Production Costs. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Eyal Even-Dar, Katrina Ligett |
Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games. |
Theory of Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum |
A discriminative model for semi-supervised learning. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranjal Awasthi, Avrim Blum, Or Sheffet |
Center-based Clustering under Perturbation Stability |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum, Or Sheffet, Santosh Vempala |
On Nash-Equilibria of Approximation-Stable Games. |
SAGT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Yishay Mansour |
Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pranjal Awasthi, Avrim Blum, Or Sheffet |
Improved Guarantees for Agnostic Learning of Disjunctions. |
COLT |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pranjal Awasthi, Avrim Blum, Or Sheffet |
Stability Yields a PTAS for k-Median and k-Means Clustering. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Sayedi, Morteza Zadimoghaddam, Avrim Blum |
Trading off Mistakes and Don't-Know Predictions. |
NIPS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sharath R. Cholleti, Sally A. Goldman, Avrim Blum, David G. Politte, Steven Don, Kirk Smith, Fred Prior |
Veritas: Combining Expert Opinions without Labeled Data. |
International Journal on Artificial Intelligence Tools |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Yishay Mansour |
Improved equilibria via public service advertising. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Anupam Gupta |
Approximate clustering without the approximation. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Yishay Mansour |
The price of uncertainty. |
ACM Conference on Electronic Commerce |
2009 |
DBLP DOI BibTeX RDF |
best response dynamics, social cost, algorithmic game theory |
| 1 | Shobha Venkataraman, Avrim Blum, Dawn Song, Subhabrata Sen, Oliver Spatscheck |
Tracking Dynamic Sources of Malicious Activity at Internet Scale. |
NIPS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Nathan Srebro |
A theory of learning with similarity functions. |
Machine Learning |
2008 |
DBLP DOI BibTeX RDF |
Kernel functions, Similarity functions, Margins |
| 1 | Maria-Florina Balcan, Avrim Blum, Yishay Mansour |
Item pricing for revenue maximization. |
SIGecom Exchanges |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Jason D. Hartline, Yishay Mansour |
Reducing mechanism design to algorithm design via machine learning. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum |
Clustering with Interactive Feedback. |
ALT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sharath R. Cholleti, Sally A. Goldman, Avrim Blum, David G. Politte, Steven Don |
Veritas: Combining Expert Opinions without Labeled Data. |
ICTAI |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Yishay Mansour |
Item pricing for revenue maximization. |
ACM Conference on Electronic Commerce |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, combinatorial auctions |
| 1 | Maria-Florina Balcan, Avrim Blum, Nathan Srebro |
Improved Guarantees for Learning via Similarity Functions. |
COLT |
2008 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Katrina Ligett, Aaron Roth |
A learning theory approach to non-interactive database privacy. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
non-interactive database privacy, learning theory |
| 1 | Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth |
Regret minimization and the price of total anarchy. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
nash equilibria, algorithmic game theory, regret minimization |
| 1 | Maria-Florina Balcan, Avrim Blum, Santosh Vempala |
A discriminative framework for clustering via similarity functions. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
clustering, learning, similarity functions |
| 1 | Shobha Venkataraman, Avrim Blum, Dawn Song |
Limits of Learning-based Signature Generation with Adversaries. |
NDSS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum |
Approximation Algorithms and Online Mechanisms for Item Pricing. |
Theory of Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Yishay Mansour |
From External to Internal Regret. |
Journal of Machine Learning Research |
2007 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Gábor Lugosi, Hans-Ulrich Simon |
Introduction to the special issue on COLT 2006. |
Machine Learning |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum |
Mechanism design, machine learning, and pricing problems. |
SIGecom Exchanges |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff |
Approximation Algorithms for Orienteering and Discounted-Reward TSP. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Chan, MohammadTaghi Hajiaghayi |
A Theory of Loss-Leaders: Making Money by Pricing Below Cost. |
WINE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum |
A Theory of Similarity Functions for Learning and Clustering. |
ALT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David J. Abraham, Avrim Blum, Tuomas Sandholm |
Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. |
ACM Conference on Electronic Commerce |
2007 |
DBLP DOI BibTeX RDF |
kidney, transplant, matching, column generation, exchange, branch-and-price, barter |
| 1 | Avrim Blum, Maria-Florina Balcan |
Open Problems in Efficient Semi-supervised PAC Learning. |
COLT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou |
Separating Populations with Wide Data: A Spectral Analysis. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum |
A Theory of Similarity Functions for Learning and Clustering. |
Discovery Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Santosh Vempala |
Kernels as features: On kernels, margins, and low-dimensional mappings. |
Machine Learning |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Tuomas Sandholm, Martin Zinkevich |
Online algorithms for market clearing. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
online algorithms, Competitive analysis, exchanges, double auctions |
| 1 | Avrim Blum, Eyal Even-Dar, Katrina Ligett |
Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. |
PODC |
2006 |
DBLP DOI BibTeX RDF |
game theory, network games |
| 1 | Maria-Florina Balcan, Avrim Blum |
On a theory of learning with similarity functions. |
ICML |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum |
Approximation algorithms and online mechanisms for item pricing. |
ACM Conference on Electronic Commerce |
2006 |
DBLP DOI BibTeX RDF |
single minded, unlimited supply, approximation algorithms, combinatorial auctions, online optimization |
| 1 | Yossi Azar, Avrim Blum, David P. Bunde, Yishay Mansour |
Combining Online Algorithms for Acceptance and Rejection. |
Theory of Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum |
Random Projection, Margins, Kernels, and Feature-Selection. |
SLSFS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Jason D. Hartline |
Near-optimal online auctions. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Yishay Mansour |
From External to Internal Regret. |
COLT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum |
A PAC-Style Model for Learning from Labeled and Unlabeled Data. |
COLT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Jason D. Hartline, Yishay Mansour |
Mechanism Design via Machine Learning. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Cynthia Dwork, Frank McSherry, Kobbi Nissim |
Practical privacy: the SuLQ framework. |
PODS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shobha Venkataraman, Dawn Xiaodong Song, Phillip B. Gibbons, Avrim Blum |
New Streaming Algorithms for Fast Detection of Superspreaders. |
NDSS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu |
Online learning in online auctions. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich |
Preference Elicitation and Query Learning. |
Journal of Machine Learning Research |
2004 |
DBLP BibTeX RDF |
|
| 1 | Nikhil Bansal, Avrim Blum, Shuchi Chawla |
Correlation Clustering. |
Machine Learning |
2004 |
DBLP DOI BibTeX RDF |
clustering, approximation algorithm, document classification |
| 1 | Avrim Blum, John D. Lafferty, Mugizi Robert Rwebangira, Rajashekar Reddy |
Semi-supervised learning using randomized mincuts. |
ICML |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Santosh Vempala |
On Kernels, Margins, and Low-Dimensional Mappings. |
ALT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Dawn Xiaodong Song, Shobha Venkataraman |
Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds. |
RAID |
2004 |
DBLP DOI BibTeX RDF |
Random walks, Network intrusion detection, Stepping stones, Evasion, Interactive sessions |
| 1 | H. Brendan McMahan, Avrim Blum |
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary. |
COLT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson |
Approximation algorithms for deadline-TSP and vehicle routing with time-windows. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, traveling salesman problem, orienteering, vehicle routing |
| 1 | Maria-Florina Balcan, Avrim Blum, Ke Yang |
Co-Training and Expansion: Towards Bridging Theory and Practice. |
NIPS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Ke Yang |
On Statistical Query Sampling and NMR Quantum Computing |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Shuchi Chawla, Adam Kalai |
Static Optimality and Dynamic Search-Optimality in Lists and Trees. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Adaptive data structures, Experts Analysis, Competitive Analysis, Binary search trees |
| 1 | John Langford, Avrim Blum |
Microchoice Bounds and Self Bounding Learning Algorithms. |
Machine Learning |
2003 |
DBLP DOI BibTeX RDF |
Occam's razor, self-bounding algorithms, PAC bounds, sample complexity |
| 1 | Avrim Blum, Adam Kalai, Hal Wasserman |
Noise-tolerant learning, the parity problem, and the statistical query model. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
machine learning, Computational learning theory, statistical queries |
| 1 | Avrim Blum, Adam Tauman Kalai, Jon M. Kleinberg |
Admission Control to Minimize Rejections. |
Internet Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere |
Scheduling for Flow-Time with Admission Control. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu |
Online learning in online auctions. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson |
Online oblivious routing. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
networks, online algorithms, competitive analysis, congestion, gradient descent, oblivious routing |
| 1 | Yossi Azar, Avrim Blum, Yishay Mansour |
Combining online algorithms for rejection and acceptance. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
QoS, admission control, competitive, on-line |
| 1 | H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum |
Planning in the Presence of Cost Functions Controlled by an Adversary. |
ICML |
2003 |
DBLP BibTeX RDF |
|
| 1 | Martin Zinkevich, Avrim Blum, Tuomas Sandholm |
On polynomial-time preference elicitation with value queries. |
ACM Conference on Electronic Commerce |
2003 |
DBLP DOI BibTeX RDF |
learning, combinatorial auctions, preference elicitation |
| 1 | Avrim Blum, John Langford |
PAC-MDL Bounds. |
COLT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich |
Preference Elicitation and Query Learning. |
COLT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum |
Learning a Function of r Relevant Variables. |
COLT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff |
Approximation Algorithms for Orienteering and Discounted-Reward TSP. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum |
Machine Learning: My Favorite Results, Directions, and Open Problems. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Yang, Avrim Blum |
On Statistical Query Sampling and NMR Quantum Computing. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Tuomas Sandholm, Martin Zinkevich |
Online algorithms for market clearing. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, John Dunagan |
Smoothed analysis of the perceptron algorithm for linear programming. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Shuchi Chawla, Adam Kalai |
Static optimality and dynamic search-optimality in lists and trees. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Avrim Blum, Shuchi Chawla |
Correlation Clustering. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Adam Kalai, Jon M. Kleinberg |
Admission Control to Minimize Rejections. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Shuchi Chawla |
Learning from Labeled and Unlabeled Data using Graph Mincuts. |
ICML |
2001 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Carl Burch |
On-line Learning and the Metrical Task System Problem. |
Machine Learning |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Adam Kalai, Hal Wasserman |
Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks |
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Prasad Chalasani |
An Online Algorithm for Improving Performance in Navigation. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph O'Sullivan, John Langford, Rich Caruana, Avrim Blum |
FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness. |
ICML |
2000 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Adam Kalai, Hal Wasserman |
Noise-tolerant learning, the parity problem, and the statistical query model. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Adam Kalai |
Universal Portfolios With and Without Transaction Costs. |
Machine Learning |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, R. Ravi, Santosh Vempala |
A Constant-Factor Approximation Algorithm for the k-MST Problem. |
J. Comput. Syst. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, John Langford |
Probabilistic Planning in the Graphplan Framework. |
ECP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Adam Kalai, John Langford |
Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation. |
COLT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | John Langford, Avrim Blum |
Microchoice Bounds and Self Bounding Learning Algorithms. |
COLT |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")