Search the dblp DataBase
Avrim Blum :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Avrim Blum , Joel Spencer Coloring Random and Semi-Random k-Colorable Graphs. [Citation Graph (2, 0)][DBLP ] J. Algorithms, 1995, v:19, n:2, pp:204-234 [Journal ] Avrim Blum , Merrick L. Furst Fast Planning Through Planning Graph Analysis. [Citation Graph (1, 0)][DBLP ] Artif. Intell., 1997, v:90, n:1-2, pp:281-300 [Journal ] Maria-Florina Balcan , Avrim Blum , Santosh Vempala On Kernels, Margins, and Low-Dimensional Mappings. [Citation Graph (0, 0)][DBLP ] ALT, 2004, pp:194-205 [Conf ] Ke Yang , Avrim Blum On Statistical Query Sampling and NMR Quantum Computing. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2003, pp:194-0 [Conf ] Avrim Blum Learning a Function of r Relevant Variables. [Citation Graph (0, 0)][DBLP ] COLT, 2003, pp:731-733 [Conf ] Avrim Blum Separating PAC and Mistake-Bound Learning Models Over the Boolean Domain (Abstract). [Citation Graph (0, 0)][DBLP ] COLT, 1990, pp:393- [Conf ] Avrim Blum , Carl Burch On-line Learning and the Metrical Task System Problem. [Citation Graph (0, 0)][DBLP ] COLT, 1997, pp:45-53 [Conf ] Avrim Blum , Prasad Chalasani Learning Switching Concepts. [Citation Graph (0, 0)][DBLP ] COLT, 1992, pp:231-242 [Conf ] Avrim Blum , Prasad Chalasani , Sally A. Goldman , Donna K. Slonim Learning with Unreliable Boundary Queries. [Citation Graph (0, 0)][DBLP ] COLT, 1995, pp:98-107 [Conf ] Avrim Blum , Prasad Chalasani , Jeffrey Jackson On Learning Embedded Symmetric Concepts. [Citation Graph (0, 0)][DBLP ] COLT, 1993, pp:337-346 [Conf ] Avrim Blum , Lisa Hellerstein , Nick Littlestone Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. [Citation Graph (0, 0)][DBLP ] COLT, 1991, pp:157-166 [Conf ] Maria-Florina Balcan , Avrim Blum A PAC-Style Model for Learning from Labeled and Unlabeled Data. [Citation Graph (0, 0)][DBLP ] COLT, 2005, pp:111-126 [Conf ] Avrim Blum , Jeffrey C. Jackson , Tuomas Sandholm , Martin Zinkevich Preference Elicitation and Query Learning. [Citation Graph (0, 0)][DBLP ] COLT, 2003, pp:13-25 [Conf ] Avrim Blum , Adam Kalai Universal Portfolios With and Without Transaction Costs. [Citation Graph (0, 0)][DBLP ] COLT, 1997, pp:309-313 [Conf ] Avrim Blum , Roni Khardon , Eyal Kushilevitz , Leonard Pitt , Dan Roth On Learning Read-k -Satisfy-j DNF. [Citation Graph (0, 0)][DBLP ] COLT, 1994, pp:110-117 [Conf ] Avrim Blum , Adam Kalai , John Langford Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation. [Citation Graph (0, 0)][DBLP ] COLT, 1999, pp:203-208 [Conf ] Avrim Blum , John Langford PAC-MDL Bounds. [Citation Graph (0, 0)][DBLP ] COLT, 2003, pp:344-357 [Conf ] Avrim Blum , Yishay Mansour From External to Internal Regret. [Citation Graph (0, 0)][DBLP ] COLT, 2005, pp:621-636 [Conf ] Avrim Blum , Tom M. Mitchell Combining Labeled and Unlabeled Sata with Co-Training. [Citation Graph (0, 0)][DBLP ] COLT, 1998, pp:92-100 [Conf ] Avrim Blum , Ronald L. Rivest Training a 3-Node Neural Network is NP-Complete. [Citation Graph (0, 0)][DBLP ] COLT, 1988, pp:9-18 [Conf ] Avrim Blum , Mona Singh Learning Functions of k Terms. [Citation Graph (0, 0)][DBLP ] COLT, 1990, pp:144-153 [Conf ] John Langford , Avrim Blum Microchoice Bounds and Self Bounding Learning Algorithms. [Citation Graph (0, 0)][DBLP ] COLT, 1999, pp:209-214 [Conf ] H. Brendan McMahan , Avrim Blum Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary. [Citation Graph (0, 0)][DBLP ] COLT, 2004, pp:109-123 [Conf ] Avrim Blum , Merrick L. Furst , Michael J. Kearns , Richard J. Lipton Cryptographic Primitives Based on Hard Learning Problems. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1993, pp:278-291 [Conf ] Avrim Blum On-line Algorithms in Machine Learning. [Citation Graph (0, 0)][DBLP ] Online Algorithms, 1996, pp:306-325 [Conf ] Avrim Blum , John Langford Probabilistic Planning in the Graphplan Framework. [Citation Graph (0, 0)][DBLP ] ECP, 1999, pp:319-332 [Conf ] Nikhil Bansal , Avrim Blum , Shuchi Chawla , Kedar Dhamdhere Scheduling for Flow-Time with Admission Control. [Citation Graph (0, 0)][DBLP ] ESA, 2003, pp:43-54 [Conf ] Maria-Florina Balcan , Avrim Blum , Jason D. Hartline , Yishay Mansour Mechanism Design via Machine Learning. [Citation Graph (0, 0)][DBLP ] FOCS, 2005, pp:605-614 [Conf ] Nikhil Bansal , Avrim Blum , Shuchi Chawla Correlation Clustering. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:238-0 [Conf ] Avrim Blum Machine Learning: My Favorite Results, Directions, and Open Problems. [Citation Graph (0, 0)][DBLP ] FOCS, 2003, pp:2-0 [Conf ] Avrim Blum Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain [Citation Graph (0, 0)][DBLP ] FOCS, 1990, pp:211-218 [Conf ] Avrim Blum Some Tools for Approximate 3-Coloring (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1990, pp:554-562 [Conf ] Avrim Blum , Carl Burch , Adam Kalai Finely-Competitive Paging. [Citation Graph (0, 0)][DBLP ] FOCS, 1999, pp:450-458 [Conf ] Avrim Blum , Carl Burch , John Langford On Learning Monotone Boolean Functions. [Citation Graph (0, 0)][DBLP ] FOCS, 1998, pp:408-415 [Conf ] Avrim Blum , Prasad Chalasani An On-Line Algorithm for Improving Performance in Navigation [Citation Graph (0, 0)][DBLP ] FOCS, 1993, pp:2-11 [Conf ] Avrim Blum , Shuchi Chawla , David R. Karger , Terran Lane , Adam Meyerson , Maria Minkoff Approximation Algorithms for Orienteering and Discounted-Reward TSP. [Citation Graph (0, 0)][DBLP ] FOCS, 2003, pp:46-55 [Conf ] Avrim Blum , Alan M. Frieze , Ravi Kannan , Santosh Vempala A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. [Citation Graph (0, 0)][DBLP ] FOCS, 1996, pp:330-338 [Conf ] Avrim Blum , Ravi Kannan Learning an Intersection of k Halfspaces over a Uniform Distribution [Citation Graph (0, 0)][DBLP ] FOCS, 1993, pp:312-320 [Conf ] Avrim Blum , Howard J. Karloff , Yuval Rabani , Michael E. Saks A Decomposition Theorem and Bounds for Randomized Server Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:197-207 [Conf ] Maria-Florina Balcan , Avrim Blum On a theory of learning with similarity functions. [Citation Graph (0, 0)][DBLP ] ICML, 2006, pp:73-80 [Conf ] Avrim Blum Empirical Support for Winnow and Weighted-Majority Based Algorithms: Results on a Calendar Scheduling Domain. [Citation Graph (0, 0)][DBLP ] ICML, 1995, pp:64-72 [Conf ] Avrim Blum , Shuchi Chawla Learning from Labeled and Unlabeled Data using Graph Mincuts. [Citation Graph (0, 0)][DBLP ] ICML, 2001, pp:19-26 [Conf ] Avrim Blum , John D. Lafferty , Mugizi Robert Rwebangira , Rajashekar Reddy Semi-supervised learning using randomized mincuts. [Citation Graph (0, 0)][DBLP ] ICML, 2004, pp:- [Conf ] H. Brendan McMahan , Geoffrey J. Gordon , Avrim Blum Planning in the Presence of Cost Functions Controlled by an Adversary. [Citation Graph (0, 0)][DBLP ] ICML, 2003, pp:536-543 [Conf ] Joseph O'Sullivan , John Langford , Rich Caruana , Avrim Blum FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness. [Citation Graph (0, 0)][DBLP ] ICML, 2000, pp:703-710 [Conf ] Avrim Blum , Merrick L. Furst Fast Planning Through Planning Graph Analysis. [Citation Graph (0, 0)][DBLP ] IJCAI, 1995, pp:1636-1642 [Conf ] Shobha Venkataraman , Dawn Xiaodong Song , Phillip B. Gibbons , Avrim Blum New Streaming Algorithms for Fast Detection of Superspreaders. [Citation Graph (0, 0)][DBLP ] NDSS, 2005, pp:- [Conf ] Maria-Florina Balcan , Avrim Blum , Ke Yang Co-Training and Expansion: Towards Bridging Theory and Practice. [Citation Graph (0, 0)][DBLP ] NIPS, 2004, pp:- [Conf ] Avrim Blum , Ronald L. Rivest Training a 3-Node Neural Network is NP-Complete. [Citation Graph (0, 0)][DBLP ] NIPS, 1988, pp:494-501 [Conf ] Avrim Blum , Eyal Even-Dar , Katrina Ligett Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. [Citation Graph (0, 0)][DBLP ] PODC, 2006, pp:45-52 [Conf ] Avrim Blum , Cynthia Dwork , Frank McSherry , Kobbi Nissim Practical privacy: the SuLQ framework. [Citation Graph (0, 0)][DBLP ] PODS, 2005, pp:128-138 [Conf ] Avrim Blum , Dawn Xiaodong Song , Shobha Venkataraman Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds. [Citation Graph (0, 0)][DBLP ] RAID, 2004, pp:258-277 [Conf ] Avrim Blum , Ronald L. Rivest Training a 3-Node Neural Network is NP-Complete. [Citation Graph (0, 0)][DBLP ] Machine Learning: From Theory to Applications, 1993, pp:9-28 [Conf ] Maria-Florina Balcan , Avrim Blum Approximation algorithms and online mechanisms for item pricing. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2006, pp:29-35 [Conf ] Martin Zinkevich , Avrim Blum , Tuomas Sandholm On polynomial-time preference elicitation with value queries. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2003, pp:176-185 [Conf ] Avrim Blum Random Projection, Margins, Kernels, and Feature-Selection. [Citation Graph (0, 0)][DBLP ] SLSFS, 2005, pp:52-68 [Conf ] Piotr Berman , Avrim Blum , Amos Fiat , Howard J. Karloff , Adi Rosén , Michael E. Saks Randomized Robot Navigation Algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 1996, pp:75-84 [Conf ] Avrim Blum , Shuchi Chawla , Adam Kalai Static optimality and dynamic search-optimality in lists and trees. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:1-8 [Conf ] Avrim Blum , John Dunagan Smoothed analysis of the perceptron algorithm for linear programming. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:905-914 [Conf ] Avrim Blum , Jason D. Hartline Near-optimal online auctions. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:1156-1163 [Conf ] Avrim Blum , Vijay Kumar , Atri Rudra , Felix Wu Online learning in online auctions. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:202-204 [Conf ] Avrim Blum , Tuomas Sandholm , Martin Zinkevich Online algorithms for market clearing. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:971-980 [Conf ] Yossi Azar , Avrim Blum , Yishay Mansour Combining online algorithms for rejection and acceptance. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:159-163 [Conf ] Nikhil Bansal , Avrim Blum , Shuchi Chawla , Adam Meyerson Online oblivious routing. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:44-49 [Conf ] Baruch Awerbuch , Yossi Azar , Avrim Blum , Santosh Vempala Improved approximation guarantees for minimum-weight k -trees and prize-collecting salesmen. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:277-283 [Conf ] Nikhil Bansal , Avrim Blum , Shuchi Chawla , Adam Meyerson Approximation algorithms for deadline-TSP and vehicle routing with time-windows. [Citation Graph (0, 0)][DBLP ] STOC, 2004, pp:166-174 [Conf ] Yair Bartal , Avrim Blum , Carl Burch , Andrew Tomkins A polylog(n )-Competitive Algorithm for Metrical Task Systems. [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:711-719 [Conf ] Avrim Blum An \tildeO(n^0.4)-Approximation Algorithm for 3-Coloring (and Improved Approximation Algorithm for k-Coloring) [Citation Graph (0, 0)][DBLP ] STOC, 1989, pp:535-542 [Conf ] Avrim Blum Learning Boolean Functions in an Infinite Atribute Space (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:64-72 [Conf ] Avrim Blum , Prasad Chalasani , Don Coppersmith , William R. Pulleyblank , Prabhakar Raghavan , Madhu Sudan The minimum latency problem. [Citation Graph (0, 0)][DBLP ] STOC, 1994, pp:163-171 [Conf ] Avrim Blum , Prasad Chalasani , Santosh Vempala A constant-factor approximation for the k -MST problem in the plane. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:294-302 [Conf ] Avrim Blum , Merrick L. Furst , Jeffrey C. Jackson , Michael J. Kearns , Yishay Mansour , Steven Rudich Weakly learning DNF and characterizing statistical query learning using Fourier analysis. [Citation Graph (0, 0)][DBLP ] STOC, 1994, pp:253-262 [Conf ] Avrim Blum , Tao Jiang , Ming Li , John Tromp , Mihalis Yannakakis Linear Approximation of Shortest Superstrings [Citation Graph (0, 0)][DBLP ] STOC, 1991, pp:328-336 [Conf ] Avrim Blum , Goran Konjevod , R. Ravi , Santosh Vempala Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. [Citation Graph (0, 0)][DBLP ] STOC, 1998, pp:100-105 [Conf ] Avrim Blum , Adam Kalai , Hal Wasserman Noise-tolerant learning, the parity problem, and the statistical query model. [Citation Graph (0, 0)][DBLP ] STOC, 2000, pp:435-440 [Conf ] Avrim Blum , Steven Rudich Fast Learning of k-Term DNF Formulas with Queries [Citation Graph (0, 0)][DBLP ] STOC, 1992, pp:382-389 [Conf ] Avrim Blum , Prabhakar Raghavan , Baruch Schieber Navigating in Unfamiliar Geometric Terrain (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1991, pp:494-504 [Conf ] Avrim Blum , R. Ravi , Santosh Vempala A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STOC, 1996, pp:442-448 [Conf ] Avrim Blum , Adam Kalai , Jon M. Kleinberg Admission Control to Minimize Rejections. [Citation Graph (0, 0)][DBLP ] WADS, 2001, pp:155-164 [Conf ] Avrim Blum , Pat Langley Selection of Relevant Features and Examples in Machine Learning. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1997, v:97, n:1-2, pp:245-271 [Journal ] Avrim Blum , Shuchi Chawla , Adam Kalai Static Optimality and Dynamic Search-Optimality in Lists and Trees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:36, n:3, pp:249-260 [Journal ] Avrim Blum , Alan M. Frieze , Ravi Kannan , Santosh Vempala A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1998, v:22, n:1/2, pp:35-52 [Journal ] Avrim Blum , Adam Kalai , Hal Wasserman Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model [Citation Graph (0, 0)][DBLP ] CoRR, 2000, v:0, n:, pp:- [Journal ] Avrim Blum , Ke Yang On Statistical Query Sampling and NMR Quantum Computing [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:014, pp:- [Journal ] Avrim Blum Rank-r Decision Trees are a Subclass of r-Decision Lists. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:4, pp:183-185 [Journal ] Avrim Blum , David R. Karger An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:61, n:1, pp:49-53 [Journal ] Avrim Blum New Approximation Algorithms for Graph Coloring. [Citation Graph (0, 0)][DBLP ] J. ACM, 1994, v:41, n:3, pp:470-516 [Journal ] Avrim Blum , Adam Kalai , Hal Wasserman Noise-tolerant learning, the parity problem, and the statistical query model. [Citation Graph (0, 0)][DBLP ] J. ACM, 2003, v:50, n:4, pp:506-519 [Journal ] Avrim Blum , Ming Li , John Tromp , Mihalis Yannakakis Linear Approximation of Shortest Superstrings. [Citation Graph (0, 0)][DBLP ] J. ACM, 1994, v:41, n:4, pp:630-647 [Journal ] Avrim Blum , Tuomas Sandholm , Martin Zinkevich Online algorithms for market clearing. [Citation Graph (0, 0)][DBLP ] J. ACM, 2006, v:53, n:5, pp:845-879 [Journal ] Avrim Blum , Prasad Chalasani , Sally A. Goldman , Donna K. Slonim Learning with Unreliable Boundary Queries. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1998, v:56, n:2, pp:209-222 [Journal ] Avrim Blum , Lisa Hellerstein , Nick Littlestone Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1995, v:50, n:1, pp:32-40 [Journal ] Avrim Blum , Ravindran Kannan Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1997, v:54, n:2, pp:371-380 [Journal ] Avrim Blum , Steven Rudich Fast Learning of k-Term DNF Formulas with Queries. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1995, v:51, n:3, pp:367-373 [Journal ] Avrim Blum , R. Ravi , Santosh Vempala A Constant-Factor Approximation Algorithm for the k -MST Problem. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1999, v:58, n:1, pp:101-108 [Journal ] Avrim Blum , Jeffrey C. Jackson , Tuomas Sandholm , Martin Zinkevich Preference Elicitation and Query Learning. [Citation Graph (0, 0)][DBLP ] Journal of Machine Learning Research, 2004, v:5, n:, pp:649-667 [Journal ] Avrim Blum , Adam Kalai Universal Portfolios With and Without Transaction Costs. [Citation Graph (0, 0)][DBLP ] Machine Learning, 1999, v:35, n:3, pp:193-205 [Journal ] Nikhil Bansal , Avrim Blum , Shuchi Chawla Correlation Clustering. [Citation Graph (0, 0)][DBLP ] Machine Learning, 2004, v:56, n:1-3, pp:89-113 [Journal ] Avrim Blum Learning Boolean Functions in an Infinite Attribute Space. [Citation Graph (0, 0)][DBLP ] Machine Learning, 1992, v:9, n:, pp:373-386 [Journal ] Avrim Blum Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain. [Citation Graph (0, 0)][DBLP ] Machine Learning, 1997, v:26, n:1, pp:5-23 [Journal ] Avrim Blum , Carl Burch On-line Learning and the Metrical Task System Problem. [Citation Graph (0, 0)][DBLP ] Machine Learning, 2000, v:39, n:1, pp:35-58 [Journal ] Avrim Blum , Adam Kalai A Note on Learning from Multiple-Instance Examples. [Citation Graph (0, 0)][DBLP ] Machine Learning, 1998, v:30, n:1, pp:23-29 [Journal ] John Langford , Avrim Blum Microchoice Bounds and Self Bounding Learning Algorithms. [Citation Graph (0, 0)][DBLP ] Machine Learning, 2003, v:51, n:2, pp:165-179 [Journal ] Maria-Florina Balcan , Avrim Blum , Santosh Vempala Kernels as features: On kernels, margins, and low-dimensional mappings. [Citation Graph (0, 0)][DBLP ] Machine Learning, 2006, v:65, n:1, pp:79-94 [Journal ] Avrim Blum , Ronald L. Rivest Training a 3-node neural network is NP-complete. [Citation Graph (0, 0)][DBLP ] Neural Networks, 1992, v:5, n:1, pp:117-127 [Journal ] Howard Aizenstein , Avrim Blum , Roni Khardon , Eyal Kushilevitz , Leonard Pitt , Dan Roth On Learning Read-k-Satisfy-j DNF. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:27, n:6, pp:1515-1530 [Journal ] Baruch Awerbuch , Yossi Azar , Avrim Blum , Santosh Vempala New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:254-262 [Journal ] Avrim Blum Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:5, pp:990-1000 [Journal ] Avrim Blum , Prasad Chalasani An Online Algorithm for Improving Performance in Navigation. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:29, n:6, pp:1907-1938 [Journal ] Avrim Blum , Howard J. Karloff , Yuval Rabani , Michael E. Saks A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:5, pp:1624-1661 [Journal ] Avrim Blum , Prabhakar Raghavan , Baruch Schieber Navigating in Unfamiliar Geometric Terrain. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:1, pp:110-137 [Journal ] Joseph S. B. Mitchell , Avrim Blum , Prasad Chalasani , Santosh Vempala A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:3, pp:771-781 [Journal ] Avrim Blum , Goran Konjevod , R. Ravi , Santosh Vempala Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:235, n:1, pp:25-42 [Journal ] Avrim Blum , Vijay Kumar , Atri Rudra , Felix Wu Online learning in online auctions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:324, n:2-3, pp:137-146 [Journal ] Avrim Blum A Theory of Similarity Functions for Learning and Clustering. [Citation Graph (0, 0)][DBLP ] ALT, 2007, pp:9- [Conf ] Avrim Blum , Maria-Florina Balcan Open Problems in Efficient Semi-supervised PAC Learning. [Citation Graph (0, 0)][DBLP ] COLT, 2007, pp:622-624 [Conf ] Avrim Blum A Theory of Similarity Functions for Learning and Clustering. [Citation Graph (0, 0)][DBLP ] Discovery Science, 2007, pp:39- [Conf ] David J. Abraham , Avrim Blum , Tuomas Sandholm Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2007, pp:295-304 [Conf ] Avrim Blum , Shuchi Chawla , David R. Karger , Terran Lane , Adam Meyerson , Maria Minkoff Approximation Algorithms for Orienteering and Discounted-Reward TSP. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2007, v:37, n:2, pp:653-670 [Journal ] Clustering with Interactive Feedback. [Citation Graph (, )][DBLP ] Improved Guarantees for Learning via Similarity Functions. [Citation Graph (, )][DBLP ] Veritas: Combining Expert Opinions without Labeled Data. [Citation Graph (, )][DBLP ] Separating Populations with Wide Data: A Spectral Analysis. [Citation Graph (, )][DBLP ] Limits of Learning-based Signature Generation with Adversaries. [Citation Graph (, )][DBLP ] Item pricing for revenue maximization. [Citation Graph (, )][DBLP ] The price of uncertainty. [Citation Graph (, )][DBLP ] Improved equilibria via public service advertising. [Citation Graph (, )][DBLP ] Approximate clustering without the approximation. [Citation Graph (, )][DBLP ] Regret minimization and the price of total anarchy. [Citation Graph (, )][DBLP ] A learning theory approach to non-interactive database privacy. [Citation Graph (, )][DBLP ] A discriminative framework for clustering via similarity functions. [Citation Graph (, )][DBLP ] A Theory of Loss-Leaders: Making Money by Pricing Below Cost. [Citation Graph (, )][DBLP ] Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior. [Citation Graph (, )][DBLP ] Search in 0.008secs, Finished in 0.015secs