 | Avrim Blum, T-H. Hubert Chan, Mugizi Robert Rwebangira: A Random-Surfer Web-Graph Model. SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO),
January 2006 PDF |
| Avrim Blum, John Lafferty, Mugizi Robert Rwebangira, and Rajashekar Reddy: Semi-Supervised Learning Using Randomized Mincuts. Proceedings of the 21st International Conference on Machine Learning (ICML) PDF |
| Maria Florina Balcan and Avrim Blum: A PAC-style Model for Learning from Labeled and Unlabeled Data. TBD PDF |
| Nikhil Basal, Avrim Blum, Shuchi Chawla, and Kedar Dhamdhere: Scheduling for Flow-Time with Admission Control. European Symposium on Algorithms, 2003 PDF |
| Nikhil Bansal, Avrim Blum, Shuchi Chawla, and Adam Meyerson: Online Oblivious Routing. ACM Symposium in Parallelism in Algorithms and Architectures (SPAA) 2003 PDF |
| Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, and Maria Minkoff: Approximation Algorithms for Orienteering and Discounted-Reward TSP. CMU-CS-03-121, March 2003 PDF |
| Avrim Blum, John Dunagan: Smoothed Analysis of the Perceptron Algorithm. SODA 2002 PDF |
| Avrim Blum, Tuomas Sandholm, Martin Zinkevich: Online Algorithms for Market Clearing. SODA 2002 PDF |
| Avrim Blum, Shuchi Chawla, Adam Kalai: Static Optimality and Dynamic Search-Optimality in Lists and Trees. SODA 2002 PDF |
| Nikhil Bansal, Avrim Blum, and Shuchi Chawla: Correlation Clustering. Symp. on Foundations of Computer Science (FOCS) 2002, pages 238-247 PDF |
| Avrim Blum, Adam Kalai, Jon M. Kleinberg: Admission Control to Minimize Rejections. WADS 2001: 155-164 PDF / abs |
| Avrim Blum, Shuchi Chawla: Learning from Labeled and Unlabeled Data using Graph Mincuts. ICML '01 PDF |
| Avrim Blum, Adam Kalai, Hal Wasserman: Noise-tolerant learning, the parity problem, and the statistical query model. STOC 2000: 435-440 PDF / abs |
| Avrim Blum, Carl Burch: On-line Learning and the Metrical Task System Problem. Machine Learning 39(1): 35-58 (2000) PDF |
| Avrim Blum, Prasad Chalasani: An Online Algorithm for Improving Performance in Navigation. SIAM J. Comput. 29(6): 1907-1938 (2000) PDF |
| 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. 30(5): 1624-1661 (2000) PDF / abs |
| Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. TCS 235(1): 25-42 (2000) PDF |
| Joseph O'Sullivan, Avrim Blum, John Langford, Rich Caruana: FeatureBoost: A Meta Learning Algorithm that Improves Model Robustness. ICML '00 PDF |
CENTER
Carnegie
Mellon 
Aladdin
