Avrim Blum

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2013
161Differentially private data analysis of social networks via restricted sensitivity. Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet. ITCS 2013, 87-96. Web SearchBibTeXDownload
160Learnability of DNF with representation-specific queries. Liu Yang, Avrim Blum, Jaime G. Carbonell. ITCS 2013, 37-46. Web SearchBibTeXDownload
159Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior. Maria-Florina Balcan, Avrim Blum, Yishay Mansour. SIAM J. Comput. (42): 230-264 (2013). Web SearchBibTeXDownload
2012
158The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy. Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet. CoRR (abs/1204.2136) (2012). Web SearchBibTeXDownload
157Distributed Learning, Communication Complexity and Privacy. Maria-Florina Balcan, Avrim Blum, Shai Fine, Yishay Mansour. CoRR (abs/1204.3514) (2012). Web SearchBibTeXDownload
156Differentially Private Data Analysis of Social Networks via Restricted Sensitivity. Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet. CoRR (abs/1208.4586) (2012). Web SearchBibTeXDownload
155Additive Approximation for Near-Perfect Phylogeny Construction. Pranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or Sheffet. CoRR (abs/1206.3334) (2012). Web SearchBibTeXDownload
154Active Property Testing. Maria-Florina Balcan, Eric Blais, Avrim Blum, Liu Yang. FOCS 2012, 21-30. Web SearchBibTeXDownload
153Center-based clustering under perturbation stability. Pranjal Awasthi, Avrim Blum, Or Sheffet. Inf. Process. Lett. (112): 49-54 (2012). Web SearchBibTeXDownload
2011
152Active Testing. Maria-Florina Balcan, Eric Blais, Avrim Blum, Liu Yang. CoRR (abs/1111.0897) (2011). Web SearchBibTeXDownload
151Welfare and Profit Maximization with Production Costs. Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma. CoRR (abs/1110.4992) (2011). Web SearchBibTeXDownload
150Fast Private Data Release Algorithms for Sparse Queries. Avrim Blum, Aaron Roth. CoRR (abs/1111.6842) (2011). Web SearchBibTeXDownload
149A Learning Theory Approach to Non-Interactive Database Privacy. Avrim Blum, Katrina Ligett, Aaron Roth. CoRR (abs/1109.2229) (2011). Web SearchBibTeXDownload
2010
148Improved Guarantees for Agnostic Learning of Disjunctions. Pranjal Awasthi, Avrim Blum, Or Sheffet. COLT 2010, 359-367. Web SearchBibTeXDownload
147Center-based Clustering under Perturbation Stability. Pranjal Awasthi, Avrim Blum, Or Sheffet. CoRR (abs/1009.3594) (2010). Web SearchBibTeXDownload
146Stability Yields a PTAS for k-Median and k-Means Clustering. Pranjal Awasthi, Avrim Blum, Or Sheffet. FOCS 2010, 309-318. Web SearchBibTeXDownload
145Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior. Maria-Florina Balcan, Avrim Blum, Yishay Mansour. ICS 2010, 200-213. Web SearchBibTeXDownload
144A discriminative model for semi-supervised learning. Maria-Florina Balcan, Avrim Blum. J. ACM (57) (2010). Web SearchBibTeXDownload
143Trading off Mistakes and Don't-Know Predictions. Amin Sayedi, Morteza Zadimoghaddam, Avrim Blum. NIPS 2010, 2092-2100. Web SearchBibTeXDownload
142On Nash-Equilibria of Approximation-Stable Games. Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum, Or Sheffet, Santosh Vempala. SAGT 2010, 78-89. Web SearchBibTeXDownload
141Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games. Avrim Blum, Eyal Even-Dar, Katrina Ligett. Theory of Computing (6): 179-199 (2010). Web SearchBibTeXDownload
2009
140The price of uncertainty. Maria-Florina Balcan, Avrim Blum, Yishay Mansour. ACM Conference on Electronic Commerce 2009, 285-294. Web SearchBibTeXDownload
139Veritas: Combining Expert Opinions without Labeled Data. Sharath R. Cholleti, Sally A. Goldman, Avrim Blum, David G. Politte, Steven Don, Kirk Smith, Fred Prior. International Journal on Artificial Intelligence Tools (18): 633-651 (2009). Web SearchBibTeXDownload
138Tracking Dynamic Sources of Malicious Activity at Internet Scale. Shobha Venkataraman, Avrim Blum, Dawn Song, Subhabrata Sen, Oliver Spatscheck. NIPS 2009, 1946-1954. Web SearchBibTeXDownload
137Improved equilibria via public service advertising. Maria-Florina Balcan, Avrim Blum, Yishay Mansour. SODA 2009, 728-737. Web SearchBibTeXDownload
136Approximate clustering without the approximation. Maria-Florina Balcan, Avrim Blum, Anupam Gupta. SODA 2009, 1068-1077. Web SearchBibTeXDownload
2008
135Item pricing for revenue maximization. Maria-Florina Balcan, Avrim Blum, Yishay Mansour. ACM Conference on Electronic Commerce 2008, 50-59. Web SearchBibTeXDownload
134Clustering with Interactive Feedback. Maria-Florina Balcan, Avrim Blum. ALT 2008, 316-328. Web SearchBibTeXDownload
133Improved Guarantees for Learning via Similarity Functions. Maria-Florina Balcan, Avrim Blum, Nathan Srebro. COLT 2008, 287-298. Web SearchBibTeXDownload
132Veritas: Combining Expert Opinions without Labeled Data. Sharath R. Cholleti, Sally A. Goldman, Avrim Blum, David G. Politte, Steven Don, Kirk Smith, Fred Prior. ICTAI (1) 2008, 45-52. Web SearchBibTeXDownload
131Reducing mechanism design to algorithm design via machine learning. Maria-Florina Balcan, Avrim Blum, Jason D. Hartline, Yishay Mansour. J. Comput. Syst. Sci. (74): 1245-1270 (2008). Web SearchBibTeXDownload
130A theory of learning with similarity functions. Maria-Florina Balcan, Avrim Blum, Nathan Srebro. Machine Learning (72): 89-112 (2008). Web SearchBibTeXDownload
129Limits of Learning-based Signature Generation with Adversaries. Shobha Venkataraman, Avrim Blum, Dawn Song. NDSS 2008. Web SearchBibTeXDownload
128Regret minimization and the price of total anarchy. Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth. STOC 2008, 373-382. Web SearchBibTeXDownload
127A learning theory approach to non-interactive database privacy. Avrim Blum, Katrina Ligett, Aaron Roth. STOC 2008, 609-618. Web SearchBibTeXDownload
126A discriminative framework for clustering via similarity functions. Maria-Florina Balcan, Avrim Blum, Santosh Vempala. STOC 2008, 671-680. Web SearchBibTeXDownload
2007
125Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. David J. Abraham, Avrim Blum, Tuomas Sandholm. ACM Conference on Electronic Commerce 2007, 295-304. Web SearchBibTeXDownload
124A Theory of Similarity Functions for Learning and Clustering. Avrim Blum. ALT 2007, 9. Web SearchBibTeXDownload
123Open Problems in Efficient Semi-supervised PAC Learning. Avrim Blum, Maria-Florina Balcan. COLT 2007, 622-624. Web SearchBibTeXDownload
122Separating Populations with Wide Data: A Spectral Analysis. Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou. ISAAC 2007, 439-451. Web SearchBibTeXDownload
121From External to Internal Regret. Avrim Blum, Yishay Mansour. Journal of Machine Learning Research (8): 1307-1324 (2007). Web SearchBibTeXDownload
120Introduction to the special issue on COLT 2006. Avrim Blum, Gábor Lugosi, Hans-Ulrich Simon. Machine Learning (69): 75-77 (2007). Web SearchBibTeXDownload
119Approximation Algorithms for Orienteering and Discounted-Reward TSP. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff. SIAM J. Comput. (37): 653-670 (2007). Web SearchBibTeXDownload
118Mechanism design, machine learning, and pricing problems. Maria-Florina Balcan, Avrim Blum. SIGecom Exchanges (7): 34-36 (2007). Web SearchBibTeXDownload
117Approximation Algorithms and Online Mechanisms for Item Pricing. Maria-Florina Balcan, Avrim Blum. Theory of Computing (3): 179-195 (2007). Web SearchBibTeXDownload
116A Theory of Loss-Leaders: Making Money by Pricing Below Cost. Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Chan, MohammadTaghi Hajiaghayi. WINE 2007, 293-299. Web SearchBibTeXDownload
2006
115Approximation algorithms and online mechanisms for item pricing. Maria-Florina Balcan, Avrim Blum. ACM Conference on Electronic Commerce 2006, 29-35. Web SearchBibTeXDownload
114On a theory of learning with similarity functions. Maria-Florina Balcan, Avrim Blum. ICML 2006, 73-80. Web SearchBibTeXDownload
113Online algorithms for market clearing. Avrim Blum, Tuomas Sandholm, Martin Zinkevich. J. ACM (53): 845-879 (2006). Web SearchBibTeXDownload
112Kernels as features: On kernels, margins, and low-dimensional mappings. Maria-Florina Balcan, Avrim Blum, Santosh Vempala. Machine Learning (65): 79-94 (2006). Web SearchBibTeXDownload
111Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. Avrim Blum, Eyal Even-Dar, Katrina Ligett. PODC 2006, 45-52. Web SearchBibTeXDownload
2005
110From External to Internal Regret. Avrim Blum, Yishay Mansour. COLT 2005, 621-636. Web SearchBibTeXDownload
109A PAC-Style Model for Learning from Labeled and Unlabeled Data. Maria-Florina Balcan, Avrim Blum. COLT 2005, 111-126. Web SearchBibTeXDownload
108Mechanism Design via Machine Learning. Maria-Florina Balcan, Avrim Blum, Jason D. Hartline, Yishay Mansour. FOCS 2005, 605-614. Web SearchBibTeXDownload
107New Streaming Algorithms for Fast Detection of Superspreaders. Shobha Venkataraman, Dawn Xiaodong Song, Phillip B. Gibbons, Avrim Blum. NDSS 2005. Web SearchBibTeXDownload
106Practical privacy: the SuLQ framework. Avrim Blum, Cynthia Dwork, Frank McSherry, Kobbi Nissim. PODS 2005, 128-138. Web SearchBibTeXDownload
105Random Projection, Margins, Kernels, and Feature-Selection. Avrim Blum. SLSFS 2005, 52-68. Web SearchBibTeXDownload
104Near-optimal online auctions. Avrim Blum, Jason D. Hartline. SODA 2005, 1156-1163. Web SearchBibTeXDownload
103Combining Online Algorithms for Acceptance and Rejection. Yossi Azar, Avrim Blum, David P. Bunde, Yishay Mansour. Theory of Computing (1): 105-117 (2005). Web SearchBibTeXDownload
2004
102On Kernels, Margins, and Low-Dimensional Mappings. Maria-Florina Balcan, Avrim Blum, Santosh Vempala. ALT 2004, 194-205. Web SearchBibTeXDownload
101Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary. H. Brendan McMahan, Avrim Blum. COLT 2004, 109-123. Web SearchBibTeXDownload
100Semi-supervised learning using randomized mincuts. Avrim Blum, John D. Lafferty, Mugizi Robert Rwebangira, Rajashekar Reddy. ICML 2004. Web SearchBibTeXDownload
99Preference Elicitation and Query Learning. Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich. Journal of Machine Learning Research (5): 649-667 (2004). Web SearchBibTeXDownload
98Correlation Clustering. Nikhil Bansal, Avrim Blum, Shuchi Chawla. Machine Learning (56): 89-113 (2004). Web SearchBibTeXDownload
97Co-Training and Expansion: Towards Bridging Theory and Practice. Maria-Florina Balcan, Avrim Blum, Ke Yang. NIPS 2004. Web SearchBibTeXDownload
96Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds. Avrim Blum, Dawn Xiaodong Song, Shobha Venkataraman. RAID 2004, 258-277. Web SearchBibTeXDownload
95Approximation algorithms for deadline-TSP and vehicle routing with time-windows. Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson. STOC 2004, 166-174. Web SearchBibTeXDownload
94Online learning in online auctions. Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu. Theor. Comput. Sci. (324): 137-146 (2004). Cited by 63Web SearchBibTeXDownload
2003
93On polynomial-time preference elicitation with value queries. Martin Zinkevich, Avrim Blum, Tuomas Sandholm. ACM Conference on Electronic Commerce 2003, 176-185. Web SearchBibTeXDownload
92Static Optimality and Dynamic Search-Optimality in Lists and Trees. Avrim Blum, Shuchi Chawla, Adam Kalai. Algorithmica (36): 249-260 (2003). Web SearchBibTeXDownload
91Learning a Function of r Relevant Variables. Avrim Blum. COLT 2003, 731-733. Web SearchBibTeXDownload
90Preference Elicitation and Query Learning. Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich. COLT 2003, 13-25. Web SearchBibTeXDownload
89PAC-MDL Bounds. Avrim Blum, John Langford. COLT 2003, 344-357. Web SearchBibTeXDownload
88Scheduling for Flow-Time with Admission Control. Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere. ESA 2003, 43-54. Web SearchBibTeXDownload
87Approximation Algorithms for Orienteering and Discounted-Reward TSP. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff. FOCS 2003, 46-55. Web SearchBibTeXDownload
86Machine Learning: My Favorite Results, Directions, and Open Problems. Avrim Blum. FOCS 2003, 2. Web SearchBibTeXDownload
85Planning in the Presence of Cost Functions Controlled by an Adversary. H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum. ICML 2003, 536-543. Web SearchBibTeXDownload
84On Statistical Query Sampling and NMR Quantum Computing. Avrim Blum, Ke Yang. IEEE Conference on Computational Complexity (10): 194 (2003). Web SearchBibTeXDownload
83Admission Control to Minimize Rejections. Avrim Blum, Adam Kalai, Jon M. Kleinberg. Internet Mathematics (1): 165-176 (2003). Web SearchBibTeXDownload
82Noise-tolerant learning, the parity problem, and the statistical query model. Avrim Blum, Adam Kalai, Hal Wasserman. J. ACM (50): 506-519 (2003). Web SearchBibTeXDownload
81Microchoice Bounds and Self Bounding Learning Algorithms. John Langford, Avrim Blum. Machine Learning (51): 165-179 (2003). Web SearchBibTeXDownload
80Online learning in online auctions. Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu. SODA 2003, 202-204. Cited by 63Web SearchBibTeXDownload
79Combining online algorithms for rejection and acceptance. Yossi Azar, Avrim Blum, Yishay Mansour. SPAA 2003, 159-163. Web SearchBibTeXDownload
78Online oblivious routing. Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson. SPAA 2003, 44-49. Web SearchBibTeXDownload
2002
77Correlation Clustering. Nikhil Bansal, Avrim Blum, Shuchi Chawla. FOCS 2002, 238. Web SearchBibTeXDownload
76Static optimality and dynamic search-optimality in lists and trees. Avrim Blum, Shuchi Chawla, Adam Kalai. SODA 2002, 1-8. Web SearchBibTeXDownload
75Smoothed analysis of the perceptron algorithm for linear programming. Avrim Blum, John Dunagan. SODA 2002, 905-914. Web SearchBibTeXDownload
74Online algorithms for market clearing. Avrim Blum, Tuomas Sandholm, Martin Zinkevich. SODA 2002, 971-980. Web SearchBibTeXDownload
2001
73Learning from Labeled and Unlabeled Data using Graph Mincuts. Avrim Blum, Shuchi Chawla. ICML 2001, 19-26. Web SearchBibTeX
72Admission Control to Minimize Rejections. Avrim Blum, Adam Kalai, Jon M. Kleinberg. WADS 2001, 155-164. Web SearchBibTeXDownload
2000
71Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model. Avrim Blum, Adam Kalai, Hal Wasserman. CoRR (cs.LG/0010022) (2000). Web SearchBibTeXDownload
70FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness. Joseph O'Sullivan, John Langford, Rich Caruana, Avrim Blum. ICML 2000, 703-710. Web SearchBibTeX
69On-line Learning and the Metrical Task System Problem. Avrim Blum, Carl Burch. Machine Learning (39): 35-58 (2000). Web SearchBibTeXDownload
68An Online Algorithm for Improving Performance in Navigation. Avrim Blum, Prasad Chalasani. SIAM J. Comput. (29): 1907-1938 (2000). Web SearchBibTeXDownload
67A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks. SIAM J. Comput. (30): 1624-1661 (2000). Web SearchBibTeXDownload
66Noise-tolerant learning, the parity problem, and the statistical query model. Avrim Blum, Adam Kalai, Hal Wasserman. STOC 2000, 435-440. Web SearchBibTeXDownload
65Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala. Theor. Comput. Sci. (235): 25-42 (2000). Web SearchBibTeXDownload
1999
64Microchoice Bounds and Self Bounding Learning Algorithms. John Langford, Avrim Blum. COLT 1999, 209-214. Web SearchBibTeXDownload
63Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation. Avrim Blum, Adam Kalai, John Langford. COLT 1999, 203-208. Web SearchBibTeXDownload
62Probabilistic Planning in the Graphplan Framework. Avrim Blum, John Langford. ECP 1999, 319-332. Web SearchBibTeXDownload
61Finely-Competitive Paging. Avrim Blum, Carl Burch, Adam Kalai. FOCS 1999, 450-458. Web SearchBibTeXDownload
60A Constant-Factor Approximation Algorithm for the k-MST Problem. Avrim Blum, R. Ravi, Santosh Vempala. J. Comput. Syst. Sci. (58): 101-108 (1999). Web SearchBibTeXDownload
59Universal Portfolios With and Without Transaction Costs. Avrim Blum, Adam Kalai. Machine Learning (35): 193-205 (1999). Web SearchBibTeXDownload
1998
58A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala. Algorithmica (22): 35-52 (1998). Web SearchBibTeXDownload
57Combining Labeled and Unlabeled Sata with Co-Training. Avrim Blum, Tom M. Mitchell. COLT 1998, 92-100. Web SearchBibTeXDownload
56On Learning Monotone Boolean Functions. Avrim Blum, Carl Burch, John Langford. FOCS 1998, 408-415. Web SearchBibTeXDownload
55Learning with Unreliable Boundary Queries. Avrim Blum, Prasad Chalasani, Sally A. Goldman, Donna K. Slonim. J. Comput. Syst. Sci. (56): 209-222 (1998). Web SearchBibTeXDownload
54A Note on Learning from Multiple-Instance Examples. Avrim Blum, Adam Kalai. Machine Learning (30): 23-29 (1998). Web SearchBibTeXDownload
53New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala. SIAM J. Comput. (28): 254-262 (1998). Web SearchBibTeXDownload
52A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane. Joseph S. B. Mitchell, Avrim Blum, Prasad Chalasani, Santosh Vempala. SIAM J. Comput. (28): 771-781 (1998). Web SearchBibTeXDownload
51On Learning Read-k-Satisfy-j DNF. Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth, Dan Roth. SIAM J. Comput. (27): 1515-1530 (1998). Web SearchBibTeXDownload
50On a theory of computing symposia. Avrim Blum, Prabhakar Raghavan. SIGACT News (29): 104-111 (1998). Web SearchBibTeXDownload
49Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala. STOC 1998, 100-105. Web SearchBibTeXDownload
1997
48Selection of Relevant Features and Examples in Machine Learning. Avrim Blum, Pat Langley. Artif. Intell. (97): 245-271 (1997). Web SearchBibTeXDownload
47Fast Planning Through Planning Graph Analysis. Avrim Blum, Merrick L. Furst. Artif. Intell. (90): 281-300 (1997). Web SearchBibTeXDownload
46On-line Learning and the Metrical Task System Problem. Avrim Blum, Carl Burch. COLT 1997, 45-53. Web SearchBibTeXDownload
45Universal Portfolios With and Without Transaction Costs. Avrim Blum, Adam Kalai. COLT 1997, 309-313. Web SearchBibTeXDownload
44An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs. Avrim Blum, David R. Karger. Inf. Process. Lett. (61): 49-53 (1997). Web SearchBibTeXDownload
43Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution. Avrim Blum, Ravindran Kannan. J. Comput. Syst. Sci. (54): 371-380 (1997). Web SearchBibTeXDownload
42Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain. Avrim Blum. Machine Learning (26): 5-23 (1997). Web SearchBibTeXDownload
41Navigating in Unfamiliar Geometric Terrain. Avrim Blum, Prabhakar Raghavan, Baruch Schieber. SIAM J. Comput. (26): 110-137 (1997). Cited by 182Web SearchBibTeXDownload
40A polylog(n)-Competitive Algorithm for Metrical Task Systems. Yair Bartal, Avrim Blum, Carl Burch, Andrew Tomkins. STOC 1997, 711-719. Cited by 70Web SearchBibTeXDownload
1996
39A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala. FOCS 1996, 330-338. Web SearchBibTeXDownload
38On-line Algorithms in Machine Learning. Avrim Blum. Online Algorithms 1996, 306-325. Web SearchBibTeXDownload
37Randomized Robot Navigation Algorithms. Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks. SODA 1996, 75-84. Web SearchBibTeXDownload
36A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract). Avrim Blum, R. Ravi, Santosh Vempala. STOC 1996, 442-448. Web SearchBibTeXDownload
1995
35Learning with Unreliable Boundary Queries. Avrim Blum, Prasad Chalasani, Sally A. Goldman, Donna K. Slonim. COLT 1995, 98-107. Web SearchBibTeXDownload
34Empirical Support for Winnow and Weighted-Majority Based Algorithms: Results on a Calendar Scheduling Domain. Avrim Blum. ICML 1995, 64-72. Web SearchBibTeX
33Fast Planning Through Planning Graph Analysis. Avrim Blum, Merrick L. Furst. IJCAI 1995, 1636-1642. Web SearchBibTeX
32Coloring Random and Semi-Random k-Colorable Graphs. Avrim Blum, Joel Spencer. J. Algorithms (19): 204-234 (1995). Web SearchBibTeXDownload
31Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. Avrim Blum, Lisa Hellerstein, Nick Littlestone. J. Comput. Syst. Sci. (50): 32-40 (1995). Web SearchBibTeXDownload
30Fast Learning of k-Term DNF Formulas with Queries. Avrim Blum, Steven Rudich. J. Comput. Syst. Sci. (51): 367-373 (1995). Web SearchBibTeXDownload
29A constant-factor approximation for the k-MST problem in the plane. Avrim Blum, Prasad Chalasani, Santosh Vempala. STOC 1995, 294-302. Web SearchBibTeXDownload
28Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala. STOC 1995, 277-283. Web SearchBibTeXDownload
1994
27On Learning Read-k-Satisfy-j DNF. Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth, Dan Roth. COLT 1994, 110-117. Web SearchBibTeXDownload
26New Approximation Algorithms for Graph Coloring. Avrim Blum. J. ACM (41): 470-516 (1994). Web SearchBibTeXDownload
25Linear Approximation of Shortest Superstrings. Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis. J. ACM (41): 630-647 (1994). Web SearchBibTeXDownload
24Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain. Avrim Blum. SIAM J. Comput. (23): 990-1000 (1994). Web SearchBibTeXDownload
23Weakly learning DNF and characterizing statistical query learning using Fourier analysis. Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich. STOC 1994, 253-262. Web SearchBibTeXDownload
22The minimum latency problem. Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan. STOC 1994, 163-171. Cited by 141Web SearchBibTeXDownload
1993
21On Learning Embedded Symmetric Concepts. Avrim Blum, Prasad Chalasani, Jeffrey C. Jackson. COLT 1993, 337-346. Web SearchBibTeXDownload
20Cryptographic Primitives Based on Hard Learning Problems. Avrim Blum, Merrick L. Furst, Michael J. Kearns, Richard J. Lipton. CRYPTO 1993, 278-291. Web SearchBibTeXDownload
19An On-Line Algorithm for Improving Performance in Navigation. Avrim Blum, Prasad Chalasani. FOCS 1993, 2-11. Web SearchBibTeXDownload
18Learning an Intersection of k Halfspaces over a Uniform Distribution. Avrim Blum, Ravi Kannan. FOCS 1993, 312-320. Web SearchBibTeXDownload
17Training a 3-Node Neural Network is NP-Complete. Avrim Blum, Ronald L. Rivest. Machine Learning: From Theory to Applications 1993, 9-28. Web SearchBibTeXDownload
1992
16Learning Switching Concepts. Avrim Blum, Prasad Chalasani. COLT 1992, 231-242. Web SearchBibTeXDownload
15A Decomposition Theorem and Bounds for Randomized Server Problems. Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks. FOCS 1992, 197-207. Web SearchBibTeXDownload
14Rank-r Decision Trees are a Subclass of r-Decision Lists. Avrim Blum. Inf. Process. Lett. (42): 183-185 (1992). Web SearchBibTeXDownload
13Learning Boolean Functions in an Infinite Attribute Space. Avrim Blum. Machine Learning (9): 373-386 (1992). Web SearchBibTeXDownload
12Training a 3-node neural network is NP-complete. Avrim Blum, Ronald L. Rivest. Neural Networks (5): 117-127 (1992). Web SearchBibTeXDownload
11Fast Learning of k-Term DNF Formulas with Queries. Avrim Blum, Steven Rudich. STOC 1992, 382-389. Web SearchBibTeXDownload
1991
10Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. Avrim Blum, Lisa Hellerstein, Nick Littlestone. COLT 1991, 157-166. Web SearchBibTeXDownload
9Navigating in Unfamiliar Geometric Terrain (Preliminary Version). Avrim Blum, Prabhakar Raghavan, Baruch Schieber. STOC 1991, 494-504. Web SearchBibTeXDownload
8Linear Approximation of Shortest Superstrings. Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis. STOC 1991, 328-336. Web SearchBibTeXDownload
1990
7Separating PAC and Mistake-Bound Learning Models Over the Boolean Domain (Abstract). Avrim Blum. COLT 1990, 393. Web SearchBibTeXDownload
6Learning Functions of k Terms. Avrim Blum, Mona Singh. COLT 1990, 144-153. Web SearchBibTeXDownload
5Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain. Avrim Blum. FOCS 1990, 211-218. Web SearchBibTeXDownload
4Some Tools for Approximate 3-Coloring (Extended Abstract). Avrim Blum. FOCS 1990, 554-562. Web SearchBibTeXDownload
3Learning Boolean Functions in an Infinite Atribute Space (Extended Abstract). Avrim Blum. STOC 1990, 64-72. Web SearchBibTeXDownload
1989
2An \\tildeO(n^0.4)-Approximation Algorithm for 3-Coloring (and Improved Approximation Algorithm for k-Coloring). Avrim Blum. STOC 1989, 535-542. Web SearchBibTeXDownload
1988
1Training a 3-Node Neural Network is NP-Complete. Avrim Blum, Ronald L. Rivest. NIPS 1988, 494-501. Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ Department of Computer Science | University of Pittsburgh - Retrieved 2013-05-12 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research