Mike Paterson (original) (raw)
Michael Stewart « Mike » Paterson, né en 1942, est un informaticien théoricien britannique, spécialiste en conception et analyse des algorithmes et en théorie de la complexité. Il est aussi réputé comme inventeur de jeux, comme les vers de Paterson ou les sprouts.
| Property | Value |
|---|---|
| dbo:abstract | Michael Stewart „Mike“ Paterson (* 1942) ist ein britischer Informatiker. Paterson studierte an der Universität Cambridge, wo er 1967 bei promoviert wurde (Equivalence problems in a model of computation). Als Post-Doktorand war er am Massachusetts Institute of Technology und ab 1971 war er an der University of Warwick, wo er Professor für Informatik war und bis 2007 das Centre for Discrete Mathematics and its Applications leitete. Er befasst sich insbesondere mit Design und Analyse von Algorithmen und Komplexitätstheorie. Zu seinen Doktoranden zählt Leslie Valiant. 2001 wurde er Präsident der European Association for Theoretical Computer Science (EATCS). 2006 erhielt er den EATCS-Award. 2001 erhielt er für Arbeiten über Verteiltes Rechnen mit Michael J. Fischer und Nancy Lynch den Dijkstra-Preis. Seit 1991 ist er Mitglied der Academia Europaea. 2001 wurde er Fellow der Royal Society. 2011 war er einer der Empfänger des David P. Robbins Prize für eine Arbeit, die das Problem der Anzahl übereinandergestapelter Bausteine mit Überhang behandelte. Mit William Thurston und anderen ist er Ko-Autor eines Buches über automatische Gruppen. Er ist ein begeisterter Bergsteiger. (de) Michael S. Paterson, comúnmente conocido como Mike Paterson, es un informático teórico británico, director del Centre for Discrete Mathematics and its Applications (Centro de Matemáticas Discretas y sus Aplicaciones) en el Departamento de Ciencias de Computación de la Universidad de Warwick, y que estuvo además a cargo de este departamento en 2005. Recibió su doctorado en la Universidad de Cambridge en 1967, bajo la supervisión de , y estuvo tres años en el MIT antes de trasladarse a Warwick, en 1971. Paterson posee más de 100 publicaciones, especialmente sobre el diseño y análisis de algoritmos y complejidad computacional. La distinguida carrera de Paterson fue reconocida con el premio EATCS Award en 2006 y se realizó una conferencia por su cumpleaños número 66 el año 2008, que incluyó el apoyo de muchos galardonados con el Premio Turing y el Premio Gödel. Por su trabajo en computación distribuida, junto con y Nancy Lynch, recibió el Premio Dijkstra en 2001, y su trabajo con Dyer y Goldberg en enumeración de homomorfismos de grafos recibió el premio al mejor artículo científico en la conferencia de 2006. Paterson es miembro honorífico de la Royal Society desde 2001, y ha sido presidente de la European Association for Theoretical Computer Science (EATCS). Según el presidente de la EATCS, Maurice Nivat, Paterson jugó un importante papel a fines de la década de los 60's en el reconocimiento de las ciencias de la computación como ciencia, y como un «área muy cercana a las matemáticas, pero distinta en su motivación e inspiración, que se constituye como un campo de investigación desafiante y fructífero». Paterson, además, es un entusiasta montañista. (es) Michael Stewart Paterson, is a British computer scientist, who was the director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick until 2007, and chair of the department of computer science in 2005. He received his Doctor of Philosophy (Ph.D.) from the University of Cambridge in 1967, under the supervision of David Park. He spent three years at Massachusetts Institute of Technology (MIT) and moved to University of Warwick in 1971, where he remains Professor Emeritus. Paterson is an expert on theoretical computer science with more than 100 publications, especially the design and analysis of algorithms and computational complexity. Paterson's distinguished career was recognised with the EATCS Award in 2006, and a workshop in honour of his 66th birthday in 2008, including contributions of several Turing Award and Gödel Prize laureates. A further workshop was held in 2017 in honour of his 75th birthday, co-located with the workshop for the 10th anniversary of the DIMAP centre. For his work on distributed computing with Fischer and Lynch, he received the Dijkstra Prize in 2001, and his work with Dyer and Goldberg on counting graph homomorphisms received a best paper award at the ICALP conference in 2006. Mike Paterson received a Lester R. Ford Award in 2010. He is a Fellow of the Royal Society since 2001 and been president of the European Association for Theoretical Computer Science (EATCS). According to EATCS president Maurice Nivat, Paterson played a great role in the late 1960s in the recognition of computer science as a science, "and that theoretical computer science, which is very close to mathematics but distinct in its motivation and inspiration, is indeed a challenging and fruitful field of research." Paterson is also an enthusiastic mountaineer. (en) Michael Stewart « Mike » Paterson, né en 1942, est un informaticien théoricien britannique, spécialiste en conception et analyse des algorithmes et en théorie de la complexité. Il est aussi réputé comme inventeur de jeux, comme les vers de Paterson ou les sprouts. (fr) Michael Stewart Paterson (1942) é um cientista da computação britânico, que foi diretor do Centre for Discrete Mathematics and its Applications (DIMAP) na Universidade de Warwick até 2007. Obteve um doutorado na University of Cambridge em 1967, orientado por . Passou três anos no Instituto de Tecnologia de Massachusetts (MIT) e foi para a Universidade de Warwick em 1971, onde é professor emérito. Paterson é especialista em ciência da computação teórica com mais de 100 publicações, especialmente o projeto e análise de algoritmos e complexidade computacional. A carreira de destaque de Paterson foi reconhecida com o Prêmio EATCS de 2006 da e um workshop em comemoração a seu aniversário de 66 anos em 2008, incluindo contribuições de diversos laureados com o Prêmio Turing e o Prêmio Gödel. Um outro workshop foi organizado em 2017 em comemoração a seu aniversário de 75 anos, simultaneamente com um workshop pelo aniversário de 10 anos do DIMAP. Por seu trabalho sobre sistema de processamento distribuído com Michael John Fischer e Nancy Lynch recebeu o Prêmio Dijkstra de 2001, e seu trabalho com Dyer e Goldberg sobre a contagem de homomorfismos de grafos recebeu um best paper award na conferência ICALP (International Colloquium on Automata, Languages and Programming) em 2006. Mike Paterson recebeu um Prêmio Lester R. Ford em 2010. É Membro da Royal Society desde 2001 e foi presidente da (EATCS). De acordo com o presidente da Maurice Nivat, Paterson teve um grande papel nofinal da década de 1960 no reconhecimento da computação como uma ciência, "and that theoretical computer science, which is very close to mathematics but distinct in its motivation and inspiration, is indeed a challenging and fruitful field of research." (pt) |
| dbo:academicDiscipline | dbr:Computer_science |
| dbo:award | dbr:EATCS_Award dbr:Dijkstra_Prize |
| dbo:doctoralAdvisor | dbr:David_Park_(computer_scientist) |
| dbo:doctoralStudent | dbr:Leslie_Valiant |
| dbo:institution | dbr:University_of_Warwick dbr:Massachusetts_Institute_of_Technology |
| dbo:knownFor | dbr:Algorithm dbr:Analysis_of_algorithms |
| dbo:wikiPageExternalLink | http://dspace.mit.edu/handle/1721.1/6186 https://warwick.ac.uk/fac/cross_fac/dimap/events/mike75/ http://www2.warwick.ac.uk/fac/cross_fac/dimap/events/mike66/ |
| dbo:wikiPageID | 17730420 (xsd:integer) |
| dbo:wikiPageLength | 6544 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1018715221 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Paterson's_worms dbr:David_Park_(computer_scientist) dbr:Algorithm dbr:University_of_British_Columbia dbr:University_of_Cambridge dbr:University_of_Warwick dbr:EATCS_Award dbc:Living_people dbc:Year_of_birth_missing_(living_people) dbr:Analysis_of_algorithms dbr:Massachusetts_Institute_of_Technology dbr:Maurice_Nivat dbr:Nancy_Lynch dbr:Symposium_on_Parallel_Algorithms_and_Architectures dbr:Leslie_Valiant dbr:Computer_science dbr:Computer_scientist dbr:Emeritus dbr:Sprouts_(game) dbr:Theoretical_Computer_Science_(journal) dbr:Theoretical_computer_science dbc:Fellows_of_the_Royal_Society dbc:Researchers_in_distributed_computing dbc:Theoretical_computer_scientists dbr:Turing_Award dbr:Distributed_computing dbr:Doctor_of_Philosophy dbr:Gödel_Prize dbr:Fellow_of_the_Royal_Society dbc:Dijkstra_Prize_laureates dbr:Dijkstra_Prize dbr:Michael_J._Fischer dbc:British_computer_scientists dbr:ICALP dbr:European_Association_for_Theoretical_Computer_Science dbr:Mountaineering dbr:Lester_R._Ford_Award dbr:SICOMP |
| dbp:awards | dbr:EATCS_Award dbr:Dijkstra_Prize |
| dbp:doctoralAdvisor | dbr:David_Park_(computer_scientist) |
| dbp:doctoralStudents | dbr:Leslie_Valiant |
| dbp:education | dbr:University_of_Cambridge dbr:Doctor_of_Philosophy |
| dbp:field | dbr:Computer_science |
| dbp:knownFor | Algorithms, complexity (en) |
| dbp:name | Mike Paterson (en) |
| dbp:nationality | British (en) |
| dbp:thesisTitle | Equivalence Problems in a Model of Computation (en) |
| dbp:thesisUrl | http://dspace.mit.edu/handle/1721.1/6186 |
| dbp:thesisYear | 1967 (xsd:integer) |
| dbp:wikiPageUsesTemplate | dbt:DBLP dbt:Authority_control dbt:EngvarB dbt:For dbt:Official_website dbt:Reflist dbt:Short_description dbt:Use_dmy_dates dbt:EATCS_Award_laureates dbt:Infobox_scientist dbt:FRS_2001 |
| dbp:wordnet_type | http://www.w3.org/2006/03/wn/wn20/instances/synset-scientist-noun-1 |
| dbp:workplaces | dbr:University_of_Warwick dbr:Massachusetts_Institute_of_Technology |
| dct:subject | dbc:Living_people dbc:Year_of_birth_missing_(living_people) dbc:Fellows_of_the_Royal_Society dbc:Researchers_in_distributed_computing dbc:Theoretical_computer_scientists dbc:Dijkstra_Prize_laureates dbc:British_computer_scientists |
| gold:hypernym | dbr:Scientist |
| schema:sameAs | http://viaf.org/viaf/111114946 |
| rdf:type | owl:Thing foaf:Person dbo:Person dul:NaturalPerson wikidata:Q19088 wikidata:Q215627 wikidata:Q5 wikidata:Q729 yago:WikicatBritishComputerScientists yago:WikicatBritishInformationTheorists yago:WikicatBritishPeople dbo:Animal dbo:Eukaryote dbo:Scientist dbo:Species yago:WikicatComputerScientists schema:Person yago:WikicatLivingPeople yago:WikicatTheoreticalComputerScientists wikidata:Q901 yago:Acquirer109764201 yago:Associate109816771 yago:CausalAgent100007347 yago:Colleague109935990 yago:ComputerScientist109951070 yago:ComputerUser109951274 yago:Honoree110183757 yago:Intellectual109621545 yago:Laureate110249011 yago:LivingThing100004258 yago:Object100002684 yago:Organism100004475 yago:Peer109626238 yago:Person100007846 yago:PhysicalEntity100001930 yago:Recipient109627906 yago:ResearchWorker110523076 yago:YagoLegalActor yago:YagoLegalActorGeo yago:Scientist110560637 yago:Theorist110706812 yago:Whole100003553 yago:WikicatDijkstraPrizeLaureates yago:WikicatFellowsOfTheRoyalSociety yago:WikicatResearchersInDistributedComputing umbel-rc:Scientist |
| rdfs:comment | Michael Stewart « Mike » Paterson, né en 1942, est un informaticien théoricien britannique, spécialiste en conception et analyse des algorithmes et en théorie de la complexité. Il est aussi réputé comme inventeur de jeux, comme les vers de Paterson ou les sprouts. (fr) Michael S. Paterson, comúnmente conocido como Mike Paterson, es un informático teórico británico, director del Centre for Discrete Mathematics and its Applications (Centro de Matemáticas Discretas y sus Aplicaciones) en el Departamento de Ciencias de Computación de la Universidad de Warwick, y que estuvo además a cargo de este departamento en 2005. Recibió su doctorado en la Universidad de Cambridge en 1967, bajo la supervisión de , y estuvo tres años en el MIT antes de trasladarse a Warwick, en 1971. Paterson, además, es un entusiasta montañista. (es) Michael Stewart „Mike“ Paterson (* 1942) ist ein britischer Informatiker. Paterson studierte an der Universität Cambridge, wo er 1967 bei promoviert wurde (Equivalence problems in a model of computation). Als Post-Doktorand war er am Massachusetts Institute of Technology und ab 1971 war er an der University of Warwick, wo er Professor für Informatik war und bis 2007 das Centre for Discrete Mathematics and its Applications leitete. Er befasst sich insbesondere mit Design und Analyse von Algorithmen und Komplexitätstheorie. Er ist ein begeisterter Bergsteiger. (de) Michael Stewart Paterson, is a British computer scientist, who was the director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick until 2007, and chair of the department of computer science in 2005. He received his Doctor of Philosophy (Ph.D.) from the University of Cambridge in 1967, under the supervision of David Park. He spent three years at Massachusetts Institute of Technology (MIT) and moved to University of Warwick in 1971, where he remains Professor Emeritus. Paterson is also an enthusiastic mountaineer. (en) Michael Stewart Paterson (1942) é um cientista da computação britânico, que foi diretor do Centre for Discrete Mathematics and its Applications (DIMAP) na Universidade de Warwick até 2007. Obteve um doutorado na University of Cambridge em 1967, orientado por . Passou três anos no Instituto de Tecnologia de Massachusetts (MIT) e foi para a Universidade de Warwick em 1971, onde é professor emérito. (pt) |
| rdfs:label | Mike Paterson (de) Mike Paterson (es) Mike Paterson (en) Michael Stewart Paterson (fr) Michael Stewart Paterson (pt) |
| owl:sameAs | freebase:Mike Paterson yago-res:Mike Paterson http://d-nb.info/gnd/1047956071 http://viaf.org/viaf/111114946 http://d-nb.info/gnd/113485107 http://d-nb.info/gnd/122239113 https://dblp.org/pid/p/MikePaterson wikidata:Mike Paterson http://data.bibliotheken.nl/id/thes/p10070333X http://azb.dbpedia.org/resource/مایک_پترسون dbpedia-de:Mike Paterson dbpedia-es:Mike Paterson dbpedia-fa:Mike Paterson dbpedia-fr:Mike Paterson dbpedia-pt:Mike Paterson https://global.dbpedia.org/id/dEVZ |
| prov:wasDerivedFrom | wikipedia-en:Mike_Paterson?oldid=1018715221&ns=0 |
| foaf:homepage | http://warwick.ac.uk/fac/sci/dcs/people/Mike_Paterson |
| foaf:isPrimaryTopicOf | wikipedia-en:Mike_Paterson |
| foaf:name | Mike Paterson (en) |
| is dbo:academicAdvisor of | dbr:Carl_Hewitt |
| is dbo:doctoralAdvisor of | dbr:Leslie_Valiant__Leslie_Valiant__1 |
| is dbo:doctoralStudent of | dbr:David_Park_(computer_scientist) |
| is dbo:wikiPageRedirects of | dbr:Michael_Stewart_Paterson dbr:Michael_S._Paterson |
| is dbo:wikiPageWikiLink of | dbr:List_of_University_of_Warwick_people dbr:List_of_computer_scientists dbr:List_of_fellows_of_the_Royal_Society_P,_Q,_R dbr:List_of_fellows_of_the_Royal_Society_elected_in_2001 dbr:Michael_Paterson_(disambiguation) dbr:Mike_Patterson dbr:Paterson's_worms dbr:Bella_Subbotovskaya dbr:David_Park_(computer_scientist) dbr:List_of_Debaters_radio_episodes dbr:David_P._Robbins_Prize dbr:List_of_people_by_Erdős_number dbr:List_of_programmers dbr:Paul_R._Halmos_–_Lester_R._Ford_Award dbr:Enfield_Grammar_School dbr:Nancy_Lynch dbr:Consensus_(computer_science) dbr:Leslie_Valiant dbr:Yuval_Peres dbr:Parity_function dbr:Paterson_(surname) dbr:Paxos_(computer_science) dbr:Carl_Hewitt dbr:Frances_Yao dbr:Atomic_broadcast dbr:Michael_Stewart_Paterson dbr:European_Association_for_Theoretical_Computer_Science dbr:Word_Processing_in_Groups dbr:Michael_S._Paterson |
| is dbp:academicAdvisors of | dbr:Carl_Hewitt |
| is dbp:doctoralAdvisor of | dbr:Leslie_Valiant |
| is dbp:doctoralStudents of | dbr:David_Park_(computer_scientist) |
| is foaf:primaryTopic of | wikipedia-en:Mike_Paterson |