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
Hilfe
Suche: Author="Tardos, {\'E}va"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Composable and efficient mechanisms
Vasilis Syrgkanis
,
Éva Tardos
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 211-220
Stronger bounds on Braess's paradox and the maximum latency of selfish routing
Henry Lin
,
Tim Roughgarden
,
Éva Tardos
,
Asher Walkover
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1667-1686
Multiplicative updates outperform generic no-regret learning in congestion games
Robert Kleinberg
,
Georgios Piliouras
,
Éva Tardos
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 533-542
The price of stability for network design with fair cost allocation
Elliot Anshelevich
,
Anirban Dasgupta
,
Jon Kleinberg
,
Éva Tardos
,
Tom Wexler
,
Tim Roughgarden
SIAM Journal on Computing
38
(4), 2008, pp. 1602-1623
Cost-sharing mechanisms for network design
Anupam Gupta
,
Aravind Srinivasan
,
Éva Tardos
Algorithmica
50
(1), 2008, pp. 98-119
Balanced outcomes in social exchange networks
Jon Kleinberg
,
Éva Tardos
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 295-304
Parallel imaging problem
Thành Nguyen
,
Éva Tardos
Lecture Notes in Computer Science
5193
, 2008, pp. 684-695
The effect of collusion in congestion games
Ara Hayrapetyan
,
Éva Tardos
,
Tom Wexler
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 89-98
Algorithm Design
Jon Kleinberg
,
Éva Tardos
Buch, 2006, pp. xxiii, 838
Large networks and the price of anarchy or stability
Éva Tardos
HNI-Verlagsschriftenreihe
181
, 2006, pp. 23-23
Influential nodes in a diffusion model for social networks
David Kempe
,
Jon Kleinberg
,
Éva Tardos
Lecture Notes in Computer Science
3580
, 2005, pp. 1127-1138
Braess's paradox, Fibonacci numbers, and exponential inapproximability
Henry Lin
,
Tim Roughgarden
,
Éva Tardos
,
Asher Walkover
Lecture Notes in Computer Science
3580
, 2005, pp. 497-512
Network games
Éva Tardos
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 341-342
Near-optimal network design with selfish agents
Elliot Anshelevich
,
Anirban Dasgupta
,
Éva Tardos
,
Tom Wexler
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 511-520
Approximation algorithms and network games
Éva Tardos
Lecture Notes in Computer Science
2832
, 2003, pp. 6-6
Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields
Jon Kleinberg
,
Éva Tardos
Journal of the ACM
49
(5), 2002, pp. 616-639
How bad is selfish routing?
Tim Roughgarden
,
Éva Tardos
Journal of the ACM
49
(2), 2002, pp. 236-259
Approximations for the disjoint paths problem in high-diameter planar networks
Jon Kleinberg
,
Éva Tardos
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 26-35
Improved bounds on the max-flow min-cut ratio for multicommodity flows
Serge Plotkin
,
éva Tardos
Combinatorica
15
(3), 1995, pp. 425-434
Polynomial time algorithms for some evacuation problems
Bruce Hoppe
,
éva Tardos
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 433-441
Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts
Philip Klein
,
Serge Plotkin
,
Clifford Stein
,
éva Tardos
SIAM Journal on Computing
23
(3), 1994, June, pp. 466-487
Improved bounds on the max-flow min-cut ratio for multicommodity flows
Serge A. Plotkin
,
éva Tardos
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 691-697
Scheduling unrelated machines with costs
David B. Shmoys
,
éva Tardos
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993)
, 1993, pp. 448-454
Improved bounds for the max-flow min-multicut ratio for planar and
K_{r,r}
-free graphs
éva Tardos
,
Vijay V. Vazirani
Information Processing Letters
47
(2), 1993, pp. 77-80
Algorithms for routing around a rectangle
András Frank
,
Takao Nishizeki
,
Nobuji Saito
,
Hitoshi Suzuki
,
éva Tardos
Discrete Applied Mathematics
40
, 1992, pp. 363-378
Seiten 1
2
>