| dbo:abstract
|
- كارستن لوند (بالإنجليزية: Carsten Lund) هو عالم حاسوب أمريكي، ولد في 1 يوليو 1963 في آرهوس في الدنمارك. (ar)
- Carsten Lund (born July 1, 1963) is a Danish-born theoretical computer scientist, currently working at AT&T Labs in Bedminster, New Jersey, United States. Lund was born in Aarhus, Denmark, and received the"kandidat" degree in 1988 from the University of Aarhus and his Ph.D.from the University of Chicago in computer science. His thesis, entitled ThePower of Interaction, was chosen as an ACM 'Distinguished Dissertation'. Lund was a co-author on two of five competing papers at the 1990 Symposium on Foundations of Computer Science characterizing complexity classes such as PSPACE and NEXPTIME in terms of interactive proof systems;this work became part of his 1991 Ph.D. thesis from the University of Chicago under the supervision of Lance Fortnow and László Babai, for which he was a runner-up for the 1991 ACM Doctoral Dissertation Award. He is also known for his joint work with Sanjeev Arora, Madhu Sudan, Rajeev Motwani, and Mario Szegedy that discovered the existence of probabilistically checkable proofs for NP-hard problems and used them to prove hardness results for approximation problems; in 2001 he and his co-authors received the Gödel Prize for their share in these discoveries. More recently he has published highly cited work on internet traffic engineering. He has been working for AT&T Laboratories since August 1991. (en)
- Carsten Lund (* 1. Juli 1963) ist ein US-amerikanischer Informatiker. Lund wurde 1991 an der University of Chicago bei Lance Fortnow und László Babai promoviert (The Power of Interaction). Er forscht an den AT&T Laboratories in Florham Park (New Jersey), wo er sich unter anderem mit der Bewältigung des Informationsflusses in Internet-Netzwerken beschäftigte (Internet Traffic Engineering). Ausgehend von seiner Doktorarbeit und in Zusammenarbeit mit seinen Lehrern Babai und Fortnow bewies er Anfang der 1990er Jahre Sätze über die von Interaktiven Beweissystemen (mit PCP´s) beweisbaren Probleme der Komplexitätstheorie. Dies führte später in den 1990er Jahren zum Beweis des PCP-Theorems. 2001 erhielt er den Gödel-Preis für seine Beteiligung an dieser Entwicklung. 2005 gewann er die Science and Technology Medal von ATT. (de)
- Carsten Lund, né le 1er juillet 1963 à Aarhus, au Danemark, est un informaticien théoricien d'origine danoise qui travaille actuellement (en 2015) à Bedminster, dans le New Jersey, aux Laboratoires de AT&T. (fr)
|
| dbo:academicDiscipline
| |
| dbo:almaMater
| |
| dbo:award
| |
| dbo:birthDate
| |
| dbo:birthPlace
| |
| dbo:doctoralAdvisor
| |
| dbo:institution
| |
| dbo:nationality
| |
| dbo:residence
| |
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 6719 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:almaMater
| |
| dbp:awards
| |
| dbp:birthDate
| |
| dbp:birthPlace
| |
| dbp:doctoralAdvisor
| |
| dbp:fields
| |
| dbp:name
| |
| dbp:nationality
| |
| dbp:residence
| |
| dbp:wikiPageUsesTemplate
| |
| dbp:workplaces
| |
| dcterms:subject
| |
| gold:hypernym
| |
| schema:sameAs
| |
| rdf:type
| |
| rdfs:comment
|
- كارستن لوند (بالإنجليزية: Carsten Lund) هو عالم حاسوب أمريكي، ولد في 1 يوليو 1963 في آرهوس في الدنمارك. (ar)
- Carsten Lund, né le 1er juillet 1963 à Aarhus, au Danemark, est un informaticien théoricien d'origine danoise qui travaille actuellement (en 2015) à Bedminster, dans le New Jersey, aux Laboratoires de AT&T. (fr)
- Carsten Lund (born July 1, 1963) is a Danish-born theoretical computer scientist, currently working at AT&T Labs in Bedminster, New Jersey, United States. Lund was born in Aarhus, Denmark, and received the"kandidat" degree in 1988 from the University of Aarhus and his Ph.D.from the University of Chicago in computer science. His thesis, entitled ThePower of Interaction, was chosen as an ACM 'Distinguished Dissertation'. More recently he has published highly cited work on internet traffic engineering. He has been working for AT&T Laboratories since August 1991. (en)
- Carsten Lund (* 1. Juli 1963) ist ein US-amerikanischer Informatiker. Lund wurde 1991 an der University of Chicago bei Lance Fortnow und László Babai promoviert (The Power of Interaction). Er forscht an den AT&T Laboratories in Florham Park (New Jersey), wo er sich unter anderem mit der Bewältigung des Informationsflusses in Internet-Netzwerken beschäftigte (Internet Traffic Engineering). 2005 gewann er die Science and Technology Medal von ATT. (de)
|
| rdfs:label
|
- Carsten Lund (en)
- كارستن لوند (عالم حاسوب) (ar)
- Carsten Lund (de)
- Carsten Lund (fr)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:isPrimaryTopicOf
| |
| foaf:name
| |
| is dbo:doctoralStudent
of | |
| is dbo:wikiPageWikiLink
of | |
| is dbp:doctoralStudents
of | |
| is foaf:primaryTopic
of | |
