Éva Tardos
Éva Tardos (born October 1, 1957 in Budapest ) is a Hungarian mathematician and computer scientist .
Life
Tardos studied at the Eotvos Lorand University in Budapest , where she made her diploma in 1981 and 1984 András Frank doctorate was. Afterwards she was a Humboldt Fellow at the University of Bonn and at the MSRI . In 1986/7 she was on a scholarship from the Hungarian Academy of Sciences at Loránd Eötvös University and was then visiting professor at the Massachusetts Institute of Technology for two years . She has been a professor at Cornell University since 1989 .
She deals with algorithms , complexity theory , games in networks and on graphs ( algorithmic game theory with applications on systems and algorithms for self-interested users ), network theory (route search for packages, design, flow algorithms, theory of social networks) and general combinatorial optimization problems in networks and graphs , Scheduling .
In 1988 she won the Fulkerson Prize (for A strongly polynomial minimum cost circulation algorithm , Combinatorica, Volume 5, 1985, pp. 247-256). She was a Sloan Research Fellow from 1991 to 1993, a Packard Fellow from 1990 to 1995, a Guggenheim Fellow from 1999 to 2000, and a Presidential Young Investigator of the National Science Foundation from 1991 to 1996. She was invited speaker at the ICM 1990 in Kyoto ( Strongly Polynomial and Combinatorial Algorithms in Optimization ). She is a member of the American Academy of Arts and Sciences , the National Academy of Engineering , the National Academy of Sciences , the American Philosophical Society and a Fellow of the Association for Computing Machinery . In 2006 she received the George B. Dantzig Prize and in 2012 the Gödel Prize for her work How bad is selfish routing? with Tim Roughgarden . In 2013 she received the Technical Achievement Award from the IEEE Computer Society for her work on algorithmic game theory and specifically selfish routing . She was awarded the EATCS Award for 2017, and the John von Neumann Medal of the IEEE for 2019 . She is a Fellow of the American Mathematical Society . In 2014/15 and 2015/16 she was on the Abel Prize Committee.
In 1988 she tightened (as well as Noga Alon and RB Boppana before) a result by Alexander Alexandrowitsch Rasborow in which she showed that the difference in circuit complexity between monotonic and non-monotonic Boolean functions can be exponential.
From 2003 to 2009 she was the editor of SIAM J. Computing. She is co-editor of the Journal of the ACM and Combinatorica.
She is the sister of Gábor Tardos .
Fonts
- with Jon Kleinberg : Algorithm Design. Addison-Wesley, 2005
- with Noam Nisan , Vijay Vazirani , Tim Roughgarden (editor): Algorithmic Game Theory. Cambridge University Press, 2007 (therein with Vazirani: Basic solution concepts and computational issues in games , with Roughgarden: Introduction to the inefficiency of equilibria , with Tom Wexler: Network formation games )
- with AV Goldberg, Robert Tarjan : Network Flow Algorithms. In: Bernhard Korte , László Lovász , Hans Jürgen Prömel , Alexander Schrijver (editor): Paths, Flows and VLSI-Design. Springer Verlag, 1990, pp. 101-164.
- with DB Shmoys: Computational complexity , as well as with Shmoys, Lovasz Combinatorics in Computer Science. In: Ronald Graham , Martin Groetschel , Lovasz: Handbook of Combinatorics. North Holland
Web links
- Éva Tardos in the Mathematics Genealogy Project (English)
- Homepage
- biography
References
- ↑ selfish users
- ↑ Journal of the ACM, Volume 49, 2002, pp. 236-259
- ↑ Technical Achievement Award IEEE Computer Society 2013
- ↑ Alon, Boppana, Noga Alon, RB Boppana, The monotone circuit complexity of Boolean functions, Combinatorica, Volume 7, 1987, pp. 1-22
- ^ Tardos, The gap between monotone and non-monotone circuit complexity is exponential, Combinatorica, Volume 8, 1988, pp. 141-142
| personal data | |
|---|---|
| SURNAME | Tardos, Éva |
| BRIEF DESCRIPTION | Hungarian mathematician and computer scientist |
| DATE OF BIRTH | October 1, 1957 |
| PLACE OF BIRTH | Budapest |