Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Blum, Avrim"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Clustering under approximation stability
Maria-Florina Balcan
,
Avrim Blum
,
Anupam Gupta
Journal of the ACM
60
(2), 2013, pp. 8: 1-34
Circumventing the price of anarchy: Leading dynamics to good behavior
Maria-Florina Balcan
,
Avrim Blum
,
Yishay Mansour
SIAM Journal on Computing
42
(1), 2013, pp. 230-264
A learning theory approach to noninteractive database privacy
Avrim Blum
,
Katrina Ligett
,
Aaron Roth
Journal of the ACM
60
(2), 2013, pp. 12: 1-25
Center-based clustering under perturbation stability
Pranjal Awasthi
,
Avrim Blum
,
Or Sheffet
Information Processing Letters
112
(1-2), 2012, pp. 49-54
A discriminative model for semi-supervised learning
Maria-Florina Balcan
,
Avrim Blum
Journal of the ACM
57
(3), 2010, pp. 19: 1-46
Reducing mechanism design to algorithm design via machine learning
Maria-Florina Balcan
,
Avrim Blum
,
Jason D. Hartline
,
Yishay Mansour
Journal of Computer and System Sciences
74
(8), 2008, pp. 1245-1270
A discriminative framework for clustering via similarity functions
Maria-Florina Balcan
,
Avrim Blum
,
Santosh Vempala
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 671-680
Regret minimization and the price of total anarchy
Avrim Blum
,
MohammadTaghi Hajiaghayi
,
Katrina Ligett
,
Aaron Roth
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 373-382
A learning theory approach to non-interactive database privacy
Avrim Blum
,
Katrina Ligett
,
Aaron Roth
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 609-617
Approximation algorithms for orienteering and discounted-reward TSP
Avrim Blum
,
Shuchi Chawla
,
David R. Karger
,
Terran Lane
,
Adam Meyerson
,
Maria Minkoff
SIAM Journal on Computing
37
(2), 2007, pp. 653-670
Separating populations with wide data: A spectral analysis
Avrim Blum
,
Amin Coja-Oghlan
,
Alan Frieze
,
Shuheng Zhou
Lecture Notes in Computer Science
4835
, 2007, pp. 439-451
Online algorithms for market clearing
Avrim Blum
,
Tuomas Sandholm
,
Martin Zinkevich
Journal of the ACM
53
(5), 2006, pp. 845-879
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
Nikhil Bansal
,
Avrim Blum
,
Shuchi Chawla
,
Adam Meyerson
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 166-174
Online learning in online auctions
Avrim Blum
,
Vijay Kumar
,
Atri Rudra
,
Felix Wu
Theoretical Computer Science
324
(2-3), 2004, pp. 137-146
Combining online algorithms for rejection and acceptance
Yossi Azar
,
Avrim Blum
,
Yishay Mansour
Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2003 (San Diego, California, June 7-9, 2003)
, 2003, pp. 159-163
Scheduling for flow-time with admission control
Nikhil Bansal
,
Avrim Blum
,
Shuchi Chawla
,
Kedar Dhamdhere
Lecture Notes in Computer Science
2832
, 2003, pp. 43-54
Online oblivious routing
Nikhil Bansal
,
Avrim Blum
,
Shuchi Chawla
,
Adam Meyerson
Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2003 (San Diego, California, June 7-9, 2003)
, 2003, pp. 44-49
Static optimality and dynamic search-optimality in lists and trees
Avrim Blum
,
Shuchi Chawla
,
Adam Kalai
Algorithmica
36
(3), 2003, pp. 249-260
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum
,
Adam Kalai
,
Hal Wasserman
Journal of the ACM
50
(4), 2003, pp. 506-519
Correlation clustering
Nikhil Bansal
,
Avrim Blum
,
Shuchi Chawla
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 238-247
Admission control to minimize rejections
Avrim Blum
,
Adam Kalai
,
Jon Kleinberg
Lecture Notes in Computer Science
2125
, 2001, pp. 155-164
An online algorithm for improving performance in navigation
Avrim Blum
,
Prasad Chalasani
SIAM Journal on Computing
29
(6), 2000, pp. 1907-1938
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum
,
Adam Kalai
,
Hal Wasserman
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 435-440
A decomposition theorem for task systems and bounds for randomized server problems
Avrim Blum
,
Howard Karloff
,
Yuval Rabani
,
Michael Saks
SIAM Journal on Computing
30
(5), 2000, pp. 1624-1661
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Avrim Blum
,
Goran Konjevod
,
R. Ravi
,
Santosh Vempala
Theoretical Computer Science
235
(1), 2000, pp. 25-42
Seiten 1
2
3
>