Tim Roughgarden
http://dbpedia.org/resource/Tim_Roughgarden an entity of type: Thing
Timothy „Tim“ Avelin Roughgarden (* 20. Juli 1975) ist ein US-amerikanischer Informatiker. Er ist Professor an der Columbia University.
rdf:langString
Tim Avelin Roughgarden est un chercheur en informatique de l'université Stanford. Il est connu pour ses travaux en théorie des jeux pour lesquels il a notamment reçu le prix Gödel en 2012.
rdf:langString
Timothy Avelin Roughgarden is an American computer scientist and a professor of Computer Science at Columbia University. Roughgarden's work deals primarily with game theoretic questions in computer science. Roughgarden received his Ph.D. from Cornell University in 2002, under the supervision of Éva Tardos. He did a postdoc at University of California, Berkeley in 2004. From 2004 to 2018, Roughgarden was a professor at the Computer Science department at Stanford University working on algorithms and game theory. Roughgarden teaches a four-part algorithms specialization on Coursera.
rdf:langString
rdf:langString
Tim Roughgarden
rdf:langString
Tim Roughgarden
rdf:langString
Tim Roughgarden
rdf:langString
Timothy Avelin Roughgarden
rdf:langString
Timothy Avelin Roughgarden
xsd:date
1975-07-20
xsd:integer
35870516
xsd:integer
1117950708
rdf:langString
Selfish routing
xsd:integer
2002
rdf:langString
Columbia University
rdf:langString
Stanford University
rdf:langString
rdf:langString
Cornell University
rdf:langString
Stanford University
rdf:langString
rdf:langString
rdf:langString
Grace Murray Hopper Award
rdf:langString
Kalai Prize
rdf:langString
Social Choice and Welfare Prize
rdf:langString
Gödel prize
xsd:date
1975-07-20
rdf:langString
Contributions to Selfish Routing in the context of Computer Science
rdf:langString
Timothy „Tim“ Avelin Roughgarden (* 20. Juli 1975) ist ein US-amerikanischer Informatiker. Er ist Professor an der Columbia University.
rdf:langString
Tim Avelin Roughgarden est un chercheur en informatique de l'université Stanford. Il est connu pour ses travaux en théorie des jeux pour lesquels il a notamment reçu le prix Gödel en 2012.
rdf:langString
Timothy Avelin Roughgarden is an American computer scientist and a professor of Computer Science at Columbia University. Roughgarden's work deals primarily with game theoretic questions in computer science. Roughgarden received his Ph.D. from Cornell University in 2002, under the supervision of Éva Tardos. He did a postdoc at University of California, Berkeley in 2004. From 2004 to 2018, Roughgarden was a professor at the Computer Science department at Stanford University working on algorithms and game theory. Roughgarden teaches a four-part algorithms specialization on Coursera. He received the Danny Lewin award at STOC 2002 for the best student paper. He received the Presidential Early Career Award for Scientists and Engineers in 2007, the Grace Murray Hopper Award in 2009, and the Gödel Prize in 2012 for his work on routing traffic in large-scale communication networks to optimize performance of a congested network. He received a Guggenheim Fellowship in 2017 and the Kalai Prize in 2016. Roughgarden is a co-editor of the 2016 textbook Algorithmic Game Theory, as well as the author of two chapters (Introduction to the Inefficiency of Equilibria and Routing Games).
xsd:nonNegativeInteger
6988